Examples of java.util.BitSet.clone()

java.util.BitSet.clone()
Cloning this BitSet produces a new BitSet that is equal to it. The clone of the bit set is another bit set that has exactly the same bits set to true as this bit set.
Overrides the clone method of Object. @return a clone of this bit set. @see java.util.BitSet#size()

     */
    public static Object[] clone(Object[] state) {
        Object[] copy = new Object[state.length];
        System.arraycopy(state, 0, copy, 0, state.length - 1);
        BitSet loaded = (BitSet) state[state.length - 1];
        copy[copy.length - 1] = loaded.clone();
        return copy;
    }


    /**
     * Return whether the given images are equivalent from an optimistic

View Full Code Here

        return new DocIdBitSet(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

        return new DocIdBitSet(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

                        this.activation );
                proxy.setTypeFilter( null );


                BitSet tc = proxy.getTypeCode();
                if ( veto == null ) {
                    veto = (BitSet) tc.clone();
                } else {
                    veto.and( tc );
                }
            }
        }

View Full Code Here

        return new DocIdBitSet(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

    //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

        } catch (CloneNotSupportedException e) {
            throw new AssertionError(e); // Should never happen, since we are cloneable.
        }
        final BitSet s = supplementary;
        if (s != null) {
            clone.supplementary = (BitSet) s.clone();
        }
        return clone;
    }
}

View Full Code Here

0 1 2 3 4 5 6

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.