Warning, /kdevelop/kdevelop/3rdparty/timsort/README is written in an unsupported language. File is not indexed.
0001 Files LICENSE and timsort.hpp were copied from the official cpp-TimSort library. 0002 0003 cpp-TimSort project URL: https://github.com/timsort/cpp-TimSort 0004 0005 You should *not* touch this code, besides updating the files from an official 0006 TimSort release. When you find a bug, fix it upstream (the project URL above). 0007 0008 gfx::timsort and gfx::timmerge can be used in place of std::stable_sort and 0009 std::inplace_merge respectively for optimization. Timsort performs much better 0010 than sorting algorithms from the standard library when the range is close to 0011 sorted or contains "runs" of consecutive ordered elements. Timmerge vastly 0012 outperforms merging algorithms from the standard library when the two sorted 0013 subranges are sparsely overlapping. 0014 0015 https://en.wikipedia.org/wiki/Timsort and 0016 https://svn.python.org/projects/python/trunk/Objects/listsort.txt describe the 0017 Timsort algorithm in detail. Merging sorted subranges efficiently is a major 0018 part of the Timsort algorithm. This subalgorithm is (not commonly) called 0019 Timmerge and is naturally described as part of Timsort at the links above.