- ;; over the whole vector. Under some measurements in 2008, it
- ;; turned out that constraint sets elements were normally clumped
- ;; together: for compiling SBCL, the average difference between
- ;; the maximum and minimum constraint-number was 90 (with the
- ;; average constraint set having around 25 elements). So using
- ;; the minimum and maximum constraint-number for iteration bounds
- ;; makes iteration over a subrange of the bit-vector comparable to
- ;; iteration across the hash storage. Note that the CONSET-MIN is
- ;; NIL when the set is known to be empty. CONSET-MAX is a normal
- ;; end bounding index.
+ ;; over the whole vector. Tracking extrema helps a bit. Note
+ ;; that the CONSET-MIN is NIL when the set is known to be empty.
+ ;; CONSET-MAX is a normal end bounding index.