Reformat headers in ADT and Support partially.

[oota-llvm.git] / include / llvm / ADT / DepthFirstIterator.h

diff --git a/include/llvm/ADT/DepthFirstIterator.h b/include/llvm/ADT/DepthFirstIterator.h
index 19e2ff3fe0a5fee73430a106057a1a084dc9e2b1..c9317b8539b38175c826adb891c1a820c722bb67 100644 (file)
--- a/include/llvm/ADT/DepthFirstIterator.h
+++ b/include/llvm/ADT/DepthFirstIterator.h
@@ -75,13 +75,13 @@ class df_iterator : public std::iterator<std::forward_iterator_tag,
   // VisitStack - Used to maintain the ordering.  Top = current block
   // First element is node pointer, second is the 'next child' to visit
   // if the int in PointerIntTy is 0, the 'next child' to visit is invalid
   // VisitStack - Used to maintain the ordering.  Top = current block
   // First element is node pointer, second is the 'next child' to visit
   // if the int in PointerIntTy is 0, the 'next child' to visit is invalid

-  std::vector<std::pair<PointerIntTy, ChildItTy> > VisitStack;
+  std::vector<std::pair<PointerIntTy, ChildItTy>> VisitStack;

 
 private:
   inline df_iterator(NodeType *Node) {
     this->Visited.insert(Node);
 
 private:
   inline df_iterator(NodeType *Node) {
     this->Visited.insert(Node);

-    VisitStack.push_back(std::make_pair(PointerIntTy(Node, 0),
-                                        GT::child_begin(Node)));
+    VisitStack.push_back(
+        std::make_pair(PointerIntTy(Node, 0), GT::child_begin(Node)));

   }
   inline df_iterator() {
     // End is when stack is empty
   }
   inline df_iterator() {
     // End is when stack is empty


@@ -89,8 +89,8 @@ private:
   inline df_iterator(NodeType *Node, SetType &S)
     : df_iterator_storage<SetType, ExtStorage>(S) {
     if (!S.count(Node)) {
   inline df_iterator(NodeType *Node, SetType &S)
     : df_iterator_storage<SetType, ExtStorage>(S) {
     if (!S.count(Node)) {

-      VisitStack.push_back(std::make_pair(PointerIntTy(Node, 0),
-                                          GT::child_begin(Node)));
+      VisitStack.push_back(
+          std::make_pair(PointerIntTy(Node, 0), GT::child_begin(Node)));

       this->Visited.insert(Node);
     }
   }
       this->Visited.insert(Node);
     }
   }


@@ -115,8 +115,8 @@ private:
         // Has our next sibling been visited?
         if (Next && this->Visited.insert(Next).second) {
           // No, do it now.
         // Has our next sibling been visited?
         if (Next && this->Visited.insert(Next).second) {
           // No, do it now.

-          VisitStack.push_back(std::make_pair(PointerIntTy(Next, 0),
-                                              GT::child_begin(Next)));
+          VisitStack.push_back(
+              std::make_pair(PointerIntTy(Next, 0), GT::child_begin(Next)));

           return;
         }
       }
           return;
         }
       }