-//===-- Support/EquivalenceClasses.h -------------------------*- C++ -*--=//
+//===-- Support/EquivalenceClasses.h ----------------------------*- C++ -*-===//
//
-// Generic implementation of equivalence classes and implementation of
-// union-find algorithms
-// A not-so-fancy implementation: 2 level tree i.e root and one more level
-// Overhead of a union = size of the equivalence class being attached
-// Overhead of a find = 1.
+// The LLVM Compiler Infrastructure
+//
+// This file was developed by the LLVM research group and is distributed under
+// the University of Illinois Open Source License. See LICENSE.TXT for details.
//
-//===------------------------------------------------------------------===//
+//===----------------------------------------------------------------------===//
+//
+// Generic implementation of equivalence classes and implementation of
+// union-find algorithms A not-so-fancy implementation: 2 level tree i.e root
+// and one more level Overhead of a union = size of the equivalence class being
+// attached Overhead of a find = 1.
+//
+//===----------------------------------------------------------------------===//
#ifndef SUPPORT_EQUIVALENCECLASSES_H
#define SUPPORT_EQUIVALENCECLASSES_H
return EqClass;
ElemTy classLeader = Elem2ECLeaderMap[Element1];
-
for (typename std::map<ElemTy, ElemTy>::iterator ElemI =
Elem2ECLeaderMap.begin(), ElemE = Elem2ECLeaderMap.end();
ElemI != ElemE; ++ElemI) {
}
return EqClass;
-
}
std::map<ElemTy, ElemTy>& getLeaderMap() {
return Elem2ECLeaderMap ;
}
-
};
#endif