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

java.io.deephaven.proto.backplane.grpc.TreeRequestOrBuilder Maven / Gradle / Ivy

There is a newer version: 0.36.1
Show newest version
// Generated by the protocol buffer compiler.  DO NOT EDIT!
// source: deephaven/proto/hierarchicaltable.proto

// Protobuf Java Version: 3.25.3
package io.deephaven.proto.backplane.grpc;

public interface TreeRequestOrBuilder extends
    // @@protoc_insertion_point(interface_extends:io.deephaven.proto.backplane.grpc.TreeRequest)
    com.google.protobuf.MessageOrBuilder {

  /**
   * 
   * Ticket to use to hold the result TreeTable from the tree operation
   * 
* * .io.deephaven.proto.backplane.grpc.Ticket result_tree_table_id = 1; * @return Whether the resultTreeTableId field is set. */ boolean hasResultTreeTableId(); /** *
   * Ticket to use to hold the result TreeTable from the tree operation
   * 
* * .io.deephaven.proto.backplane.grpc.Ticket result_tree_table_id = 1; * @return The resultTreeTableId. */ io.deephaven.proto.backplane.grpc.Ticket getResultTreeTableId(); /** *
   * Ticket to use to hold the result TreeTable from the tree operation
   * 
* * .io.deephaven.proto.backplane.grpc.Ticket result_tree_table_id = 1; */ io.deephaven.proto.backplane.grpc.TicketOrBuilder getResultTreeTableIdOrBuilder(); /** *
   * Ticket for the source Table to tree
   * 
* * .io.deephaven.proto.backplane.grpc.Ticket source_table_id = 2; * @return Whether the sourceTableId field is set. */ boolean hasSourceTableId(); /** *
   * Ticket for the source Table to tree
   * 
* * .io.deephaven.proto.backplane.grpc.Ticket source_table_id = 2; * @return The sourceTableId. */ io.deephaven.proto.backplane.grpc.Ticket getSourceTableId(); /** *
   * Ticket for the source Table to tree
   * 
* * .io.deephaven.proto.backplane.grpc.Ticket source_table_id = 2; */ io.deephaven.proto.backplane.grpc.TicketOrBuilder getSourceTableIdOrBuilder(); /** *
   * The name of the column containing the unique identifier for each row in the source table
   * 
* * string identifier_column = 3; * @return The identifierColumn. */ java.lang.String getIdentifierColumn(); /** *
   * The name of the column containing the unique identifier for each row in the source table
   * 
* * string identifier_column = 3; * @return The bytes for identifierColumn. */ com.google.protobuf.ByteString getIdentifierColumnBytes(); /** *
   * The name of the column containing the parent row's unique identifier for each row in the source table
   * 
* * string parent_identifier_column = 4; * @return The parentIdentifierColumn. */ java.lang.String getParentIdentifierColumn(); /** *
   * The name of the column containing the parent row's unique identifier for each row in the source table
   * 
* * string parent_identifier_column = 4; * @return The bytes for parentIdentifierColumn. */ com.google.protobuf.ByteString getParentIdentifierColumnBytes(); /** *
   * Whether to promote "orphaned" nodes to be children of the root node. Orphans are nodes whose parent identifiers do
   * not occur as identifiers for any row in the source Table.
   * 
* * bool promote_orphans = 5; * @return The promoteOrphans. */ boolean getPromoteOrphans(); }




© 2015 - 2024 Weber Informatics LLC | Privacy Policy