reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
128 Node *Left = nullptr, *Right = nullptr; 131 Node *Root = nullptr; 136 void erase(const Node *N) { 140 void order(SmallVectorImpl<Node*> &Seq) const { 143 SmallVector<Node*,8> nodesWith(int32_t P, bool CheckAlign = true) { 144 SmallVector<Node*,8> Nodes; 150 SmallVector<Node*,8> Nodes; 152 for (Node *N : Nodes) 157 void dump(const Node *N) const; 158 void order(Node *N, SmallVectorImpl<Node*> &Seq) const; 158 void order(Node *N, SmallVectorImpl<Node*> &Seq) const; 159 void nodesWith(Node *N, int32_t P, bool CheckA, 160 SmallVectorImpl<Node*> &Seq) const; 162 Node *add(Node *N, const OffsetRange &R); 162 Node *add(Node *N, const OffsetRange &R); 163 Node *remove(Node *N, const Node *D); 163 Node *remove(Node *N, const Node *D); 163 Node *remove(Node *N, const Node *D); 164 Node *rotateLeft(Node *Lower, Node *Higher); 164 Node *rotateLeft(Node *Lower, Node *Higher); 164 Node *rotateLeft(Node *Lower, Node *Higher); 165 Node *rotateRight(Node *Lower, Node *Higher); 165 Node *rotateRight(Node *Lower, Node *Higher); 165 Node *rotateRight(Node *Lower, Node *Higher); 166 unsigned height(Node *N) { 169 Node *update(Node *N) { 169 Node *update(Node *N) { 178 Node *rebalance(Node *N) { 178 Node *rebalance(Node *N) { 585 LLVM_DUMP_METHOD void RangeTree::dump(const Node *N) const { 601 void RangeTree::order(Node *N, SmallVectorImpl<Node*> &Seq) const { 601 void RangeTree::order(Node *N, SmallVectorImpl<Node*> &Seq) const { 609 void RangeTree::nodesWith(Node *N, int32_t P, bool CheckA, 610 SmallVectorImpl<Node*> &Seq) const { 621 RangeTree::Node *RangeTree::add(Node *N, const OffsetRange &R) { 621 RangeTree::Node *RangeTree::add(Node *N, const OffsetRange &R) { 623 return new Node(R); 637 RangeTree::Node *RangeTree::remove(Node *N, const Node *D) { 637 RangeTree::Node *RangeTree::remove(Node *N, const Node *D) { 637 RangeTree::Node *RangeTree::remove(Node *N, const Node *D) { 656 Node *M = N->Left; 664 RangeTree::Node *RangeTree::rotateLeft(Node *Lower, Node *Higher) { 664 RangeTree::Node *RangeTree::rotateLeft(Node *Lower, Node *Higher) { 664 RangeTree::Node *RangeTree::rotateLeft(Node *Lower, Node *Higher) { 679 RangeTree::Node *RangeTree::rotateRight(Node *Lower, Node *Higher) { 679 RangeTree::Node *RangeTree::rotateRight(Node *Lower, Node *Higher) { 679 RangeTree::Node *RangeTree::rotateRight(Node *Lower, Node *Higher) { 1328 using CandData = std::pair<unsigned, SmallVector<RangeTree::Node*,8>>; 1334 SmallVector<RangeTree::Node*,8> Nodes; 1339 for (RangeTree::Node *N : Nodes) { 1355 for (RangeTree::Node *N : Nodes) { 1396 for (RangeTree::Node *N : Tree.nodesWith(Best)) {