Package org.apache.lucene.search

Examples of org.apache.lucene.search.DocIdSetIterator.doc()

158
159
160
161
162
163
164
165
166
167
168
  private static int iterateOnResults(DocIdSet docIdBitSet) throws IOException {
    DocIdSetIterator iterator = docIdBitSet.iterator();
    int i = 0;
    while ( iterator.next() ) {
      i += iterator.doc();
    }
    return i;
  }

  private static final BitSet applyANDOnBitSets(final List<BitSet> filtersData) {
View Full Code Here
230
231
232
233
234
235
236
237
238
239
240
          return false;
        }
        else if ( nextA==false) {
          return true;
        }
        else if ( iterA.doc() != iterB.doc() ) {
          return false;
        }
      } while ( nextA && nextB );
    }
    catch (IOException ioe) {
View Full Code Here
41
42
43
44
45
46
47
48
49
50
51
      }
    }
    DocIdSetIterator m = vintList.iterator();
    for (int i = 0; i < ints.length; i++) {
      assertTrue("No end of Matcher at: " + i, m.next());
      assertEquals(ints[i], m.doc());
    }
    assertTrue("End of Matcher", (! m.next()));
  }

  void tstVIntList(
View Full Code Here
82
83
84
85
86
87
88
89
90
91
92
      final DocIdSetIterator iterator = iterators[i];
      if ( ! iterator.next() ) {
        //current iterator has no values, so skip all
        return EmptyDocIdBitSet.instance;
      }
      final int position = iterator.doc();
      if ( targetPosition==position ) {
        votes++; //stopped as same position of others
      }
      else {
        targetPosition = max( targetPosition, position );
View Full Code Here
106
107
108
109
110
111
112
113
114
115
116
    while ( true ) {
      final DocIdSetIterator iterator = iterators[i];
      final boolean validPosition = iterator.skipTo( targetPosition );
      if ( ! validPosition )
        return result; //exit condition
      final int position = iterator.doc();
      if ( position == targetPosition ) {
        if ( ++votes == iteratorSize ) {
          result.fastSet( position );
          votes = 0;
          targetPosition++;
View Full Code Here
59
60
61
62
63
64
65
66
67
68
69
      final DocIdSetIterator iterator = iterators[i];
      if ( ! iterator.next() ) {
        //current iterator has no values, so skip all
        return EmptyDocIdBitSet.instance;
      }
      final int position = iterator.doc();
      if ( targetPosition==position ) {
        votes++; //stopped as same position of others
      }
      else {
        targetPosition = max( targetPosition, position );
View Full Code Here
83
84
85
86
87
88
89
90
91
92
93
    while ( true ) {
      final DocIdSetIterator iterator = iterators[i];
      final boolean validPosition = iterator.skipTo( targetPosition );
      if ( ! validPosition )
        return result; //exit condition
      final int position = iterator.doc();
      if ( position == targetPosition ) {
        if ( ++votes == iteratorSize ) {
          result.fastSet( position );
          votes = 0;
          targetPosition++;
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.