// Path: src/main/java/com/googlecode/javaewah/IntIterator.java
// public interface IntIterator {
// 
//     /**
//      * Is there more?
//      *
//      * @return true, if there is more, false otherwise
//      */
//     boolean hasNext();
// 
//     /**
//      * Return the next integer
//      *
//      * @return the integer
//      */
//     int next();
// }
// 
// Path: src/main/java/com/googlecode/javaewah32/EWAHCompressedBitmap32.java
// public static final int WORD_IN_BITS = 32;


import static com.googlecode.javaewah32.EWAHCompressedBitmap32.WORD_IN_BITS;
import com.googlecode.javaewah.IntIterator;
    public boolean moveToNext() {
        while (!runningHasNext() && !literalHasNext()) {
            if (!this.ewahIter.hasNext()) {
                return false;
            }
            setRunningLengthWord(this.ewahIter.next());
        }
        return true;
    }

    @Override
    public boolean hasNext() {
        return this.hasnext;
    }

    @Override
    public int next() {
        final int answer;
        if (runningHasNext()) {
            answer = this.position++;
        } else {
            final int t = this.word & -this.word;
            answer = this.literalPosition + Integer.bitCount(t - 1);
            this.word ^= t;
        }
        this.hasnext = this.moveToNext();
        return answer;
    }

    private void setRunningLengthWord(RunningLengthWord32 rlw) {
// Path: src/main/java/com/googlecode/javaewah/IntIterator.java
// public interface IntIterator {
// 
//     /**
//      * Is there more?
//      *
//      * @return true, if there is more, false otherwise
//      */
//     boolean hasNext();
// 
//     /**
//      * Return the next integer
//      *
//      * @return the integer
//      */
//     int next();
// }
// 
// Path: src/main/java/com/googlecode/javaewah32/EWAHCompressedBitmap32.java
// public static final int WORD_IN_BITS = 32;


// Path: src/main/java/com/googlecode/javaewah32/IntIteratorImpl32.java
import static com.googlecode.javaewah32.EWAHCompressedBitmap32.WORD_IN_BITS;
import com.googlecode.javaewah.IntIterator;

    public boolean moveToNext() {
        while (!runningHasNext() && !literalHasNext()) {
            if (!this.ewahIter.hasNext()) {
                return false;
            }
            setRunningLengthWord(this.ewahIter.next());
        }
        return true;
    }

    @Override
    public boolean hasNext() {
        return this.hasnext;
    }

    @Override
    public int next() {
        final int answer;
        if (runningHasNext()) {
            answer = this.position++;
        } else {
            final int t = this.word & -this.word;
            answer = this.literalPosition + Integer.bitCount(t - 1);
            this.word ^= t;
        }
        this.hasnext = this.moveToNext();
        return answer;
    }

    private void setRunningLengthWord(RunningLengthWord32 rlw) {
        this.runningLength = WORD_IN_BITS * rlw.getRunningLength()