public int compareTo(Dimension dimension) { return Utilities.compare(this.cubeOrdinal, dimension.cubeOrdinal); }
public int compareTo(Column column) { return Utilities.compare(ordinal, column.ordinal); } }
public int compareTo(Column column) { return Utilities.compare(ordinal, column.ordinal); }
public int compareTo(Column column) { return Utilities.compare(ordinal, column.ordinal); }
/** Compares arrays of {@link RelNode}. */ public static int compareRels(RelNode[] rels0, RelNode[] rels1) { int c = Utilities.compare(rels0.length, rels1.length); if (c != 0) { return c; } for (int i = 0; i < rels0.length; i++) { c = COMPARATOR.compare(rels0[i], rels1[i]); if (c != 0) { return c; } } return 0; }
/** Compares arrays of {@link RelNode}. */ public static int compareRels(RelNode[] rels0, RelNode[] rels1) { int c = Utilities.compare(rels0.length, rels1.length); if (c != 0) { return c; } for (int i = 0; i < rels0.length; i++) { c = COMPARATOR.compare(rels0[i], rels1[i]); if (c != 0) { return c; } } return 0; }
private static int compare(List<Column> list0, List<Column> list1) { final int size = Math.min(list0.size(), list1.size()); for (int i = 0; i < size; i++) { final int o0 = list0.get(i).ordinal; final int o1 = list1.get(i).ordinal; final int c = Utilities.compare(o0, o1); if (c != 0) { return c; } } return Utilities.compare(list0.size(), list1.size()); } }
private static int compare(List<Column> list0, List<Column> list1) { final int size = Math.min(list0.size(), list1.size()); for (int i = 0; i < size; i++) { final int o0 = list0.get(i).ordinal; final int o1 = list1.get(i).ordinal; final int c = Utilities.compare(o0, o1); if (c != 0) { return c; } } return Utilities.compare(list0.size(), list1.size()); }
/** Compares this ImmutableBitSet with another, using a lexicographic * ordering. * * <p>Bit sets {@code (), (0), (0, 1), (0, 1, 3), (1), (2, 3)} are in sorted * order.</p> */ public int compareTo(@Nonnull ImmutableBitSet o) { int i = 0; for (;;) { int n0 = nextSetBit(i); int n1 = o.nextSetBit(i); int c = Utilities.compare(n0, n1); if (c != 0 || n0 < 0) { return c; } i = n0 + 1; } }
/** Compares this ImmutableBitSet with another, using a lexicographic * ordering. * * <p>Bit sets {@code (), (0), (0, 1), (0, 1, 3), (1), (2, 3)} are in sorted * order.</p> */ public int compareTo(@Nonnull ImmutableBitSet o) { int i = 0; for (;;) { int n0 = nextSetBit(i); int n1 = o.nextSetBit(i); int c = Utilities.compare(n0, n1); if (c != 0 || n0 < 0) { return c; } i = n0 + 1; } }
public int compare(RelNode o1, RelNode o2) { // Compare on field count first. It is more stable than id (when rules // are added to the set of active rules). final int c = Utilities.compare(o1.getRowType().getFieldCount(), o2.getRowType().getFieldCount()); if (c != 0) { return -c; } return Utilities.compare(o1.getId(), o2.getId()); } }
public int compare(RelNode o1, RelNode o2) { // Compare on field count first. It is more stable than id (when rules // are added to the set of active rules). final int c = Utilities.compare(o1.getRowType().getFieldCount(), o2.getRowType().getFieldCount()); if (c != 0) { return -c; } return Utilities.compare(o1.getId(), o2.getId()); } }
public int compareTo(@Nonnull RelMultipleTrait o) { final RelCollationImpl that = (RelCollationImpl) o; final UnmodifiableIterator<RelFieldCollation> iterator = that.fieldCollations.iterator(); for (RelFieldCollation f : fieldCollations) { if (!iterator.hasNext()) { return 1; } final RelFieldCollation f2 = iterator.next(); int c = Utilities.compare(f.getFieldIndex(), f2.getFieldIndex()); if (c != 0) { return c; } } return iterator.hasNext() ? -1 : 0; }
public int compareTo(@Nonnull RelMultipleTrait o) { final RelCollationImpl that = (RelCollationImpl) o; final UnmodifiableIterator<RelFieldCollation> iterator = that.fieldCollations.iterator(); for (RelFieldCollation f : fieldCollations) { if (!iterator.hasNext()) { return 1; } final RelFieldCollation f2 = iterator.next(); int c = Utilities.compare(f.getFieldIndex(), f2.getFieldIndex()); if (c != 0) { return c; } } return iterator.hasNext() ? -1 : 0; }
/** Unit test for * {@link Utilities#compare(java.util.List, java.util.List)}. */ @Test public void testCompare() { final List<String> ac = Arrays.asList("a", "c"); final List<String> abc = Arrays.asList("a", "b", "c"); final List<String> a = Collections.singletonList("a"); final List<String> empty = Collections.emptyList(); assertEquals(0, Utilities.compare(ac, ac)); assertEquals(0, Utilities.compare(ac, new ArrayList<>(ac))); assertEquals(-1, Utilities.compare(a, ac)); assertEquals(-1, Utilities.compare(empty, ac)); assertEquals(1, Utilities.compare(ac, a)); assertEquals(1, Utilities.compare(ac, abc)); assertEquals(1, Utilities.compare(ac, empty)); assertEquals(0, Utilities.compare(empty, empty)); }
/** Unit test for * {@link Utilities#compare(java.util.List, java.util.List)}. */ @Test public void testCompare() { final List<String> ac = Arrays.asList("a", "c"); final List<String> abc = Arrays.asList("a", "b", "c"); final List<String> a = Collections.singletonList("a"); final List<String> empty = Collections.emptyList(); assertEquals(0, Utilities.compare(ac, ac)); assertEquals(0, Utilities.compare(ac, new ArrayList<>(ac))); assertEquals(-1, Utilities.compare(a, ac)); assertEquals(-1, Utilities.compare(empty, ac)); assertEquals(1, Utilities.compare(ac, a)); assertEquals(1, Utilities.compare(ac, abc)); assertEquals(1, Utilities.compare(ac, empty)); assertEquals(0, Utilities.compare(empty, empty)); }
@Test public void testCompare() { final List<ImmutableBitSet> sorted = getSortedList(); for (int i = 0; i < sorted.size(); i++) { for (int j = 0; j < sorted.size(); j++) { final ImmutableBitSet set0 = sorted.get(i); final ImmutableBitSet set1 = sorted.get(j); int c = set0.compareTo(set1); if (c == 0) { assertTrue(i == j || i == 3 && j == 4 || i == 4 && j == 3); } else { assertEquals(c, Utilities.compare(i, j)); } assertEquals(c == 0, set0.equals(set1)); assertEquals(c == 0, set1.equals(set0)); } } }
@Test public void testCompare() { final List<ImmutableBitSet> sorted = getSortedList(); for (int i = 0; i < sorted.size(); i++) { for (int j = 0; j < sorted.size(); j++) { final ImmutableBitSet set0 = sorted.get(i); final ImmutableBitSet set1 = sorted.get(j); int c = set0.compareTo(set1); if (c == 0) { assertTrue(i == j || i == 3 && j == 4 || i == 4 && j == 3); } else { assertEquals(c, Utilities.compare(i, j)); } assertEquals(c == 0, set0.equals(set1)); assertEquals(c == 0, set1.equals(set0)); } } }