Class RandomAccessData.UnsignedLexicographicalComparator
- java.lang.Object
-
- org.apache.beam.runners.dataflow.util.RandomAccessData.UnsignedLexicographicalComparator
-
- All Implemented Interfaces:
java.io.Serializable,java.util.Comparator<RandomAccessData>
- Enclosing class:
- RandomAccessData
public static final class RandomAccessData.UnsignedLexicographicalComparator extends java.lang.Object implements java.util.Comparator<RandomAccessData>, java.io.Serializable
AComparatorthat compares two byte arrays lexicographically. It compares values as a list of unsigned bytes. The first pair of values that follow any common prefix, or when one array is a prefix of the other, treats the shorter array as the lesser. For example,[] < [0x01] < [0x01, 0x7F] < [0x01, 0x80] < [0x02] < POSITIVE INFINITY.Note that a token type of positive infinity is supported and is greater than all other
RandomAccessData.- See Also:
- Serialized Form
-
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description intcommonPrefixLength(RandomAccessData o1, RandomAccessData o2)Compute the length of the common prefix of the two provided sets of bytes.intcompare(RandomAccessData o1, RandomAccessData o2)intcompare(RandomAccessData o1, RandomAccessData o2, int startOffset)Compare the two sets of bytes starting at the given offset.
-
-
-
Method Detail
-
compare
public int compare(RandomAccessData o1, RandomAccessData o2)
- Specified by:
comparein interfacejava.util.Comparator<RandomAccessData>
-
compare
public int compare(RandomAccessData o1, RandomAccessData o2, int startOffset)
Compare the two sets of bytes starting at the given offset.
-
commonPrefixLength
public int commonPrefixLength(RandomAccessData o1, RandomAccessData o2)
Compute the length of the common prefix of the two provided sets of bytes.
-
-