Iterable < T > function ( final int arg0 ) { return new Iterable < T > ( ) { public Iterator < T > iterator ( ) { return table . list ( arg0 ) ; } } ; }
creates a permutation of all the nodes for the given data point . the returned permutation is consistent , in the sense that small change to the consistent hash like addition/removal/change of replicas only creates a small change in the permutation . nodes with more replicas are more likely to show up early in the list 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 T lookup concode_elem_sep T lookup concode_elem_sep T lookup 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 void remove concode_elem_sep String hash concode_elem_sep String hash concode_elem_sep int md5