61     class Iter;  variable
68     Iter insert(const T& t);
88     Iter begin();
94     Iter end();
99     Iter last();
106     Iter find(const T& t);
113     Iter findFirst(const T& t);
120     Iter findLast(const T& t);
134     void remove(const Iter& iter) { deleteAtNode(iter.fN); }  in remove()
189 class GrRedBlackTree<T,C>::Iter {
191     Iter() {};  in Iter()  function
192     Iter(const Iter& i) {fN = i.fN; fTree = i.fTree;}  in Iter()  function
193     Iter& operator =(const Iter& i) {
201     bool operator ==(const Iter& i) const {
204     bool operator !=(const Iter& i) const { return !(*this == i); }
205     Iter& operator ++() {
210     Iter& operator --() {
222     explicit Iter(Node* n, GrRedBlackTree* tree) {  in Iter()  function
245 typename GrRedBlackTree<T,C>::Iter GrRedBlackTree<T,C>::begin() {  in begin()
246     return Iter(fFirst, this);  in begin()
250 typename GrRedBlackTree<T,C>::Iter GrRedBlackTree<T,C>::end() {  in end()
251     return Iter(NULL, this);  in end()
255 typename GrRedBlackTree<T,C>::Iter GrRedBlackTree<T,C>::last() {  in last()
256     return Iter(fLast, this);  in last()
260 typename GrRedBlackTree<T,C>::Iter GrRedBlackTree<T,C>::find(const T& t) {  in find()
267                 return Iter(n, this);  in find()
276 typename GrRedBlackTree<T,C>::Iter GrRedBlackTree<T,C>::findFirst(const T& t) {  in findFirst()
292     return Iter(leftMost, this);  in findFirst()
296 typename GrRedBlackTree<T,C>::Iter GrRedBlackTree<T,C>::findLast(const T& t) {  in findLast()
310     return Iter(rightMost, this);  in findLast()
348 typename GrRedBlackTree<T,C>::Iter GrRedBlackTree<T,C>::insert(const T& t) {  in insert()
389         return Iter(returnNode, this);  in insert()
408             return Iter(returnNode, this);  in insert()
432                 return Iter(returnNode, this);  in insert()
485     return Iter(returnNode, this);  in insert()
958     typedef GrRedBlackTree<int>::Iter iter;  in UnitTest()
966         Iter xi = tree.insert(x);  in UnitTest()
984     for (Iter a = tree.begin(); tree.end() != a; ++a) {  in UnitTest()
985         Iter b = a;  in UnitTest()
1000         Iter iter = tree.findFirst(i);  in UnitTest()
1030             Iter iter;  in UnitTest()
1078     for (Iter a = tree.begin(); tree.end() != a; ++a) {  in UnitTest()
1079         Iter b = a;  in UnitTest()
1091         Iter iter = tree.findFirst(i);  in UnitTest()