1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357
|
//////////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////////
//
// copyright : (C) 2008 by Eran Ifrah
// file name : tree_node.h
//
// -------------------------------------------------------------------------
// A
// _____ _ _ _ _
// / __ \ | | | | (_) |
// | / \/ ___ __| | ___| | _| |_ ___
// | | / _ \ / _ |/ _ \ | | | __/ _ )
// | \__/\ (_) | (_| | __/ |___| | || __/
// \____/\___/ \__,_|\___\_____/_|\__\___|
//
// F i l e
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
//////////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////////
#ifndef CODELITE_TREE_NODE_H
#define CODELITE_TREE_NODE_H
#include <map>
#include <iostream>
#include <vector>
template <class TKey, class TData>
class TreeNode
{
TKey m_key;
TData m_data;
TreeNode* m_parent;
std::map<TreeNode*, TreeNode*> m_childs;
typename std::map<TreeNode*, TreeNode*>::iterator m_pos;
public:
/**
* Constructor, constructs a tree node with key and data.
* If parent is left NULL, node is assumed to be root.
* \param key Node key, must have operator =, <
* \param data Node data, this class must have operator=
* \param parent Parent node
*/
TreeNode(const TKey& key, const TData& data, TreeNode* parent = NULL);
/**
* Destructor, deletes this node and all its children.
*/
virtual ~TreeNode();
//---------------------------------------------------
// Setters / Getters
//---------------------------------------------------
/**
* Get node data.
* \return node data
*/
TData& GetData()
{
return m_data;
};
/**
* Get node key.
* \return key
*/
TKey& GetKey()
{
return m_key;
};
/**
* Set node data.
* \param data data
*/
void SetData(const TData& data)
{
m_data = data;
};
/**
* Set node key.
* \param key Key
*/
void SetKey(const TKey& key)
{
m_key = key;
};
/**
* Return the parent node of this node (or null if root).
* \return pointer to parent node
*/
TreeNode* GetParent()
{
return m_parent;
}
//---------------------------------------------
// Misc
//---------------------------------------------
/**
* Print the tree to stream (default is stdout).
*/
void Print(std::ostream& stream = std::cout , int depth = 0);
/**
* Check if this node is root.
* \return true if node is root
*/
bool IsRoot() const
{
return m_parent == NULL;
};
//----------------------------------------------
// Operations
//----------------------------------------------
/**
* Add new child node to this node.
* Duplicate nodes are allowed. However, Remove() will remove the first occurance of a node by a given key.
* \param key Node key
* \param data Node data
* \return newly added node
*/
TreeNode* AddChild(const TKey& key, const TData& data) ;
/**
* \brief Append new child to this tree node
* \param newNode node to append, must be allocated on the heap
* \return the newly added tree node
*/
TreeNode* AddChild(TreeNode* newNode);
/**
* Remove first occurance of node with a given key.
* If the node to be removed is the root, a std::exception* is thrown, which must be deleted by caller.
* Remove does not delete the memory allocated for the node. The user must delete the removed node.
* \param key Node key
* \return removed node
*/
TreeNode* Remove(const TKey& key);
/**
* Find a node by a key.
* \param key Node key
* \return node, or NULL if non exist
*/
TreeNode* Find(const TKey& key) ;
/**
* Set the pointer to the first child of this node .
*/
void First();
/**
* Return the next child of this node.
*/
TreeNode* Next();
/**
* Test if this node has more childs.
* This call is usually used before issuing a Next() call.
* \return true if the next call to Next() will return a valid child pointer
*/
bool HasMore();
std::map<TreeNode*, TreeNode*>& GetChilds() { return m_childs; }
};
template <class TKey, class TData>
TreeNode<TKey, TData>::TreeNode(const TKey& key, const TData& data, TreeNode* parent)
: m_key(key), m_data(data), m_parent(parent)
{
}
template <class TKey, class TData>
TreeNode<TKey, TData>::~TreeNode()
{
typename std::map<TreeNode*, TreeNode*>::iterator iter = m_childs.begin();
for(; iter != m_childs.end(); iter++)
{
delete iter->second;
}
m_childs.clear();
}
template <class TKey, class TData>
TreeNode<TKey, TData>* TreeNode<TKey, TData>::AddChild(const TKey& key, const TData& data)
{
TreeNode* newNode = new TreeNode(key, data, this);
m_childs[newNode] = newNode;
return newNode;
}
template <class TKey, class TData>
TreeNode<TKey, TData>* TreeNode<TKey, TData>::AddChild(TreeNode* newNode)
{
m_childs[newNode] = newNode;
return newNode;
}
template <class TKey, class TData>
TreeNode<TKey, TData>* TreeNode<TKey, TData>::Remove(const TKey& key)
{
TreeNode* node = Find(key);
if( node )
{
if(NULL == node->m_parent)
{
// Cant remove root
return NULL;
}
typename std::map<TreeNode*, TreeNode*>::iterator iter = node->m_parent->m_childs.find(node);
if(iter != node->m_parent->m_childs.end())
node->m_parent->m_childs.erase(iter);
return node;
}
return NULL;
}
template <class TKey, class TData>
TreeNode<TKey, TData>* TreeNode<TKey, TData>::Find(const TKey& key)
{
if(m_key == key)
return this;
typename std::map<TreeNode*, TreeNode*>::iterator iter;
// Scan first the childs of this node
for(iter = m_childs.begin(); iter != m_childs.end(); iter++)
{
if(((TreeNode*)iter->second)->GetKey() == key)
return iter->second;
}
// Scan level below
for(iter = m_childs.begin(); iter != m_childs.end(); iter++)
{
TreeNode* node = NULL;
node = iter->second->Find(key);
if(node) return node;
}
return NULL;
}
template <class TKey, class TData>
void TreeNode<TKey, TData>::Print(std::ostream& stream, int depth)
{
std::string tab = " ";
for(int i=0; i<depth; i++)
tab += " ";
stream << tab.c_str() << m_key << std::endl;
depth++;
typename std::map<TreeNode*, TreeNode*>::iterator iter = m_childs.begin();
for(; iter != m_childs.end(); iter++)
iter->second->Print(stream, depth);
}
/// Prepare for tree iteration in the current node
template <class TKey, class TData>
void TreeNode<TKey, TData>::First()
{
m_pos = m_childs.begin();
}
template <class TKey, class TData>
TreeNode<TKey, TData>* TreeNode<TKey, TData>::Next()
{
if(!HasMore())
return NULL;
TreeNode* nextElem = m_pos->second;
m_pos++;
return nextElem;
}
template <class TKey, class TData>
bool TreeNode<TKey, TData>::HasMore()
{
return (m_pos != m_childs.end());
}
//----------------------------------------------------------------
// TreeWalker class
//----------------------------------------------------------------
template <class TKey, class TData>
class TreeWalker
{
private:
void GetChildren(TreeNode<TKey, TData>* node);
std::vector<TreeNode<TKey, TData>* > m_children;
size_t m_pos;
public:
TreeWalker(TreeNode<TKey, TData>* node);
virtual ~TreeWalker();
bool End();
void operator++(int);
TreeNode<TKey, TData>* GetNode()
{
if(m_pos < m_children.size())
return m_children[m_pos];
return NULL;
}
};
template <class TKey, class TData>
TreeWalker<TKey, TData>::TreeWalker(TreeNode<TKey, TData>* node)
: m_pos(0)
{
m_children.push_back(node);
GetChildren(node);
}
template <class TKey, class TData>
TreeWalker<TKey, TData>::~TreeWalker()
{
}
template <class TKey, class TData>
void TreeWalker<TKey, TData>::GetChildren(TreeNode<TKey, TData>* node)
{
if(node == NULL)
return;
typename std::map<TreeNode<TKey, TData>*, TreeNode<TKey, TData>*>::iterator iter = node->GetChilds().begin();
for(; iter != node->GetChilds().end(); iter++)
{
m_children.push_back(iter->second);
GetChildren(iter->second);
}
}
template <class TKey, class TData>
bool TreeWalker<TKey, TData>::End()
{
return m_pos == m_children.size();
}
template <class TKey, class TData>
void TreeWalker<TKey, TData>::operator++(int)
{
m_pos++;
}
#endif // CODELITE_TREE_NODE_H
|