Method iterator

JSAT/src/jsat/utils/IntSet.java:247–290

()

    
    
    @Override
    public Iterator<Integer> iterator()
    {
        final IntSet parentRef = this;

        //find the first starting inded
        int START = 0;
        while (START < status.length && status[START] != OCCUPIED)
            START++;
        if (START == status.length)
            return Collections.emptyIterator();
        final int startPos = START;

        return new Iterator<Integer>()
        {
            int pos = startPos;
            int prevPos = -1;

            @Override
            public boolean hasNext()
            {
                return pos < status.length;
            }

            @Override
            public Integer next()
            {
                //final int make so that object remains good after we call next again
                final int oldPos = prevPos = pos++;
                //find next
                while (pos < status.length && status[pos] != OCCUPIED)
                    pos++;
                //and return new object
                return keys[oldPos];
            }

            @Override
            public void remove()
            {
                //its ok to just call remove b/c nothing is re-ordered when we remove an element, we just set the status to DELETED
                parentRef.remove(keys[prevPos]);
            }
        };
    }

    @Override
    public int size()