| commit | 8bb34dad31b73a7bd4ca17b1630f4f5bdc94f347 | |
| author | Nikodemus Siivola <nikodemus@random-state.net> | |
| Mon, 27 Aug 2007 14:44:21 +0000 (27 14:44 +0000) | ||
| committer | Nikodemus Siivola <nikodemus@random-state.net> | |
| Mon, 27 Aug 2007 14:44:21 +0000 (27 14:44 +0000) | ||
| tree | 0fafb21598342dd1b15e520770767e6ee56ee8fe | treesnapshot (tar.gz zip) |
| parent | 8396eebfbac967b5710b55d0a6b842962ed34228 | commitdiff |
1.0.9.1: faster MAKE-MEMBER-TYPE, UNION, and NUNION
* MAKE-MEMBER-TYPE was doing several SUBSETP calls,
instead just walk once over the list of members.
* UNION and NUNION were using an O(N^2) implementation
for all input sizes. Use a hashtable (giving O(N))
for large inputs when :TEST is something we can
use with a hash-table.
Thanks to Damien Diederen for catching a typo in the new UNION /
NUNION code.
* MAKE-MEMBER-TYPE was doing several SUBSETP calls,
instead just walk once over the list of members.
* UNION and NUNION were using an O(N^2) implementation
for all input sizes. Use a hashtable (giving O(N))
for large inputs when :TEST is something we can
use with a hash-table.
Thanks to Damien Diederen for catching a typo in the new UNION /
NUNION code.
| NEWS | diffblobblamehistory | |
| src/code/early-type.lisp | diffblobblamehistory | |
| src/code/list.lisp | diffblobblamehistory | |
| version.lisp-expr | diffblobblamehistory |