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

nl.topicus.jdbc.shaded.com.google.spanner.v1.PlanNodeOrBuilder Maven / Gradle / Ivy

There is a newer version: 1.1.6
Show newest version
// Generated by the protocol buffer nl.topicus.jdbc.shaded.com.iler.  DO NOT EDIT!
// source: google/spanner/v1/query_plan.proto

package nl.topicus.jdbc.shaded.com.google.spanner.v1;

public interface PlanNodeOrBuilder extends
    // @@protoc_insertion_point(interface_extends:google.spanner.v1.PlanNode)
    nl.topicus.jdbc.shaded.com.google.protobuf.MessageOrBuilder {

  /**
   * 
   * The `PlanNode`'s index in [node list][google.spanner.v1.QueryPlan.plan_nodes].
   * 
* * int32 index = 1; */ int getIndex(); /** *
   * Used to determine the type of node. May be needed for visualizing
   * different kinds of nodes differently. For example, If the node is a
   * [SCALAR][google.spanner.v1.PlanNode.Kind.SCALAR] node, it will have a condensed representation
   * which can be used to directly embed a description of the node in its
   * parent.
   * 
* * .google.spanner.v1.PlanNode.Kind kind = 2; */ int getKindValue(); /** *
   * Used to determine the type of node. May be needed for visualizing
   * different kinds of nodes differently. For example, If the node is a
   * [SCALAR][google.spanner.v1.PlanNode.Kind.SCALAR] node, it will have a condensed representation
   * which can be used to directly embed a description of the node in its
   * parent.
   * 
* * .google.spanner.v1.PlanNode.Kind kind = 2; */ nl.topicus.jdbc.shaded.com.google.spanner.v1.PlanNode.Kind getKind(); /** *
   * The display name for the node.
   * 
* * string display_name = 3; */ java.lang.String getDisplayName(); /** *
   * The display name for the node.
   * 
* * string display_name = 3; */ nl.topicus.jdbc.shaded.com.google.protobuf.ByteString getDisplayNameBytes(); /** *
   * List of child node `index`es and their relationship to this parent.
   * 
* * repeated .google.spanner.v1.PlanNode.ChildLink child_links = 4; */ java.util.List getChildLinksList(); /** *
   * List of child node `index`es and their relationship to this parent.
   * 
* * repeated .google.spanner.v1.PlanNode.ChildLink child_links = 4; */ nl.topicus.jdbc.shaded.com.google.spanner.v1.PlanNode.ChildLink getChildLinks(int index); /** *
   * List of child node `index`es and their relationship to this parent.
   * 
* * repeated .google.spanner.v1.PlanNode.ChildLink child_links = 4; */ int getChildLinksCount(); /** *
   * List of child node `index`es and their relationship to this parent.
   * 
* * repeated .google.spanner.v1.PlanNode.ChildLink child_links = 4; */ java.util.List getChildLinksOrBuilderList(); /** *
   * List of child node `index`es and their relationship to this parent.
   * 
* * repeated .google.spanner.v1.PlanNode.ChildLink child_links = 4; */ nl.topicus.jdbc.shaded.com.google.spanner.v1.PlanNode.ChildLinkOrBuilder getChildLinksOrBuilder( int index); /** *
   * Condensed representation for [SCALAR][google.spanner.v1.PlanNode.Kind.SCALAR] nodes.
   * 
* * .google.spanner.v1.PlanNode.ShortRepresentation short_representation = 5; */ boolean hasShortRepresentation(); /** *
   * Condensed representation for [SCALAR][google.spanner.v1.PlanNode.Kind.SCALAR] nodes.
   * 
* * .google.spanner.v1.PlanNode.ShortRepresentation short_representation = 5; */ nl.topicus.jdbc.shaded.com.google.spanner.v1.PlanNode.ShortRepresentation getShortRepresentation(); /** *
   * Condensed representation for [SCALAR][google.spanner.v1.PlanNode.Kind.SCALAR] nodes.
   * 
* * .google.spanner.v1.PlanNode.ShortRepresentation short_representation = 5; */ nl.topicus.jdbc.shaded.com.google.spanner.v1.PlanNode.ShortRepresentationOrBuilder getShortRepresentationOrBuilder(); /** *
   * Attributes relevant to the node contained in a group of key-value pairs.
   * For example, a Parameter Reference node could have the following
   * information in its metadata:
   *     {
   *       "parameter_reference": "param1",
   *       "parameter_type": "array"
   *     }
   * 
* * .google.protobuf.Struct metadata = 6; */ boolean hasMetadata(); /** *
   * Attributes relevant to the node contained in a group of key-value pairs.
   * For example, a Parameter Reference node could have the following
   * information in its metadata:
   *     {
   *       "parameter_reference": "param1",
   *       "parameter_type": "array"
   *     }
   * 
* * .google.protobuf.Struct metadata = 6; */ nl.topicus.jdbc.shaded.com.google.protobuf.Struct getMetadata(); /** *
   * Attributes relevant to the node contained in a group of key-value pairs.
   * For example, a Parameter Reference node could have the following
   * information in its metadata:
   *     {
   *       "parameter_reference": "param1",
   *       "parameter_type": "array"
   *     }
   * 
* * .google.protobuf.Struct metadata = 6; */ nl.topicus.jdbc.shaded.com.google.protobuf.StructOrBuilder getMetadataOrBuilder(); /** *
   * The execution statistics associated with the node, contained in a group of
   * key-value pairs. Only present if the plan was returned as a result of a
   * profile query. For example, number of executions, number of rows/time per
   * execution etc.
   * 
* * .google.protobuf.Struct execution_stats = 7; */ boolean hasExecutionStats(); /** *
   * The execution statistics associated with the node, contained in a group of
   * key-value pairs. Only present if the plan was returned as a result of a
   * profile query. For example, number of executions, number of rows/time per
   * execution etc.
   * 
* * .google.protobuf.Struct execution_stats = 7; */ nl.topicus.jdbc.shaded.com.google.protobuf.Struct getExecutionStats(); /** *
   * The execution statistics associated with the node, contained in a group of
   * key-value pairs. Only present if the plan was returned as a result of a
   * profile query. For example, number of executions, number of rows/time per
   * execution etc.
   * 
* * .google.protobuf.Struct execution_stats = 7; */ nl.topicus.jdbc.shaded.com.google.protobuf.StructOrBuilder getExecutionStatsOrBuilder(); }




© 2015 - 2024 Weber Informatics LLC | Privacy Policy