procyberian/emacs
2
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Further seq-uniq speed-ups for lists

Browse source 
* lisp/emacs-lisp/seq.el (seq-uniq): Speed up more for long lists
(bug#57079).
This commit is contained in:
Lars Ingebrigtsen 2022-08-12 15:15:11 +02:00
parent f947b20a19
commit c0d761bf7f
2 changed files with 21 additions and 6 deletions
Download patch file Download diff file Expand all files Collapse all files

20
lisp/emacs-lisp/seq.el
View file

@ -458,11 +458,21 @@ TESTFN is used to compare elements, or `equal' if TESTFN is nil."
(cl-defmethod seq-uniq ((sequence list) &optional testfn)
(let ((result nil))
(if (not testfn)
;; Fast path.
(while sequence
(unless (member (car sequence) result)
(push (car sequence) result))
(pop sequence))
;; Fast path. If the list is long, use a hash table to speed
;; things up even more.
(let ((l (length sequence)))
(if (> l 100)
(let ((hash (make-hash-table :test #'equal :size l)))
(while sequence
(unless (gethash (car sequence) hash)
(setf (gethash (car sequence) hash) t)
(push (car sequence) result))
(setq sequence (cdr sequence))))
;; Short list.
(while sequence
(unless (member (car sequence) result)
(push (car sequence) result))
(pop sequence))))
;; Slower path.
(while sequence
(unless (seq-find (lambda (elem)