Examples of java.util.BitSet.cardinality()

java.util.BitSet.cardinality()
Returns the number of bits set to true in this BitSet. @return the number of bits set to true in thisBitSet. @since 1.4

      int[] compact = hash.compact();
      assertTrue(numEntries < compact.length);
      for (int i = 0; i < numEntries; i++) {
        bits.set(compact[i], false);
      }
      assertEquals(0, bits.cardinality());
      hash.clear();
      assertEquals(0, hash.size());
      hash.reinit();
    }
  }

View Full Code Here

        doIterate(a_andn,b_andn, mode);


        assertEquals(a_and.cardinality(), b_and.cardinality());
        assertEquals(a_or.cardinality(), b_or.cardinality());
        assertEquals(a_xor.cardinality(), b_xor.cardinality());
        assertEquals(a_andn.cardinality(), b_andn.cardinality());


        // test non-mutating popcounts
        assertEquals(b_and.cardinality(), OpenBitSet.intersectionCount(b,b0));
        assertEquals(b_or.cardinality(), OpenBitSet.unionCount(b,b0));
        assertEquals(b_xor.cardinality(), OpenBitSet.xorCount(b,b0));

View Full Code Here

        BitSet t = new BitSet( x.length() );
        t.or( x );
        t.flip(0, t.size());
        t.and( y );


        switch ( t.cardinality() ) {
            case 0 : return t;
            case 1 : return t;
            default: return new BitSet();
        }
    }

View Full Code Here

        BitSet t = new BitSet( x.length() );
        t.or( x );
        t.flip(0, t.size());
        t.and( y );


        switch ( t.cardinality() ) {
            case 0 : return t;
            case 1 : return t;
            default: return new BitSet();
        }
    }

View Full Code Here

            if (counts[fi] > pruneCount.value) {
              bs.set(fi);
            }
          }
          
          logger.info ("Pruning "+(numFeatures-bs.cardinality())+" features out of "+numFeatures
                 +"; leaving "+(bs.cardinality())+" features.");
          
          FeatureSelection fs = new FeatureSelection (instances.getDataAlphabet(), bs);
          
          for (int ii = 0; ii < instances.size(); ii++) {

View Full Code Here

              bs.set(fi);
            }
          }
          
          logger.info ("Pruning "+(numFeatures-bs.cardinality())+" features out of "+numFeatures
                 +"; leaving "+(bs.cardinality())+" features.");
          
          FeatureSelection fs = new FeatureSelection (instances.getDataAlphabet(), bs);
          
          for (int ii = 0; ii < instances.size(); ii++) {

View Full Code Here

   */
  @GwtIncompatible("java.util.BitSet")
  CharMatcher precomputedInternal() {
    final BitSet table = new BitSet();
    setBits(table);
    int totalCharacters = table.cardinality();
    if (totalCharacters * 2 <= DISTINCT_CHARS) {
      return precomputedPositive(totalCharacters, table, description);
    } else {
      // TODO(user): is it worth it to worry about the last character of large matchers?
      table.flip(Character.MIN_VALUE, Character.MAX_VALUE + 1);

View Full Code Here

            if (sz == Integer.MAX_VALUE) {


                BitSet dead = new BitSet();
                dead.or(potentiallyDeadStores);
                dead.and(potentiallyDeadStoresFromBeforeFallthrough);
                if (dead.cardinality() > 0) {
                    int register = dead.nextSetBit(0);
                    priority = HIGH_PRIORITY;
                    deadStore = LocalVariableAnnotation.getLocalVariableAnnotation(getMethod(), register, getPC() - 1, getPC());
                    bugAccumulator.accumulateBug(new BugInstance(this, "SF_DEAD_STORE_DUE_TO_SWITCH_FALLTHROUGH_TO_THROW",
                            priority).addClassAndMethod(this).add(deadStore), this);

View Full Code Here

        BitSet t = new BitSet( x.length() );
        t.or( x );
        t.flip(0, t.size());
        t.and( y );


        switch ( t.cardinality() ) {
            case 0 : return t;
            case 1 : return t;
            default: return new BitSet();
        }
    }

View Full Code Here

        final LoptMultiJoin.Edge edge = unusedEdges.get(i);
        if (edge.factors.intersects(merged)) {
          BitSet newEdgeFactors = (BitSet) edge.factors.clone();
          newEdgeFactors.andNot(newFactors);
          newEdgeFactors.set(v);
          assert newEdgeFactors.cardinality() == 2;
          final LoptMultiJoin.Edge newEdge =
              new LoptMultiJoin.Edge(edge.condition, newEdgeFactors,
                  edge.columns);
          unusedEdges.set(i, newEdge);
        }

View Full Code Here

0 1 2 3 4 5 6 7 8 9

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.