code: public static int jenkinsHash(int code) {
  		code = (code + 0x7ed55d16) + (code << 12);
  		code = (code ^ 0xc761c23c) ^ (code >>> 19);
  		code = (code + 0x165667b1) + (code << 5);
  		code = (code + 0xd3a2646c) ^ (code << 9);
  		code = (code + 0xfd7046c5) + (code << 3);
  		code = (code ^ 0xb55a4f09) ^ (code >>> 16);
  		return code >= 0 ? code : -(code + 1);
  	}
docs: This function hashes an integer value. It is adapted from Bob Jenkins' website
  <a href="http://www.burtleburtle.net/bob/hash/integer.html">http://www.burtleburtle.net/bob/hash/integer.html</a>.
  The hash function has the <i>full avalanche</i> property, meaning that every bit of the value to be hashed
  affects every bit of the hash value.
  
  <p>It is crucial to use different hash functions to partition data across machines and the internal partitioning of
  data structures. This hash function is intended for partitioning internally in data structures.
  
  @param code The integer to be hashed.
  @return The non-negative hash code for the integer.