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()


        // on bouche jusqu'a la limite pour creer les contraintes 2
        BitSet neqs = new BitSet();
        neqs.or(precs);
        while (nbNeq > 0 && neqs.cardinality() > 0) {
            int ij = neqs.nextSetBit(0);
            int index = rand.nextInt(neqs.cardinality());
            while (index > 0) {
                ij = neqs.nextSetBit(ij + 1);
                index--;
            }

View Full Code Here

Examples of java.util.BitSet.nextSetBit()

        neqs.or(precs);
        while (nbNeq > 0 && neqs.cardinality() > 0) {
            int ij = neqs.nextSetBit(0);
            int index = rand.nextInt(neqs.cardinality());
            while (index > 0) {
                ij = neqs.nextSetBit(ij + 1);
                index--;
            }
            assert (ij > -1);
            graph[ij / n][ij % n] = 2;
            neqs.set(ij, false);

View Full Code Here

Examples of java.util.BitSet.nextSetBit()

        }


        for (int i = 0; i < alldiffLayers.length; i++) {
            BitSet disjoint = alldiffLayers[i];
            IntVar[] tvars = new IntVar[disjoint.cardinality()];
            for (int k = 0, j = disjoint.nextSetBit(0); j >= 0; j = disjoint.nextSetBit(j + 1), k++) {
                tvars[k] = vars[j];
            }
            solver.post(IntConstraintFactory.alldifferent(tvars, "BC"));
        }
    }

View Full Code Here

Examples of java.util.BitSet.nextSetBit()

        }


        for (int i = 0; i < alldiffLayers.length; i++) {
            BitSet disjoint = alldiffLayers[i];
            IntVar[] tvars = new IntVar[disjoint.cardinality()];
            for (int k = 0, j = disjoint.nextSetBit(0); j >= 0; j = disjoint.nextSetBit(j + 1), k++) {
                tvars[k] = vars[j];
            }
            solver.post(IntConstraintFactory.alldifferent(tvars, "BC"));
        }
    }

View Full Code Here

Examples of java.util.BitSet.nextSetBit()

        layers[nbC - 1] = new BitSet(nbS);
        layers[nbC - 1].set(nbS - 1, true);
        available.set(nbS - 1, false);




        for (int i = available.nextSetBit(0); i >= 0; i = available.nextSetBit(i + 1)) {
            int layer = 1 + rand.nextInt(nbC - 2);
            layers[layer].set(i, true);
            available.set(i, false);
        }

View Full Code Here

Examples of java.util.BitSet.nextSetBit()

        layers[nbC - 1] = new BitSet(nbS);
        layers[nbC - 1].set(nbS - 1, true);
        available.set(nbS - 1, false);




        for (int i = available.nextSetBit(0); i >= 0; i = available.nextSetBit(i + 1)) {
            int layer = 1 + rand.nextInt(nbC - 2);
            layers[layer].set(i, true);
            available.set(i, false);
        }

View Full Code Here

Examples of java.util.BitSet.nextSetBit()

            succs[l] = new BitSet(nbS);
        }


        for (int l = 0; l < layers.length - 1; l++) {
            BitSet layer = layers[l];
            for (int i = layer.nextSetBit(0); i >= 0; i = layer.nextSetBit(i + 1)) {
                BitSet layer2 = layers[l + 1];
                for (int j = layer2.nextSetBit(0); j >= 0; j = layer2.nextSetBit(j + 1)) {
                    succs[i].set(j, true);
                }
            }

View Full Code Here

Examples of java.util.BitSet.nextSetBit()

            succs[l] = new BitSet(nbS);
        }


        for (int l = 0; l < layers.length - 1; l++) {
            BitSet layer = layers[l];
            for (int i = layer.nextSetBit(0); i >= 0; i = layer.nextSetBit(i + 1)) {
                BitSet layer2 = layers[l + 1];
                for (int j = layer2.nextSetBit(0); j >= 0; j = layer2.nextSetBit(j + 1)) {
                    succs[i].set(j, true);
                }
            }

View Full Code Here

Examples of java.util.BitSet.nextSetBit()


        for (int l = 0; l < layers.length - 1; l++) {
            BitSet layer = layers[l];
            for (int i = layer.nextSetBit(0); i >= 0; i = layer.nextSetBit(i + 1)) {
                BitSet layer2 = layers[l + 1];
                for (int j = layer2.nextSetBit(0); j >= 0; j = layer2.nextSetBit(j + 1)) {
                    succs[i].set(j, true);
                }
            }
        }

View Full Code Here

Examples of java.util.BitSet.nextSetBit()


        for (int l = 0; l < layers.length - 1; l++) {
            BitSet layer = layers[l];
            for (int i = layer.nextSetBit(0); i >= 0; i = layer.nextSetBit(i + 1)) {
                BitSet layer2 = layers[l + 1];
                for (int j = layer2.nextSetBit(0); j >= 0; j = layer2.nextSetBit(j + 1)) {
                    succs[i].set(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.