Associative container with the ability to search more efficiently if you know the key will be there. On par with std::map and well against std::unordered_map for most keys sizes, and especially where you have large keys with common prefixes.
GNU General Public License v3.0
0
stars
0
forks
source link
Can I reduce the number of comparisons in splay tree find() / _splay()? #59
Is your feature request related to a problem? Please describe.
A clear and concise description of what the problem is. Ex. I'm always frustrated when [...]
Describe the solution you'd like
A clear and concise description of what you want to happen.
Describe alternatives you've considered
A clear and concise description of any alternative solutions or features you've considered.
Additional context
Add any other context or screenshots about the feature request here.
Is your feature request related to a problem? Please describe. A clear and concise description of what the problem is. Ex. I'm always frustrated when [...]
Describe the solution you'd like A clear and concise description of what you want to happen.
Describe alternatives you've considered A clear and concise description of any alternative solutions or features you've considered.
Additional context Add any other context or screenshots about the feature request here.