public static interface RiakTsPB.TsRangeOrBuilder
extends com.google.protobuf.MessageOrBuilder
| Modifier and Type | Method and Description |
|---|---|
com.google.protobuf.ByteString |
getDesc()
required bytes desc = 6; |
com.google.protobuf.ByteString |
getFieldName()
required bytes field_name = 1; |
long |
getLowerBound()
required sint64 lower_bound = 2; |
boolean |
getLowerBoundInclusive()
required bool lower_bound_inclusive = 3; |
long |
getUpperBound()
required sint64 upper_bound = 4; |
boolean |
getUpperBoundInclusive()
required bool upper_bound_inclusive = 5; |
boolean |
hasDesc()
required bytes desc = 6; |
boolean |
hasFieldName()
required bytes field_name = 1; |
boolean |
hasLowerBound()
required sint64 lower_bound = 2; |
boolean |
hasLowerBoundInclusive()
required bool lower_bound_inclusive = 3; |
boolean |
hasUpperBound()
required sint64 upper_bound = 4; |
boolean |
hasUpperBoundInclusive()
required bool upper_bound_inclusive = 5; |
findInitializationErrors, getAllFields, getDefaultInstanceForType, getDescriptorForType, getField, getInitializationErrorString, getOneofFieldDescriptor, getRepeatedField, getRepeatedFieldCount, getUnknownFields, hasField, hasOneofboolean hasFieldName()
required bytes field_name = 1;com.google.protobuf.ByteString getFieldName()
required bytes field_name = 1;boolean hasLowerBound()
required sint64 lower_bound = 2;long getLowerBound()
required sint64 lower_bound = 2;boolean hasLowerBoundInclusive()
required bool lower_bound_inclusive = 3;boolean getLowerBoundInclusive()
required bool lower_bound_inclusive = 3;boolean hasUpperBound()
required sint64 upper_bound = 4;long getUpperBound()
required sint64 upper_bound = 4;boolean hasUpperBoundInclusive()
required bool upper_bound_inclusive = 5;boolean getUpperBoundInclusive()
required bool upper_bound_inclusive = 5;boolean hasDesc()
required bytes desc = 6;
Some human readable description of the time range
com.google.protobuf.ByteString getDesc()
required bytes desc = 6;
Some human readable description of the time range
Copyright © 2016. All rights reserved.