List of nextSetBit() Examples

Examples of nextSetBit()

au.csiro.snorocket.core.util.FeatureSet.nextSetBit()
com.carrotsearch.hppc.BitSet.nextSetBit()
Returns the index of the first set bit starting at the index specified. -1 is returned if there are no more set bits.
com.carrotsearch.hppc.BitSetIterator.nextSetBit()
java.util.BitSet.nextSetBit()
ate on index i here } @param fromIndex the index to start checking from (inclusive). @return the index of the next set bit. @throws IndexOutOfBoundsException if the specified index is negative. @since 1.4
javolution.util.FastBitSet.nextSetBit()
Returns the index of the next {@code true} bit, from the specified bit(inclusive). If there is none, {@code -1} is returned. The following code will iterates through the bit set:[code] for (int i=nextSetBit(0); i >= 0; i = nextSetBit(i)) { ... }[/code] @param fromIndex the start location. @return the first {@code false} bit. @throws IndexOutOfBoundsException if {@code fromIndex < 0}
org.apache.lucene.util.BitSet.nextSetBit()
org.apache.lucene.util.FixedBitSet.nextSetBit()
Returns the index of the first set bit starting at the index specified. -1 is returned if there are no more set bits.
org.apache.lucene.util.OpenBitSet.nextSetBit()
Returns the index of the first set bit starting at the index specified. -1 is returned if there are no more set bits.
org.drools.core.util.bitmask.OpenBitSet.nextSetBit()
Returns the index of the first set bit starting at the index specified. -1 is returned if there are no more set bits.
org.jgroups.util.FixedSizeBitSet.nextSetBit()
ate on index i here } @param fromIndex the index to start checking from (inclusive). @return the index of the next set bit. @throws IndexOutOfBoundsException if the specified index is negative.
org.jkff.ire.util.WrappedBitSet.nextSetBit()

Examples of java.util.BitSet.nextSetBit()

                } catch (VisitorException e) {
                    LOG.warn("Feature visitor failed", e);
                }
            }
            StringBuilder sb = new StringBuilder();
            for (int i=feature.nextSetBit(0); i>=0; i=feature.nextSetBit(i+1)) {
                if (sb.length() > 0) sb.append(",");             
                sb.append(PIG_FEATURE.values()[i].name());
            }
            retStr = sb.toString();
            featureMap.put(mro, retStr);

View Full Code Here

Examples of java.util.BitSet.nextSetBit()

                } catch (VisitorException e) {
                    LOG.warn("Feature visitor failed", e);
                }
            }
            StringBuilder sb = new StringBuilder();
            for (int i=feature.nextSetBit(0); i>=0; i=feature.nextSetBit(i+1)) {
                if (sb.length() > 0) sb.append(",");             
                sb.append(PIG_FEATURE.values()[i].name());
            }
            retStr = sb.toString();
            featureMap.put(mro, retStr);

View Full Code Here

Examples of java.util.BitSet.nextSetBit()

                    seti.set(j, true);
                }
            }
            seti.set(i, false);
            int y = rand.nextInt(size);
            int j = seti.nextSetBit(y);
            if (j == -1) {
                j = seti.nextSetBit(0);
            }
            if (j != -1) {
                seti.set(j, false);

View Full Code Here

Examples of java.util.BitSet.nextSetBit()

            }
            seti.set(i, false);
            int y = rand.nextInt(size);
            int j = seti.nextSetBit(y);
            if (j == -1) {
                j = seti.nextSetBit(0);
            }
            if (j != -1) {
                seti.set(j, false);
                graph[i][j] = true;
                nb--;

View Full Code Here

Examples of java.util.BitSet.nextSetBit()




        // on bouche jusqu'a la limite pour creer les contraintes 1
        while (nbPrec > 0) {
            //Pair p = precs.get(rand.nextInt(precs.size()));
            int ij = precs.nextSetBit(0);
            int index = rand.nextInt(precs.cardinality());
            while (index > 0) {
                ij = precs.nextSetBit(ij + 1);
                index--;
            }

View Full Code Here

Examples of java.util.BitSet.nextSetBit()

        while (nbPrec > 0) {
            //Pair p = precs.get(rand.nextInt(precs.size()));
            int ij = precs.nextSetBit(0);
            int index = rand.nextInt(precs.cardinality());
            while (index > 0) {
                ij = precs.nextSetBit(ij + 1);
                index--;
            }
            assert (ij > -1);
            graph[ij / n][ij % n] = 1;
            precs.set(ij, false);

View Full Code Here

Examples of java.util.BitSet.nextSetBit()

            }
            seti.set(i, false);
            int ti = nb - ni;
            while (ti > 0) {
                int y = rand.nextInt(size);
                int j = seti.nextSetBit(y);
                if (j == -1) {
                    j = seti.nextSetBit(0);
                }
                seti.set(j, false);
                graph[i][j] = true;

View Full Code Here

Examples of java.util.BitSet.nextSetBit()

            int ti = nb - ni;
            while (ti > 0) {
                int y = rand.nextInt(size);
                int j = seti.nextSetBit(y);
                if (j == -1) {
                    j = seti.nextSetBit(0);
                }
                seti.set(j, false);
                graph[i][j] = true;
                ti--;
            }

View Full Code Here

Examples of java.util.BitSet.nextSetBit()

            int i = pickOneTrue(notIn);
            notIn.set(i, false);
            // relier i a un sommet de in quelconque.
            int j;
            int sj = rand.nextInt(size);
            j = in.nextSetBit(sj);
            if (j == -1) {
                j = in.nextSetBit(0);
            }
            // cas du premier sommet ajoute dans in
            if (j > -1) {

View Full Code Here

Examples of java.util.BitSet.nextSetBit()

            // relier i a un sommet de in quelconque.
            int j;
            int sj = rand.nextInt(size);
            j = in.nextSetBit(sj);
            if (j == -1) {
                j = in.nextSetBit(0);
            }
            // cas du premier sommet ajoute dans in
            if (j > -1) {
                // pas de pbs car i et j ne peuvent pas etre tous deux dans in
                this.graph[i][j] = true;

View Full Code Here

0 1 2 3 4 5

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.