private static int mixH1(int h1, int k1) { h1 ^= k1; h1 = Integer.rotateLeft(h1, 13); h1 = h1 * 5 + 0xe6546b64; return h1; }
private static int mixK1(int k1) { k1 *= C1; k1 = Integer.rotateLeft(k1, 15); k1 *= C2; return k1; }
static int smear(int hashCode) { return C2 * Integer.rotateLeft(hashCode * C1, 15); }
static int smear(int hashCode) { return (int) (C2 * Integer.rotateLeft((int) (hashCode * C1), 15)); }
private static int mixK1(int k1) { k1 *= C1; k1 = Integer.rotateLeft(k1, 15); k1 *= C2; return k1; }
private static int mixH1(int h1, int k1) { h1 ^= k1; h1 = Integer.rotateLeft(h1, 13); h1 = h1 * 5 + 0xe6546b64; return h1; }
private static int mixH1(int h1, int k1) { h1 ^= k1; h1 = Integer.rotateLeft(h1, 13); h1 = h1 * 5 + 0xe6546b64; return h1; }
private static int mixK1(int k1){ k1 *= C1; k1 = Integer.rotateLeft(k1, 15); k1 *= C2; return k1; }
private static int mixH1(int h1, int k1){ h1 ^= k1; h1 = Integer.rotateLeft(h1, 13); h1 = h1 * 5 + 0xe6546b64; return h1; }
private static int mixK1(int k1) { k1 *= C1; k1 = Integer.rotateLeft(k1, 15); k1 *= C2; return k1; }
/** * Smear hash code. */ public static int smear(int hashCode) { return C2 * Integer.rotateLeft(hashCode * C1, 15); }
/** * This method was rewritten in Java from an intermediate step of the Murmur hash function in * https://github.com/aappleby/smhasher/blob/master/src/MurmurHash3.cpp, which contained the * following header: * * MurmurHash3 was written by Austin Appleby, and is placed in the public domain. The author * hereby disclaims copyright to this source code. */ static int smear(int hashCode) { return C2 * Integer.rotateLeft(hashCode * C1, 15); }
static int smear(int hashCode) { return C2 * Integer.rotateLeft(hashCode * C1, 15); }
static int smear(int hashCode) { return (int) (C2 * Integer.rotateLeft((int) (hashCode * C1), 15)); }
private static int mixH1(int h1, int k1) { h1 ^= k1; h1 = Integer.rotateLeft(h1, 13); h1 = h1 * 5 + 0xe6546b64; return h1; }
private static int mixK1(int k1) { k1 *= C1; k1 = Integer.rotateLeft(k1, 15); k1 *= C2; return k1; }
@Override public int hashCode() { return name.hashCode() ^ Integer.rotateLeft(descriptor.hashCode(), 8) ^ Integer.rotateLeft(bootstrapMethod.hashCode(), 16) ^ Integer.rotateLeft(Arrays.hashCode(bootstrapMethodArguments), 24); }
@Override public int hashCode() { /* I'm not sure why this is happening, and i really don't want to spend a month tracing it down. -wmorgan. */ //if (val == null) return num << 16 ^ 1 << 5 ^ tag.hashCode(); //return num << 16 ^ val.hashCode() << 5 ^ tag.hashCode(); if (hashCode == 0) { int hNum = Integer.rotateLeft(num,16); int hVal = Integer.rotateLeft(val.hashCode(),5); hashCode = hNum ^ hVal ^ tag.hashCode(); } return hashCode; }
@Override public int hashCode() { return name.hashCode() ^ Integer.rotateLeft(descriptor.hashCode(), 8) ^ Integer.rotateLeft(bootstrapMethod.hashCode(), 16) ^ Integer.rotateLeft(Arrays.hashCode(bootstrapMethodArguments), 24); }
@Override public int hashCode() { return name.hashCode() ^ Integer.rotateLeft(descriptor.hashCode(), 8) ^ Integer.rotateLeft(bootstrapMethod.hashCode(), 16) ^ Integer.rotateLeft(Arrays.hashCode(bootstrapMethodArguments), 24); }