-
Notifications
You must be signed in to change notification settings - Fork 272
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
Alternatives to unordered_map
, unordered_set
for C++ backend.
#438
Comments
unordered_map
, unordered_set
- AFAIK, these are slow in STL of C++. We have found some alternatives - policy based data structures (https://codeforces.com/blog/entry/60737, SparseHash by Google, abseil::flat_hash_map
, boost::unordered_map
(https://comp.lang.cpp.moderated.narkive.com/VPUab6if/performance-difference-between-std-unordered-map-and), https://codeforces.com/blog/entry/62393 - implementing our own hash map.unordered_map
, unordered_set
.
unordered_map
, unordered_set
.unordered_map
, unordered_set
for C++ backend.
@jthorat10 After completing bubble sort and insertion sort, feel free to start working on this. |
Sure. |
The benchmark in https://tessil.github.io/2016/08/29/benchmark-hopscotch-map.html can be a good source of inspiration for designing ours to analyse the approaches mentioned in the OP. |
hello sir i`m new to open source i know c++ and data structure how can i contribute |
I want to work on this under GSSOC2022. Here is my discord profile DHANANJOY DEY | Contributor#7903 please please I want to work on a c++ project. |
@sceary-expert Feel free to start working on this issue. |
@czgdp1807 can you assign me for this issue? |
We don't assign issues. Care to read, https://github.com/codezonediitj/pydatastructs/wiki/Issue-Policy |
@czgdp1807 Can you tell me more about the the issue ? |
@sceary-expert There is sufficient information in the description of this PR. Do you have any specific questions? |
Hey @czgdp1807 , is this still open? I would like to work on it. |
Hi @czgdp1807 Can you please help me to start |
AFAIK, these are slow in STL of C++. We have found some alternatives - policy based data structures (https://codeforces.com/blog/entry/60737, SparseHash by Google,
abseil::flat_hash_map
,boost::unordered_map
(https://comp.lang.cpp.moderated.narkive.com/VPUab6if/performance-difference-between-std-unordered-map-and), https://codeforces.com/blog/entry/62393 - implementing our own hash map.Refer #438 (comment)
The text was updated successfully, but these errors were encountered: