Reviews
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.
License
zlib License
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.
Creator
Related apps
plf_indiesort
A sort wrapper enabling both use of random-access sorting on non-random access c
C++18zlib
8 months ago
sortsorting
plf_nanotimer
A simple C++ 03/11/etc timer class for ~microsecond-precision cross-platform ben
C++120zlib
2 years ago
benchmarkbenchmarkingtimer
plf_stack
A C++ data container replicating std::stack functionality but with better perfor
C++55zlib
9 months ago
containercppstack
plf_list
A drop-in replacement for std::list with 293% faster insertion, 57% faster erasu
C++133zlib
5 months ago
containercpplinked-list