reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
81 if (Root) { Root->retain(); } 81 if (Root) { Root->retain(); } 84 ImmutableMap(const ImmutableMap &X) : Root(X.Root) { 85 if (Root) { Root->retain(); } 85 if (Root) { Root->retain(); } 89 if (Root) { Root->release(); } 89 if (Root) { Root->release(); } 93 if (Root != X.Root) { 93 if (Root != X.Root) { 94 if (X.Root) { X.Root->retain(); } 94 if (X.Root) { X.Root->retain(); } 95 if (Root) { Root->release(); } 95 if (Root) { Root->release(); } 96 Root = X.Root; 96 Root = X.Root; 118 TreeTy *T = F.add(Old.Root, std::pair<key_type,data_type>(K,D)); 123 TreeTy *T = F.remove(Old.Root,K); 133 return Root ? Root->contains(K) : false; 133 return Root ? Root->contains(K) : false; 137 return Root && RHS.Root ? Root->isEqual(*RHS.Root) : Root == RHS.Root; 137 return Root && RHS.Root ? Root->isEqual(*RHS.Root) : Root == RHS.Root; 137 return Root && RHS.Root ? Root->isEqual(*RHS.Root) : Root == RHS.Root; 137 return Root && RHS.Root ? Root->isEqual(*RHS.Root) : Root == RHS.Root; 137 return Root && RHS.Root ? Root->isEqual(*RHS.Root) : Root == RHS.Root; 137 return Root && RHS.Root ? Root->isEqual(*RHS.Root) : Root == RHS.Root; 141 return Root && RHS.Root ? Root->isNotEqual(*RHS.Root) : Root != RHS.Root; 141 return Root && RHS.Root ? Root->isNotEqual(*RHS.Root) : Root != RHS.Root; 141 return Root && RHS.Root ? Root->isNotEqual(*RHS.Root) : Root != RHS.Root; 141 return Root && RHS.Root ? Root->isNotEqual(*RHS.Root) : Root != RHS.Root; 141 return Root && RHS.Root ? Root->isNotEqual(*RHS.Root) : Root != RHS.Root; 141 return Root && RHS.Root ? Root->isNotEqual(*RHS.Root) : Root != RHS.Root; 145 if (Root) { Root->retain(); } 145 if (Root) { Root->retain(); } 146 return Root; 149 TreeTy *getRootWithoutRetain() const { return Root; } 152 if (Root) Root->retain(); 152 if (Root) Root->retain(); 156 if (Root) Root->release(); 156 if (Root) Root->release(); 159 bool isEmpty() const { return !Root; } 185 if (Root) { 187 Root->foreach(CB); 193 if (Root) { 195 Root->foreach(CB); 203 void verify() const { if (Root) Root->verify(); } 203 void verify() const { if (Root) Root->verify(); } 220 iterator begin() const { return iterator(Root); } 224 if (Root) { 225 TreeTy* T = Root->find(K); 236 return Root ? &(Root->getMaxElement()->getValue()) : nullptr; 236 return Root ? &(Root->getMaxElement()->getValue()) : nullptr; 243 unsigned getHeight() const { return Root ? Root->getHeight() : 0; } 243 unsigned getHeight() const { return Root ? Root->getHeight() : 0; } 246 ID.AddPointer(M.Root);