Package org.apache.lucene.util

Examples of org.apache.lucene.util.OpenBitSet.cardinality()

118
119
120
121
122
123
124
125
126
127
128
          }
        } while (termEnum.next());
        termEnum.close();
        termEnum = null;
       
        if (docsWithFieldBitSet.cardinality() > 0) {
          this.fieldAccumulator.add(fieldName,docsWithFieldBitSet.cardinality());
        }
      }
     
      // sort
View Full Code Here
119
120
121
122
123
124
125
126
127
128
129
        } while (termEnum.next());
        termEnum.close();
        termEnum = null;
       
        if (docsWithFieldBitSet.cardinality() > 0) {
          this.fieldAccumulator.add(fieldName,docsWithFieldBitSet.cardinality());
        }
      }
     
      // sort
      if (this.getSortByFrequency()) {
View Full Code Here
151
152
153
154
155
156
157
158
159
160
161
        termEnum = null;
      
      }
     
      // sort
      this.numberOfDocsWithTerm = docsWithTermBitSet.cardinality();
      if (Val.chkStr(request.getSortBy()).equalsIgnoreCase("name")) {
        this.fieldAccumulator.sortByName();
      } else {
        this.fieldAccumulator.sortByFrequency();
      }
View Full Code Here
96
97
98
99
100
101
102
103
104
105
106
      for (int i = 0; i < size; ++i) {
        bitset.fastFlip(i);
      }
    }

    long count = bitset.cardinality();

    if (count == 0) {
      final DocIdSet empty = EmptyDocIdSet.getInstance();
      return new RandomAccessDocIdSet() {
        @Override
View Full Code Here
154
155
156
157
158
159
160
161
162
163
164
      }
      if (doc > 0) {
        this.maxIDs[0] = doc;
      }
    }
    this.freqs[0] = maxdoc + 1 - (int) bitset.cardinality();
  }

  /**
   * loads multi-value facet data. This method uses the count payload to allocate storage before loading data.
   * @param fieldName
View Full Code Here
253
254
255
256
257
258
259
260
261
262
263
      }
      if (doc > 0) {
        this.maxIDs[0] = doc;
      }
    }
    this.freqs[0] = maxdoc + 1 - (int) bitset.cardinality();
  }

  protected void logOverflow(String fieldName) {
    if (!_overflow) {
      logger
View Full Code Here
161
162
163
164
165
166
167
168
      }
      if (doc > 0) {
        this.maxIDs[0] = doc;
      }
    }
    this.freqs[0] = maxdoc + 1 - (int) bitset.cardinality();
  }
}
View Full Code Here
36
37
38
39
40
41
42
43
44
45
46
  @Override
  public RandomAccessDocIdSet getRandomAccessDocIdSet(final BoboSegmentReader reader)
      throws IOException {
    final FacetDataCache<?> dataCache = facetDataCacheBuilder.build(reader);
    final OpenBitSet openBitSet = getBitSet(dataCache);
    long count = openBitSet.cardinality();
    if (count == 0) {
      return EmptyDocIdSet.getInstance();
    } else {
      final boolean multi = dataCache instanceof MultiValueFacetDataCache;
      final MultiValueFacetDataCache<?> multiCache = multi ? (MultiValueFacetDataCache<?>) dataCache
View Full Code Here
141
142
143
144
145
146
147
148
149
150
151
          public void setScorer(org.apache.lucene.search.Scorer scorer)
              throws IOException {
            // Do Nothing
          }
        });
        assertEquals(1, bitset.cardinality());
        final Highlighter highlighter = new Highlighter(
            new SimpleHTMLFormatter(), new SimpleHTMLEncoder(),
            new QueryScorer(phraseQuery));
        for (int position = bitset.nextSetBit(0); position >= 0; position = bitset
            .nextSetBit(position + 1)) {
View Full Code Here
61
62
63
64
65
66
67
68
69
70
71
    w.close();
   
    TermsFilter tf=new TermsFilter();
    tf.addTerm(new Term(fieldName,"19"));
    OpenBitSet bits = (OpenBitSet)tf.getDocIdSet(reader);
    assertEquals("Must match nothing", 0, bits.cardinality());

    tf.addTerm(new Term(fieldName,"20"));
    bits = (OpenBitSet)tf.getDocIdSet(reader);
    assertEquals("Must match 1", 1, bits.cardinality());
   
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.