Interface PlanProtocol.SortPartitionOrBuilder

    • Method Summary

      All Methods Instance Methods Abstract Methods 
      Modifier and Type Method Description
      float getDenormVal​(int index)
      The values are guaranteed to be in sort key order There may not be a value for all sort keys though For example, there may only be a value for the first sort key, which means we can partition only on that and we don't need to worry about subsequent sort keys All partitions are closed on the lower side and open on the higher side
      int getDenormValCount()
      The values are guaranteed to be in sort key order There may not be a value for all sort keys though For example, there may only be a value for the first sort key, which means we can partition only on that and we don't need to worry about subsequent sort keys All partitions are closed on the lower side and open on the higher side
      List<Float> getDenormValList()
      The values are guaranteed to be in sort key order There may not be a value for all sort keys though For example, there may only be a value for the first sort key, which means we can partition only on that and we don't need to worry about subsequent sort keys All partitions are closed on the lower side and open on the higher side
      • Methods inherited from interface com.google.protobuf.MessageLiteOrBuilder

        isInitialized
      • Methods inherited from interface com.google.protobuf.MessageOrBuilder

        findInitializationErrors, getAllFields, getDefaultInstanceForType, getDescriptorForType, getField, getInitializationErrorString, getOneofFieldDescriptor, getRepeatedField, getRepeatedFieldCount, getUnknownFields, hasField, hasOneof
    • Method Detail

      • getDenormValList

        List<Float> getDenormValList()
        The values are guaranteed to be in sort key order
        There may not be a value for all sort keys though
        For example, there may only be a value for the first sort
        key, which means we can partition only on that
        and we don't need to worry about subsequent sort keys
        All partitions are closed on the lower side and open on the higher side
         
        repeated float denormVal = 1;
        Returns:
        A list containing the denormVal.
      • getDenormValCount

        int getDenormValCount()
        The values are guaranteed to be in sort key order
        There may not be a value for all sort keys though
        For example, there may only be a value for the first sort
        key, which means we can partition only on that
        and we don't need to worry about subsequent sort keys
        All partitions are closed on the lower side and open on the higher side
         
        repeated float denormVal = 1;
        Returns:
        The count of denormVal.
      • getDenormVal

        float getDenormVal​(int index)
        The values are guaranteed to be in sort key order
        There may not be a value for all sort keys though
        For example, there may only be a value for the first sort
        key, which means we can partition only on that
        and we don't need to worry about subsequent sort keys
        All partitions are closed on the lower side and open on the higher side
         
        repeated float denormVal = 1;
        Parameters:
        index - The index of the element to return.
        Returns:
        The denormVal at the given index.