#ifdef NOTDEF
TL - please see comment in AsynchTree.idl

#include "api1/Cipres.idl"
/* 
	This interface is implemented by AsyncTreeInfer to give access to
	a progressively growing stack of trees, e.g. as a result of a markov chain.
	
	$Id$ 
*/

/*
module CipresIDL_api1 {
	interface TreeIterator : Scriptable, LifeCycle {
		
		/* accessors */
		Tree getFirstTree();
		Tree getLastTree();
		Tree getNextTree();
		Tree getPreviousTree();
		Tree getTreeByIndex(in long whichTree); // zero-based
		
		/* stack operations */
		Tree pop();                       // removes and returns last item on stack
		void push(in Tree treeParam);	  // adds another item to the end of the stack	
		Tree shift();                     // removes and returns first item on stack
		void unshift(in Tree treeParam);  // adds another item to the front of the stack
		
		/* 
		long i;
		for ( i = 0; i < TreeIterator.getNumTrees(); i++ ) {
			Tree t = TreeIterator.getTreeByIndex(i);
		}
		*/
		long getNumTrees();
		
				
		/*
		i = 0;
		while ( TreeIterator.exists(i) ) {
			Tree t = TreeIterator.getTreeByIndex(i);      			
      			i++;
		}
		*/
		boolean exists(in long whichTree);

	};
};
*/
#endif