Fix several violations of the style guide

1 files changed, 5 insertions, 5 deletions

diff --git a/source/validate.h b/source/validate.h
index e24f7b11..35ec9a61 100644
--- a/source/validate.h
+++ b/source/validate.h
@@ -63,8 +63,8 @@ using get_blocks_func =
 /// Computes dominators using the algorithm of Cooper, Harvey, and Kennedy
 /// "A Simple, Fast Dominance Algorithm", 2001.
 ///
-/// The algorithm assumes there is a unique root node (a node without predecessors),
-/// and it is therefore at the end of the postorder vector.
+/// The algorithm assumes there is a unique root node (a node without
+/// predecessors), and it is therefore at the end of the postorder vector.
 ///
 /// This function calculates the dominator edges for a set of blocks in the CFG.
 /// Uses the dominator algorithm by Cooper et al.
@@ -75,9 +75,9 @@ using get_blocks_func =
 ///                             block
 ///
 /// @return the dominator tree of the graph, as a vector of pairs of nodes.
-/// The first node in the pair is a node in the graph. The second node in the pair
-/// is its immediate dominator in the sense of Cooper et.al., where a block without
-/// predecessors (such as the root node) is its own immediate dominator.
+/// The first node in the pair is a node in the graph. The second node in the
+/// pair is its immediate dominator in the sense of Cooper et.al., where a block
+/// without predecessors (such as the root node) is its own immediate dominator.
 std::vector<std::pair<BasicBlock*, BasicBlock*>> CalculateDominators(
     const std::vector<const BasicBlock*>& postorder,
     get_blocks_func predecessor_func);