Package java.util

Examples of java.util.BitSet.clone()


    //SHOULD filters
    if (shouldFilters!=null)
    {
      returnBits = ((Filter)shouldFilters.get(0)).bits(reader);
//      avoid changing the original bitset - it may be cached
      returnBits=(BitSet) returnBits.clone();
      if (shouldFilters.size() > 1)
      {
        for (int i = 1; i < shouldFilters.size(); i++)
        {
          returnBits.or(((Filter)shouldFilters.get(i)).bits(reader));
View Full Code Here


      for (int i = 0; i < notFilters.size(); i++)
      {
        BitSet notBits=((Filter)notFilters.get(i)).bits(reader);
        if(returnBits==null)
        {
          returnBits=(BitSet) notBits.clone();         
          returnBits.flip(0,reader.maxDoc());
        }
        else
        {
          returnBits.andNot(notBits);
View Full Code Here

           
          }
          else
          {
            //don't mangle the bitset
            returnBits=(BitSet) mustBits.clone();           
          }
        }
        else
        {
          returnBits.and(mustBits);
View Full Code Here

        if ((sm.getPCState() == PCState.PDIRTY
            && (!sm.isFlushed() || sm.isFlushedDirty()))
            || (sm.getPCState() == PCState.PNEW && sm.isFlushedDirty())) {
            BitSet dirty = sm.getDirty();
            if (sm.isFlushed()) {
                dirty = (BitSet) dirty.clone();
                dirty.andNot(sm.getFlushed());
            }
            if (dirty.length() > 0)
                return dirty;
        }
View Full Code Here

  BitSet addClause(BooleanQuery bq, BitSet result) {
    BitSet rnd = sets[r.nextInt(sets.length)];
    Query q = new ConstantScoreQuery(new BitSetFilter(rnd));
    bq.add(q, BooleanClause.Occur.MUST);
    if (validate) {
      if (result==null) result = (BitSet)rnd.clone();
      else result.and(rnd);
    }
    return result;
  }
View Full Code Here

  boolean done = false;
  boolean addone = false;
  boolean z;
  boolean deleted = false;
  while (!done) {
    temp_group = (BitSet)best_group.clone();
    temp_best = best_merit;
   
    done = true;
    addone = false;
    for (i = 0; i < numAttribs;i++) {
View Full Code Here

    // evaluate the initial subset
    best_merit = ASEvaluator.evaluateSubset(best_group);
    // add the initial group to the list and the hash table
    Object [] best = new Object[1];
    best[0] = best_group.clone();
    bfList.addToList(best, best_merit);
    BitSet tt = (BitSet)best_group.clone();
    String hashC = tt.toString();
    lookup.put(hashC, new Double(best_merit));
View Full Code Here

        cacheHits++; 
      }
     
      // insert this one in the list
      Object[] add = new Object[1];
      add[0] = tt.clone();
      bfList.addToList(add, merit);
     
      if (m_debug) {
        System.out.print("Group: ");
        printGroup(tt, m_numAttribs);
View Full Code Here

     if (tempMerit >= best_merit) {
       tempSize = countFeatures(tempGroup);
       if (tempMerit > best_merit ||
     (tempSize < sizeOfBest)) {
   best_merit = tempMerit;
   m_bestGroup = (BitSet)(tempGroup.clone());
   sizeOfBest = tempSize;
       }
     }

     int numatts = (m_hasClass)
View Full Code Here

       if (tempMerit >= best_merit) {
         tempSize = countFeatures(tempGroup);
         if (tempMerit > best_merit ||
             (tempSize < sizeOfBest)) {
           best_merit = tempMerit;
           m_bestGroup = (BitSet)(tempGroup.clone());
           sizeOfBest = tempSize;
           if (m_verbose) {
             System.out.println("New best subset ("
                                +Utils.doubleToString(Math.
                                                      abs(best_merit),8,5)
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.