New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

benchmark #2

Open

ktprime opened this issue Nov 3, 2021 · 0 comments

ktprime commented Nov 3, 2021 •

edited

Loading

可以把我实现的lru 加入你的测试（集中删除）https://github.com/ktprime/emhash/blob/master/lru_size.h
过比传统实现hashmap+list 快4倍。一个单一数组实现的hash，不算严格的lru。

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment