4 ms·
That's marginally better, but it's still a million little hashtabe lookups.
by Pxtl 10y ago
That's marginally better, but it's still a million little hashtabe lookups.
- enkiv2 10y agoHashtable lookups are O(1). What are you complaining about? If they did this in plain C they'd probably end up using binary search trees and then everything would be slower.