@Retention(value=SOURCE) @Target(value=TYPE) public @interface DoubleHashing
Hash table capacities are chosen from a predefined set of prime numbers, with max difference below 0.5% between neighbouring ones (this condition starts to be true only from capacities of a few thousands). The smallest possible capacities are 5, 7, 11, 13, 19, 23, 29, 41, 43, ... Density of the predefined capacities and the smallest possible capacities could be changed in any future version of Koloboke Compile.
This algorithm usually performs slower than @QuadraticHashing
, while
it is not considerably better by other characteristics. So between @DoubleHashing
and
@QuadraticHashing
the latter should be the default choice.