Raymond Toy pushed to branch issue-240-set-diff-with-hash-table at cmucl / cmucl

Commits: 2e46d458 by Raymond Toy at 2023-06-24T08:35:33-07:00 Modify code so we only hash list2

Tests for when we hash list1 containing fixnums show that we're always much slower that not hashing. But when list1 consists of strings, we're always better hashing list1. So complicated.

So for now, just hash list2, like what clisp does.

- - - - -

1 changed file:

- src/code/list.lisp

Changes:

===================================== src/code/list.lisp ===================================== @@ -785,6 +785,7 @@ (l2 list2 (cdr l2))) ((cond ((endp l2) (return (values length list2))) + #+nil ((endp l1) (return (values length list1)))))) ;; If the list is too short, the hashtable makes things

View it on GitLab: https://gitlab.common-lisp.net/cmucl/cmucl/-/commit/2e46d4581f00c9d3a1df8b3f...