Package org.apache.lucene.util

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

149
150
151
152
153
154
155
156
157
158
159
      while (doc >= 0 && !_nestedArray.contains(doc, 0, true)) {
        --doc;
      }
      this.maxIDs[0] = doc;
    }
    this.freqs[0] = maxdoc - (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
245
246
247
248
249
250
251
252
253
254
255
      while (doc >= 0 && !_nestedArray.contains(doc, 0, true)) {
        --doc;
      }
      this.maxIDs[0] = doc;
    }
    this.freqs[0] = maxdoc - (int) bitset.cardinality();
  }

  protected void logOverflow(String fieldName) {
    if (!_overflow) {
      logger
View Full Code Here
158
159
160
161
162
163
164
165
166
167
168
          visitedDocs.set(term.docs[i]);
        }
        sumDF += term.docs.length;
        sumTotalTermCount += term.write(termsConsumer);
      }
      termsConsumer.finish(omitTF ? -1 : sumTotalTermCount, sumDF, (int) visitedDocs.cardinality());
    }
  }

  class PositionData {
    int pos;
View Full Code Here
50
51
52
53
54
55
56
57
58
59
60
    IndexReader reader = IndexReader.open(rd);
   
    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
54
55
56
57
58
59
60
61
62
63
64
    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());
   
    tf.addTerm(new Term(fieldName,"10"));
    bits = (OpenBitSet)tf.getDocIdSet(reader);
    assertEquals("Must match 2", 2, bits.cardinality());
   
View Full Code Here
58
59
60
61
62
63
64
65
66
67
68
    bits = (OpenBitSet)tf.getDocIdSet(reader);
    assertEquals("Must match 1", 1, bits.cardinality());
   
    tf.addTerm(new Term(fieldName,"10"));
    bits = (OpenBitSet)tf.getDocIdSet(reader);
    assertEquals("Must match 2", 2, bits.cardinality());
   
    tf.addTerm(new Term(fieldName,"00"));
    bits = (OpenBitSet)tf.getDocIdSet(reader);
    assertEquals("Must match 2", 2, bits.cardinality());
       
View Full Code Here
62
63
64
65
66
67
68
69
70
    bits = (OpenBitSet)tf.getDocIdSet(reader);
    assertEquals("Must match 2", 2, bits.cardinality());
   
    tf.addTerm(new Term(fieldName,"00"));
    bits = (OpenBitSet)tf.getDocIdSet(reader);
    assertEquals("Must match 2", 2, bits.cardinality());
       
  }
}
View Full Code Here
198
199
200
201
202
203
204
205
206
207
208
      }

      // AND the term's bitset with cluster doc bitset to get the term's in-cluster frequency.
      // This modifies the termBitset, but that's fine as we are not using it anywhere else.
      termBitset.and(clusterDocBitset);
      int inclusterDF = (int) termBitset.cardinality();

      TermEntry entry = new TermEntry(term.text(), count++, inclusterDF);
      termEntryMap.put(entry.getTerm(), entry);
    } while (te.next());
    te.close();
View Full Code Here
249
250
251
252
253
254
255
256
257
258
259
      }
      if (idSet.contains(id)) {
        bitset.set(i);
      }
    }
    log.info("Created bitset for in-cluster documents : {}", bitset.cardinality());
    return bitset;
  }

  private static double scoreDocumentFrequencies(int inDF, int outDF, int clusterSize, int corpusSize) {
    int k12 = clusterSize - inDF;
View Full Code Here
73
74
75
76
77
78
79
80
81
82
      }
    }
   
    long end = System.currentTimeMillis();
    if(log.isLoggable(Level.FINE)) {
      log.fine("BoundaryBox Time Taken: "+ (end - start) + " found: "+bits.cardinality()+" candidates");
    }
    return bits;
  }
}
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.