Package org.apache.lucene.util

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

562
563
564
565
566
567
568
569
570
571
572
          sumTotalTermFreq += totalTermFreq;
          totalTermFreq = 0;
          termCount++;
        }
      }
      docCount = (int) visitedDocs.cardinality();
      fst = b.finish();
      /*
      PrintStream ps = new PrintStream("out.dot");
      fst.toDot(ps);
      ps.close();
View Full Code Here
67
68
69
70
71
72
73
74
75
76
77
    IndexReader reader = IndexReader.open(rd, true);
   
    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
71
72
73
74
75
76
77
78
79
80
81
    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
75
76
77
78
79
80
81
82
83
84
85
    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
79
80
81
82
83
84
85
86
87
    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
142
143
144
145
146
147
148
149
150
151
152
          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
157
158
159
160
161
162
163
164
165
166
167
    checkEqual(a_or, b1.union(b2));
    checkEqual(a_andn, b1.andNot(b2));

    assertEquals(a_and.cardinality(), b1.intersectionSize(b2));
    assertEquals(a_or.cardinality(), b1.unionSize(b2));
    assertEquals(a_andn.cardinality(), b1.andNotSize(b2));
  }


  public void doMany(int maxSz, int iter) {
    for (int i=0; i<iter; i++) {
View Full Code Here
102
103
104
105
106
107
108
109
110
111
112
        HashDocSet hds1=hds;
        generate(randSize ? rand.nextInt(bitSetSize) : bitSetSize, numBitsSet);

        OpenBitSet res = ((OpenBitSet)bs1.clone());
        res.and(bs);
        int icount = (int)res.cardinality();

        test(bds1.intersection(bds).size() == icount);
        test(bds1.intersectionSize(bds) == icount);
        if (bds1.intersection(hds).size() != icount) {
          DocSet ds = bds1.intersection(hds);
View Full Code Here
158
159
160
161
162
163
164
165
166
167
168
    checkEqual(a_or, b1.union(b2));
    checkEqual(a_andn, b1.andNot(b2));

    assertEquals(a_and.cardinality(), b1.intersectionSize(b2));
    assertEquals(a_or.cardinality(), b1.unionSize(b2));
    assertEquals(a_andn.cardinality(), b1.andNotSize(b2));
  }


  public void doMany(int maxSz, int iter) {
    for (int i=0; i<iter; i++) {
View Full Code Here
116
117
118
119
120
121
122
123
124
125
126
    indexWarmup.warmFile(indexReader, filePartsToWarm, "test", blockSize, 1024 * 1024);
    long t3 = System.nanoTime();

    for (Entry<String, OpenBitSet> e : filePartsToWarm.entrySet()) {
      OpenBitSet bitSet = e.getValue();
      System.out.println(bitSet.length() + " " + bitSet.cardinality());
    }

    System.out.println((t2 - t1) / 1000000.0 + " " + (t3 - t2) / 1000000.0);
    System.out.println(totalLookups + " " + sampleReads + " " + SlowAccessDirectory._reads.get());
  }
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.