| add(TreeTy *T, value_type_ref V) | llvm::ImutAVLFactory< ImutInfo, Canonicalize > | inline |
| add_internal(value_type_ref V, TreeTy *T) | llvm::ImutAVLFactory< ImutInfo, Canonicalize > | inlineprotected |
| balanceTree(TreeTy *L, value_type_ref V, TreeTy *R) | llvm::ImutAVLFactory< ImutInfo, Canonicalize > | inlineprotected |
| combineTrees(TreeTy *L, TreeTy *R) | llvm::ImutAVLFactory< ImutInfo, Canonicalize > | inlineprotected |
| createNode(TreeTy *L, value_type_ref V, TreeTy *R) | llvm::ImutAVLFactory< ImutInfo, Canonicalize > | inlineprotected |
| createNode(TreeTy *newLeft, TreeTy *oldTree, TreeTy *newRight) | llvm::ImutAVLFactory< ImutInfo, Canonicalize > | inlineprotected |
| getCanonicalTree(TreeTy *TNew) | llvm::ImutAVLFactory< ImutInfo, Canonicalize > | inline |
| getEmptyTree() const | llvm::ImutAVLFactory< ImutInfo, Canonicalize > | inline |
| getHeight(TreeTy *T) const | llvm::ImutAVLFactory< ImutInfo, Canonicalize > | inlineprotected |
| getLeft(TreeTy *T) const | llvm::ImutAVLFactory< ImutInfo, Canonicalize > | inlineprotected |
| getRight(TreeTy *T) const | llvm::ImutAVLFactory< ImutInfo, Canonicalize > | inlineprotected |
| getValue(TreeTy *T) const | llvm::ImutAVLFactory< ImutInfo, Canonicalize > | inlineprotected |
| ImutAVLFactory() | llvm::ImutAVLFactory< ImutInfo, Canonicalize > | inline |
| ImutAVLFactory(BumpPtrAllocator &Alloc) | llvm::ImutAVLFactory< ImutInfo, Canonicalize > | inline |
| ImutAVLTree< ImutInfo, Canonicalize > class | llvm::ImutAVLFactory< ImutInfo, Canonicalize > | friend |
| incrementHeight(TreeTy *L, TreeTy *R) const | llvm::ImutAVLFactory< ImutInfo, Canonicalize > | inlineprotected |
| isEmpty(TreeTy *T) const | llvm::ImutAVLFactory< ImutInfo, Canonicalize > | inlineprotected |
| joinTrees(TreeTy *L, value_type_ref V, TreeTy *R) | llvm::ImutAVLFactory< ImutInfo, Canonicalize > | inlineprotected |
| maskCacheIndex(unsigned I) | llvm::ImutAVLFactory< ImutInfo, Canonicalize > | inlineprotectedstatic |
| merge_internal(TreeTy *A, TreeTy *B, CombineFn &Combine, bool KeepUnmatched, bool SkipShared) | llvm::ImutAVLFactory< ImutInfo, Canonicalize > | inlineprotected |
| mergeTrees(TreeTy *A, TreeTy *B, CombineFn Combine, bool KeepUnmatched, bool SkipShared=false) | llvm::ImutAVLFactory< ImutInfo, Canonicalize > | inline |
| recoverNodes(TreeTy *Result) | llvm::ImutAVLFactory< ImutInfo, Canonicalize > | inlineprotected |
| remove(TreeTy *T, key_type_ref V) | llvm::ImutAVLFactory< ImutInfo, Canonicalize > | inline |
| remove_internal(key_type_ref K, TreeTy *T) | llvm::ImutAVLFactory< ImutInfo, Canonicalize > | inlineprotected |
| removeMinBinding(TreeTy *T, TreeTy *&Noderemoved) | llvm::ImutAVLFactory< ImutInfo, Canonicalize > | inlineprotected |
| splitLookup(TreeTy *T, key_type_ref K, TreeTy *&L, const value_type *&Match, TreeTy *&R) | llvm::ImutAVLFactory< ImutInfo, Canonicalize > | inlineprotected |
| transformTree(TreeTy *T, CombineFn &Combine, bool FromB) | llvm::ImutAVLFactory< ImutInfo, Canonicalize > | inlineprotected |
| unionTrees(TreeTy *A, TreeTy *B) | llvm::ImutAVLFactory< ImutInfo, Canonicalize > | inline |
| ~ImutAVLFactory() | llvm::ImutAVLFactory< ImutInfo, Canonicalize > | inline |
1.14.0