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

org.apache.lucene.util.OpenBitSet.fastSet()
Sets the bit at the specified index. The index should be less than the OpenBitSet size.

      }
    }


    if (obs != null) {
      for (int i=0; i<upto; i++) {
        obs.fastSet(docs[i]);
      }
      numBits += upto;
      return new BitDocSet(obs, numBits);
    }

View Full Code Here

    DocIdSet docSet = lfilter.getDocIdSet(this.reader);
    OpenBitSet obs = new OpenBitSet();
    DocIdSetIterator it = docSet.iterator();
    int doc;
    while((doc = it.nextDoc()) != DocIdSetIterator.NO_MORE_DOCS) {
      obs.fastSet(doc);
    }
    return new BitDocSet(obs);
  }


  /**

View Full Code Here

  @Override
  public OpenBitSet getBits() {
    int maxDoc = size() > 0 ? docs[size()-1] : 0;
    OpenBitSet bs = new OpenBitSet(maxDoc+1);
    for (int doc : docs) {
      bs.fastSet(doc);
    }
    return bs;
  }

View Full Code Here

      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

    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

      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

      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


            // Check for cached reads
            if (norms != null && norms.length > idx && norms[idx] == norm)
                continue;


            docHits.fastSet(idx);


            if (norms == null)
                norms = new byte[numDocs];


            norms[idx] = norm;

View Full Code Here

            sfc.indexed = ftype == null ? sfc.name : ftype.toInternal(sfc.name);
            sfc.termNum = termNum++;
            counts.put(name, sfc);
          }
          sfc.count += count;
          terms.fastSet(sfc.termNum);
          last = count;
        }
      }


      // the largest possible missing term is initialMincount if we received less

View Full Code Here


  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

0 1 2 3 4 5 6 7 8

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.