Re:C++ macros to write a hashtable implementation
by stevemk14ebr on Saturday March 10, 2018 @04:17PM
(#16560192)
Neat/Funny i guess but not really technically impressive. They took normal C++ code and hid it behind a macro with some names. The actual implementation isn't even there, Hashtable::hash and the 'table' member for example.
I was totally hoping for some fancy templates and macro tricks to compile time gen all the code for a working hashtable implementation.
Re:C++ macros to write a hashtable implementation
by stochastic_monk on Saturday March 10, 2018 @05:06PM
(#16560412)
I've had real world applications where the full program's performance increased by a factor of 10 when switching to khash over std::unordered_map. I've seen papers which have them performing rather comparably, but whenever I've compared the two, khash has always soared over std::unordered_map. I use std::unordered_map for typical, average use cases (where speed doesn't matter as much and I'm feeling lazy), but khash for inner loops/core functionality.
I wonder if part of the reason is that, by nature of the standard, std::unordered_map has to resolve its collisions by linear chaining, while khash is able to use quadratic probing.
Re:C++ macros to write a hashtable implementation
by CyberDildonics on Saturday March 10, 2018 @05:24PM
(#16560481)
The standard dictates performance characteristics that imply the use of buckets, so there is more pointer hopping. A hash map that uses flat memory will end up being better. I would guess robin hood hashing + flat memory would be one of the most competitive techniques.
Re:C++ macros to write a hashtable implementation
by stochastic_monk on Saturday March 10, 2018 @10:07PM
(#16561507)
Thanks for the tip. This testing was 2015, so it would have been after that point. You're right, though -- even linear probing would probably have better locality than chaining.
I was totally hoping for some fancy templates and macro tricks to compile time gen all the code for a working hashtable implementation.
I wonder if part of the reason is that, by nature of the standard, std::unordered_map has to resolve its collisions by linear chaining, while khash is able to use quadratic probing.
[1] https://troydhanson.github.io/uthash/
they hash the data and use that as an index. So by def. That said it's pretty bare and missing _ALOT_