Package org.apache.lucene.util

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

67
68
69
70
71
72
73
74
75
76
77
          NumericUtils.doubleToPrefixCoded(boxId)));
     
      // iterate through all documents
      // which have this boxId
      while (termDocs.next()) {
        bits.fastSet(termDocs.doc());
      }
    }
   
    long end = System.currentTimeMillis();
    if(log.isLoggable(Level.FINE)) {
View Full Code Here
95
96
97
98
99
100
101
102
103
104
105
      }
    }
    final OpenBitSet result = new OpenBitSet( maxDocNumber );
    // end iterator initialize
    if (votes==iteratorSize) {
      result.fastSet( targetPosition );
      targetPosition++;
    }
    i = 0;
    votes = 0; //could be smarter but would make the code even more complex for a minor optimization out of cycle.
    // enter main loop:
View Full Code Here
108
109
110
111
112
113
114
115
116
117
118
      final int position = iterator.advance( targetPosition );
      if ( position==DocIdSetIterator.NO_MORE_DOCS )
        return result; //exit condition
      if ( position == targetPosition ) {
        if ( ++votes == iteratorSize ) {
          result.fastSet( position );
          votes = 0;
          targetPosition++;
        }
      }
      else {
View Full Code Here
64
65
66
67
68
69
70
71
72
73
74
    for ( int i = 0; i < quadTreeCellsIds.size(); i++ ) {
      Term quadTreeCellTerm = new Term( fieldName, quadTreeCellsIds.get( i ) );
      TermDocs quadTreeCellsDocs = reader.termDocs( quadTreeCellTerm );
      if ( quadTreeCellsDocs != null ) {
        while ( quadTreeCellsDocs.next() ) {
          matchedDocumentsIds.fastSet( quadTreeCellsDocs.doc() );
          found = true;
        }
      }
    }
View Full Code Here
95
96
97
98
99
100
101
102
103
104
105
      }
    }
    final OpenBitSet result = new OpenBitSet( maxDocNumber );
    // end iterator initialize
    if (votes==iteratorSize) {
      result.fastSet( targetPosition );
      targetPosition++;
    }
    i=0;
    votes=0; //could be smarted but would make the code even more complex for a minor optimization out of cycle.
    // enter main loop:
View Full Code Here
109
110
111
112
113
114
115
116
117
118
119
      if ( ! validPosition )
        return result; //exit condition
      final int position = iterator.doc();
      if ( position == targetPosition ) {
        if ( ++votes == iteratorSize ) {
          result.fastSet( position );
          votes = 0;
          targetPosition++;
        }
      }
      else {
View Full Code Here
109
110
111
112
113
114
115
116
117
118
119
      if ( position == DocIdSetIterator.NO_MORE_DOCS ) {
        return result;
      } //exit condition
      if ( position == targetPosition ) {
        if ( ++votes == numberOfIterators ) {
          result.fastSet( position );
          votes = 0;
          targetPosition++;
        }
      }
      else {
View Full Code Here
114
115
116
117
118
119
120
121
122
123
124
      if ( position == DocIdSetIterator.NO_MORE_DOCS ) {
        return result;
      } //exit condition
      if ( position == targetPosition ) {
        if ( ++votes == numberOfIterators ) {
          result.fastSet( position );
          votes = 0;
          targetPosition++;
        }
      }
      else {
View Full Code Here
169
170
171
172
173
174
175
176
177
178
179
            long count = 0;
            while (termDocs.next()) {
              int docId = termDocs.doc();             
              boolean bSet = isUnfiltered || documentFilterBitSet.fastGet(docId);
              if (bSet) {
                docsWithFieldBitSet.fastSet(docId);
                count++;
              }
            }
            if ((!checkMaxFreq || (count <= this.maxFrequency)) &&
                (!checkMinFreq || (count >= this.minFrequency))) {
View Full Code Here
115
116
117
118
119
120
121
122
123
124
125
        do {
          Term term = termEnum.term();
          if ((term != null) && term.field().equals(field)) {
            termDocs.seek(term);
            while (termDocs.next()) {
              bitSet.fastSet(termDocs.doc());
            }
          }
        } while (termEnum.next());
               
        bitSet.flip(0,nBits);
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.