Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
* The syntax version of the source, e.g. `cel1`.
*
*
* string syntax_version = 1;
* @return The bytes for syntaxVersion.
*/
com.google.protobuf.ByteString
getSyntaxVersionBytes();
/**
*
* The location name. All position information attached to an expression is
* relative to this location.
*
* The location could be a file, UI element, or similar. For example,
* `acme/app/AnvilPolicy.cel`.
*
* The location name. All position information attached to an expression is
* relative to this location.
*
* The location could be a file, UI element, or similar. For example,
* `acme/app/AnvilPolicy.cel`.
*
*
* string location = 2;
* @return The bytes for location.
*/
com.google.protobuf.ByteString
getLocationBytes();
/**
*
* Monotonically increasing list of code point offsets where newlines
* `\n` appear.
*
* The line number of a given position is the index `i` where for a given
* `id` the `line_offsets[i] < id_positions[id] < line_offsets[i+1]`. The
* column may be derivd from `id_positions[id] - line_offsets[i]`.
*
*
* repeated int32 line_offsets = 3;
* @return A list containing the lineOffsets.
*/
java.util.List getLineOffsetsList();
/**
*
* Monotonically increasing list of code point offsets where newlines
* `\n` appear.
*
* The line number of a given position is the index `i` where for a given
* `id` the `line_offsets[i] < id_positions[id] < line_offsets[i+1]`. The
* column may be derivd from `id_positions[id] - line_offsets[i]`.
*
*
* repeated int32 line_offsets = 3;
* @return The count of lineOffsets.
*/
int getLineOffsetsCount();
/**
*
* Monotonically increasing list of code point offsets where newlines
* `\n` appear.
*
* The line number of a given position is the index `i` where for a given
* `id` the `line_offsets[i] < id_positions[id] < line_offsets[i+1]`. The
* column may be derivd from `id_positions[id] - line_offsets[i]`.
*
*
* repeated int32 line_offsets = 3;
* @param index The index of the element to return.
* @return The lineOffsets at the given index.
*/
int getLineOffsets(int index);
/**
*
* A map from the parse node id (e.g. `Expr.id`) to the code point offset
* within the source.
*
* A map from the parse node id (e.g. `Expr.id`) to the code point offset
* within the source.
*
*
* map<int64, int32> positions = 4;
*/
int getPositionsOrDefault(
long key,
int defaultValue);
/**
*
* A map from the parse node id (e.g. `Expr.id`) to the code point offset
* within the source.
*
*
* map<int64, int32> positions = 4;
*/
int getPositionsOrThrow(
long key);
/**
*
* A map from the parse node id where a macro replacement was made to the
* call `Expr` that resulted in a macro expansion.
*
* For example, `has(value.field)` is a function call that is replaced by a
* `test_only` field selection in the AST. Likewise, the call
* `list.exists(e, e > 10)` translates to a comprehension expression. The key
* in the map corresponds to the expression id of the expanded macro, and the
* value is the call `Expr` that was replaced.
*
* A map from the parse node id where a macro replacement was made to the
* call `Expr` that resulted in a macro expansion.
*
* For example, `has(value.field)` is a function call that is replaced by a
* `test_only` field selection in the AST. Likewise, the call
* `list.exists(e, e > 10)` translates to a comprehension expression. The key
* in the map corresponds to the expression id of the expanded macro, and the
* value is the call `Expr` that was replaced.
*
* A map from the parse node id where a macro replacement was made to the
* call `Expr` that resulted in a macro expansion.
*
* For example, `has(value.field)` is a function call that is replaced by a
* `test_only` field selection in the AST. Likewise, the call
* `list.exists(e, e > 10)` translates to a comprehension expression. The key
* in the map corresponds to the expression id of the expanded macro, and the
* value is the call `Expr` that was replaced.
*
* A map from the parse node id where a macro replacement was made to the
* call `Expr` that resulted in a macro expansion.
*
* For example, `has(value.field)` is a function call that is replaced by a
* `test_only` field selection in the AST. Likewise, the call
* `list.exists(e, e > 10)` translates to a comprehension expression. The key
* in the map corresponds to the expression id of the expanded macro, and the
* value is the call `Expr` that was replaced.
*
* A map from the parse node id where a macro replacement was made to the
* call `Expr` that resulted in a macro expansion.
*
* For example, `has(value.field)` is a function call that is replaced by a
* `test_only` field selection in the AST. Likewise, the call
* `list.exists(e, e > 10)` translates to a comprehension expression. The key
* in the map corresponds to the expression id of the expanded macro, and the
* value is the call `Expr` that was replaced.
*
* A list of tags for extensions that were used while parsing or type checking
* the source expression. For example, optimizations that require special
* runtime support may be specified.
*
* These are used to check feature support between components in separate
* implementations. This can be used to either skip redundant work or
* report an error if the extension is unsupported.
*
* A list of tags for extensions that were used while parsing or type checking
* the source expression. For example, optimizations that require special
* runtime support may be specified.
*
* These are used to check feature support between components in separate
* implementations. This can be used to either skip redundant work or
* report an error if the extension is unsupported.
*
* A list of tags for extensions that were used while parsing or type checking
* the source expression. For example, optimizations that require special
* runtime support may be specified.
*
* These are used to check feature support between components in separate
* implementations. This can be used to either skip redundant work or
* report an error if the extension is unsupported.
*
* A list of tags for extensions that were used while parsing or type checking
* the source expression. For example, optimizations that require special
* runtime support may be specified.
*
* These are used to check feature support between components in separate
* implementations. This can be used to either skip redundant work or
* report an error if the extension is unsupported.
*
* A list of tags for extensions that were used while parsing or type checking
* the source expression. For example, optimizations that require special
* runtime support may be specified.
*
* These are used to check feature support between components in separate
* implementations. This can be used to either skip redundant work or
* report an error if the extension is unsupported.
*