| [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 | /** Provides a tree node used internally by the tree template. Overhead added
|
|---|
| 32 | * to the user's node type is only five pointers, so 20 additional bytes on a
|
|---|
| 33 | * 32-bit machine.
|
|---|
| 34 | */
|
|---|
| 35 | template <class T>
|
|---|
| 36 | class tree_node
|
|---|
| 37 | {
|
|---|
| 38 | public:
|
|---|
| 39 |
|
|---|
| 40 | T data;
|
|---|
| 41 |
|
|---|
| 42 | tree_node *parent;
|
|---|
| 43 | tree_node *first_child, *last_child;
|
|---|
| 44 | tree_node *prev_sibling, *next_sibling;
|
|---|
| 45 |
|
|---|
| 46 | tree_node(void) { }
|
|---|
| 47 |
|
|---|
| 48 | tree_node(const T& data) : data(data) { }
|
|---|
| 49 | };
|
|---|