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.
created at April 4, 2015, 1:27 a.m.
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.
created at Aug. 21, 2017, 4:26 a.m.
A simple C++ 03/11/etc timer class for ~microsecond-precision cross-platform benchmarking. The implementation is as limited and as simple as possible to create the lowest amount of overhead.
created at Oct. 4, 2016, 12:45 a.m.
A C++ data container replicating std::stack functionality but with better performance than standard library containers in a stack context.
created at Oct. 3, 2016, 8:38 p.m.
A sort wrapper enabling both use of random-access sorting on non-random access containers, and increased performance for the sorting of large types.
created at June 26, 2020, 8:42 a.m.