aud.BinarySearchTree.RangeIterator Class Reference

Iterator over Range. More...

Inheritance diagram for aud.BinarySearchTree.RangeIterator:

Collaboration diagram for aud.BinarySearchTree.RangeIterator:

Public Member Functions
boolean	hasNext ()
Cursor	next ()
void	remove ()
	not implemented More...

Detailed Description

Iterator over Range.

Implementation is based on Node#next.

Definition at line 491 of file BinarySearchTree.java.

Member Function Documentation

hasNext()

boolean aud.BinarySearchTree.RangeIterator.hasNext

(

)

Definition at line 500 of file BinarySearchTree.java.

                                       {
      return node_!=range_.end_;
    }

next()

Cursor aud.BinarySearchTree.RangeIterator.next

(

)

Definition at line 504 of file BinarySearchTree.java.

                                   {
      assert(node_!=null);
      Node cur=node_;
      node_=node_.next();
      return new Cursor(cur);
    }

remove()

void aud.BinarySearchTree.RangeIterator.remove

(

)

not implemented

Exceptions

UnsupportedOperationException

Definition at line 513 of file BinarySearchTree.java.

                                   {
      throw new UnsupportedOperationException();
    }

---

The documentation for this class was generated from the following file:

• BinarySearchTree.java