A drop-in replacement for std::list with 333% faster insertion, 81% faster erasure, 16% faster iteration and 72% faster sorting on average. 20-25% speed increase in use-case testing.
Switch branches/tags
Nothing to show
Clone or download
mattreecebentley v1.50
Performance increases, corrections and improvements to single insert, fill-insert and reserve. End result is between 2-7% overall performance increase for large (> 10000, generally) numbers of elements in general use tests. Reversion from printf in test suite to iostream, as printf created problems for dealing with size_type across platforms.
Latest commit 911c18e Aug 1, 2018
Permalink
Failed to load latest commit information.
README.md Update README.md Apr 28, 2018
plf_licensing.txt v1.10 Jan 5, 2018
plf_list.h v1.50 Aug 1, 2018
plf_list_test_suite.cpp v1.50 Aug 1, 2018

README.md

plf_list

A drop-in replacement for std::list with (on average):

  • 333% faster insertion
  • 81% faster erasure
  • 16% faster iteration
  • 72% faster sorting
  • 492% faster reversal
  • 103% faster remove/remove_if
  • 62% faster unique
  • 826% faster clear (1122550% for trivially-destructible types)
  • 1238% faster destruction (6187% for trivially-destructible types)

(Benchmarks performed on a haswell-based CPU under GCC 7.3: http://www.plflib.org/benchmarks_haswell_gcc.htm)