Package org.apache.lucene.util

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

64
65
66
67
68
69
70
71
72
73
74
    for ( int i = 0; i < gridCellsIds.size(); i++ ) {
      Term gridCellTerm = new Term( fieldName, gridCellsIds.get( i ) );
      TermDocs gridCellsDocs = reader.termDocs( gridCellTerm );
      if ( gridCellsDocs != null ) {
        while ( gridCellsDocs.next() ) {
          matchedDocumentsIds.fastSet( gridCellsDocs.doc() );
          found = true;
        }
      }
    }
View Full Code Here
107
108
109
110
111
112
113
114
115
116
117
            } else {
              weightLoader.add(docID, weight);
            }

            if (docID < minID) minID = docID;
            bitset.fastSet(docID);
            while (docsEnum.nextDoc() != DocsEnum.NO_MORE_DOCS) {
              docID = docsEnum.docID();
              df++;
              if (!loader.add(docID, valId)) {
                logOverflow(fieldName);
View Full Code Here
116
117
118
119
120
121
122
123
124
125
126
              if (!loader.add(docID, valId)) {
                logOverflow(fieldName);
              } else {
                weightLoader.add(docID, weight);
              }
              bitset.fastSet(docID);
            }
            if (docID > maxID) maxID = docID;
          }
        }
        pre = val;
View Full Code Here
106
107
108
109
110
111
112
113
114
115
116
        int valId = (t - 1 < negativeValueCount) ? (negativeValueCount - t + 1) : t;
        while ((docID = docsEnum.nextDoc()) != DocsEnum.NO_MORE_DOCS) {
          df++;
          if (!loader.add(docID, valId)) logOverflow(fieldName);
          minID = docID;
          bitset.fastSet(docID);
          while (docsEnum.nextDoc() != DocsEnum.NO_MORE_DOCS) {
            docID = docsEnum.docID();
            df++;
            if (!loader.add(docID, valId)) logOverflow(fieldName);
            bitset.fastSet(docID);
View Full Code Here
111
112
113
114
115
116
117
118
119
120
121
          bitset.fastSet(docID);
          while (docsEnum.nextDoc() != DocsEnum.NO_MORE_DOCS) {
            docID = docsEnum.docID();
            df++;
            if (!loader.add(docID, valId)) logOverflow(fieldName);
            bitset.fastSet(docID);
          }
          maxID = docID;
        }
        freqList.add(df);
        minIDList.add(minID);
View Full Code Here
209
210
211
212
213
214
215
216
217
218
219
        int docID = -1;
        while ((docID = docsEnum.nextDoc()) != DocsEnum.NO_MORE_DOCS) {
          df++;
          if (!_nestedArray.addData(docID, t)) logOverflow(fieldName);
          minID = docID;
          bitset.fastSet(docID);
          int valId = (t - 1 < negativeValueCount) ? (negativeValueCount - t + 1) : t;
          while (docsEnum.nextDoc() != DocsEnum.NO_MORE_DOCS) {
            docID = docsEnum.docID();
            df++;
            if (!_nestedArray.addData(docID, valId)) logOverflow(fieldName);
View Full Code Here
215
216
217
218
219
220
221
222
223
224
225
          int valId = (t - 1 < negativeValueCount) ? (negativeValueCount - t + 1) : t;
          while (docsEnum.nextDoc() != DocsEnum.NO_MORE_DOCS) {
            docID = docsEnum.docID();
            df++;
            if (!_nestedArray.addData(docID, valId)) logOverflow(fieldName);
            bitset.fastSet(docID);
          }
          maxID = docID;
        }
        freqList.add(df);
        minIDList.add(minID);
View Full Code Here
73
74
75
76
77
78
79
80
81
82
83
      }
    }
    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
87
88
89
90
91
92
93
94
95
96
97
      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
191
192
193
194
195
196
197
198
199
200
201
    public DocIdSet getDocIdSet(AtomicReaderContext context, Bits acceptDocs) throws IOException {
      final AtomicReader reader = context.reader();
      this.visitedReaders.add( reader );
      OpenBitSet bitSet = new OpenBitSet( reader.maxDoc() );
      for ( int i = 0; i < reader.maxDoc(); i++ ) {
        bitSet.fastSet( i );
      }
      Terms terms = reader.terms( fieldName );
      TermsEnum iterator = terms.iterator( null );
      BytesRef next = iterator.next();
      while ( next != null ) {
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.