@Override public int compare(long[] left, long[] right) { int minLength = Math.min(left.length, right.length); for (int i = 0; i < minLength; i++) { int result = Longs.compare(left[i], right[i]); if (result != 0) { return result; } } return left.length - right.length; }
@Override public int compare(Object o, Object o1) { return Longs.compare(((Histogram) o).count, ((Histogram) o1).count); } };
@Override public int compare(long[] left, long[] right) { int minLength = Math.min(left.length, right.length); for (int i = 0; i < minLength; i++) { int result = Longs.compare(left[i], right[i]); if (result != 0) { return result; } } return left.length - right.length; }
@Override public int compare(Object o, Object o1) { return Longs.compare(((Number) o).longValue(), ((Number) o1).longValue()); } };
@Override public int compare(Object o, Object o1) { return Longs.compare(((Number) o).longValue(), ((Number) o1).longValue()); } };
@Override public ComparisonChain compare(long left, long right) { return classify(Longs.compare(left, right)); }
@Override public int compare(ByteBuffer lhsBuffer, ByteBuffer rhsBuffer, int lhsPosition, int rhsPosition) { final int cmp = compareDimsInBuffersForNullFudgeTimestamp( serdeHelperComparators, lhsBuffer, rhsBuffer, lhsPosition, rhsPosition ); if (cmp != 0) { return cmp; } return Longs.compare(lhsBuffer.getLong(lhsPosition), rhsBuffer.getLong(rhsPosition)); } };
@Override public ComparisonChain compare(long left, long right) { return classify(Longs.compare(left, right)); }
@Override public int compareTo(Delayed other) { return Longs.compare(getDelay(TimeUnit.NANOSECONDS), other.getDelay(TimeUnit.NANOSECONDS)); } }
/** * Compares the two specified {@code long} values, treating them as unsigned values between {@code * 0} and {@code 2^64 - 1} inclusive. * * <p><b>Java 8 users:</b> use {@link Long#compareUnsigned(long, long)} instead. * * @param a the first unsigned {@code long} to compare * @param b the second unsigned {@code long} to compare * @return a negative value if {@code a} is less than {@code b}; a positive value if {@code a} is * greater than {@code b}; or zero if they are equal */ public static int compare(long a, long b) { return Longs.compare(flip(a), flip(b)); }
@Override public int compare(Row left, Row right) { return Longs.compare(left.getTimestampFromEpoch(), right.getTimestampFromEpoch()); } };
@Override public int compare(StorageLocation left, StorageLocation right) { return Longs.compare(right.available(), left.available()); } };
@Override public int compare(Object o, Object o1) { return Longs.compare(((FixedBucketsHistogram) o).getCount(), ((FixedBucketsHistogram) o1).getCount()); } };
public void testCompare() { for (long x : VALUES) { for (long y : VALUES) { // note: spec requires only that the sign is the same assertEquals(x + ", " + y, Long.valueOf(x).compareTo(y), Longs.compare(x, y)); } } }
@Override public int compare(Result<T> r1, Result<T> r2) { return Longs.compare( gran.bucketStart(r1.getTimestamp()).getMillis(), gran.bucketStart(r2.getTimestamp()).getMillis() ); }
public void testCompare() { for (long a : UNSIGNED_INTS) { for (long b : UNSIGNED_INTS) { int cmpAsLongs = Longs.compare(a, b); int cmpAsUInt = UnsignedInts.compare((int) a, (int) b); assertEquals(Integer.signum(cmpAsLongs), Integer.signum(cmpAsUInt)); } } }
@Override public int compare(EventHolder o1, EventHolder o2) { int retVal = Longs.compare(o1.getTimestamp().getMillis(), o2.getTimestamp().getMillis()); if (retVal == 0) { retVal = o1.getSegmentId().compareTo(o2.getSegmentId()); } if (retVal == 0) { retVal = Integer.compare(o1.getOffset(), o2.getOffset()); } return retVal; } };
@SuppressWarnings("SubtractionInCompareTo") @Override public int compare(Memory o1, Memory o2) { // We have two Ordered Compact sketches, so just compare their last entry if they have the size. // This is to produce a deterministic ordering, though it might not match the actual estimate // ordering, but that's ok because this comparator is only used by GenericIndexed int retVal = Longs.compare(o1.getCapacity(), o2.getCapacity()); if (retVal == 0) { retVal = Longs.compare(o1.getLong(o2.getCapacity() - 8), o2.getLong(o2.getCapacity() - 8)); } return retVal; } };
@Nullable private Comparator<Row> getTimeComparator(boolean granular) { if (Granularities.ALL.equals(getGranularity())) { return null; } else if (granular) { return (lhs, rhs) -> Longs.compare( getGranularity().bucketStart(lhs.getTimestamp()).getMillis(), getGranularity().bucketStart(rhs.getTimestamp()).getMillis() ); } else { return NON_GRANULAR_TIME_COMP; } }
public static int compare(TitanElement e1, TitanElement e2) { long e1id = (e1 instanceof AbstractElement)?((AbstractElement)e1).getCompareId():e1.longId(); long e2id = (e2 instanceof AbstractElement)?((AbstractElement)e2).getCompareId():e2.longId(); return Longs.compare(e1id,e2id); }