Pinned Repositories
plf_colony
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.
plf_engine
A modern(ish) cross-platform open-source 2D game engine built on top of SDL2. C++98/03/11/14/17 compatible. Requires plf::colony and plf::stack.
plf_hive
plf::hive is a fork of plf::colony to match the current C++ standards proposal.
plf_indiesort
A sort wrapper enabling both use of random-access sorting on non-random access containers, and increased performance for the sorting of large types.
plf_list
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.
plf_nanotimer
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.
plf_queue
A C++ data container replicating std::queue functionality but with better performance.
plf_rand
A replacement for rand()/srand() that's ~700% faster and typically has better statistical distribution. An adaptationof Melissa O'Neill's PCG rand with a fallback to xor-rand for 32-bit code.
plf_stack
A C++ data container replicating std::stack functionality but with better performance than standard library containers in a stack context.
Windows-10-11-Simplifier
Windows 10/11 Simplifier - A script for automating simplifications and maintenance
mattreecebentley's Repositories
mattreecebentley/plf_colony
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/plf_list
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.
mattreecebentley/plf_nanotimer
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.
mattreecebentley/Windows-10-11-Simplifier
Windows 10/11 Simplifier - A script for automating simplifications and maintenance
mattreecebentley/plf_hive
plf::hive is a fork of plf::colony to match the current C++ standards proposal.
mattreecebentley/plf_stack
A C++ data container replicating std::stack functionality but with better performance than standard library containers in a stack context.
mattreecebentley/plf_queue
A C++ data container replicating std::queue functionality but with better performance.
mattreecebentley/plf_indiesort
A sort wrapper enabling both use of random-access sorting on non-random access containers, and increased performance for the sorting of large types.
mattreecebentley/plf_engine
A modern(ish) cross-platform open-source 2D game engine built on top of SDL2. C++98/03/11/14/17 compatible. Requires plf::colony and plf::stack.
mattreecebentley/plf_rand
A replacement for rand()/srand() that's ~700% faster and typically has better statistical distribution. An adaptationof Melissa O'Neill's PCG rand with a fallback to xor-rand for 32-bit code.
mattreecebentley/plf_reorderase
A faster method for singular erasures, ranged erasures, and erase_if-style erasures for vector/deque/static_vector when element order is not important.
mattreecebentley/plf_colony_old
Deprecated version of colony which will be updated when and if bugs are found. For backwards compatibility with users of colony version 5.
mattreecebentley/stl-sort
C++ implementation of popular sorting algorithms
mattreecebentley/draft
C++ standards drafts