Replace \textit with \term where appropriate.

Author: Eelis

source/containers.tex

@@ -2059,7 +2059,7 @@
 argument values of type \tcode{Key}, and by a binary predicate \tcode{Pred}
 that induces an equivalence relation on values of type \tcode{Key}.
 Additionally, \tcode{unordered_map} and \tcode{unordered_multimap} associate
-an arbitrary \textit{mapped type} \tcode{T} with the \tcode{Key}.
+an arbitrary \term{mapped type} \tcode{T} with the \tcode{Key}.
 
 \pnum
 \indextext{unordered associative containers!hash function}%
@@ -2089,9 +2089,9 @@
 \pnum
 \indextext{unordered associative containers!unique keys}%
 \indextext{unordered associative containers!equivalent keys}%
-An unordered associative container supports \textit{unique keys} if it
+An unordered associative container supports \term{unique keys} if it
 may contain at most one element for each key.  Otherwise, it supports
-\textit{equivalent keys}.  \tcode{unordered_set} and \tcode{unordered_map}
+\term{equivalent keys}.  \tcode{unordered_set} and \tcode{unordered_map}
 support unique keys. \tcode{unordered_multiset} and \tcode{unordered_multimap}
 support equivalent keys.  In containers that support equivalent keys,
 elements with equivalent keys are adjacent to each other
@@ -2123,7 +2123,7 @@
 \indextext{buckets}%
 \indextext{hash code}%
 The elements of an unordered associative container are organized into
-\textit{buckets}.  Keys with the same hash code appear in the same
+\term{buckets}.  Keys with the same hash code appear in the same
 bucket.  The number of buckets is automatically increased as elements
 are added to an unordered associative container, so that the average
 number of elements per bucket is kept below a bound.  Rehashing

source/iostreams.tex

@@ -1372,7 +1372,7 @@
 
 \pnum
 When a standard iostream object \tcode{str} is
-\textit{synchronized}
+\term{synchronized}
 with a standard stdio stream \tcode{f}, the effect of inserting a character \tcode{c} by
 \begin{codeblock}
 fputc(f, c);
@@ -1895,7 +1895,7 @@
 \pnum
 \returns
 An output sequence that is
-\textit{tied}
+\term{tied}
 to (synchronized with) the sequence controlled by the stream buffer.
 \end{itemdescr}
 

source/regex.tex

@@ -3605,7 +3605,7 @@
 \pnum
 \indextext{\idxcode{regex_iterator}!end-of-sequence}%
 An object of type \tcode{regex_iterator} that is not an end-of-sequence iterator
-holds a \textit{zero-length match} if \tcode{match[0].matched == true} and
+holds a \term{zero-length match} if \tcode{match[0].matched == true} and
 \tcode{match[0].first == match[0].second}. \begin{note} For
 example, this can occur when the part of the regular expression that
 matched consists only of an assertion (such as \verb|'^'|, \verb|'$'|, 
@@ -3900,7 +3900,7 @@
 \end{codeblock}
 
 \pnum
-A \textit{suffix iterator} is a \tcode{regex_token_iterator} object
+A \term{suffix iterator} is a \tcode{regex_token_iterator} object
 that points to a final sequence of characters at
 the end of the target sequence. In a suffix iterator the
 member \tcode{result} holds a pointer to the data
@@ -3916,7 +3916,7 @@
 sequence \end{note}
 
 \pnum
-The \textit{current match} is \tcode{(*position).prefix()} if \tcode{subs[N] == -1}, or
+The \term{current match} is \tcode{(*position).prefix()} if \tcode{subs[N] == -1}, or
 \tcode{(*position)[subs[N]]} for any other value of \tcode{subs[N]}.
 
 \rSec3[re.tokiter.cnstr]{\tcode{regex_token_iterator} constructors}