Package com.ocient.jdbc.proto
Interface PlanProtocol.SortOperatorOrBuilder
- All Superinterfaces:
com.google.protobuf.MessageLiteOrBuilder,com.google.protobuf.MessageOrBuilder
- All Known Implementing Classes:
PlanProtocol.SortOperator,PlanProtocol.SortOperator.Builder
- Enclosing class:
- PlanProtocol
public static interface PlanProtocol.SortOperatorOrBuilder
extends com.google.protobuf.MessageOrBuilder
-
Method Summary
Modifier and Type Method Description booleangetDirections(int index)The directions for each sort col - true = ascendingintgetDirectionsCount()The directions for each sort col - true = ascendingList<Boolean>getDirectionsList()The directions for each sort col - true = ascendingStringgetHashSortKeys(int index)The hash sort keys if there are any, primarily only for window these can be different from the regular sort keys if this isn't empty we do a hash based sort mutliplexing insteadcom.google.protobuf.ByteStringgetHashSortKeysBytes(int index)The hash sort keys if there are any, primarily only for window these can be different from the regular sort keys if this isn't empty we do a hash based sort mutliplexing insteadintgetHashSortKeysCount()The hash sort keys if there are any, primarily only for window these can be different from the regular sort keys if this isn't empty we do a hash based sort mutliplexing insteadList<String>getHashSortKeysList()The hash sort keys if there are any, primarily only for window these can be different from the regular sort keys if this isn't empty we do a hash based sort mutliplexing insteadlonggetLimitVal()If we know we only need the top n rows of the sort that is noted here If there is no limit being applied, this is set to -1booleangetNullsFirst(int index)repeated bool nulls_first = 6;intgetNullsFirstCount()repeated bool nulls_first = 6;List<Boolean>getNullsFirstList()repeated bool nulls_first = 6;PlanProtocol.SortPartitiongetPoint(int index)This defines the list of partitioning points for dividing the sort into streams There's no guarantees on the size of this It could be completely empty, which could happen if it look like all the data has the same sort key - implies that we don't know what to do besides one sort stream There is no guarantee that the partitioning points are in orderintgetPointCount()This defines the list of partitioning points for dividing the sort into streams There's no guarantees on the size of this It could be completely empty, which could happen if it look like all the data has the same sort key - implies that we don't know what to do besides one sort stream There is no guarantee that the partitioning points are in orderList<PlanProtocol.SortPartition>getPointList()This defines the list of partitioning points for dividing the sort into streams There's no guarantees on the size of this It could be completely empty, which could happen if it look like all the data has the same sort key - implies that we don't know what to do besides one sort stream There is no guarantee that the partitioning points are in orderPlanProtocol.SortPartitionOrBuildergetPointOrBuilder(int index)This defines the list of partitioning points for dividing the sort into streams There's no guarantees on the size of this It could be completely empty, which could happen if it look like all the data has the same sort key - implies that we don't know what to do besides one sort stream There is no guarantee that the partitioning points are in orderList<? extends PlanProtocol.SortPartitionOrBuilder>getPointOrBuilderList()This defines the list of partitioning points for dividing the sort into streams There's no guarantees on the size of this It could be completely empty, which could happen if it look like all the data has the same sort key - implies that we don't know what to do besides one sort stream There is no guarantee that the partitioning points are in orderStringgetSortKeys(int index)The sort columns - order matterscom.google.protobuf.ByteStringgetSortKeysBytes(int index)The sort columns - order mattersintgetSortKeysCount()The sort columns - order mattersList<String>getSortKeysList()The sort columns - order mattersMethods inherited from interface com.google.protobuf.MessageOrBuilder
findInitializationErrors, getAllFields, getDefaultInstanceForType, getDescriptorForType, getField, getInitializationErrorString, getOneofFieldDescriptor, getRepeatedField, getRepeatedFieldCount, getUnknownFields, hasField, hasOneof
-
Method Details
-
getSortKeysList
The sort columns - order matters
repeated string sortKeys = 1; -
getSortKeysCount
int getSortKeysCount()The sort columns - order matters
repeated string sortKeys = 1; -
getSortKeys
The sort columns - order matters
repeated string sortKeys = 1; -
getSortKeysBytes
com.google.protobuf.ByteString getSortKeysBytes(int index)The sort columns - order matters
repeated string sortKeys = 1; -
getDirectionsList
The directions for each sort col - true = ascending
repeated bool directions = 2; -
getDirectionsCount
int getDirectionsCount()The directions for each sort col - true = ascending
repeated bool directions = 2; -
getDirections
boolean getDirections(int index)The directions for each sort col - true = ascending
repeated bool directions = 2; -
getLimitVal
long getLimitVal()If we know we only need the top n rows of the sort that is noted here If there is no limit being applied, this is set to -1
int64 limitVal = 3; -
getPointList
List<PlanProtocol.SortPartition> getPointList()This defines the list of partitioning points for dividing the sort into streams There's no guarantees on the size of this It could be completely empty, which could happen if it look like all the data has the same sort key - implies that we don't know what to do besides one sort stream There is no guarantee that the partitioning points are in order
repeated .xg.db.sqlPlans.SortPartition point = 4; -
getPoint
This defines the list of partitioning points for dividing the sort into streams There's no guarantees on the size of this It could be completely empty, which could happen if it look like all the data has the same sort key - implies that we don't know what to do besides one sort stream There is no guarantee that the partitioning points are in order
repeated .xg.db.sqlPlans.SortPartition point = 4; -
getPointCount
int getPointCount()This defines the list of partitioning points for dividing the sort into streams There's no guarantees on the size of this It could be completely empty, which could happen if it look like all the data has the same sort key - implies that we don't know what to do besides one sort stream There is no guarantee that the partitioning points are in order
repeated .xg.db.sqlPlans.SortPartition point = 4; -
getPointOrBuilderList
List<? extends PlanProtocol.SortPartitionOrBuilder> getPointOrBuilderList()This defines the list of partitioning points for dividing the sort into streams There's no guarantees on the size of this It could be completely empty, which could happen if it look like all the data has the same sort key - implies that we don't know what to do besides one sort stream There is no guarantee that the partitioning points are in order
repeated .xg.db.sqlPlans.SortPartition point = 4; -
getPointOrBuilder
This defines the list of partitioning points for dividing the sort into streams There's no guarantees on the size of this It could be completely empty, which could happen if it look like all the data has the same sort key - implies that we don't know what to do besides one sort stream There is no guarantee that the partitioning points are in order
repeated .xg.db.sqlPlans.SortPartition point = 4; -
getHashSortKeysList
The hash sort keys if there are any, primarily only for window these can be different from the regular sort keys if this isn't empty we do a hash based sort mutliplexing instead
repeated string hashSortKeys = 5; -
getHashSortKeysCount
int getHashSortKeysCount()The hash sort keys if there are any, primarily only for window these can be different from the regular sort keys if this isn't empty we do a hash based sort mutliplexing instead
repeated string hashSortKeys = 5; -
getHashSortKeys
The hash sort keys if there are any, primarily only for window these can be different from the regular sort keys if this isn't empty we do a hash based sort mutliplexing instead
repeated string hashSortKeys = 5; -
getHashSortKeysBytes
com.google.protobuf.ByteString getHashSortKeysBytes(int index)The hash sort keys if there are any, primarily only for window these can be different from the regular sort keys if this isn't empty we do a hash based sort mutliplexing instead
repeated string hashSortKeys = 5; -
getNullsFirstList
repeated bool nulls_first = 6; -
getNullsFirstCount
int getNullsFirstCount()repeated bool nulls_first = 6; -
getNullsFirst
boolean getNullsFirst(int index)repeated bool nulls_first = 6;
-