3 ms·
Yes. It's open addressing, linear probing, Robin Hood hashing. https://doc.rust-lang.org/std/collections/struct.HashMap.html https://doc.rust-lang.org/std/coll
by sanxiyn 10y ago
Yes. It's open addressing, linear probing, Robin Hood hashing.
https://doc.rust-lang.org/std/collections/struct.HashMap.html https://doc.rust-lang.org/std/collections/struct.HashMap.htm...
- masklinn 10y agoThe program which reached the top of k-n does not use the standard library's hashmap, it uses ordermap: https://github.com/bluss/ordermap https://github.com/bluss/ordermap Though that's also an open addressed map.