projects / sbcl.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: d720bc3) | patch
Improved merge-sort implementation for lists
authorPaul Khuong <pvk@pvk.ca>
Sun, 17 Jun 2012 08:53:47 +0000 (10:53 +0200)
committerPaul Khuong <pvk@pvk.ca>
Sun, 17 Jun 2012 08:53:47 +0000 (10:53 +0200)
commit41c307979e17a33e8700c1ca92ed8b3400a301b3
tree6f6624268e49ac5b131e004fcc7eef52999c7b0ftree | snapshot
parentd720bc359f03734ccb9baf66cb45dc01d623f369commit | diff
Improved merge-sort implementation for lists

 The new implementation is simpler and more efficient than the previous
 bottom-up sort.  It only differs from the original patch aesthetically.

 STABLE-SORT-LIST is also now MAYBE-INLINE, to enable selective inlining.

 Thanks to Takeru Ohta for the code and for his patience.
NEWS diff | blob | history
src/code/sort.lisp diff | blob | history
tests/dynamic-extent.impure.lisp diff | blob | history
tests/seq.pure.lisp diff | blob | history
Mirror of Steel Bank Common Lisp SBCL's official repository