/* * Copyright LGPL3 * YES Technology Association * http://yestech.org * * http://www.opensource.org/licenses/lgpl-3.0.html */ package org.yestech.lib.util; import static org.yestech.lib.crypto.MessageDigestUtils.md5HashToByte; import static org.yestech.lib.util.HashAlgorithm.KeyUtil.getKeyBytes; import java.util.zip.CRC32; import java.util.Collection; import java.util.ArrayList; import java.io.UnsupportedEncodingException; /** * Known hashing algorithms for locating a server for a key. * Note that all hash algorithms return 64-bits of hash, but only the lower * 32-bits are significant. This allows a positive 32-bit number to be * returned for all cases. * <p/> * Note: this was taken from <a href=http://code.google.com/p/spymemcached/>spymemcached</a> */ public enum HashAlgorithm { /** * Native hash (String.hashCode()). */ NATIVE_HASH, /** * CRC32_HASH as used by the perl API. This will be more consistent both * across multiple API users as well as java versions, but is mostly likely * significantly slower. */ CRC32_HASH, /** * FNV hashes are designed to be fast while maintaining a low collision * rate. The FNV speed allows one to quickly hash lots of data while * maintaining a reasonable collision rate. * * @see <a href="http://www.isthe.com/chongo/tech/comp/fnv/">fnv comparisons</a> * @see <a href="http://en.wikipedia.org/wiki/Fowler_Noll_Vo_hash">fnv at wikipedia</a> */ FNV1_64_HASH, /** * Variation of FNV. */ FNV1A_64_HASH, /** * 32-bit FNV1. */ FNV1_32_HASH, /** * 32-bit FNV1a. */ FNV1A_32_HASH, /** * MD5-based hash algorithm used by ketama. Best hash to use for {@link org.yestech.lib.util.ConsistentHash}. */ KETAMA_HASH; private static final long FNV_64_INIT = 0xcbf29ce484222325L; private static final long FNV_64_PRIME = 0x100000001b3L; private static final long FNV_32_INIT = 2166136261L; private static final long FNV_32_PRIME = 16777619; /** * Compute the hash for the given key. * * @param k String to hash * @return a positive integer hash */ public long hash(final String k) { long rv = 0; switch (this) { case NATIVE_HASH: rv = k.hashCode(); break; case CRC32_HASH: // return (crc32(shift) >> 16) & 0x7fff; CRC32 crc32 = new CRC32(); crc32.update(getKeyBytes(k)); rv = (crc32.getValue() >> 16) & 0x7fff; break; case FNV1_64_HASH: { // Thanks to pierre@demartines.com for the pointer rv = FNV_64_INIT; int len = k.length(); for (int i = 0; i < len; i++) { rv *= FNV_64_PRIME; rv ^= k.charAt(i); } } break; case FNV1A_64_HASH: { rv = FNV_64_INIT; int len = k.length(); for (int i = 0; i < len; i++) { rv ^= k.charAt(i); rv *= FNV_64_PRIME; } } break; case FNV1_32_HASH: { rv = FNV_32_INIT; int len = k.length(); for (int i = 0; i < len; i++) { rv *= FNV_32_PRIME; rv ^= k.charAt(i); } } break; case FNV1A_32_HASH: { rv = FNV_32_INIT; int len = k.length(); for (int i = 0; i < len; i++) { rv ^= k.charAt(i); rv *= FNV_32_PRIME; } } break; case KETAMA_HASH: byte[] bKey = md5HashToByte(getKeyBytes(k)); rv = ((long) (bKey[3] & 0xFF) << 24) | ((long) (bKey[2] & 0xFF) << 16) | ((long) (bKey[1] & 0xFF) << 8) | (bKey[0] & 0xFF); break; default: assert false; } return rv & 0xffffffffL; /* Truncate to 32-bits */ } /** * Utility methods for working with Strings */ public static class KeyUtil { /** * Get the bytes for a key. * * @param k the key * @return the bytes */ public static byte[] getKeyBytes(String k) { try { return k.getBytes("UTF-8"); } catch (UnsupportedEncodingException e) { throw new RuntimeException(e); } } /** * Get the keys in byte form for all of the string keys. * * @param keys a collection of keys * @return return a collection of the byte representations of keys */ public static Collection<byte[]> getKeyBytes(Collection<String> keys) { Collection<byte[]> rv = new ArrayList<byte[]>(keys.size()); for (String s : keys) { rv.add(getKeyBytes(s)); } return rv; } } }