LLVM: llvm::ImutAVLTree< ImutInfo > Class Template Reference (original) (raw)
#include "[llvm/ADT/ImmutableSet.h](ImmutableSet%5F8h%5Fsource.html)"
| Public Types | |
|---|---|
| using | key_type_ref = typename ImutInfo::key_type_ref |
| using | value_type = typename ImutInfo::value_type |
| using | value_type_ref = typename ImutInfo::value_type_ref |
| using | Factory = ImutAVLFactory |
| using | iterator = ImutAVLTreeInOrderIterator |
| Public Member Functions | |
|---|---|
| ImutAVLTree * | getLeft () const |
| Return a pointer to the left subtree. | |
| ImutAVLTree * | getRight () const |
| Return a pointer to the right subtree. | |
| unsigned | getHeight () const |
| getHeight - Returns the height of the tree. | |
| const value_type & | getValue () const |
| getValue - Returns the data value associated with the tree node. | |
| ImutAVLTree * | find (key_type_ref K) |
| find - Finds the subtree associated with the specified key value. | |
| ImutAVLTree * | getMaxElement () |
| getMaxElement - Find the subtree associated with the highest ranged key value. | |
| unsigned | size () const |
| size - Returns the number of nodes in the tree, which includes both leaves and non-leaf nodes. | |
| iterator | begin () const |
| begin - Returns an iterator that iterates over the nodes of the tree in an inorder traversal. | |
| iterator | end () const |
| end - Returns an iterator for the tree that denotes the end of an inorder traversal. | |
| bool | isElementEqual (value_type_ref V) const |
| bool | isElementEqual (const ImutAVLTree *RHS) const |
| bool | isEqual (const ImutAVLTree &RHS) const |
| isEqual - Compares two trees for structural equality and returns true if they are equal. | |
| bool | isNotEqual (const ImutAVLTree &RHS) const |
| isNotEqual - Compares two trees for structural inequality. | |
| bool | contains (key_type_ref K) |
| contains - Returns true if this tree contains a subtree (node) that has an data element that matches the specified key. | |
| unsigned | validateTree () const |
| validateTree - A utility method that checks that the balancing and ordering invariants of the tree are satisfied. | |
| void | retain () |
| void | release () |
| void | destroy () |
template
class llvm::ImutAVLTree< ImutInfo >
Definition at line 46 of file ImmutableSet.h.
◆ Factory
template
◆ iterator
template
◆ key_type_ref
template
◆ value_type
template
◆ value_type_ref
template
using llvm::ImutAVLTree< ImutInfo >::value_type_ref = typename ImutInfo::value_type_ref
◆ begin()
template
begin - Returns an iterator that iterates over the nodes of the tree in an inorder traversal.
The returned iterator thus refers to the the tree node with the minimum data element.
Definition at line 116 of file ImmutableSet.h.
Referenced by llvm::ImutAVLTree< ValInfo >::isEqual().
◆ contains()
template
contains - Returns true if this tree contains a subtree (node) that has an data element that matches the specified key.
Complexity is logarithmic in the size of the tree.
Definition at line 174 of file ImmutableSet.h.
◆ destroy()
template
◆ end()
template
◆ find()
template
◆ getHeight()
template
◆ getLeft()
template
◆ getMaxElement()
template
getMaxElement - Find the subtree associated with the highest ranged key value.
Definition at line 95 of file ImmutableSet.h.
◆ getRight()
template
◆ getValue()
template
◆ isElementEqual() [1/2]
template
◆ isElementEqual() [2/2]
template
◆ isEqual()
template
◆ isNotEqual()
template
isNotEqual - Compares two trees for structural inequality.
Performance is the same is isEqual.
Definition at line 169 of file ImmutableSet.h.
◆ release()
template
◆ retain()
template
◆ size()
template
size - Returns the number of nodes in the tree, which includes both leaves and non-leaf nodes.
Definition at line 104 of file ImmutableSet.h.
◆ validateTree()
template
validateTree - A utility method that checks that the balancing and ordering invariants of the tree are satisfied.
It is a recursive method that returns the height of the tree, which is then consumed by the enclosing validateTree call. External callers should ignore the return value. An invalid tree will cause an assertion to fire in a debug build.
Definition at line 182 of file ImmutableSet.h.
Referenced by llvm::ImutAVLTree< ValInfo >::validateTree().
◆ ImutAVLFactory< ImutInfo >
template
◆ ImutAVLTreeGenericIterator< ImutInfo >
template
◆ ImutIntervalAVLFactory< ImutInfo >
template
The documentation for this class was generated from the following file:
- include/llvm/ADT/ImmutableSet.h