How to use

Utilities

in

org.apache.calcite.runtime

private static int compare_(Object o0, Object o1) {
 if (o0 instanceof Comparable) {
  return compare((Comparable) o0, (Comparable) o1);
 }
 return compare((List) o0, (List) o1);
}

@Override
public int hashCode() {
 return Utilities.hashCode(rowCount) + Utilities.hashCode(cpu)
   + Utilities.hashCode(io) + Utilities.hashCode(network);
}

public int hashCode() {
 int h = 1;
 h = h * 31 + Utilities.hash(t0);
 return h;
}

public static int compare(List v0, List v1) {
 //noinspection unchecked
 final Iterator iterator0 = v0.iterator();
 final Iterator iterator1 = v1.iterator();
 for (;;) {
  if (!iterator0.hasNext()) {
   return !iterator1.hasNext()
     ? 0
     : -1;
  }
  if (!iterator1.hasNext()) {
   return 1;
  }
  final Object o0 = iterator0.next();
  final Object o1 = iterator1.next();
  int c = compare_(o0, o1);
  if (c != 0) {
   return c;
  }
 }
}

public static int compare(List v0, List v1) {
 //noinspection unchecked
 final Iterator iterator0 = v0.iterator();
 final Iterator iterator1 = v1.iterator();
 for (;;) {
  if (!iterator0.hasNext()) {
   return !iterator1.hasNext()
     ? 0
     : -1;
  }
  if (!iterator1.hasNext()) {
   return 1;
  }
  final Object o0 = iterator0.next();
  final Object o1 = iterator1.next();
  int c = compare_(o0, o1);
  if (c != 0) {
   return c;
  }
 }
}

private static int compare_(Object o0, Object o1) {
 if (o0 instanceof Comparable) {
  return compare((Comparable) o0, (Comparable) o1);
 }
 return compare((List) o0, (List) o1);
}

public static int hash(int h, boolean v) {
 return h * 31 + hashCode(v);
}

public int hashCode() {
 int h = 1;
 h = h * 31 + Utilities.hash(t0);
 h = h * 31 + Utilities.hash(t1);
 return h;
}

 public int compareTo(Column column) {
  return Utilities.compare(ordinal, column.ordinal);
 }
}

public static int hash(int h, boolean v) {
 return h * 31 + hashCode(v);
}

public int hashCode() {
 int h = 1;
 h = h * 31 + Utilities.hash(t0);
 h = h * 31 + Utilities.hash(t1);
 h = h * 31 + Utilities.hash(t2);
 h = h * 31 + Utilities.hash(t3);
 h = h * 31 + Utilities.hash(t4);
 return h;
}

public int compareTo(Column column) {
 return Utilities.compare(ordinal, column.ordinal);
}

@SuppressWarnings("deprecation")
public void checkHash(double v) {
 assertThat(Double.valueOf(v).hashCode(), is(Utilities.hashCode(v)));
 final long long_ = (long) v;
 assertThat(Long.valueOf(long_).hashCode(), is(Utilities.hashCode(long_)));
 final float float_ = (float) v;
 assertThat(Float.valueOf(float_).hashCode(),
   is(Utilities.hashCode(float_)));
 final boolean boolean_ = v != 0;
 assertThat(Boolean.valueOf(boolean_).hashCode(),
   is(Utilities.hashCode(boolean_)));
}

public int hashCode() {
 int h = 1;
 h = h * 31 + Utilities.hash(t0);
 h = h * 31 + Utilities.hash(t1);
 h = h * 31 + Utilities.hash(t2);
 h = h * 31 + Utilities.hash(t3);
 h = h * 31 + Utilities.hash(t4);
 return h;
}

public int compareTo(Dimension dimension) {
 return Utilities.compare(this.cubeOrdinal, dimension.cubeOrdinal);
}

@SuppressWarnings("deprecation")
public void checkHash(double v) {
 assertThat(Double.valueOf(v).hashCode(), is(Utilities.hashCode(v)));
 final long long_ = (long) v;
 assertThat(Long.valueOf(long_).hashCode(), is(Utilities.hashCode(long_)));
 final float float_ = (float) v;
 assertThat(Float.valueOf(float_).hashCode(),
   is(Utilities.hashCode(float_)));
 final boolean boolean_ = v != 0;
 assertThat(Boolean.valueOf(boolean_).hashCode(),
   is(Utilities.hashCode(boolean_)));
}

public int hashCode() {
 int h = 1;
 h = h * 31 + Utilities.hash(t0);
 h = h * 31 + Utilities.hash(t1);
 h = h * 31 + Utilities.hash(t2);
 h = h * 31 + Utilities.hash(t3);
 return h;
}

public int compareTo(Column column) {
 return Utilities.compare(ordinal, column.ordinal);
}

public int hashCode() {
 int h = 1;
 h = h * 31 + Utilities.hash(t0);
 h = h * 31 + Utilities.hash(t1);
 h = h * 31 + Utilities.hash(t2);
 h = h * 31 + Utilities.hash(t3);
 h = h * 31 + Utilities.hash(t4);
 h = h * 31 + Utilities.hash(t5);
 return h;
}

/** 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;
}