reference, declarationdefinition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced

References

include/llvm/ADT/ImmutableSet.h
  973     if (Root) { Root->retain(); }
  973     if (Root) { Root->retain(); }
  976   ImmutableSet(const ImmutableSet &X) : Root(X.Root) {
  977     if (Root) { Root->retain(); }
  977     if (Root) { Root->retain(); }
  981     if (Root) { Root->release(); }
  981     if (Root) { Root->release(); }
  985     if (Root != X.Root) {
  985     if (Root != X.Root) {
  986       if (X.Root) { X.Root->retain(); }
  986       if (X.Root) { X.Root->retain(); }
  987       if (Root) { Root->release(); }
  987       if (Root) { Root->release(); }
  988       Root = X.Root;
  988       Root = X.Root;
 1020       TreeTy *NewT = F.add(Old.Root, V);
 1032       TreeTy *NewT = F.remove(Old.Root, V);
 1047     return Root ? Root->contains(V) : false;
 1047     return Root ? Root->contains(V) : false;
 1051     return Root && RHS.Root ? Root->isEqual(*RHS.Root) : Root == RHS.Root;
 1051     return Root && RHS.Root ? Root->isEqual(*RHS.Root) : Root == RHS.Root;
 1051     return Root && RHS.Root ? Root->isEqual(*RHS.Root) : Root == RHS.Root;
 1051     return Root && RHS.Root ? Root->isEqual(*RHS.Root) : Root == RHS.Root;
 1051     return Root && RHS.Root ? Root->isEqual(*RHS.Root) : Root == RHS.Root;
 1051     return Root && RHS.Root ? Root->isEqual(*RHS.Root) : Root == RHS.Root;
 1055     return Root && RHS.Root ? Root->isNotEqual(*RHS.Root) : Root != RHS.Root;
 1055     return Root && RHS.Root ? Root->isNotEqual(*RHS.Root) : Root != RHS.Root;
 1055     return Root && RHS.Root ? Root->isNotEqual(*RHS.Root) : Root != RHS.Root;
 1055     return Root && RHS.Root ? Root->isNotEqual(*RHS.Root) : Root != RHS.Root;
 1055     return Root && RHS.Root ? Root->isNotEqual(*RHS.Root) : Root != RHS.Root;
 1055     return Root && RHS.Root ? Root->isNotEqual(*RHS.Root) : Root != RHS.Root;
 1059     if (Root) { Root->retain(); }
 1059     if (Root) { Root->retain(); }
 1060     return Root;
 1064     return Root;
 1068   bool isEmpty() const { return !Root; }
 1075   void foreach(Callback& C) { if (Root) Root->foreach(C); }
 1075   void foreach(Callback& C) { if (Root) Root->foreach(C); }
 1078   void foreach() { if (Root) { Callback C; Root->foreach(C); } }
 1078   void foreach() { if (Root) { Callback C; Root->foreach(C); } }
 1086   iterator begin() const { return iterator(Root); }
 1093   unsigned getHeight() const { return Root ? Root->getHeight() : 0; }
 1093   unsigned getHeight() const { return Root ? Root->getHeight() : 0; }
 1096     ID.AddPointer(S.Root);
 1105   void validateTree() const { if (Root) Root->validateTree(); }
 1105   void validateTree() const { if (Root) Root->validateTree(); }