SourceForge has been redesigned. Learn more.
Close

Commit [41cb42]  Maximize  Restore  History

faster FIND and POSITION on bit-vectors

Read data a word at a time for efficiency's sake.

Could do even better with VOPs, but this already wins hugely on sparse
vectors -- and works on all backends. (Tested on both little- and big-endian
hosts.)

This also makes constraint propagation in sparse universes a bit less sucky.

Nikodemus Siivola Nikodemus Siivola 2011-12-13

changed NEWS
changed package-data-list.lisp-expr
changed src/code/bit-bash.lisp
changed src/code/seq.lisp
changed src/compiler/seqtran.lisp
changed tests/seq.impure.lisp
NEWS Diff Switch to side-by-side view
Loading...
package-data-list.lisp-expr Diff Switch to side-by-side view
Loading...
src/code/bit-bash.lisp Diff Switch to side-by-side view
Loading...
src/code/seq.lisp Diff Switch to side-by-side view
Loading...
src/compiler/seqtran.lisp Diff Switch to side-by-side view
Loading...
tests/seq.impure.lisp Diff Switch to side-by-side view
Loading...