Package org.apache.lucene.util

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

129
130
131
132
133
134
135
136
137
138
139
              {
                df++;
                docid = tdoc.doc();
              
                if(!loader.add(docid, valId)) logOverflow(fieldName);
                bitset.fastSet(docid);
              }
              maxID = docid;
            }
            freqList.add(df);
            minIDList.add(minID);
View Full Code Here
273
274
275
276
277
278
279
280
281
282
283
            {
              df++;
              int docid = tdoc.doc();
              if (!_nestedArray.addData(docid, t)) logOverflow(fieldName);
              minID = docid;
              bitset.fastSet(docid);
              int valId = (t - 1 < negativeValueCount) ? (negativeValueCount - t + 1) : t;
              while(tdoc.next())
              {
                df++;
                docid = tdoc.doc();
View Full Code Here
280
281
282
283
284
285
286
287
288
289
290
              while(tdoc.next())
              {
                df++;
                docid = tdoc.doc();
                if(!_nestedArray.addData(docid, valId)) logOverflow(fieldName);
                bitset.fastSet(docid);
              }
              maxID = docid;
            }
            freqList.add(df);
            minIDList.add(minID);
View Full Code Here
93
94
95
96
97
98
99
100
101
102
103
    final BigNestedIntArray nestedArray = dataCache._nestedArray;
    final OpenBitSet bitset = new OpenBitSet(dataCache.valArray.size());
 
    for (int i : index)
    {
      bitset.fastSet(i);
    }
 
    if (_takeCompliment)
    {
      // flip the bits
View Full Code Here
122
123
124
125
126
127
128
129
130
131
132
            {
              df++;
              int docid = tdoc.doc();
              if(!loader.add(docid, t)) logOverflow(fieldName);
              minID = docid;
              bitset.fastSet(docid);
              while(tdoc.next())
              {
                df++;
                docid = tdoc.doc();
                if(!loader.add(docid, t)) logOverflow(fieldName);
View Full Code Here
128
129
130
131
132
133
134
135
136
137
138
              while(tdoc.next())
              {
                df++;
                docid = tdoc.doc();
                if(!loader.add(docid, t)) logOverflow(fieldName);
                bitset.fastSet(docid);
              }
              maxID = docid;
            }
            freqList.add(df);
            minIDList.add(minID);
View Full Code Here
272
273
274
275
276
277
278
279
280
281
282
            {
              df++;
              int docid = tdoc.doc();
              if (!_nestedArray.addData(docid, t)) logOverflow(fieldName);
              minID = docid;
              bitset.fastSet(docid);
              while(tdoc.next())
              {
                df++;
                docid = tdoc.doc();
                if(!_nestedArray.addData(docid, t)) logOverflow(fieldName);
View Full Code Here
278
279
280
281
282
283
284
285
286
287
288
              while(tdoc.next())
              {
                df++;
                docid = tdoc.doc();
                if(!_nestedArray.addData(docid, t)) logOverflow(fieldName);
                bitset.fastSet(docid);
              }
              maxID = docid;
            }
            freqList.add(df);
            minIDList.add(minID);
View Full Code Here
187
188
189
190
191
192
193
194
195
196
197
  public DocIdSet randSet(int sz) {
    OpenBitSet obs = new OpenBitSet(sz);
    int n = r.nextInt(sz);
    for (int i=0; i<n; i++) {
      obs.fastSet(r.nextInt(sz));
    }
    return obs;
  } 
 
View Full Code Here
61
62
63
64
65
66
67
68
69
70
71
          if ( docId == DocIdSetIterator.NO_MORE_DOCS ) {
            break;
          }
          else {
            if ( acceptDocs == null || acceptDocs.get( docId ) ) {
              matchedDocumentsIds.fastSet( docId );
              found = true;
            }
          }
        }
      }
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.