| 854 | } |
| 855 | |
| 856 | bool Node::inNodeTree( Node* node ) const { |
| 857 | if ( this == node ) { |
| 858 | return true; |
| 859 | } else { |
| 860 | Node* child = mChild; |
| 861 | while ( NULL != child ) { |
| 862 | if ( child->inNodeTree( node ) ) |
| 863 | return true; |
| 864 | child = child->mNext; |
| 865 | } |
| 866 | } |
| 867 | |
| 868 | return false; |
| 869 | } |
| 870 | |
| 871 | bool Node::isChild( Node* child ) const { |
| 872 | Node* childLoop = mChild; |