Practice
Learn
← Quit
0 / 0 correct
Data Structures
Hard
1 of 20
What is the key idea of SwissTable (used by Rust's hashbrown and Abseil)?
A
Use cryptographic hashes
B
Use a binary tree per bucket
C
Store keys sorted
D
Store a 7-bit hash fragment per slot in a separate control array and compare 16 at once with SIMD