5253545556575859606162
td.seek(term); if (td.next()) { result = new OpenBitSet(reader.maxDoc()); result.fastSet(td.doc()); while (td.next()) { result.fastSet(td.doc()); } } } finally { td.close(); }
6768697071727374757677
} int docFreq = reader.docFreq(primeDocTerm); int doc; int count = 0; while ((doc = termDocsEnum.nextDoc()) != DocIdSetIterator.NO_MORE_DOCS) { bs.fastSet(doc); count++; } if (count == docFreq) { primeDocMap.put(key, bs); } else {
698699700701702703704705706707708
*/ 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); } /**
614615616617618619620621622623624
sfc.indexed = ftype == null ? sfc.name : ftype.toInternal(sfc.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
518519520521522523524525526527528
@Override public OpenBitSet getBits() { int maxDoc = size() > 0 ? docs[size()-1] : 0; OpenBitSet bs = new OpenBitSet(maxDoc+1); for (int doc : docs) { bs.fastSet(doc); } return bs; }
436437438439440441442443444445446
do { Term term = termEnum.term(); if (term==null || term.field() != field) break; termDocs.seek (termEnum); while (termDocs.next()) { res.fastSet(termDocs.doc()); } } while (termEnum.next()); } finally { termDocs.close(); termEnum.close();
127128129130131132133134135136137
if(!loader.add(docid, valId)) logOverflow(fieldName); else weightLoader.add(docid, weight); if (docid < minID) minID = docid; bitset.fastSet(docid); while(tdoc.next()) { df++; docid = tdoc.doc();
136137138139140141142143144145146
docid = tdoc.doc(); if(!loader.add(docid, valId)) logOverflow(fieldName); else weightLoader.add(docid, weight); bitset.fastSet(docid); } if (docid > maxID) maxID = docid; } pre = val; }
2021222324252627282930
public OpenBitSet bitSet(FacetDataCache dataCache) { int[] index = facetValueConverter.convert(dataCache, vals); OpenBitSet bitset = new OpenBitSet(dataCache.valArray.size()); for (int i : index) { bitset.fastSet(i); } if (takeCompliment) { // flip the bits for (int i=0; i < index.length; ++i){
122123124125126127128129130131132
{ df++; int docid = tdoc.doc(); if(!loader.add(docid, valId)) logOverflow(fieldName); minID = docid; bitset.fastSet(docid); while(tdoc.next()) { df++; docid = tdoc.doc();