TreeIterator.java

/*
Copyright 2008-2010 Gephi
Authors : Mathieu Bastian <mathieu.bastian@gephi.org>
Website : http://www.gephi.org

This file is part of Gephi.

Gephi is free software: you can redistribute it and/or modify
it under the terms of the GNU Affero General Public License as
published by the Free Software Foundation, either version 3 of the
License, or (at your option) any later version.

Gephi is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU Affero General Public License for more details.

You should have received a copy of the GNU Affero General Public License
along with Gephi.  If not, see <http://www.gnu.org/licenses/>.
*/
package org.gephi.graph.dhns.node.iterators;

import java.util.Iterator;
import org.gephi.graph.dhns.core.DurableTreeList;
import org.gephi.graph.dhns.core.TreeStructure;
import org.gephi.graph.dhns.core.DurableTreeList.DurableAVLNode;
import org.gephi.utils.collection.avl.ResetableIterator;
import org.gephi.graph.api.Node;
import org.gephi.graph.dhns.node.AbstractNode;
import org.gephi.graph.dhns.predicate.Predicate;

/**
 * {@link AbstractNode} iterator for all nodes nodes. If predicate contains the **enabled** predicate,
 * skipping is true and descendants of enabled nodes are skipped
 * 
 * @author Mathieu Bastian
 */
public class TreeIterator extends AbstractNodeIterator implements Iterator<Node>, ResetableIterator {

    protected int treeSize;
    protected DurableTreeList treeList;
    protected int nextIndex;
    protected int diffIndex;
    protected DurableAVLNode currentNode;
    //Settings
    protected final boolean skipping;
    //Predicate
    protected Predicate<AbstractNode> predicate;

    public TreeIterator(TreeStructure treeStructure, boolean skipping, Predicate<AbstractNode> predicate) {
        this.treeList = treeStructure.getTree();
        nextIndex = 1;
        diffIndex = 2;
        treeSize = treeList.size();
        this.skipping = skipping;
        this.predicate = predicate;
    }

    public void reset() {
        nextIndex = 1;
        diffIndex = 2;
    }

    public boolean hasNext() {
        while (true) {
            if (nextIndex < treeSize) {
                if (diffIndex > 1) {
                    currentNode = treeList.getNode(nextIndex);
                } else {
                    currentNode = currentNode.next();
                }

                if (skipping) {
                    while (!currentNode.getValue().isEnabled() || !predicate.evaluate(currentNode.getValue())) {
                        ++nextIndex;
                        if (nextIndex >= treeSize) {
                            return false;
                        }
                        currentNode = currentNode.next();
                    }
                    return true;
                } else {
                    while (!predicate.evaluate(currentNode.getValue())) {
                        ++nextIndex;
                        if (nextIndex >= treeSize) {
                            return false;
                        }
                        currentNode = currentNode.next();
                    }
                    return true;
                }
            } else {
                return false;
            }
        }
    }

    public AbstractNode next() {
        if (skipping) {
            nextIndex = currentNode.getValue().getPre() + 1 + currentNode.getValue().size;
            diffIndex = nextIndex - currentNode.getValue().pre;
        } else {
            nextIndex++;
            diffIndex = 1;
        }
        return currentNode.getValue();
    }

    public void remove() {
        throw new UnsupportedOperationException();
    }
}