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
This also makes constraint propagation in sparse universes a bit less sucky.