 |
lua-l archive |
|
|
||
|
Later when the hash value is used by truncating some high bits (according to the table size), they remain consecutive: the hashed "main" positions in the table is sequential when short keys of equal size are sequential. This makes it extremely easy to rapidly create long collision lists linking all non-null keys together, so the worse case is evident to reproduce (so all table lookups will use slow full table scans.