530531532533534535536537538539540
sfc.name = name; sfc.termNum = termNum++; counts.put(name, sfc); } sfc.count += count; terms.fastSet(sfc.termNum); last = count; } } // the largest possible missing term is 0 if we received less
655656657658659660661662663664665
*/ public DocSet convertFilter(Filter lfilter) throws IOException { BitSet bs = lfilter.bits(this.reader); OpenBitSet obs = new OpenBitSet(bs.size()); for(int i=bs.nextSetBit(0); i>=0; i=bs.nextSetBit(i+1)) { obs.fastSet(i); } return new BitDocSet(obs); } /**
596597598599600601602603604605606
3334353637383940414243
public OpenBitSet getRandomSet(int sz, int bitsToSet) { OpenBitSet bs = new OpenBitSet(sz); if (sz==0) return bs; for (int i=0; i<bitsToSet; i++) { bs.fastSet(rand.nextInt(sz)); } return bs; } public DocSet getHashDocSet(OpenBitSet bs) {
642643644645646647648649650651652
3536373839404142434445