DescendantAndSelfIterator.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.TreeStructure;
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 descendant and self of a node or the whole structure.
 *
 * @author Mathieu Bastian
 */
public class DescendantAndSelfIterator extends DescendantIterator implements Iterator<Node>, ResetableIterator {

    public DescendantAndSelfIterator(TreeStructure treeStructure, Predicate<AbstractNode> predicate) {
        super(treeStructure, predicate);
    }

    public DescendantAndSelfIterator(TreeStructure treeStructure, AbstractNode node, Predicate<AbstractNode> predicate) {
        super(treeStructure, node, predicate);
    }

    @Override
    public void setNode(AbstractNode node) {
        nextIndex = node.getPre();
        treeSize = node.getPre() + node.size + 1;
        diffIndex = 2;
    }
}