Package java.util

Examples of java.util.BitSet.cardinality()


        for (int i = 0; i < size; i += 10) {
            queue.push(i);
        }

        while (bitSet.cardinality() < size && queue.size() > 0) {
            if (bitSet.cardinality() % 10000 == 0) {
                System.out.println("Crawled nodes: " + bitSet.cardinality());
            }
            int nodeId = queue.poll();
            if (!bitSet.get(nodeId)) {
                // ok we saw this node
View Full Code Here


            queue.push(i);
        }

        while (bitSet.cardinality() < size && queue.size() > 0) {
            if (bitSet.cardinality() % 10000 == 0) {
                System.out.println("Crawled nodes: " + bitSet.cardinality());
            }
            int nodeId = queue.poll();
            if (!bitSet.get(nodeId)) {
                // ok we saw this node
                bitSet.set(nodeId, true);
View Full Code Here

   */
  public void testHexToBits() {
    String methodStringToStore = "00";
    BitSet methodBitSet = new BitSet(8);
    HexUtil.hexToBits(methodStringToStore,methodBitSet,methodBitSet.size());
    assertTrue(methodBitSet.cardinality()==0);   
    BitSet expectedBitSet = new BitSet(8);
    expectedBitSet.set(0,7,true); /*0x7f*/
    methodStringToStore = "7f";
    methodBitSet = new BitSet(8);
    HexUtil.hexToBits(methodStringToStore,methodBitSet,methodBitSet.size());
View Full Code Here

            return random.nextInt(slots.length);
        }

        public int getRandomLocalSlot(SplitDef split) {
            BitSet localSlots = computeLocalSlots(split);
            int cardinality = localSlots.cardinality();
            if (cardinality == 0) {
                return getRandomSlot();
            }
            int nth = random.nextInt(cardinality);
            int current = localSlots.nextSetBit(0);
View Full Code Here

      threadArray[i].start();
    }
    for( int i = 0; i < threadArray.length; ++i ) {
      threadArray[i].join();
    }
    assertEquals("some threads failed!", N_THREADS,success.cardinality());
  }
 
  // counting collector that can slow down at collect().
  private class MyHitCollector extends Collector {
    private final BitSet bits = new BitSet();
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

      CountingHitCollector hc = validate ? new MatchingHitCollector(result)
                                         : new CountingHitCollector();
      s.search(bq, hc);
      ret += hc.getSum();

      if (validate) assertEquals(result.cardinality(), hc.getCount());
      // System.out.println(hc.getCount());
    }
   
    return ret;
  }
View Full Code Here

      CountingHitCollector hc = validate ? new MatchingHitCollector(result)
                                         : new CountingHitCollector();
      s.search(oq, hc);
      nMatches += hc.getCount();
      ret += hc.getSum();
      if (validate) assertEquals(result.cardinality(), hc.getCount());
      // System.out.println(hc.getCount());
    }
    if (VERBOSE) System.out.println("Average number of matches="+(nMatches/iter));
    return ret;
  }
View Full Code Here

            Object oid = oids.get(i);
            if (_cache.getById(oid, false) != null) {
                loaded.set(i);
            }
        }
        if(loaded.cardinality()==oids.size()){
            return true;
        }
        return _store.isCached(oids, loaded);
    };
   
View Full Code Here

            }
        }
        if (values.cardinality() <= vars[n].getLB()) {
            return ESat.TRUE;
        }
        if (mandatoryValues.cardinality() > vars[n].getUB()) {
            return ESat.FALSE;
        }
        return ESat.UNDEFINED;
    }
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.