|
LLVM 24.0.0git
|
#include "llvm/ADT/ImmutableSet.h"
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<ImutInfo, Canonicalize> |
| using | iterator = ImutAVLTreeInOrderIterator<ImutInfo, Canonicalize> |
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 |
| Returns the height of the tree. A tree with no subtrees has a height of 1. | |
| const value_type & | getValue () const |
| Returns the data value associated with the tree node. | |
| ImutAVLTree * | find (key_type_ref K) |
| Finds the subtree associated with the specified key value. | |
| ImutAVLTree * | getMaxElement () |
| Find the subtree associated with the highest ranged key value. | |
| unsigned | size () const |
| Returns the number of nodes in the tree, which includes both leaves and. | |
| iterator | begin () const |
| Returns an iterator that iterates over the nodes of the tree in an inorder traversal. | |
| iterator | end () const |
| 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 |
| Compares two trees for structural equality and returns true if they are equal. | |
| bool | isNotEqual (const ImutAVLTree &RHS) const |
| Compares two trees for structural inequality. | |
| bool | contains (key_type_ref K) |
| Returns true if this tree contains a subtree (node) that has an data element that matches the specified key. | |
| unsigned | validateTree () const |
| A utility method that checks that the balancing and ordering invariants of the tree are satisfied. | |
| void | retain () |
| void | release () |
| LLVM_ATTRIBUTE_NOINLINE void | destroy () |
Friends | |
| class | ImutAVLFactory< ImutInfo, Canonicalize > |
Definition at line 75 of file ImmutableSet.h.
| using llvm::ImutAVLTree< ImutInfo, Canonicalize >::Factory = ImutAVLFactory<ImutInfo, Canonicalize> |
Definition at line 82 of file ImmutableSet.h.
| using llvm::ImutAVLTree< ImutInfo, Canonicalize >::iterator = ImutAVLTreeInOrderIterator<ImutInfo, Canonicalize> |
Definition at line 83 of file ImmutableSet.h.
| using llvm::ImutAVLTree< ImutInfo, Canonicalize >::key_type_ref = typename ImutInfo::key_type_ref |
Definition at line 79 of file ImmutableSet.h.
| using llvm::ImutAVLTree< ImutInfo, Canonicalize >::value_type = typename ImutInfo::value_type |
Definition at line 80 of file ImmutableSet.h.
| using llvm::ImutAVLTree< ImutInfo, Canonicalize >::value_type_ref = typename ImutInfo::value_type_ref |
Definition at line 81 of file ImmutableSet.h.
|
inline |
Returns an iterator that iterates over the nodes of the tree in an inorder traversal.
The returned iterator thus refers to the tree node with the minimum data element.
Definition at line 144 of file ImmutableSet.h.
Referenced by llvm::ImutAVLTree< ValInfo, Canonicalize >::isEqual().
|
inline |
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 202 of file ImmutableSet.h.
|
inline |
Definition at line 357 of file ImmutableSet.h.
Referenced by llvm::ImutAVLFactory< ImutInfo, Canonicalize >::getCanonicalTree(), and llvm::ImutAVLTree< ValInfo, Canonicalize >::release().
|
inline |
Returns an iterator for the tree that denotes the end of an inorder traversal.
Definition at line 148 of file ImmutableSet.h.
Referenced by llvm::ImutAVLTree< ValInfo, Canonicalize >::isEqual().
|
inline |
Finds the subtree associated with the specified key value.
This method returns NULL if no matching subtree is found.
Definition at line 108 of file ImmutableSet.h.
Referenced by llvm::ImutAVLTree< ValInfo, Canonicalize >::contains().
|
inline |
Returns the height of the tree. A tree with no subtrees has a height of 1.
Definition at line 101 of file ImmutableSet.h.
Referenced by llvm::ImutAVLTree< ValInfo, Canonicalize >::validateTree().
|
inline |
Return a pointer to the left subtree.
This value is NULL if there is no left subtree.
Definition at line 94 of file ImmutableSet.h.
Referenced by llvm::ImutAVLTree< ValInfo, Canonicalize >::size(), and llvm::ImutAVLTree< ValInfo, Canonicalize >::validateTree().
|
inline |
Find the subtree associated with the highest ranged key value.
Definition at line 123 of file ImmutableSet.h.
|
inline |
Return a pointer to the right subtree.
This value is NULL if there is no right subtree.
Definition at line 98 of file ImmutableSet.h.
Referenced by llvm::ImutAVLTree< ValInfo, Canonicalize >::size(), and llvm::ImutAVLTree< ValInfo, Canonicalize >::validateTree().
|
inline |
Returns the data value associated with the tree node.
Definition at line 104 of file ImmutableSet.h.
Referenced by llvm::ImutAVLTree< ValInfo, Canonicalize >::isElementEqual(), and llvm::ImutAVLTree< ValInfo, Canonicalize >::validateTree().
|
inline |
Definition at line 164 of file ImmutableSet.h.
|
inline |
Definition at line 150 of file ImmutableSet.h.
Referenced by llvm::ImutAVLTree< ValInfo, Canonicalize >::isElementEqual(), and llvm::ImutAVLTree< ValInfo, Canonicalize >::isEqual().
|
inline |
Compares two trees for structural equality and returns true if they are equal.
The worst case performance of this operation is linear in the sizes of the trees.
Definition at line 171 of file ImmutableSet.h.
Referenced by llvm::ImutAVLFactory< ImutInfo, Canonicalize >::getCanonicalTree(), and llvm::ImutAVLTree< ValInfo, Canonicalize >::isNotEqual().
|
inline |
Compares two trees for structural inequality.
Performance is the same as isEqual.
Definition at line 197 of file ImmutableSet.h.
|
inline |
Definition at line 351 of file ImmutableSet.h.
|
inline |
Definition at line 349 of file ImmutableSet.h.
|
inline |
Returns the number of nodes in the tree, which includes both leaves and.
Definition at line 132 of file ImmutableSet.h.
|
inline |
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 209 of file ImmutableSet.h.
Referenced by llvm::ImutAVLTree< ValInfo, Canonicalize >::validateTree().
|
friend |
Definition at line 69 of file ImmutableSet.h.