List of cardinality() Examples

Examples of cardinality()

aQute.bnd.osgi.Descriptors.TypeRef.cardinality()
cern.colt.matrix.DoubleMatrix2D.cardinality()
Returns the number of cells having non-zero values; ignores tolerance.
com.clearspring.analytics.stream.cardinality.HyperLogLog.cardinality()
com.clearspring.analytics.stream.cardinality.HyperLogLogPlus.cardinality()
Gather the cardinality estimate from this estimator.
Has two procedures based on current mode. 'Normal' mode works similar to HLL but has some new bias corrections. 'Sparse' mode is linear counting. @return
com.clearspring.analytics.stream.cardinality.ICardinality.cardinality()
@return the number of unique elements in the stream or an estimate thereof
com.exigen.ie.constrainer.Constrainer.cardinality()
Returns expression being equal to the number of required values in a set domain @param var constrained set variable @return var.cardinality() expression
com.sun.org.apache.xalan.internal.xsltc.util.IntegerArray.cardinality()
com.sun.xmlsearch.util.IntegerArray.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
net.agkn.hll.HLL.cardinality()
Computes the cardinality of the HLL. @return the cardinality of HLL. This will never be negative.
orestes.bloomfilter.redis.RedisBitSet.cardinality()
org.apache.giraph.utils.IncreasingBitSet.cardinality()
Get the number of set bits @return Number of set bits
org.apache.harmony.pack200.BHSDCodec.cardinality()
Returns the cardinality of this codec; that is, the number of distinct values that it can contain. @return the cardinality of this codec
org.apache.lucene.index.RandomAccessOrds.cardinality()
Returns the cardinality for the current document (previously set by {@link #setDocument(int)}.
org.apache.lucene.util.BitSet.cardinality()
org.apache.lucene.util.FixedBitSet.cardinality()
Returns number of set bits. NOTE: this visits every long in the backing bits array, and the result is not internally cached!
org.apache.lucene.util.LongBitSet.cardinality()
Returns number of set bits. NOTE: this visits every long in the backing bits array, and the result is not internally cached!
org.apache.lucene.util.OpenBitSet.cardinality()
@return the number of set bits
org.apache.lucene.util.OpenBitSetDISI.cardinality()
org.apache.mahout.matrix.Vector.cardinality()
Return the cardinality of the recipient (the maximum number of values) @return an int
org.apache.pig.data.DataBag.cardinality()
Deprecated. Use size() instead.
org.apache.solr.util.OpenBitSet.cardinality()
@return the number of set bits
org.apache.xalan.xsltc.util.IntegerArray.cardinality()
org.geotools.feature.TypeBuilder.cardinality()
org.jgroups.util.FixedSizeBitSet.cardinality()
Returns the number of bits set to true in this bit set @return the number of bits set to true in this bit set

Examples of java.util.BitSet.cardinality()

        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

Examples of java.util.BitSet.cardinality()

            double logLikelihood = logLikelihood(a, b, c, d);
            if (logLikelihood > 3.841)
                validFeatures.set(co);
        }
        if (LOGGER.isLoggable(Level.FINE))
            LOGGER.fine(term + " had " + validFeatures.cardinality() 
                        + " features");
        return validFeatures;
    }


    /**

View Full Code Here

Examples of java.util.BitSet.cardinality()

                            for (Integer linkIndex : linkPartition) {
                                Edge link = edgeList.get(linkIndex);
                                nodesInPartition.set(link.from);
                                nodesInPartition.set(link.to);
                            }
                            int numNodes = nodesInPartition.cardinality();
                            // This reflects the density of this particular
                            // cluster
                            double partitionDensity =
                                (numLinks - (numNodes - 1d))
                                / (((numNodes * (numNodes - 1d)) / 2d)

View Full Code Here

Examples of java.util.BitSet.cardinality()

            for (Integer linkIndex : linkPartition) {
                Edge link = edgeList.get(linkIndex);
                nodesInPartition.set(link.from);
                nodesInPartition.set(link.to);
            }
            int numNodes = nodesInPartition.cardinality();
            // This reflects the density of this particular cluster within the
            // total partitioning
            double partitionDensity = (numLinks - (numNodes - 1d))
                / (((numNodes * (numNodes - 1d)) / 2d) - (numLinks - 1));                
            partitionDensitySum += partitionDensity;

View Full Code Here

Examples of java.util.BitSet.cardinality()


    @Test public void testRandomDistributionUnderHalfSet() {
        for (int size = 10; size < 100; ++size) {
            for (int set = 1; set < size / 2; ++set) {
                BitSet b = Statistics.randomDistribution(set, size);
                assertEquals(set, b.cardinality());
            }
        }        
    }


    @Test public void testRandomDistributionOverHalfSet() {

View Full Code Here

Examples of java.util.BitSet.cardinality()


    @Test public void testRandomDistributionOverHalfSet() {
        for (int size = 10; size < 100; ++size) {
            for (int set = size / 2; set < ((3 * size) / 4); ++set) {
                BitSet b = Statistics.randomDistribution(set, size);
                assertEquals(set, b.cardinality());
            }
        }        
    }


    @Test(expected=IllegalArgumentException.class)

View Full Code Here

Examples of java.util.BitSet.cardinality()

            union.set(i);
        }
        
        // get the intersection
        c.and(d); 
        return ((double)(c.cardinality())) / union.cardinality();
    }


    /**
     * Computes the <a href="http://en.wikipedia.org/wiki/Jaccard_index">Jaccard
     * index</a> comparing the similarity both {@code DoubleVector}s when viewed

View Full Code Here

Examples of java.util.BitSet.cardinality()

     * {@inheritDoc}
     */
    public int disconnect(int v) {
        BitSet b = edges.remove(v);
        if (b != null) {
            int edges = b.cardinality();
            size -= edges;
            return edges;
        }
        return 0;
    }

View Full Code Here

Examples of java.util.BitSet.cardinality()

        // If there was an edge of that type, remove it and update the
        // "connected" set as necessary
        if (types.get(index)) {
            types.set(index, false);
            // If this was the last edge to that vertex, remove this BitMap
            if (types.cardinality() == 0) {
                edges.remove(i);
                size--;
            }
            return true;
        }

View Full Code Here

Examples of java.util.BitSet.cardinality()

    public int disconnect(int v) {
        if (connected.remove(v)) {
            int removed = 0;
            BitSet b = inEdges.remove(v);
            if (b != null) {
                int edges = b.cardinality();
                size -= edges;
                removed += edges;
            }
            b = outEdges.remove(v);
            if (b != null) {

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.