All Downloads are FREE. Search and download functionalities are using the official Maven repository.

dev.cel.expr.SourceInfoOrBuilder Maven / Gradle / Ivy

The newest version!
// Generated by the protocol buffer compiler.  DO NOT EDIT!
// NO CHECKED-IN PROTOBUF GENCODE
// source: cel/expr/syntax.proto
// Protobuf Java Version: 4.28.2

package dev.cel.expr;

public interface SourceInfoOrBuilder extends
    // @@protoc_insertion_point(interface_extends:cel.expr.SourceInfo)
    com.google.protobuf.MessageOrBuilder {

  /**
   * 
   * The syntax version of the source, e.g. `cel1`.
   * 
* * string syntax_version = 1; * @return The syntaxVersion. */ java.lang.String getSyntaxVersion(); /** *
   * 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`.
   * 
* * string location = 2; * @return The location. */ java.lang.String getLocation(); /** *
   * 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 derived 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 derived 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 derived 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.
   * 
* * map<int64, int32> positions = 4; */ int getPositionsCount(); /** *
   * A map from the parse node id (e.g. `Expr.id`) to the code point offset
   * within the source.
   * 
* * map<int64, int32> positions = 4; */ boolean containsPositions( long key); /** * Use {@link #getPositionsMap()} instead. */ @java.lang.Deprecated java.util.Map getPositions(); /** *
   * A map from the parse node id (e.g. `Expr.id`) to the code point offset
   * within the source.
   * 
* * map<int64, int32> positions = 4; */ java.util.Map getPositionsMap(); /** *
   * 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.
   * 
* * map<int64, .cel.expr.Expr> macro_calls = 5; */ int getMacroCallsCount(); /** *
   * 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.
   * 
* * map<int64, .cel.expr.Expr> macro_calls = 5; */ boolean containsMacroCalls( long key); /** * Use {@link #getMacroCallsMap()} instead. */ @java.lang.Deprecated java.util.Map getMacroCalls(); /** *
   * 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.
   * 
* * map<int64, .cel.expr.Expr> macro_calls = 5; */ java.util.Map getMacroCallsMap(); /** *
   * 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.
   * 
* * map<int64, .cel.expr.Expr> macro_calls = 5; */ /* nullable */ dev.cel.expr.Expr getMacroCallsOrDefault( long key, /* nullable */ dev.cel.expr.Expr defaultValue); /** *
   * 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.
   * 
* * map<int64, .cel.expr.Expr> macro_calls = 5; */ dev.cel.expr.Expr getMacroCallsOrThrow( long key); /** *
   * 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.
   * 
* * repeated .cel.expr.SourceInfo.Extension extensions = 6; */ java.util.List getExtensionsList(); /** *
   * 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.
   * 
* * repeated .cel.expr.SourceInfo.Extension extensions = 6; */ dev.cel.expr.SourceInfo.Extension getExtensions(int index); /** *
   * 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.
   * 
* * repeated .cel.expr.SourceInfo.Extension extensions = 6; */ int getExtensionsCount(); /** *
   * 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.
   * 
* * repeated .cel.expr.SourceInfo.Extension extensions = 6; */ java.util.List getExtensionsOrBuilderList(); /** *
   * 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.
   * 
* * repeated .cel.expr.SourceInfo.Extension extensions = 6; */ dev.cel.expr.SourceInfo.ExtensionOrBuilder getExtensionsOrBuilder( int index); }




© 2015 - 2024 Weber Informatics LLC | Privacy Policy