<s>
Key	O
or	O
hash	B-Error_Name
function	I-Error_Name
should	O
avoid	O
clustering	B-Algorithm
,	O
the	O
mapping	O
of	O
two	O
or	O
more	O
keys	O
to	O
consecutive	O
slots	O
.	O
</s>
<s>
Such	O
clustering	B-Algorithm
may	O
cause	O
the	O
lookup	O
cost	O
to	O
skyrocket	O
,	O
even	O
if	O
the	O
load	O
factor	O
is	O
low	O
and	O
collisions	B-Algorithm
are	O
infrequent	O
.	O
</s>
<s>
The	O
popular	O
multiplicative	O
hash	B-Error_Name
is	O
claimed	O
to	O
have	O
particularly	O
poor	O
clustering	B-Algorithm
behaviour	O
.	O
</s>
