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

            encoder.encode( "X" + j, Arrays.asList( "A" ) );
        }


        assertEquals( N, encoder.size() );
        BitSet code = encoder.getCode( "X" + ( N -1 ) );
        assertEquals( 1, code.cardinality() );
        assertTrue( code.get( N - 2 ) );
    }

View Full Code Here

    int cardinality() {
        int count = 0;
        Iterator<BitSet> iter = bitSegments.values().iterator();
        while (iter.hasNext()) {
            BitSet b = iter.next();
            count += b.cardinality();
        }
        return count;
    }
}

View Full Code Here

  /**
   * Returns nnumber of running instances for the given runnable.
   */
  private int getRunningInstances(String runableName) {
    BitSet instances = runnableInstances.get(runableName);
    return instances == null ? 0 : instances.cardinality();
  }


  private RunId getRunId(String runnableName, int instanceId) {
    RunId baseId;

View Full Code Here

  }
  
  private void rebuildCompressedActives() {
    
    BitSet bs = activeIds;
    int size = bs.cardinality();
    actives.setSize(size);
    actives.ensureCapacity(size);
    EntityManager em = world.getEntityManager();
    Object[] activesArray = actives.getData();
    for (int i = bs.nextSetBit(0), index = 0; i >= 0; i = bs.nextSetBit(i + 1)) {

View Full Code Here

          if (conflictIndex != startIndex) {
            input.seek(startIndex);
          }


          conflictingAlts = evalSemanticContext(D.predicates, outerContext, true);
          if ( conflictingAlts.cardinality()==1 ) {
            if ( debug ) System.out.println("Full LL avoided");
            return conflictingAlts.nextSetBit(0);
          }


          if (conflictIndex != startIndex) {

View Full Code Here

        }


        int stopIndex = input.index();
        input.seek(startIndex);
        BitSet alts = evalSemanticContext(D.predicates, outerContext, true);
        switch (alts.cardinality()) {
        case 0:
          throw noViableAlt(input, outerContext, D.configs, startIndex);


        case 1:
          return alts.nextSetBit(0);

View Full Code Here

    public void reportAmbiguity(Parser recognizer, DFA dfa, int startIndex, int stopIndex, boolean exact, BitSet ambigAlts, ATNConfigSet configs) {
      if (COMPUTE_TRANSITION_STATS && DETAILED_DFA_STATE_STATS) {
        BitSet sllPredictions = getConflictingAlts(_sllConflict, _sllConfigs);
        int sllPrediction = sllPredictions.nextSetBit(0);
        BitSet llPredictions = getConflictingAlts(ambigAlts, configs);
        int llPrediction = llPredictions.cardinality() == 0 ? ATN.INVALID_ALT_NUMBER : llPredictions.nextSetBit(0);
        if (sllPrediction != llPrediction) {
          ((StatisticsParserATNSimulator)recognizer.getInterpreter()).nonSll[dfa.decision]++;
        }
      }

View Full Code Here

        doIterate(a_or,b_or, mode);
        doIterate(a_andn,b_andn, mode);


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


      a0=a;
      b0=b;
    }

View Full Code Here

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

View Full Code Here

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

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.