From: Kostka B. <ko...@to...> - 2012-12-12 14:27:26
|
BitSet::nexSetBit is implemented very inefficient way for sparse bit sets. It searches for next bit set by per-bit iteration and bit shifting See OPTIMIZED_BITSET branch for better solution. It is approximately 8 times faster. It could be still improved (probably 4 times faster) by using uint32_t instead of current uint8_8 array, but it needs deeper changes. Borek |