The CRC is a specific example of these for detecting errors in modems as a checksum, and the (*) Pearson one finds a way around bit-shifting.
Gperf is a program to generate examples of these that only require a single string lookup. The lazy mod method extends one example of these data structures to non-powers of two. The CRC is a specific example of these for detecting errors in modems as a checksum, and the (*) Pearson one finds a way around bit-shifting. Bloom filters employ many of these data structures. Examples that are one-way and block simultaneous message mapping are generated by the cuckoo algorithm and are termed collision-free, while examples that find strings in blocks of text are termed rolling and are employed in the Rabin-Karp algorithm. For 10 points, name this function which maps keys to memory addresses, thereby compressing large amounts of data into indices in an array.
Gperf is a program to generate examples of these that only require a single string lookup.
hashing function [prompt on checksum until mentioned]