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

Class org.apache.lucene.search.DocIdSetIterator

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

org.apache.lucene.search.DocIdSetIterator.advance()
Advances to the first beyond the current whose document number is greater than or equal to target. Returns the current document number or {@link #NO_MORE_DOCS} if there are no more docs in the set.
Behaves as if written:
```
 int advance(int target) { int doc; while ((doc = nextDoc()) < target) { } return doc; } 
```
Some implementations are considerably more efficient than that.
NOTE: certain implementations may return a different value (each time) if called several times in a row with the same target.
NOTE: this method may be called with {@value #NO_MORE_DOCS} forefficiency by some Scorers. If your implementation cannot efficiently determine that it should exhaust, it is recommended that you check for that value in each call to this method.
NOTE: after the iterator has exhausted you should not call this method, as it may result in unpredicted behavior.
@since 2.9

    // enter main loop:
    while ( true ) {
      final DocIdSetIterator iterator = iterators[i];
      int position = targetPosition;
      if ( !iteratorAlreadyOnTargetPosition( targetPosition, iterator ) ) {
        position = iterator.advance( targetPosition );
      }
      if ( position == DocIdSetIterator.NO_MORE_DOCS ) {
        return result;
      } //exit condition
      if ( position == targetPosition ) {

View Full Code Here

    // enter main loop:
    while ( true ) {
      final DocIdSetIterator iterator = iterators[i];
      int position = targetPosition;
      if ( !iteratorAlreadyOnTargetPosition( targetPosition, iterator ) ) {
        position = iterator.advance( targetPosition );
      }
      if ( position == DocIdSetIterator.NO_MORE_DOCS ) {
        return result;
      } //exit condition
      if ( position == targetPosition ) {

View Full Code Here

  public final boolean find(int val) throws IOException {


    DocIdSetIterator finder = new AndDocIdSetIterator();


    try {
      int docid = finder.advance(val);
      if (docid != DocIdSetIterator.NO_MORE_DOCS && docid == val) return true;
      else return false;
    } catch (IOException e) {
      return false;
    }

View Full Code Here

      int skip = 0;
      int i = 1;
      while (i < size) {
        if (i != skip) {
          dcit = iterators[i];
          int docid = dcit.advance(target);


          if (docid > target) {
            target = docid;
            if (i != 0) {
              skip = i;

View Full Code Here

      if (lastReturn == DocIdSetIterator.NO_MORE_DOCS) {
        return DocIdSetIterator.NO_MORE_DOCS;
      }


      DocIdSetIterator dcit = iterators[0];
      target = dcit.advance(target);
      int size = iterators.length;
      int skip = 0;
      int i = 1;
      while (i < size) {
        if (i != skip) {

View Full Code Here

      int skip = 0;
      int i = 1;
      while (i < size) {
        if (i != skip) {
          dcit = iterators[i];
          int docid = dcit.advance(target);
          if (docid > target) {
            target = docid;
            if (i != 0) {
              skip = i;
              i = 0;

View Full Code Here


    Item top = _heap[0];
    while (true) {
      DocIdSetIterator topIter = top.iter;
      int docid;
      if ((docid = topIter.advance(target)) != DocIdSetIterator.NO_MORE_DOCS) {
        top.doc = docid;
        heapAdjust();
      } else {
        heapRemoveRoot();
        if (_size == 0) return (_curDoc = DocIdSetIterator.NO_MORE_DOCS);

View Full Code Here

                collector.collect(doc);


                target = filterDocIdIterator.nextDoc();
              } else {
                // skip to the next possible docid
                target = filterDocIdIterator.advance(validator._nextTarget);
              }
            } else // doc > target
            {
              if (doc == DocIdSetIterator.NO_MORE_DOCS) break;
              target = filterDocIdIterator.advance(doc);

View Full Code Here

                target = filterDocIdIterator.advance(validator._nextTarget);
              }
            } else // doc > target
            {
              if (doc == DocIdSetIterator.NO_MORE_DOCS) break;
              target = filterDocIdIterator.advance(doc);
            }
          }
        } else {
          // MapReduce wrapper is not null
          while (target < DocIdSetIterator.NO_MORE_DOCS) {

View Full Code Here

                collector.collect(doc);


                target = filterDocIdIterator.nextDoc();
              } else {
                // skip to the next possible docid
                target = filterDocIdIterator.advance(validator._nextTarget);
              }
            } else // doc > target
            {
              if (doc == DocIdSetIterator.NO_MORE_DOCS) break;
              target = filterDocIdIterator.advance(doc);

View Full Code Here

0 1 2 3 4 5 6 7

TOP

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.