Index: doc/theses/mike_brooks_MMath/string.tex
===================================================================
--- doc/theses/mike_brooks_MMath/string.tex	(revision fb7bf3f9eeb7136289d8e14f7dec493567587668)
+++ doc/theses/mike_brooks_MMath/string.tex	(revision 8136df1210d3d27dd6ffabd23376885f7cb6e0e2)
@@ -700,4 +700,5 @@
 \end{tabular}
 \end{cquote}
+\CC @setfill@ is not considered an important string manipulator.
 
 \CC input matching for @char@, @char *@, and @string@ are similar, where \emph{all} input characters are read from the current point in the input stream to the end of the type size, format width, whitespace, end of line (@'\n'@), or end of file.
@@ -1556,10 +1557,10 @@
 Timing outcomes report mean nanoseconds per invocation, which includes harness overhead and the targeted string API execution.
 
-\PAB{To discuss: hardware and such}
-
 As discussed in \VRef[Section]{string-raii-limit}, general performance comparisons are made using \CFA's faster, low-level string API, named @string_res@.
 \VRef{s:ControllingImplicitSharing} presents an operational mode where \CFA string sharing is turned off.
 In this mode, the \CFA string operates similarly to \CC's, by using a heap allocation for string text.
 Some experiments include measurements in this mode for baselining purposes, called ``\CC emulation mode'' or ``nosharing''.
+
+See~\VRef{s:ExperimentalEnvironment} for a description of the hardware environment.