diff --git a/src/IceTimerTree.h b/src/IceTimerTree.h
index 98bbdda..796ce8c 100644
--- a/src/IceTimerTree.h
+++ b/src/IceTimerTree.h
@@ -8,8 +8,8 @@
 //===----------------------------------------------------------------------===//
 ///
 /// \file
-/// This file declares the TimerTree class, which allows flat and
-/// cumulative execution time collection of call chains.
+/// This file declares the TimerTree class, which allows flat and cumulative
+/// execution time collection of call chains.
 ///
 //===----------------------------------------------------------------------===//
 
@@ -26,23 +26,22 @@
   TimerStack() = delete;
   TimerStack &operator=(const TimerStack &) = delete;
 
-  /// Timer tree index type.  A variable of this type is used to access
-  /// an interior, not-necessarily-leaf node of the tree.
+  /// Timer tree index type. A variable of this type is used to access an
+  /// interior, not-necessarily-leaf node of the tree.
   using TTindex = std::vector<class TimerTreeNode>::size_type;
-  /// Representation of a path of leaf values leading to a particular
-  /// node.  The representation happens to be in "reverse" order,
-  /// i.e. from leaf/interior to root, for implementation efficiency.
+  /// Representation of a path of leaf values leading to a particular node. The
+  /// representation happens to be in "reverse" order, i.e. from leaf/interior
+  /// to root, for implementation efficiency.
   using PathType = llvm::SmallVector<TTindex, 8>;
-  /// Representation of a mapping of leaf node indexes from one timer
-  /// stack to another.
+  /// Representation of a mapping of leaf node indexes from one timer stack to
+  /// another.
   using TranslationType = std::vector<TimerIdT>;
 
-  /// TimerTreeNode represents an interior or leaf node in the call tree.
-  /// It contains a list of children, a pointer to its parent, and the
-  /// timer ID for the node.  It also holds the cumulative time spent at
-  /// this node and below.  The children are always at a higher index in
-  /// the TimerTreeNode::Nodes array, and the parent is always at a lower
-  /// index.
+  /// TimerTreeNode represents an interior or leaf node in the call tree. It
+  /// contains a list of children, a pointer to its parent, and the timer ID for
+  /// the node. It also holds the cumulative time spent at this node and below.
+  /// The children are always at a higher index in the TimerTreeNode::Nodes
+  /// array, and the parent is always at a lower index.
   class TimerTreeNode {
     TimerTreeNode &operator=(const TimerTreeNode &) = delete;