>>>>> "Matthew" == Matthew Danish <[EMAIL PROTECTED]> writes:
Matthew> I am working with bit-vector sets, and they are quite fast for a number
Matthew> of operations, but one problem I am having is iterating in a set. I am
Matthew> using POSITION to find the next set bit, and it seems to be taking a
Matthew> great deal of time. I was wondering if anyone had suggestions as to
Matthew> speed up bit-vector search; even cmucl-specific solutions.
There is kernel::%raw-bits that lets you access the elements of a vector
as words. But you'd have to know the layout of the array, because
offset 0 would be the header word, etc.
A deftransform for position might be possible too, so you can do the
search by words until you find a non-zero word (or non-all-ones
word). I might try this....
Ray
