reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
279 if (Root) { 280 Root->retain(); 288 if (Root) { Root->retain(); } 288 if (Root) { Root->retain(); } 291 ImmutableMapRef(const ImmutableMapRef &X) : Root(X.Root), Factory(X.Factory) { 292 if (Root) { 293 Root->retain(); 298 if (Root) 299 Root->release(); 303 if (Root != X.Root) { 303 if (Root != X.Root) { 304 if (X.Root) 305 X.Root->retain(); 307 if (Root) 308 Root->release(); 310 Root = X.Root; 310 Root = X.Root; 321 if (Root) Root->retain(); 321 if (Root) Root->retain(); 325 if (Root) Root->release(); 325 if (Root) Root->release(); 329 TreeTy *NewT = Factory->add(Root, std::pair<key_type, data_type>(K, D)); 334 TreeTy *NewT = Factory->remove(Root, K); 339 return Root ? Root->contains(K) : false; 339 return Root ? Root->contains(K) : false; 343 return ImmutableMap<KeyT, ValT>(Factory->getCanonicalTree(Root)); 347 return Root && RHS.Root ? Root->isEqual(*RHS.Root) : Root == RHS.Root; 347 return Root && RHS.Root ? Root->isEqual(*RHS.Root) : Root == RHS.Root; 347 return Root && RHS.Root ? Root->isEqual(*RHS.Root) : Root == RHS.Root; 351 return Root && RHS.Root ? Root->isNotEqual(*RHS.Root) : Root != RHS.Root; 351 return Root && RHS.Root ? Root->isNotEqual(*RHS.Root) : Root != RHS.Root; 351 return Root && RHS.Root ? Root->isNotEqual(*RHS.Root) : Root != RHS.Root; 354 bool isEmpty() const { return !Root; } 361 if (Root) 362 Root->verify(); 380 iterator begin() const { return iterator(Root); } 384 if (Root) { 385 TreeTy* T = Root->find(K); 396 return Root ? &(Root->getMaxElement()->getValue()) : 0; 396 return Root ? &(Root->getMaxElement()->getValue()) : 0; 403 unsigned getHeight() const { return Root ? Root->getHeight() : 0; } 403 unsigned getHeight() const { return Root ? Root->getHeight() : 0; }