Uses of Class
com.ocient.jdbc.proto.PlanProtocol.SortPartition
-
Packages that use PlanProtocol.SortPartition Package Description com.ocient.jdbc.proto -
-
Uses of PlanProtocol.SortPartition in com.ocient.jdbc.proto
Methods in com.ocient.jdbc.proto that return PlanProtocol.SortPartition Modifier and Type Method Description PlanProtocol.SortPartitionPlanProtocol.SortPartition.Builder. build()PlanProtocol.SortPartitionPlanProtocol.SortPartition.Builder. buildPartial()static PlanProtocol.SortPartitionPlanProtocol.SortPartition. getDefaultInstance()PlanProtocol.SortPartitionPlanProtocol.SortPartition.Builder. getDefaultInstanceForType()PlanProtocol.SortPartitionPlanProtocol.SortPartition. getDefaultInstanceForType()PlanProtocol.SortPartitionPlanProtocol.IndexAggOperator.Builder. getPoint(int index)repeated .xg.db.sqlPlans.SortPartition point = 16;PlanProtocol.SortPartitionPlanProtocol.IndexAggOperator. getPoint(int index)repeated .xg.db.sqlPlans.SortPartition point = 16;PlanProtocol.SortPartitionPlanProtocol.IndexAggOperatorOrBuilder. getPoint(int index)repeated .xg.db.sqlPlans.SortPartition point = 16;PlanProtocol.SortPartitionPlanProtocol.IndexDistinctOperator.Builder. getPoint(int index)repeated .xg.db.sqlPlans.SortPartition point = 12;PlanProtocol.SortPartitionPlanProtocol.IndexDistinctOperator. getPoint(int index)repeated .xg.db.sqlPlans.SortPartition point = 12;PlanProtocol.SortPartitionPlanProtocol.IndexDistinctOperatorOrBuilder. getPoint(int index)repeated .xg.db.sqlPlans.SortPartition point = 12;PlanProtocol.SortPartitionPlanProtocol.SortOperator.Builder. getPoint(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 orderPlanProtocol.SortPartitionPlanProtocol.SortOperator. getPoint(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 orderPlanProtocol.SortPartitionPlanProtocol.SortOperatorOrBuilder. getPoint(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 orderstatic PlanProtocol.SortPartitionPlanProtocol.SortPartition. parseDelimitedFrom(InputStream input)static PlanProtocol.SortPartitionPlanProtocol.SortPartition. parseDelimitedFrom(InputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry)static PlanProtocol.SortPartitionPlanProtocol.SortPartition. parseFrom(byte[] data)static PlanProtocol.SortPartitionPlanProtocol.SortPartition. parseFrom(byte[] data, com.google.protobuf.ExtensionRegistryLite extensionRegistry)static PlanProtocol.SortPartitionPlanProtocol.SortPartition. parseFrom(com.google.protobuf.ByteString data)static PlanProtocol.SortPartitionPlanProtocol.SortPartition. parseFrom(com.google.protobuf.ByteString data, com.google.protobuf.ExtensionRegistryLite extensionRegistry)static PlanProtocol.SortPartitionPlanProtocol.SortPartition. parseFrom(com.google.protobuf.CodedInputStream input)static PlanProtocol.SortPartitionPlanProtocol.SortPartition. parseFrom(com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry)static PlanProtocol.SortPartitionPlanProtocol.SortPartition. parseFrom(InputStream input)static PlanProtocol.SortPartitionPlanProtocol.SortPartition. parseFrom(InputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry)static PlanProtocol.SortPartitionPlanProtocol.SortPartition. parseFrom(ByteBuffer data)static PlanProtocol.SortPartitionPlanProtocol.SortPartition. parseFrom(ByteBuffer data, com.google.protobuf.ExtensionRegistryLite extensionRegistry)Methods in com.ocient.jdbc.proto that return types with arguments of type PlanProtocol.SortPartition Modifier and Type Method Description com.google.protobuf.Parser<PlanProtocol.SortPartition>PlanProtocol.SortPartition. getParserForType()List<PlanProtocol.SortPartition>PlanProtocol.IndexAggOperator.Builder. getPointList()repeated .xg.db.sqlPlans.SortPartition point = 16;List<PlanProtocol.SortPartition>PlanProtocol.IndexAggOperator. getPointList()repeated .xg.db.sqlPlans.SortPartition point = 16;List<PlanProtocol.SortPartition>PlanProtocol.IndexAggOperatorOrBuilder. getPointList()repeated .xg.db.sqlPlans.SortPartition point = 16;List<PlanProtocol.SortPartition>PlanProtocol.IndexDistinctOperator.Builder. getPointList()repeated .xg.db.sqlPlans.SortPartition point = 12;List<PlanProtocol.SortPartition>PlanProtocol.IndexDistinctOperator. getPointList()repeated .xg.db.sqlPlans.SortPartition point = 12;List<PlanProtocol.SortPartition>PlanProtocol.IndexDistinctOperatorOrBuilder. getPointList()repeated .xg.db.sqlPlans.SortPartition point = 12;List<PlanProtocol.SortPartition>PlanProtocol.SortOperator.Builder. 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 orderList<PlanProtocol.SortPartition>PlanProtocol.SortOperator. 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 orderList<PlanProtocol.SortPartition>PlanProtocol.SortOperatorOrBuilder. 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 orderstatic com.google.protobuf.Parser<PlanProtocol.SortPartition>PlanProtocol.SortPartition. parser()Methods in com.ocient.jdbc.proto with parameters of type PlanProtocol.SortPartition Modifier and Type Method Description PlanProtocol.IndexAggOperator.BuilderPlanProtocol.IndexAggOperator.Builder. addPoint(int index, PlanProtocol.SortPartition value)repeated .xg.db.sqlPlans.SortPartition point = 16;PlanProtocol.IndexAggOperator.BuilderPlanProtocol.IndexAggOperator.Builder. addPoint(PlanProtocol.SortPartition value)repeated .xg.db.sqlPlans.SortPartition point = 16;PlanProtocol.IndexDistinctOperator.BuilderPlanProtocol.IndexDistinctOperator.Builder. addPoint(int index, PlanProtocol.SortPartition value)repeated .xg.db.sqlPlans.SortPartition point = 12;PlanProtocol.IndexDistinctOperator.BuilderPlanProtocol.IndexDistinctOperator.Builder. addPoint(PlanProtocol.SortPartition value)repeated .xg.db.sqlPlans.SortPartition point = 12;PlanProtocol.SortOperator.BuilderPlanProtocol.SortOperator.Builder. addPoint(int index, PlanProtocol.SortPartition value)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.SortOperator.BuilderPlanProtocol.SortOperator.Builder. addPoint(PlanProtocol.SortPartition value)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.SortPartition.BuilderPlanProtocol.SortPartition.Builder. mergeFrom(PlanProtocol.SortPartition other)static PlanProtocol.SortPartition.BuilderPlanProtocol.SortPartition. newBuilder(PlanProtocol.SortPartition prototype)PlanProtocol.IndexAggOperator.BuilderPlanProtocol.IndexAggOperator.Builder. setPoint(int index, PlanProtocol.SortPartition value)repeated .xg.db.sqlPlans.SortPartition point = 16;PlanProtocol.IndexDistinctOperator.BuilderPlanProtocol.IndexDistinctOperator.Builder. setPoint(int index, PlanProtocol.SortPartition value)repeated .xg.db.sqlPlans.SortPartition point = 12;PlanProtocol.SortOperator.BuilderPlanProtocol.SortOperator.Builder. setPoint(int index, PlanProtocol.SortPartition value)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 orderMethod parameters in com.ocient.jdbc.proto with type arguments of type PlanProtocol.SortPartition Modifier and Type Method Description PlanProtocol.IndexAggOperator.BuilderPlanProtocol.IndexAggOperator.Builder. addAllPoint(Iterable<? extends PlanProtocol.SortPartition> values)repeated .xg.db.sqlPlans.SortPartition point = 16;PlanProtocol.IndexDistinctOperator.BuilderPlanProtocol.IndexDistinctOperator.Builder. addAllPoint(Iterable<? extends PlanProtocol.SortPartition> values)repeated .xg.db.sqlPlans.SortPartition point = 12;PlanProtocol.SortOperator.BuilderPlanProtocol.SortOperator.Builder. addAllPoint(Iterable<? extends PlanProtocol.SortPartition> values)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
-