/**
Copyright (C) SYSTAP, LLC DBA Blazegraph 2006-2016. All rights reserved.
Contact:
SYSTAP, LLC DBA Blazegraph
2501 Calvert ST NW #106
Washington, DC 20008
licenses@blazegraph.com
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; version 2 of the License.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
package com.bigdata.btree;
import java.util.Iterator;
/**
* Interface for a node or a leaf of a B+-Tree.
*
* @author <a href="mailto:thompsonbry@users.sourceforge.net">Bryan Thompson</a>
* @version $Id$
*/
public interface IAbstractNode {
/**
* Traversal of index values in key order.
*/
public ITupleIterator entryIterator();
/**
* Post-order traveral of nodes and leaves in the tree. For any given
* node, its children are always visited before the node itself (hence
* the node occurs in the post-order position in the traveral). The
* iterator is NOT safe for concurrent modification.
*
* @return Iterator visiting {@link IAbstractNode}s.
*/
public Iterator<AbstractNode> postOrderNodeIterator();
}