Package org.apache.lucene.util

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

65
66
67
68
69
70
71
72
73
74
75
    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
69
70
71
72
73
74
75
76
77
78
79
    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
73
74
75
76
77
78
79
80
81
82
83
    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());
   
    reader.close();
    rd.close();
  }
}
View Full Code Here
134
135
136
137
138
139
140
141
142
143
144
      }
    }
    // collisions resolved, now re-queue
    // empty (partially) the queue until seeing all pps advanced for resolving collisions
    int n = 0;
    while (bits.cardinality() > 0) {
      PhrasePositions pp2 = pq.pop();
      rptStack[n++] = pp2;
      if (pp2.rptGroup >= 0 && bits.get(pp2.rptInd)) {
        bits.clear(pp2.rptInd);
      }
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.