[834] | 1 | /* |
---|
| 2 | Copyright (c) 2003-2006, Troy Aaron Johnson |
---|
| 3 | All rights reserved. |
---|
| 4 | |
---|
| 5 | Redistribution and use in source and binary forms, with or without |
---|
| 6 | modification, are permitted provided that the following conditions |
---|
| 7 | are met: |
---|
| 8 | |
---|
| 9 | * Redistributions of source code must retain the above copyright |
---|
| 10 | notice, this list of conditions and the following disclaimer. |
---|
| 11 | * Redistributions in binary form must reproduce the above copyright |
---|
| 12 | notice, this list of conditions and the following disclaimer in the |
---|
| 13 | documentation and/or other materials provided with the distribution. |
---|
| 14 | * Neither the name of Troy Aaron Johnson nor the names of any |
---|
| 15 | contributors may be used to endorse or promote products derived from |
---|
| 16 | this software without specific prior written permission. |
---|
| 17 | |
---|
| 18 | THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
---|
| 19 | AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
---|
| 20 | IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
---|
| 21 | ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE |
---|
| 22 | LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
---|
| 23 | CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
---|
| 24 | SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
---|
| 25 | INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
---|
| 26 | CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
---|
| 27 | ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
---|
| 28 | POSSIBILITY OF SUCH DAMAGE. |
---|
| 29 | */ |
---|
| 30 | |
---|
| 31 | /** Iterates through the graph visiting parents before children and does not allow changes. |
---|
| 32 | */ |
---|
| 33 | class const_preorder_iterator : public virtual const_iterator |
---|
| 34 | { |
---|
| 35 | friend class tree; |
---|
| 36 | |
---|
| 37 | private: |
---|
| 38 | |
---|
| 39 | explicit const_preorder_iterator(tree_node<N>* current) : const_iterator(current) { } |
---|
| 40 | |
---|
| 41 | public: |
---|
| 42 | |
---|
| 43 | const_preorder_iterator(void) { } |
---|
| 44 | const_preorder_iterator(const const_iterator& iter) : const_iterator(iter) { } |
---|
| 45 | |
---|
| 46 | const_preorder_iterator& operator++(void) |
---|
| 47 | { |
---|
| 48 | pre_inc(this->current, this->iter_depth); |
---|
| 49 | return *this; |
---|
| 50 | } |
---|
| 51 | |
---|
| 52 | const_preorder_iterator& operator--(void) |
---|
| 53 | { |
---|
| 54 | pre_dec(this->current, this->iter_depth); |
---|
| 55 | return *this; |
---|
| 56 | } |
---|
| 57 | |
---|
| 58 | /** Skips the children of this node and moves |
---|
| 59 | * to what would normally be the next node |
---|
| 60 | * had the children actually been visited. */ |
---|
| 61 | const_preorder_iterator& prune(void) |
---|
| 62 | { |
---|
| 63 | while (this->current->next_sibling == NULL) |
---|
| 64 | { |
---|
| 65 | this->current = this->current->parent; |
---|
| 66 | this->iter_depth--; |
---|
| 67 | if (this->current == NULL) |
---|
| 68 | return *this; |
---|
| 69 | } |
---|
| 70 | this->current = this->current->next_sibling; |
---|
| 71 | |
---|
| 72 | return *this; |
---|
| 73 | } |
---|
| 74 | }; |
---|