18#include <unordered_map>
42 std::vector<Node*>&
GetChild() {
return _child; }
43 const std::vector<Node*>&
GetChild()
const {
return _child; }
47 std::vector<Node*> _child;
58 if (!_allNode.empty())
64 _allNode.push_back(node);
77 Node* node =
new Node(v, node_parent);
78 _allNode.push_back(node);
79 node_parent->_child.push_back(node);
84 Node* node_parent =
Get(parent);
90 return Add(v, node_parent);
98 auto iter = std::find(_allNode.begin(), _allNode.end(), node);
99 if (iter == _allNode.end())
105 auto iter1 = std::find(node->_parent->_child.begin(), node->_parent->_child.end(), node);
106 if (iter1 == node->_parent->_child.end())
111 node->_parent->_child.erase(iter1);
114 for (
Node* node_child : node->_child)
116 node->_parent->_child.push_back(node_child);
117 node_child->_parent = node->_parent;
122 _allNode.erase(iter);
130 for (
Node* node : _allNode)
142 for (
Node* iter : _allNode)
175 auto& vec_child = node->_parent->
GetChild();
176 auto iter_child = std::find(vec_child.begin(), vec_child.end(), node);
177 if (iter_child == vec_child.end())
182 vec_child.erase(iter_child);
183 parent->_child.push_back(node);
184 node->_parent = parent;
192 if (_allNode.empty())
196 s.push(_allNode.front());
200 Node* node_this = s.top();
205 auto& c = node_this->_child;
206 for (
auto iter = c.rbegin(); iter != c.rend(); ++iter)
217 template<
typename T1,
typename F>
228 std::unordered_map<NTree::Node*, NTree<T>::Node*> map_ptr;
233 _allNode.push_back(node);
235 map_ptr[node_b] = node;
241 node->_parent = map_ptr[node_b->_parent];
242 for (
auto& iter : node_b->_child)
244 node->_child.push_back(map_ptr[iter]);
246 func(node_b->_v, node->_v);
247 _allNode.push_back(node);
258 if (_allNode.empty())
260 return _allNode.front();
265 return _allNode.size();
269 auto begin() {
return _allNode.begin(); }
270 auto end() {
return _allNode.end(); }
275 for (
Node* node : _allNode)
281 std::list<Node*> _allNode;
const std::vector< Node * > & GetChild() const
const T & GetValue() const
Node(const T &v, Node *parent)
std::vector< Node * > & GetChild()
void ForEach(F func)
遍历,保证父节点先遍历
const Node * GetRoot() const
返回根节点,空树返回空
Node * Get(T v)
查找,失败返回nullptr
const std::list< Node * > & GetAll()
返回所有节点
auto begin()
标准库迭代方法不保证父节点先遍历
void Copy(const NTree< T1 > &b, F func)
从另一个树填充
void SetParent(Node *node, Node *parent)
修改父节点
Node * AddRoot(const T &v)
添加根节点
Node * Add(const T &v, Node *node_parent)
添加子节点
Node * Add(const T &v, const T &parent)
size_t GetSize() const
返回总数量
void log_err0(std::string_view str, const std::source_location location=std::source_location::current())