Lines Matching refs:key
41 * though elements of "key" array. On each iteration, it checks if
42 * table includes key. If absent, with probability pinsert it
134 Integer[] key = new Integer[n];
135 for (int i = 0; i < key.length; ++i)
136 key[i] = new Integer(rng.next());
137 return key;
140 static void shuffleKeys(Integer[] key) {
142 for (int i = key.length; i > 1; --i) {
144 Integer tmp = key[j];
145 key[j] = key[i-1];
146 key[i-1] = tmp;
153 Integer[] key = makeKeys(nkeys);
156 // map.put(key[j], key[j]);
160 pool.execute(new Runner(map, key, barrier));
173 final Integer[] key;
179 Runner(Map<Integer,Integer> map, Integer[] key, CyclicBarrier barrier) {
181 this.key = key;
183 position = key.length / 2;
187 // random-walk around key positions, bunching accesses
190 while (position >= key.length) position -= key.length;
191 while (position < 0) position += key.length;
193 Integer k = key[position];
202 position = total % key.length; // move from position