todd-coxeter: remove trailing whitespace in src/todd-coxeter-impl.cpp

Author: james-d-mitchell

src/todd-coxeter-impl.cpp

@@ -67,32 +67,32 @@ The valid values are :
 
 .. py:attribute:: strategy.hlt
   :value: <strategy.hlt: 0>
-  
+
   This value indicates that the HLT (Hazelgrove-Leech-Trotter) strategy should be used. This is analogous to ACE's R-style.
 
 .. py:attribute:: strategy.felsch
   :value: <strategy.felsch: 1>
-  
+
   This value indicates that the Felsch strategy should be used. This is analogous to ACE's C-style.
 
 .. py:attribute:: strategy.CR
   :value: <strategy.CR: 2>
-  
+
   This strategy is meant to mimic the ACE strategy of the same name. The Felsch is run until at least :any:`f_defs` nodes are defined, then the HLT strategy is run until at least :any:`hlt_defs` divided by :math:`N` nodes have been defined, where :math:`N` is the sum of the lengths of the words in the presentation and generating pairs. These steps are repeated until the enumeration terminates.
 
 .. py:attribute:: strategy.R_over_C
   :value: <strategy.R_over_C: 3>
-  
+
   This strategy is meant to mimic the ACE strategy R/C. The HLT strategy is run until the first lookahead is triggered (when :the number of nodes active is at least :any:`lookahead_next`). A full lookahead is then performed, and then the CR strategy is used.
 
 .. py:attribute:: strategy.Cr
   :value: <strategy.Cr: 4>
-  
+
   This strategy is meant to mimic the ACE strategy Cr. The Felsch strategy is run until at least :any:`f_defs` new nodes have been defined, then the HLT strategy is run until at least :any:`hlt_defs` divided by :math:`N` nodes have been defined, where :math:`N` is the sum of the lengths of the words in the presentation and generating pairs. Then the Felsch strategy is run.
 
 .. py:attribute:: strategy.Rc
   :value: <strategy.Rc: 5>
-  
+
   This strategy is meant to mimic the ACE strategy Rc. The HLT strategy is run until at least :any:`hlt_defs` divided by :math:`N` new nodes have been defined (where :math:`N` is the sum of the lengths of the words in the presentation and generating pairs) the Felsch strategy is then run until at least :any:`f_defs` new nodes are defined, and then the HLT strategy is run.
 
 
@@ -126,7 +126,7 @@ The valid values are :
 
 .. py:attribute:: lookahead_extent.partial
   :value: <lookahead_extent.partial: 1>
-  
+
   Perform a partial lookahead starting from the current node in the word graph. Partial lookaheads are sometimes faster but may not detect as many coincidences as a full lookahead.
 )pbdoc")
         .value("full", ToddCoxeterImpl_::options::lookahead_extent::full)
@@ -235,12 +235,12 @@ The valid values are:
 
 .. py:attribute:: def_version.one
   :value: <def_version.one: 0>
-  
+
   Version 1 definition processing.
-  
+
 .. py:attribute:: def_version.two
   :value: <def_version.two: 1>
-  
+
   Version 2 definition processing.
 )pbdoc")
         .value("one",