Refine search
public int hashCode() { final int[] buf = new int[size()]; forEachPair( new DoubleCharProcedure() { int i = 0; @Override public boolean apply(double key, char value) { buf[i++] = HashUtils.hash(key) ^ HashUtils.hash(value); return true; } } ); Arrays.sort(buf); return IntBuffer.wrap(buf).hashCode(); }
public int hashCode() { final int[] buf = new int[size()]; forEachPair( new ShortFloatProcedure() { int i = 0; @Override public boolean apply(short key, float value) { buf[i++] = HashUtils.hash(key) ^ HashUtils.hash(value); return true; } } ); Arrays.sort(buf); return IntBuffer.wrap(buf).hashCode(); }
public int hashCode() { final int[] buf = new int[size()]; forEachPair( new ShortCharProcedure() { int i = 0; @Override public boolean apply(short key, char value) { buf[i++] = HashUtils.hash(key) ^ HashUtils.hash(value); return true; } } ); Arrays.sort(buf); return IntBuffer.wrap(buf).hashCode(); }
public int hashCode() { final int[] buf = new int[size()]; forEachPair( new FloatFloatProcedure() { int i = 0; @Override public boolean apply(float key, float value) { buf[i++] = HashUtils.hash(key) ^ HashUtils.hash(value); return true; } } ); Arrays.sort(buf); return IntBuffer.wrap(buf).hashCode(); }
public int hashCode() { final int[] buf = new int[size()]; forEachPair( new DoubleFloatProcedure() { int i = 0; @Override public boolean apply(double key, float value) { buf[i++] = HashUtils.hash(key) ^ HashUtils.hash(value); return true; } } ); Arrays.sort(buf); return IntBuffer.wrap(buf).hashCode(); }
public int hashCode() { final int[] buf = new int[size()]; forEachPair( new CharShortProcedure() { int i = 0; @Override public boolean apply(char key, short value) { buf[i++] = HashUtils.hash(key) ^ HashUtils.hash(value); return true; } } ); Arrays.sort(buf); return IntBuffer.wrap(buf).hashCode(); }
public int hashCode() { final int[] buf = new int[size()]; forEachPair( new DoubleObjectProcedure() { int i = 0; @Override public boolean apply(double key, Object value) { buf[i++] = HashUtils.hash(key) ^ value.hashCode(); return true; } } ); Arrays.sort(buf); return IntBuffer.wrap(buf).hashCode(); }
public int hashCode() { final int[] buf = new int[size()]; forEachPair( new DoubleShortProcedure() { int i = 0; @Override public boolean apply(double key, short value) { buf[i++] = HashUtils.hash(key) ^ HashUtils.hash(value); return true; } } ); Arrays.sort(buf); return IntBuffer.wrap(buf).hashCode(); }
public int hashCode() { final int[] buf = new int[size()]; forEachPair( new ByteDoubleProcedure() { int i = 0; @Override public boolean apply(byte key, double value) { buf[i++] = HashUtils.hash(key) ^ HashUtils.hash(value); return true; } } ); Arrays.sort(buf); return IntBuffer.wrap(buf).hashCode(); }
public int hashCode() { final int[] buf = new int[size()]; forEachPair( new FloatLongProcedure() { int i = 0; @Override public boolean apply(float key, long value) { buf[i++] = HashUtils.hash(key) ^ HashUtils.hash(value); return true; } } ); Arrays.sort(buf); return IntBuffer.wrap(buf).hashCode(); }