Improve /= on large numbers of arguments
Bug #1745196 reported by
Paul F. Dietz
This bug affects 1 person
Affects | Status | Importance | Assigned to | Milestone | |
---|---|---|---|---|---|
SBCL |
Won't Fix
|
Undecided
|
Unassigned |
Bug Description
The current algorithm for /= does O(N^2) comparisons on N arguments. For large N, it would be more efficient to use an EQUALP hash table (or a hash table specialized for numbers). The crossover is somewhere around N=60, by experiment using a standard EQUALP hash table created with :size N.
(Use of SXHASH and a Bloom filter might be even faster.)
description: | updated |
To post a comment you must log in.
Who calls /= with 60 arguments? That's even more than call-arguments- limit.