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

Please consider proposing btree to C++17 #23

Open
GoogleCodeExporter opened this issue Oct 6, 2015 · 0 comments
Open

Please consider proposing btree to C++17 #23

GoogleCodeExporter opened this issue Oct 6, 2015 · 0 comments

Comments

@GoogleCodeExporter
Copy link

btree_map and btree_set are both extremely useful. They beat STL 
unordered/map/set both in insertion time, lookup time and space consumption so 
it would be a very valuable addition. 

Many people from industry are not happy with STL associative containers and 
they usually create their own (see recent CppCon video 
https://www.youtube.com/watch?v=rX0ItVEVjHc. Also famous paper from committee 
member: http://lafstern.org/matt/col1.pdf)

Also consider changing the lookup interface along heterogeneous lookup proposal 
(http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2013/n3657.htm) when 
available. There are too many std::string/QString/CString keys out there (see 
one sad story here: 
http://channel9.msdn.com/Shows/C9-GoingNative/GoingNative-29-Massive-Improvement
s-for-Browsing-in-Large-Codebases-)

Common google you can do it

Original issue reported on code.google.com by pecholt@gmail.com on 8 Oct 2014 at 11:25

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant