An unordered C++ data container providing fast iteration/insertion/erasure while maintaining pointer/iterator validity to non-erased elements regardless of insertions/erasures. Provides higher-performance than std:: library containers for high-modification scenarios with unordered data.
mattreecebentley
3 tracked repositories
☆ 864 TOTAL STARS
⑂ 77 TOTAL FORKS
↗ +10 STARS TODAY
★ Add Profile Badge to your GitHub README.md
Auto-UpdatingShowcase your total open-source impact. This SVG badge updates automatically as our continuous crawler records new stars.
[](https://githubrepo.cloud/developers/mattreecebentley)
Repositories
Sorted by stars
↑ +1 today
plf::hive is a fork of plf::colony to match the current C++ standards proposal.
↑ +1 today
A drop-in replacement for std::list with 293% faster insertion, 57% faster erasure, 17% faster iteration and 77% faster sorting on average. 20-24% speed increase in use-case testing.
↑ +1 today
From our network