From: Itamar Syn-H. <it...@co...> - 2012-12-13 07:42:59
|
Feel free to merge it into master On Wed, Dec 12, 2012 at 4:27 PM, Kostka Bořivoj <ko...@to...> wrote: > 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 > > > ------------------------------------------------------------------------------ > LogMeIn Rescue: Anywhere, Anytime Remote support for IT. Free Trial > Remotely access PCs and mobile devices and provide instant support > Improve your efficiency, and focus on delivering more value-add services > Discover what IT Professionals Know. Rescue delivers > http://p.sf.net/sfu/logmein_12329d2d > _______________________________________________ > CLucene-developers mailing list > CLu...@li... > https://lists.sourceforge.net/lists/listinfo/clucene-developers > > |