-
Notifications
You must be signed in to change notification settings - Fork 8
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
Add stanford hash/swisstable as hashmap #18
Comments
rurban
changed the title
Add stanford hash as hashmap
Add stanford hash/swisstable as hashmap
Mar 23, 2021
See the hmap branch |
rurban
added a commit
that referenced
this issue
Mar 27, 2021
stanford hash for int keys <= 4byte. swisstable for strings and the rest. greg7mdp/parallel-hashmap for multithreaded later. See GH #18
rurban
added a commit
that referenced
this issue
Mar 27, 2021
stanford hash for int keys <= 4byte. swisstable for strings and the rest. greg7mdp/parallel-hashmap for multithreaded later. See GH #18
rurban
added a commit
that referenced
this issue
Apr 4, 2021
stanford hash for int keys <= 4byte. swisstable for strings and the rest. greg7mdp/parallel-hashmap for multithreaded later. See GH #18
rurban
added a commit
that referenced
this issue
Apr 24, 2021
stanford hash for int keys <= 4byte. swisstable for strings and the rest. greg7mdp/parallel-hashmap for multithreaded later. See GH #18
Most of the work is needed for a proper/better map/umap API.
|
rurban
added a commit
that referenced
this issue
Jul 12, 2021
stanford hash for int keys <= 4byte. swisstable for strings and the rest. greg7mdp/parallel-hashmap for multithreaded later. See GH #18
rurban
added a commit
that referenced
this issue
Oct 13, 2021
stanford hash for int keys <= 4byte. swisstable for strings and the rest. greg7mdp/parallel-hashmap for multithreaded later. See GH #18
rurban
added a commit
that referenced
this issue
Mar 13, 2023
stanford hash for int keys <= 4byte. swisstable for strings and the rest. greg7mdp/parallel-hashmap for multithreaded later. See GH #18
rurban
added a commit
that referenced
this issue
Apr 12, 2023
stanford hash for int keys <= 4byte. swisstable for strings and the rest. greg7mdp/parallel-hashmap for multithreaded later. See GH #18
rurban
added a commit
that referenced
this issue
Jul 17, 2023
stanford hash for int keys <= 4byte. swisstable for strings and the rest. greg7mdp/parallel-hashmap for multithreaded later. See GH #18
rurban
added a commit
that referenced
this issue
Feb 16, 2024
stanford hash for int keys <= 4byte. swisstable for strings and the rest. greg7mdp/parallel-hashmap for multithreaded later. See GH #18
rurban
added a commit
that referenced
this issue
Feb 16, 2024
stanford hash for int keys <= 4byte. swisstable for strings and the rest. greg7mdp/parallel-hashmap for multithreaded later. See GH #18
rurban
added a commit
that referenced
this issue
Feb 20, 2024
stanford hash for int keys <= 4byte. swisstable for strings and the rest. greg7mdp/parallel-hashmap for multithreaded later. See GH #18
rurban
added a commit
that referenced
this issue
Feb 21, 2024
stanford hash for int keys <= 4byte. swisstable for strings and the rest. greg7mdp/parallel-hashmap for multithreaded later. See GH #18
rurban
added a commit
that referenced
this issue
Feb 21, 2024
stanford hash for int keys <= 4byte. swisstable for strings and the rest. greg7mdp/parallel-hashmap for multithreaded later. See GH #18
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
stanford is optimal for integers (i.e. literals divisible by 256),
greg7mdp/parallel-hashmap for strings and structs.
Converting swiss table or greg7mdp/parallel-hashmap from C++/SIMD might be too much work.
stanford_hash is similar and good enough for now.
EDIT: see LIMachi/swiss-table on github.
Try the o1hash from wyhash as default, but add security measures (collision counting or tree conversion, no sorted_vector yet)
The text was updated successfully, but these errors were encountered: