Eric wrote: ========== Hashes seem to be particularly slow when searching for nonexistent key values. For 100,000 searches: loop 100000 [ if select z "1533695" [x: x + 1]] ; first key value, 0:02 loop 100000 [ if select z "501730" [x: x + 1]] ; 5000th key value, 0:53 loop 100000 [ if select z "1533696" [x: x + 1]] ; non-key value, 1:41 ========= Well, how would it compare to find? It looks to me like it's doing a linear search like find. plus have you plugged select back into Ladislav's code to see if it was any faster really? this ought to be brainless. What are we doing wrong on these hashes? -galt
