I am working with bit-vector sets, and they are quite fast for a number of operations, but one problem I am having is iterating in a set. I am using POSITION to find the next set bit, and it seems to be taking a great deal of time. I was wondering if anyone had suggestions as to speed up bit-vector search; even cmucl-specific solutions.
The bit-vectors are generally on the order of a thousand elements, and the bits should be found in sparsely-distributed clusters. -- ; Matthew Danish <[EMAIL PROTECTED]> ; OpenPGP public key: C24B6010 on keyring.debian.org ; Signed or encrypted mail welcome. ; "There is no dark side of the moon really; matter of fact, it's all dark."
