projects / sbcl.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 9ec385d) | patch
More efficient (stable) sort of lists
authorPaul Khuong <pvk@pvk.ca>
Mon, 13 Aug 2012 06:40:54 +0000 (02:40 -0400)
committerPaul Khuong <pvk@pvk.ca>
Mon, 13 Aug 2012 06:46:00 +0000 (02:46 -0400)
commit088583ae2b22d8d861fbc354568bd24edc0333cb
tree943af995ee1a3f790d996fb2757fc2aa6f5d5cfbtree | snapshot
parent9ec385d7e964b5d07f2e075db4c9faa07161aca2commit | diff
More efficient (stable) sort of lists

 * (Reverse-) Sorted runs are mostly processed in linear time;

 * Calls to the :key function are cached;

 * Base cases now include specialised sorts for lists of
   length 3 and shorter.

 * Minimal test case for stable sorting.
NEWS diff | blob | history
src/code/sort.lisp diff | blob | history
tests/seq.pure.lisp diff | blob | history
Mirror of Steel Bank Common Lisp SBCL's official repository