2 * Copyright (c) 2011 Samsung Electronics Co., Ltd All Rights Reserved
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
8 * http://www.apache.org/licenses/LICENSE-2.0
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
16 #include <ace/TreeNode.h>
17 #include <dpl/assert.h>
18 #include <dpl/log/log.h>
20 //Tree node destructor is a tricky part, only the original tree should remove the elements
21 //release resources should be called when we want to destroy the whole tree
26 //TODO release resources is releaseTheSubtree and delete the element
27 void TreeNode::releaseResources()
31 std::list<TreeNode*>::iterator it = this->children.begin();
32 while (it != children.end()) {
33 (*it)->releaseResources();
39 int TreeNode::level = 0;
41 std::ostream & operator<<(std::ostream & out,
42 const TreeNode * node)
46 switch (node->getTypeID()) {
47 case TreeNode::Policy:
50 case TreeNode::PolicySet:
60 out << "" << tmp << "-> children count: " << node->children.size() <<
62 AbstractTreeElement * el = node->getElement();
66 std::cout << "Empty element!" << std::endl;