self-explanatory

source/algorithms.tex

@@ -1707,7 +1707,7 @@
 \requires
 The type of
 \tcode{*first}
-shall satisfy the MoveAssignable
+shall satisfy the \tcode{MoveAssignable}
 requirements (Table~\ref{moveassignable}).
 
 \pnum
@@ -1859,9 +1859,9 @@
 \tcode{OutputIterator}
 meets the requirements of forward iterator then the value type of
 \tcode{InputIterator}
-shall be CopyConstructible (Table~\ref{copyconstructible}) and
-CopyAssignable (Table~\ref{copyassignable}).
-Otherwise CopyConstructible is not required.
+shall be \tcode{CopyConstructible} (Table~\ref{copyconstructible}) and
+\tcode{CopyAssignable} (Table~\ref{copyassignable}).
+Otherwise \tcode{CopyConstructible} is not required.
 
 \pnum
 \effects

source/atomics.tex

@@ -45,7 +45,6 @@
   #define ATOMIC_INT_LOCK_FREE @\unspec@
   #define ATOMIC_LONG_LOCK_FREE @\unspec@
   #define ATOMIC_LLONG_LOCK_FREE @\unspec@
-  #define ATOMIC_LLONG_LOCK_FREE @\unspec@
   #define ATOMIC_POINTER_LOCK_FREE @\unspec@
 
   // \ref{atomics.types.generic}, generic types

source/compatibility.tex

@@ -1115,7 +1115,7 @@
 \change \tcode{basic_string} requirements no longer allow reference-counted
 strings
 \rationale Invalidation is subtly different with reference-counted strings.
-This change regularizes behavor for this International Standard.
+This change regularizes behavior for this International Standard.
 \effect
 Valid \CppIII code may execute differently in this International Standard.
 

source/diagnostics.tex

@@ -1612,7 +1612,7 @@
 \pnum
 \postconditions \tcode{code() == ec}.
 
-string(what()).find(what_arg) != string::npos.
+\tcode{string(what()).find(what_arg) != string::npos}.
 \end{itemdescr}
 
 \indexlibrary{\idxcode{system_error}!\idxcode{system_error}}
@@ -1643,7 +1643,7 @@
 \pnum
 \postconditions \tcode{code() == error_code(ev, ecat)}.
 
-string(what()).find(what_arg) != string::npos.
+\tcode{string(what()).find(what_arg) != string::npos}.
 \end{itemdescr}
 
 \indexlibrary{\idxcode{system_error}!\idxcode{system_error}}

source/iterators.tex

@@ -380,7 +380,7 @@
 They should be
 \term{single pass}
 algorithms.
-Value type T is not required to be a CopyAssignable type (Table~\ref{copyassignable}).
+Value type T is not required to be a \tcode{CopyAssignable} type (Table~\ref{copyassignable}).
 These algorithms can be used with istreams as the source of the input data through the
 \tcode{istream_iterator}
 class template.

source/lib-intro.tex

@@ -1325,7 +1325,7 @@
 \end{concepttable}
 
 \indextext{requirements!\idxcode{CopyConstructible}}%
-\begin{concepttable}{\tcode{CopyConstructible} requirements (in addition to MoveConstructible)}{copyconstructible}
+\begin{concepttable}{\tcode{CopyConstructible} requirements (in addition to \tcode{MoveConstructible})}{copyconstructible}
 {p{1in}p{4.15in}}
 \topline
 Expression          &   Post-condition  \\ \capsep
@@ -1349,7 +1349,7 @@
 \end{concepttable}
 
 \indextext{requirements!\idxcode{CopyAssignable}}%
-\begin{concepttable}{\tcode{CopyAssignable} requirements(in addition to MoveAssignable)}{copyassignable}
+\begin{concepttable}{\tcode{CopyAssignable} requirements (in addition to \tcode{MoveAssignable})}{copyassignable}
 {p{1in}p{1in}p{1in}p{1.9in}}
 \topline
 Expression  &   Return type &   Return value    &   Post-condition  \\ \capsep

source/numerics.tex

@@ -1973,8 +1973,8 @@
 
 \pnum
 \tcode{E} shall meet the requirements
-of CopyConstructible (Table~\ref{copyconstructible})
-and CopyAssignable (Table~\ref{copyassignable}) types.
+of \tcode{CopyConstructible} (Table~\ref{copyconstructible})
+and \tcode{CopyAssignable} (Table~\ref{copyassignable}) types.
 These operations shall each be of complexity
 no worse than \bigoh{\mbox{size of state}}.
 
@@ -2352,8 +2352,8 @@
 
 \pnum
 \tcode{D} shall satisfy the requirements
-of CopyConstructible (Table~\ref{copyconstructible})
-and CopyAssignable (Table~\ref{copyassignable}) types.
+of \tcode{CopyConstructible} (Table~\ref{copyconstructible})
+and \tcode{CopyAssignable} (Table~\ref{copyassignable}) types.
 
 \pnum
 The sequence of numbers
@@ -2384,8 +2384,8 @@
 
 \pnum
 \tcode{P} shall satisfy the requirements
-of CopyConstructible (Table~\ref{copyconstructible}),
-CopyAssignable (Table~\ref{copyassignable}),
+of \tcode{CopyConstructible} (Table~\ref{copyconstructible}),
+\tcode{CopyAssignable} (Table~\ref{copyassignable}),
 and
 EqualityComparable (Table~\ref{equalitycomparable}) types.
 

source/strings.tex

@@ -1779,7 +1779,7 @@
 
 \pnum
 \returns \tcode{*(begin() + pos)} if \tcode{pos < size()}. Otherwise,
-returns a reference to an object of type \tcode{T} with value
+returns a reference to an object of type \tcode{charT} with value
 \tcode{charT()}, where modifying the object leads to
 undefined behavior.
 

source/threads.tex

@@ -3994,7 +3994,7 @@
 \end{itemize}
 
 \pnum
-\returns An object of type \tcode{future<typename result_of<F(Args...)>:type>} that refers
+\returns An object of type \tcode{future<typename result_of<F(Args...)>::type>} that refers
 to the shared state created by this call to \tcode{async}.
 
 \pnum

source/utilities.tex

@@ -3389,7 +3389,7 @@
 \begin{itemdescr}
 \pnum
 \ctype \tcode{Alloc::propagate_on_container_copy_assignment} if such a type
-exits, otherwise \tcode{false_type}.
+exists, otherwise \tcode{false_type}.
 \end{itemdescr}
 
 \indexlibrary{\idxcode{allocator_traits}!\idxcode{propagate_on_container_move_assignment}}%
@@ -3401,7 +3401,7 @@
 \begin{itemdescr}
 \pnum
 \ctype \tcode{Alloc::propagate_on_container_move_assignment} if such a type
-exits, otherwise \tcode{false_type}.
+exists, otherwise \tcode{false_type}.
 \end{itemdescr}
 
 \indexlibrary{\idxcode{allocator_traits}!\idxcode{propagate_on_container_swap}}%
@@ -3412,7 +3412,7 @@
 
 \begin{itemdescr}
 \pnum
-\ctype \tcode{Alloc::propagate_on_container_swap} if such a type exits, otherwise \tcode{false_type}.
+\ctype \tcode{Alloc::propagate_on_container_swap} if such a type exists, otherwise \tcode{false_type}.
 \end{itemdescr}
 
 \indexlibrary{\idxcode{allocator_traits}!\idxcode{rebind_alloc}}%
@@ -4434,7 +4434,7 @@
 \begin{codeblock}
 D d;
 unique_ptr<int, D> p1(new int, D());        // \tcode{D} must be \tcode{MoveConstructible}
-unique_ptr<int, D> p2(new int, d);          // \tcode{D} must be \tcode{Copyconstructible}
+unique_ptr<int, D> p2(new int, d);          // \tcode{D} must be \tcode{CopyConstructible}
 unique_ptr<int, D&> p3(new int, d);         // \tcode{p3} holds a reference to \tcode{d}
 unique_ptr<int, const D&> p4(new int, D()); // error: rvalue deleter object combined
                                             // with reference deleter type
@@ -6936,8 +6936,8 @@
 \indextext{simple call wrapper}%
 \indextext{forwarding call wrapper}%
 Every call wrapper~(\ref{func.def}) shall be
-MoveConstructible. A \term{simple call wrapper} is a call wrapper
-that is CopyConstructible and CopyAssignable and whose copy
+\tcode{MoveConstructible}. A \term{simple call wrapper} is a call wrapper
+that is \tcode{CopyConstructible} and \tcode{CopyAssignable} and whose copy
 constructor, move constructor, and assignment operator
 do not throw exceptions. A \term{forwarding call wrapper} is a
 call wrapper that can be called with an arbitrary argument list
@@ -6993,7 +6993,7 @@
 \end{codeblock}
 
 \pnum
-\tcode{reference_wrapper<T>} is a CopyConstructible and CopyAssignable wrapper
+\tcode{reference_wrapper<T>} is a \tcode{CopyConstructible} and \tcode{CopyAssignable} wrapper
 around a reference to an object or function of type \tcode{T}.
 
 \pnum

tools/grama.sed

@@ -2,5 +2,5 @@
 /\\index.*|see/d
 
 # insert newlines after groups
-/\\end/s/(.*)/\1\
+/\\end/s/\(.*\)/\1\
 /

tools/makegram

@@ -1,2 +1,3 @@
+export LC_ALL=C
 cp ../tools/grambase.tex grammar.tex
-cat $(cat ../tools/gram.files) | sed -n -E -f ../tools/gram.sed | sed -E -f ../tools/grama.sed | sed -E -f ../tools/gramb.sed >> grammar.tex
+cat $(cat ../tools/gram.files) | sed -n -f ../tools/gram.sed | sed -f ../tools/grama.sed | sed -f ../tools/gramb.sed >> grammar.tex

tools/makexref

@@ -1,5 +1,6 @@
+export LC_ALL=C
 cp ../tools/xrefbegin.tex xref.tex
 cp ../tools/alphabet xref.tmp
-cat $(cat ../tools/std.files) | sed -n -E -f ../tools/xref.sed >> xref.tmp
-sort -f < xref.tmp | sed -E -f ../tools/indexheader.sed >> xref.tex
+cat $(cat ../tools/std.files) | sed -n -r -f ../tools/xref.sed >> xref.tmp
+sort -f < xref.tmp | sed -r -f ../tools/indexheader.sed >> xref.tex
 cat ../tools/xrefend.tex >> xref.tex