[llvm] r261492 - ADT: clang-format ilist_iterator, NFC

[Duncan P. N. Exon Smith via llvm-commits]

Author: dexonsmith
Date: Sun Feb 21 13:26:08 2016
New Revision: 261492

URL: http://llvm.org/viewvc/llvm-project?rev=261492&view=rev
Log:
ADT: clang-format ilist_iterator, NFC

Also removed a couple of noisy (no-value-added) comments.

Modified:
    llvm/trunk/include/llvm/ADT/ilist.h

Modified: llvm/trunk/include/llvm/ADT/ilist.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/ADT/ilist.h?rev=261492&r1=261491&r2=261492&view=diff
==============================================================================
--- llvm/trunk/include/llvm/ADT/ilist.h (original)
+++ llvm/trunk/include/llvm/ADT/ilist.h Sun Feb 21 13:26:08 2016
@@ -186,39 +186,38 @@ template<typename Ty>
 struct ilist_traits<const Ty> : public ilist_traits<Ty> {};
 
 //===----------------------------------------------------------------------===//
-// ilist_iterator<Node> - Iterator for intrusive list.
+// Iterator for intrusive list.
 //
-template<typename NodeTy>
+template <typename NodeTy>
 class ilist_iterator
-  : public std::iterator<std::bidirectional_iterator_tag, NodeTy, ptrdiff_t> {
-
+    : public std::iterator<std::bidirectional_iterator_tag, NodeTy, ptrdiff_t> {
 public:
   typedef ilist_traits<NodeTy> Traits;
-  typedef std::iterator<std::bidirectional_iterator_tag,
-                        NodeTy, ptrdiff_t> super;
+  typedef std::iterator<std::bidirectional_iterator_tag, NodeTy, ptrdiff_t>
+      super;
 
   typedef typename super::value_type value_type;
   typedef typename super::difference_type difference_type;
   typedef typename super::pointer pointer;
   typedef typename super::reference reference;
+
 private:
   pointer NodePtr;
 
 public:
-
   explicit ilist_iterator(pointer NP) : NodePtr(NP) {}
   explicit ilist_iterator(reference NR) : NodePtr(&NR) {}
   ilist_iterator() : NodePtr(nullptr) {}
 
   // This is templated so that we can allow constructing a const iterator from
   // a nonconst iterator...
-  template<class node_ty>
+  template <class node_ty>
   ilist_iterator(const ilist_iterator<node_ty> &RHS)
-    : NodePtr(RHS.getNodePtrUnchecked()) {}
+      : NodePtr(RHS.getNodePtrUnchecked()) {}
 
   // This is templated so that we can allow assigning to a const iterator from
   // a nonconst iterator...
-  template<class node_ty>
+  template <class node_ty>
   const ilist_iterator &operator=(const ilist_iterator<node_ty> &RHS) {
     NodePtr = RHS.getNodePtrUnchecked();
     return *this;
@@ -227,13 +226,8 @@ public:
   void reset(pointer NP) { NodePtr = NP; }
 
   // Accessors...
-  explicit operator pointer() const {
-    return NodePtr;
-  }
-
-  reference operator*() const {
-    return *NodePtr;
-  }
+  explicit operator pointer() const { return NodePtr; }
+  reference operator*() const { return *NodePtr; }
   pointer operator->() const { return &operator*(); }
 
   // Comparison operators
@@ -245,21 +239,21 @@ public:
   }
 
   // Increment and decrement operators...
-  ilist_iterator &operator--() {      // predecrement - Back up
+  ilist_iterator &operator--() {
     NodePtr = Traits::getPrev(NodePtr);
     assert(NodePtr && "--'d off the beginning of an ilist!");
     return *this;
   }
-  ilist_iterator &operator++() {      // preincrement - Advance
+  ilist_iterator &operator++() {
     NodePtr = Traits::getNext(NodePtr);
     return *this;
   }
-  ilist_iterator operator--(int) {    // postdecrement operators...
+  ilist_iterator operator--(int) {
     ilist_iterator tmp = *this;
     --*this;
     return tmp;
   }
-  ilist_iterator operator++(int) {    // postincrement operators...
+  ilist_iterator operator++(int) {
     ilist_iterator tmp = *this;
     ++*this;
     return tmp;