Distribution of number of swaps during inserts gathered using
the implementation from the original authors of the Hopscotch
algorithm.

000 115153
001 2620
002 940
003 403
004 189
005 110
006 63
007 33
008 24
009 16
010 7
011 9
012 7
013 3
014 1



Command run:

$ ./test_intel32 bhop 1 2 100 90 102400 1 1 > out



Output:

ConcurrentHashMap Benchmark
---------------------------
numOfThreads:   2
Algorithm Name: bhop
NumProcessors:  1
testNo:         1
insert ops:     50
del ops:        50
constain ops:   0
loadFactor:     89
initialCount:   131072
throughputTime: 1
initialCapacity:   131072

START create random numbers.
END   creating random numbers.

START fill table. (117964)
BHOP Num elm: 117964
END   fill table.

START creating threads.
END   creating threads.

START threads.
END   threads.

STARTING test.
ENDING test,

ERROR - RESIZE is not implemented - size 117971