[SetOperations] clang-format header (NFC)

This header used three-space indentation in a number of places.
Reformat it completely.

Author: nikic

llvm/include/llvm/ADT/SetOperations.h

@@ -19,12 +19,11 @@ namespace llvm {
 
 /// set_union(A, B) - Compute A := A u B, return whether A changed.
 ///
-template <class S1Ty, class S2Ty>
-bool set_union(S1Ty &S1, const S2Ty &S2) {
+template <class S1Ty, class S2Ty> bool set_union(S1Ty &S1, const S2Ty &S2) {
   bool Changed = false;
 
-  for (typename S2Ty::const_iterator SI = S2.begin(), SE = S2.end();
-       SI != SE; ++SI)
+  for (typename S2Ty::const_iterator SI = S2.begin(), SE = S2.end(); SI != SE;
+       ++SI)
     if (S1.insert(*SI).second)
       Changed = true;
 
@@ -36,52 +35,51 @@ bool set_union(S1Ty &S1, const S2Ty &S2) {
 /// is nicer to use.  Functionally, this iterates through S1, removing
 /// elements that are not contained in S2.
 ///
-template <class S1Ty, class S2Ty>
-void set_intersect(S1Ty &S1, const S2Ty &S2) {
-   for (typename S1Ty::iterator I = S1.begin(); I != S1.end();) {
-     const auto &E = *I;
-     ++I;
-     if (!S2.count(E)) S1.erase(E);   // Erase element if not in S2
-   }
+template <class S1Ty, class S2Ty> void set_intersect(S1Ty &S1, const S2Ty &S2) {
+  for (typename S1Ty::iterator I = S1.begin(); I != S1.end();) {
+    const auto &E = *I;
+    ++I;
+    if (!S2.count(E))
+      S1.erase(E); // Erase element if not in S2
+  }
 }
 
 template <class S1Ty, class S2Ty>
 S1Ty set_intersection_impl(const S1Ty &S1, const S2Ty &S2) {
-   S1Ty Result;
-   for (typename S1Ty::const_iterator SI = S1.begin(), SE = S1.end(); SI != SE;
-        ++SI)
-     if (S2.count(*SI))
+  S1Ty Result;
+  for (typename S1Ty::const_iterator SI = S1.begin(), SE = S1.end(); SI != SE;
+       ++SI)
+    if (S2.count(*SI))
       Result.insert(*SI);
-   return Result;
+  return Result;
 }
 
 /// set_intersection(A, B) - Return A ^ B
 template <class S1Ty, class S2Ty>
 S1Ty set_intersection(const S1Ty &S1, const S2Ty &S2) {
-   if (S1.size() < S2.size())
-     return set_intersection_impl(S1, S2);
-   else
-     return set_intersection_impl(S2, S1);
+  if (S1.size() < S2.size())
+    return set_intersection_impl(S1, S2);
+  else
+    return set_intersection_impl(S2, S1);
 }
 
 /// set_difference(A, B) - Return A - B
 ///
 template <class S1Ty, class S2Ty>
 S1Ty set_difference(const S1Ty &S1, const S2Ty &S2) {
   S1Ty Result;
-  for (typename S1Ty::const_iterator SI = S1.begin(), SE = S1.end();
-       SI != SE; ++SI)
-    if (!S2.count(*SI))       // if the element is not in set2
+  for (typename S1Ty::const_iterator SI = S1.begin(), SE = S1.end(); SI != SE;
+       ++SI)
+    if (!S2.count(*SI)) // if the element is not in set2
       Result.insert(*SI);
   return Result;
 }
 
 /// set_subtract(A, B) - Compute A := A - B
 ///
-template <class S1Ty, class S2Ty>
-void set_subtract(S1Ty &S1, const S2Ty &S2) {
-  for (typename S2Ty::const_iterator SI = S2.begin(), SE = S2.end();
-       SI != SE; ++SI)
+template <class S1Ty, class S2Ty> void set_subtract(S1Ty &S1, const S2Ty &S2) {
+  for (typename S2Ty::const_iterator SI = S2.begin(), SE = S2.end(); SI != SE;
+       ++SI)
     S1.erase(*SI);
 }
 
@@ -110,6 +108,6 @@ bool set_is_subset(const S1Ty &S1, const S2Ty &S2) {
   return true;
 }
 
-} // End llvm namespace
+} // namespace llvm
 
 #endif