-
-
Notifications
You must be signed in to change notification settings - Fork 681
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
Perf: use term hashmap in fastfield #2243
Conversation
lower minimum resize in hashtable
@@ -57,60 +11,8 @@ impl KeyValue { | |||
/// the computation of the hash of the key twice, | |||
/// or copying the key as long as there is no insert. | |||
pub struct ArenaHashMap { | |||
table: Vec<KeyValue>, | |||
shared_arena_hashmap: SharedArenaHashMap, |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
can you relationship between ArenaHashMap vs SharedArenaHashMap?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I added some comments to clarify
/// SharedArenaHashMap is like ArenaHashMap but gets the memory arena
/// passed as an argument to the methods.
/// So one MemoryArena can be shared with multiple SharedArenaHashMap.
* add shared arena hashmap * bench fastfield indexing * use shared arena hashmap in columnar lower minimum resize in hashtable * clippy * add comments
Faster indexing + Lower Memory consumption + Less allocations