|
FastLED 3.9.15
|
#include <rbtree.h>
Inheritance diagram for fl::RedBlackTree< T, Compare, Allocator >:
Collaboration diagram for fl::RedBlackTree< T, Compare, Allocator >:Classes | |
| class | const_iterator |
| class | iterator |
| struct | RBNode |
Public Types | |
| using | allocator_type = Allocator |
| enum | Color { RED , BLACK } |
| using | compare_type = Compare |
| using | const_pointer = const value_type* |
| using | const_reference = const value_type& |
| using | difference_type = ptrdiff_t |
| using | pointer = value_type* |
| using | reference = value_type& |
| using | size_type = fl::size |
| using | value_type = T |
Private Types | |
| using | NodeAllocator = typename Allocator::template rebind<RBNode>::other |
Private Member Functions | |
| RBNode * | copyTree (RBNode *node, RBNode *parent=nullptr) |
| void | deleteFixup (RBNode *x, RBNode *xParent) |
| void | destroyTree (RBNode *node) |
| RBNode * | findNode (const value_type &value) const |
| void | insertFixup (RBNode *z) |
| template<typename U> | |
| fl::pair< iterator, bool > | insertImpl (U &&value) |
| RBNode * | lowerBoundNode (const value_type &value) const |
| RBNode * | maximum (RBNode *x) const |
| RBNode * | minimum (RBNode *x) const |
| void | rotateLeft (RBNode *x) |
| void | rotateRight (RBNode *x) |
| void | transplant (RBNode *u, RBNode *v) |
| RBNode * | upperBoundNode (const value_type &value) const |
Private Attributes | |
| NodeAllocator | alloc_ |
| Compare | comp_ |
| RBNode * | root_ |
| fl::size | size_ |