FastLED 3.9.15
Loading...
Searching...
No Matches

◆ copyTree()

template<typename T, typename Compare = less<T>, typename Allocator = allocator_slab<char>>
RBNode * fl::RedBlackTree< T, Compare, Allocator >::copyTree ( RBNode * node,
RBNode * parent = nullptr )
inlineprivate

Definition at line 250 of file rbtree.h.

250 {
251 if (node == nullptr) return nullptr;
252
253 RBNode* newNode = mAlloc.allocate(1);
254 if (newNode == nullptr) {
255 return nullptr;
256 }
257
258 mAlloc.construct(newNode, node->color, parent, node->data);
259 newNode->left = copyTree(node->left, newNode);
260 newNode->right = copyTree(node->right, newNode);
261 return newNode;
262 }
NodeAllocator mAlloc
Definition rbtree.h:64
RBNode * copyTree(RBNode *node, RBNode *parent=nullptr)
Definition rbtree.h:250

Referenced by fl::RedBlackTree< value_type, PairCompare, Allocator >::RedBlackTree(), fl::RedBlackTree< value_type, PairCompare, Allocator >::copyTree(), and fl::RedBlackTree< value_type, PairCompare, Allocator >::operator=().

+ Here is the caller graph for this function: