projects / sbcl.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 94cb041) | patch
A more efficient algorithm for remove-duplicates on lists when there
authorPaul F. Dietz <pfdietz@users.sourceforge.net>
Tue, 26 Jul 2005 12:51:01 +0000 (12:51 +0000)
committerPaul F. Dietz <pfdietz@users.sourceforge.net>
Tue, 26 Jul 2005 12:51:01 +0000 (12:51 +0000)
commitef3fa440db906a78b377d694313b2ef9aedda33a
treecdd168f5ce9a43b9b5d5ca4bc8e2a3b943bb03fbtree | snapshot
parent94cb041d72bab63d161a5f88fe88da6ff612e451commit | diff
A more efficient algorithm for remove-duplicates on lists when there
is no :key or :test-not argument and :test is one of the standardly
acceptable arguments for make-hash-table.  The previous algorithm
ran in O(n^2) time; this algorithm runs in O(n) time, n the length
of the list.
BUGS diff | blob | history
NEWS diff | blob | history
src/code/seq.lisp diff | blob | history
version.lisp-expr diff | blob | history
Mirror of Steel Bank Common Lisp SBCL's official repository