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
94 Integer[] key = new Integer[NKEYS];
95 for (int i = 0; i < key.length; ++i)
96 key[i] = new Integer(rng.nextInt());
104 new Runner(map, key, barrier).run();
115 pool.execute(new Runner(map, key, barrier));
132 final Integer[] key;
138 Runner(Map<Integer,Integer> map, Integer[] key, CyclicBarrier barrier) {
140 this.key = key;
142 position = key.length / 2;
146 // random-walk around key positions, bunching accesses
149 while (position >= key.length) position -= key.length;
150 while (position < 0) position += key.length;
152 Integer k = key[position];
161 position = r % key.length;