com.gemstone.gemfire.internal.shared

Class ClientResolverUtils

java.lang.Object

com.gemstone.gemfire.internal.shared.ClientResolverUtils

public abstract class ClientResolverUtils
extends Object

Moved some code from GFXD ResolverUtils to enable using at GFE layer.

Field Summary

Fields

Modifier and Type	Field and Description
protected static int[]	sbox

Constructor Summary

Constructors

Modifier	Constructor and Description
protected	ClientResolverUtils()

Method Summary

Modifier and Type	Method and Description
static int	addBytesToHash(byte[] bytes, int hash) The below hash generation uses substitution box technique to generate hashcodes.
static int	addBytesToHash(byte[] bytes, int offset, int length, int hash) The below hash generation uses substitution box technique to generate hashcodes.
static int	addByteToHash(byte b, int hash)
static int	addCharsToHash(char[] chars, int offset, int length, int hash)
static int	addIntToHash(int val, int hash)
static int	addIntToHashOpt(int val, int hash)
static int	addLongToHash(long val, int hash)
static int	addLongToHashOpt(long val, int hash)
static int	addStringToHash(String s, int offset, int length, int hash)
static int	fastHashInt(int v) Quickly mixes the bits of an integer.
static int	fastHashLong(long v)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

sbox

protected static final int[] sbox

Constructor Detail

ClientResolverUtils

protected ClientResolverUtils()

Method Detail

addBytesToHash

public static final int addBytesToHash(byte[] bytes,
                                       int hash)

The below hash generation uses substitution box technique to generate hashcodes. This gives good distribution characteristics with nice "avalanche" characteristics. The actual values in the sbox array are from http://home.comcast.net/~bretm/hash/10.html.

addBytesToHash

public static final int addBytesToHash(byte[] bytes,
                                       int offset,
                                       int length,
                                       int hash)

The below hash generation uses substitution box technique to generate hashcodes. This gives good distribution characteristics with nice "avalanche" characteristics. The actual values in the sbox array are from http://home.comcast.net/~bretm/hash/10.html.

addStringToHash

public static final int addStringToHash(String s,
                                        int offset,
                                        int length,
                                        int hash)

addCharsToHash

public static final int addCharsToHash(char[] chars,
                                       int offset,
                                       int length,
                                       int hash)

addByteToHash

public static final int addByteToHash(byte b,
                                      int hash)

addIntToHash

public static final int addIntToHash(int val,
                                     int hash)

addLongToHash

public static final int addLongToHash(long val,
                                      int hash)

addIntToHashOpt

public static int addIntToHashOpt(int val,
                                  int hash)

addLongToHashOpt

public static int addLongToHashOpt(long val,
                                   int hash)

fastHashInt

public static int fastHashInt(int v)

Quickly mixes the bits of an integer.

This method mixes the bits of the argument by multiplying by the golden ratio and XORshifting the result. It is borrowed from Koloboke, and it has slightly worse behaviour than MurmurHash3 (in open-addressed hash tables the average number of probes is slightly larger), but it's much faster.

fastHashLong

public static int fastHashLong(long v)