Timeline for Hash function classification
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 31, 2012 at 4:30 | vote | accept | maaartinus | ||
| Dec 31, 2012 at 4:28 | comment | added | maaartinus | Thanks, that's it - the link seems to be the source of this ***. It still makes no sense as they're mixing many things together: 1. computing the hashCode from a key (e.g., fold and add), 2. improving (=smearing) the hash (e.g., mid-square), 3. mapping the hash to the index (e.g., modulus, "&"). | |
| Dec 31, 2012 at 3:56 | history | answered | James | CC BY-SA 3.0 |