| 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 nodes that have the same parent and does not
|
|---|
| 32 | * allow changes.
|
|---|
| 33 | */
|
|---|
| 34 | class const_sibling_iterator : public virtual const_iterator
|
|---|
| 35 | {
|
|---|
| 36 | friend class tree;
|
|---|
| 37 |
|
|---|
| 38 | private:
|
|---|
| 39 |
|
|---|
| 40 | explicit const_sibling_iterator(tree_node<N>* current) : const_iterator(current) { }
|
|---|
| 41 |
|
|---|
| 42 | public:
|
|---|
| 43 |
|
|---|
| 44 | const_sibling_iterator(void) { }
|
|---|
| 45 | const_sibling_iterator(const const_iterator& iter) : const_iterator(iter) { }
|
|---|
| 46 |
|
|---|
| 47 | const_sibling_iterator& operator++(void)
|
|---|
| 48 | {
|
|---|
| 49 | sib_inc(this->current);
|
|---|
| 50 | return *this;
|
|---|
| 51 | }
|
|---|
| 52 |
|
|---|
| 53 | const_sibling_iterator operator ++ (int)
|
|---|
| 54 | {
|
|---|
| 55 | const_sibling_iterator tmp(*this);
|
|---|
| 56 | sib_inc(this->current);
|
|---|
| 57 | return tmp;
|
|---|
| 58 | }
|
|---|
| 59 |
|
|---|
| 60 | const_sibling_iterator& operator--(void)
|
|---|
| 61 | {
|
|---|
| 62 | sib_dec(this->current);
|
|---|
| 63 | return *this;
|
|---|
| 64 | }
|
|---|
| 65 |
|
|---|
| 66 | const_sibling_iterator operator -- (int)
|
|---|
| 67 | {
|
|---|
| 68 | const_sibling_iterator tmp(*this);
|
|---|
| 69 | sib_dec(this->current);
|
|---|
| 70 | return tmp;
|
|---|
| 71 | }
|
|---|
| 72 |
|
|---|
| 73 | const_sibling_iterator operator + (unsigned int n) const
|
|---|
| 74 | {
|
|---|
| 75 | const_sibling_iterator i(*this);
|
|---|
| 76 |
|
|---|
| 77 | while (n-- > 0)
|
|---|
| 78 | ++i;
|
|---|
| 79 |
|
|---|
| 80 | return i;
|
|---|
| 81 | }
|
|---|
| 82 |
|
|---|
| 83 | const_sibling_iterator operator - (unsigned int n) const
|
|---|
| 84 | {
|
|---|
| 85 | const_sibling_iterator i(*this);
|
|---|
| 86 |
|
|---|
| 87 | while (n-- > 0)
|
|---|
| 88 | --i;
|
|---|
| 89 |
|
|---|
| 90 | return i;
|
|---|
| 91 | }
|
|---|
| 92 | };
|
|---|