|
Boost : |
From: Jooseong Lee (frozenca91_at_[hidden])
Date: 2022-07-25 03:45:14
I recently wrote a general-purpose STL-like ordered associative B-Tree
based container in C++.
.
Its API and usage is very similar to std::set, std::map, std::multiset,
std::multimap,
and when the number of elements is relatively large, my benchmark shows
that it is 2.5~3 times faster than std::set and its friends.
Repo link: https://github.com/frozenca/BTree
This was better than I thought, so I'd like to contribute to the Boost
community by incorporating it within the list of Boost libraries.
I'd like to know if it's possible or if you think it's worth it.
Best Regards,
Jooseong Lee
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk