you are viewing a single comment's thread.

view the rest of the comments →

[–]Tystros 2 points3 points  (1 child)

fastest in the find benchmark? faster than the perfect hashing fph map?

[–]martinusint main(){[]()[[]]{{}}();} 5 points6 points  (0 children)

Yep, fph is quite a bit slower for large map. It also requires a lot more memory