looks up a consistent hash with the given data point . the whole point of this class is that if the same query point is given , it 's likely to return the same result even when other nodes are added/removed , or the # of replicas for the given node is changed . concode_field_sep int numPoints concode_elem_sep int defaultReplication concode_elem_sep Object[] owner concode_elem_sep Object item concode_elem_sep Map<T,Point[]> items concode_elem_sep Hash<?> DEFAULT_HASH concode_elem_sep int[] hash concode_elem_sep Table table concode_field_sep void add concode_elem_sep void add concode_elem_sep void addInternal concode_elem_sep void addAll concode_elem_sep void addAll concode_elem_sep void addAll concode_elem_sep int countAllPoints concode_elem_sep void refreshTable concode_elem_sep int b2i concode_elem_sep int index concode_elem_sep int compareTo concode_elem_sep Iterator<T> list concode_elem_sep Iterable<T> list concode_elem_sep Iterable<T> list concode_elem_sep void remove concode_elem_sep String hash concode_elem_sep String hash concode_elem_sep int md5
T function ( int arg0 ) { return table . lookup ( arg0 ) ; }