Class BasicNodeTreeIterator

    • Method Summary

      All Methods Instance Methods Concrete Methods 
      Modifier and Type Method Description
      protected void afterAdvance()  
      boolean hasNext()  
      boolean hasPrevious()
      Returns true if this bidi iterator has more elements when traversing in the reverse direction.
      AbstractNode next()
      AbstractNode previous()
      Returns the previous element.
      void prune()  
      • Methods inherited from class com.google.common.collect.UnmodifiableIterator

        remove
      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
      • Methods inherited from interface java.util.Iterator

        forEachRemaining, remove
    • Constructor Detail

      • BasicNodeTreeIterator

        protected BasicNodeTreeIterator​(AbstractNode root)
    • Method Detail

      • hasNext

        public boolean hasNext()
        Specified by:
        hasNext in interface java.util.Iterator<AbstractNode>
      • afterAdvance

        protected void afterAdvance()
      • hasPrevious

        public boolean hasPrevious()
        Description copied from interface: BidiIterator
        Returns true if this bidi iterator has more elements when traversing in the reverse direction. (In other words, returns true if previous would return an element rather than throwing an exception.)
        Specified by:
        hasPrevious in interface BidiIterator<AbstractNode>
        Returns:
        true if the bidi iterator has more elements when traversing in the reverse direction.
      • previous

        public AbstractNode previous()
        Description copied from interface: BidiTreeIterator
        Returns the previous element. This method may be called repeatedly to iterate backwards, or intermixed with calls to next to go back and forth. (Note that alternating calls to next and previous will return the same element repeatedly.)

        Intermixed calls to BidiTreeIterator.next() and BidiTreeIterator.previous() may not lead to the very same element since the iterator does not return the parent element when its done with its children but the next sibling of the parent.

        Specified by:
        previous in interface BidiIterator<AbstractNode>
        Specified by:
        previous in interface BidiTreeIterator<AbstractNode>
        Returns:
        the previous element.
      • prune

        public void prune()
        Specified by:
        prune in interface org.eclipse.emf.common.util.TreeIterator<AbstractNode>