@Override public int cardinality() { return (int) bitSet.cardinality(); }
public int size() { if (size!=-1) return size; return size=(int)bits.cardinality(); }
@Override public int size() { return (int) bitSet.cardinality(); }
/** Returns true if there are no set bits */ public boolean isEmpty() { return cardinality()==0; }
/** Returns true if there are no set bits */ public boolean isEmpty() { return cardinality()==0; }
@Override public int numDocs() { return super.numDocs() - (int)getDeletedDocuments().cardinality(); }
@Override public int numDocs() { return super.numDocs() - (int)getDeletedDocuments().cardinality(); }
@Override public String toString() { StringBuilder buff = new StringBuilder(); buff.append("IdentifierSet: cardinality: "); buff.append(bitSet.cardinality()); buff.append(" "); I_IterateIds idIterator = iterator(); int count = 0; int cardinality = (int) bitSet.cardinality(); try { buff.append("["); while ((count < toStringMax) && idIterator.next()) { try { buff.append(Terms.get().getComponent(idIterator.nid()).toString()); } catch (TerminologyException e) { buff.append(e.toString()); } count++; if ((count == 10) && (count < cardinality)) { buff.append(", ..."); } else if (count < cardinality) { buff.append(", "); } } buff.append("]"); } catch (IOException e) { e.printStackTrace(); } return buff.toString(); }
private static OpenBitSet getClusterDocBitset(IndexReader reader, Collection<String> idSet, String idField) throws IOException { int numDocs = reader.numDocs(); OpenBitSet bitset = new OpenBitSet(numDocs); FieldSelector idFieldSelector = new SetBasedFieldSelector(Collections.singleton(idField), Collections.<String>emptySet()); for (int i = 0; i < numDocs; i++) { String id; // Use Lucene's internal ID if idField is not specified. Else, get it from the document. if (idField == null) { id = Integer.toString(i); } else { id = reader.document(i, idFieldSelector).get(idField); } if (idSet.contains(id)) { bitset.set(i); } } log.info("Created bitset for in-cluster documents : {}", bitset.cardinality()); return bitset; }
@Override public int numDocs() { if (this.bits instanceof FixedBitSet) { return ((FixedBitSet) this.bits).cardinality(); } else if (this.bits instanceof OpenBitSet) { return (int) ((OpenBitSet) this.bits).cardinality(); } else { int count = 0; for (int i = 0; i < this.bits.length(); i++) { if (this.bits.get(i)) { count++; } } return count; } }
private void calculateScores() throws IOException { // initialize buffers OpenBitSet docPointers = new OpenBitSet(reader.maxDoc()); TermPositions tp = null; List<Term> uniqueTerms = new LinkedList<Term>(new LinkedHashSet<Term>(terms)); uniqueTermSize = uniqueTerms.size(); roughThresholdFreq = (int) (uniqueTermSize * (threshold*0.01f)); for (Iterator<Term> iter = uniqueTerms.iterator(); iter.hasNext();) { try { tp = reader.termPositions(iter.next()); while (tp.next()) { int f = scoredDocs.adjustOrPutValue(tp.doc(), 1, 1); if (f > roughThresholdFreq) { docPointers.fastSet(tp.doc()); } } } finally { if (tp != null) { tp.close(); } } } if (docPointers.cardinality() > 0) { docPointerIterator = (OpenBitSetIterator) docPointers.iterator(); } }
private void calculateScores() throws IOException { // initialize buffers OpenBitSet docPointers = new OpenBitSet(reader.maxDoc()); TermPositions tp = null; List<Term> uniqueTerms = new LinkedList<Term>(new LinkedHashSet<Term>(terms)); uniqueTermSize = uniqueTerms.size(); this.roughThresholdFreq = (int) (uniqueTermSize * ROUGH_CUTOFF); for (Iterator<Term> iter = uniqueTerms.iterator(); iter.hasNext();) { try { tp = reader.termPositions(iter.next()); while (tp.next()) { int f = scoredDocs.adjustOrPutValue(tp.doc(), 1, 1); if (f > roughThresholdFreq) { docPointers.fastSet(tp.doc()); } } } finally { if (tp != null) { tp.close(); } } } if (docPointers.cardinality() > 0) { docPointerIterator = (OpenBitSetIterator) docPointers.iterator(); } }
final FacetDataCache<?> dataCache = facetDataCacheBuilder.build(reader); final OpenBitSet openBitSet = getBitSet(dataCache); long count = openBitSet.cardinality(); if (count == 0) { return EmptyDocIdSet.getInstance();
int inclusterDF = (int) termBitset.cardinality();
documentList.add(solrDocument); documentList.setNumFound(bitSet.cardinality()); NamedList collapsedGroupResult = getCollapseGroupResult(id, result); collapsedGroupResult.add("collapsedDocs", documentList);
if (matchingDocs.cardinality() == 0) { return; counter.count = (int) matchingDocs.cardinality(); } else { TermEnum termEnum = indexReader.terms(new Term(rangeFields.internalFacetName,
long count = bitset.cardinality();
this.freqs[0] = maxdoc - (int) bitset.cardinality();
this.freqs[0] = maxdoc - (int) bitset.cardinality();
this.freqs[0] = maxdoc - (int) bitset.cardinality();