Skip to content
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.

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

Operate on hash table entries directly instead of through keys #28

Open
florian1345 opened this issue Jun 6, 2023 · 0 comments
Open
Assignees
Labels
performance Performance or benchmark improvements

Comments

@florian1345
Copy link
Owner

Some performance is lost by making hash lookups in situations where it would not be necessary, such as deleting the LRU element, where we already have a pointer.

At the moment this issue is blocked by the lack of any method to convert raw pointers to hash table buckets. This issue serves as a reminder to check whether any such method is available.

As an alternative, it may be possible to switch from using raw pointers to using buckets.

@florian1345 florian1345 self-assigned this Jun 6, 2023
@florian1345 florian1345 added the performance Performance or benchmark improvements label Jun 8, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
performance Performance or benchmark improvements
Projects
None yet
Development

No branches or pull requests

1 participant