Replace \techterm with \term.

As per #2072, local terms should not be marked up at all, and more widely-used terms should have a (scoped) index entry (via \defnx etc.)

Author: tkoeppe

source/algorithms.tex

@@ -3565,11 +3565,11 @@
 
 \pnum
 The term
-\techterm{strict}
+\term{strict}
 refers to the
 requirement of an irreflexive relation (\tcode{!comp(x, x)} for all \tcode{x}),
 and the term
-\techterm{weak}
+\term{weak}
 to requirements that are not as strong as
 those for a total ordering,
 but stronger than those for a partial
@@ -3612,7 +3612,7 @@
 
 \pnum
 A sequence is
-\techterm{sorted with respect to a comparator}
+\term{sorted with respect to a comparator}
 \tcode{comp} if for every iterator
 \tcode{i}
 pointing to the sequence and every non-negative integer
@@ -3626,7 +3626,7 @@
 A sequence
 \range{start}{finish}
 is
-\techterm{partitioned with respect to an expression}
+\term{partitioned with respect to an expression}
 \tcode{f(e)}
 if there exists an integer
 \tcode{n}
@@ -4882,7 +4882,7 @@
 
 \pnum
 A
-\techterm{heap}
+\term{heap}
 is a particular organization of elements in a range between two random access iterators
 \range{a}{b} such that:
 

source/iterators.tex

@@ -75,12 +75,12 @@
 This document defines
 five categories of iterators, according to the operations
 defined on them:
-\techterm{input iterators},
-\techterm{output iterators},
-\techterm{forward iterators},
-\techterm{bidirectional iterators}
+\term{input iterators},
+\term{output iterators},
+\term{forward iterators},
+\term{bidirectional iterators}
 and
-\techterm{random access iterators},
+\term{random access iterators},
 as shown in \tref{iterators.relations}.
 
 \begin{floattable}{Relations among iterator categories}{tab:iterators.relations}
@@ -216,7 +216,7 @@
 
 \pnum
 An
-\techterm{invalid}
+\term{invalid}
 iterator is an iterator that may be singular.\footnote{This definition applies to pointers, since pointers are iterators.
 The effect of dereferencing an iterator that has been invalidated
 is undefined.
@@ -329,7 +329,7 @@
 
 \pnum
 In \tref{iterator.input.requirements}, the term
-\techterm{the domain of \tcode{==}}
+\term{the domain of \tcode{==}}
 is used in the ordinary mathematical sense to denote
 the set of values over which
 \tcode{==} is (required to be) defined.
@@ -992,7 +992,7 @@
 argument, so that the function can select the most efficient algorithm at compile time.
 To facilitate this, the
 library introduces
-\techterm{category tag}
+\term{category tag}
 classes which are used as compile time tags for algorithm selection.
 They are:
 \tcode{input_iterator_tag},
@@ -1647,7 +1647,7 @@
 \pnum
 To make it possible to deal with insertion in the same way as writing into an array, a special kind of iterator
 adaptors, called
-\techterm{insert iterators},
+\term{insert iterators},
 are provided in the library.
 With regular iterator classes,
 
@@ -1662,8 +1662,8 @@
 being an insert iterator will insert corresponding elements into the container.
 This device allows all of the
 copying algorithms in the library to work in the
-\techterm{insert mode}
-instead of the \techterm{regular overwrite} mode.
+\term{insert mode}
+instead of the \term{regular overwrite} mode.
 
 \pnum
 An insert iterator is constructed from a container and possibly one of its iterators pointing to where

source/lib-intro.tex

@@ -496,9 +496,9 @@
 
 \pnum
 Whenever the \Fundescx{Effects} element specifies that the semantics of some function
-\tcode{F} are \techterm{Equivalent to} some code sequence, then the various elements are
+\tcode{F} are \term{Equivalent to} some code sequence, then the various elements are
 interpreted as follows. If \tcode{F}'s semantics specifies a \Fundescx{Requires} element, then
-that requirement is logically imposed prior to the \techterm{equivalent-to} semantics.
+that requirement is logically imposed prior to the \term{equivalent-to} semantics.
 Next, the semantics of the code sequence are determined by the \Fundescx{Requires}, \Fundescx{Effects},
 \Fundescx{Synchronization}, \Fundescx{Postconditions}, \Fundescx{Returns}, \Fundescx{Throws}, \Fundescx{Complexity}, \Fundescx{Remarks}, and \Fundescx{Error conditions}
 specified for the function invocations contained in the code sequence. The value
@@ -1793,7 +1793,7 @@
 
 \indextext{requirements!\idxcode{Allocator}}%
 \pnum
-The library describes a standard set of requirements for \techterm{allocators},
+The library describes a standard set of requirements for \term{allocators},
 which are class-type objects that encapsulate the information about an allocation model.
 This information includes the knowledge of pointer types, the type of their
 difference, the type of the size of objects in this allocation model, as well

source/macros.tex

@@ -180,9 +180,9 @@
 
 % Code and definitions embedded in text.
 \newcommand{\tcode}[1]{\CodeStylex{#1}}
-\newcommand{\techterm}[1]{\textit{#1}}
 \newcommand{\defnx}[2]{\indexdefn{#2}\textit{#1}}
 \newcommand{\defn}[1]{\defnx{#1}{#1}}
+\newcommand{\techterm}[1]{\textit{#1}}
 \newcommand{\term}[1]{\textit{#1}}
 \newcommand{\gterm}[1]{\GrammarStylex{#1}}
 \newcommand{\fakegrammarterm}[1]{\gterm{#1}}

source/numerics.tex

@@ -1389,11 +1389,11 @@
 \pnum
 In addition to a few utilities,
 four categories of entities are described:
-\techterm{uniform random bit generators},
-\techterm{random number engines},
-\techterm{random number engine adaptors},
+\term{uniform random bit generators},
+\term{random number engines},
+\term{random number engine adaptors},
 and
-\techterm{random number distributions}.
+\term{random number distributions}.
 These categorizations are applicable
 to types that satisfy the corresponding requirements,
 to objects instantiated from such types,
@@ -1419,20 +1419,20 @@
 that entity is characterized:
 \begin{enumeratea}
  \item
-   as \techterm{boolean} or equivalently as \techterm{boolean-valued},
+   as \term{boolean} or equivalently as \term{boolean-valued},
    if \tcode{T} is \tcode{bool};
  \item
    otherwise
-   as \techterm{integral} or equivalently as \techterm{integer-valued},
+   as \term{integral} or equivalently as \term{integer-valued},
    if \tcode{numeric_limits<T>::is_integer} is \tcode{true};
  \item
    otherwise
-   as \techterm{floating} or equivalently as \techterm{real-valued}.
+   as \term{floating} or equivalently as \term{real-valued}.
 \end{enumeratea}
 \noindent
 If integer-valued,
 an entity may optionally be further characterized as
-\techterm{signed} or \techterm{unsigned},
+\term{signed} or \term{unsigned},
 according to \tcode{numeric_limits<T>::is_signed}.
 
 \pnum
@@ -1560,7 +1560,7 @@
 \indextext{requirements!seed sequence|(}
 
 \pnum
- A \techterm{seed sequence}\indextext{seed sequence}
+ A \term{seed sequence}\indextext{seed sequence}
  is an object
  that consumes a sequence
  of integer-valued data
@@ -1701,7 +1701,7 @@
 \indextext{requirements!uniform random bit generator|(}
 
 \pnum
-A \techterm{uniform random bit generator}
+A \term{uniform random bit generator}
 \tcode{g} of type \tcode{G}
 is a function object
 returning unsigned integer values
@@ -1718,7 +1718,7 @@
 \pnum
 A class \tcode{G}
 satisfies the requirements
-of a \techterm{uniform random bit generator}
+of a \term{uniform random bit generator}
 if the expressions shown
 in \tref{UniformRandomBitGenerator}
 are valid and have the indicated semantics,
@@ -1795,8 +1795,8 @@
 \indextext{requirements!random number engine|(}
 
 \pnum
-A \techterm{random number engine}
-(commonly shortened to \techterm{engine})
+A \term{random number engine}
+(commonly shortened to \term{engine})
 \tcode{e} of type \tcode{E}
 is a uniform random bit generator
 that additionally meets the requirements
@@ -1824,14 +1824,14 @@
    in multiples of the size of \tcode{result_type},
    given as an integral constant expression;
  \item
-   the \techterm{transition algorithm}
+   the \term{transition algorithm}
    $\mathsf{TA}$
    by which \tcode{e}'s state \state{e}{i}
-   is advanced to its \techterm{successor state}
+   is advanced to its \term{successor state}
    \state{e}{i+1};
  and
  \item
-   the \techterm{generation algorithm}
+   the \term{generation algorithm}
    $\mathsf{GA}$
    by which an engine's state is mapped
    to a value of type \tcode{result_type}.
@@ -1842,7 +1842,7 @@
 that satisfies the requirements
 of a uniform random bit generator\iref{rand.req.urng}
 also satisfies the requirements
-of a \techterm{random number engine}
+of a \term{random number engine}
 if the expressions shown
 in \tref{RandomEngine}
 are valid and have the indicated semantics,
@@ -2068,8 +2068,8 @@
 \rSec3[rand.req.adapt]{Random number engine adaptor requirements}%
 
 \pnum
-A \techterm{random number engine adaptor}
-(commonly shortened to \techterm{adaptor})
+A \term{random number engine adaptor}
+(commonly shortened to \term{adaptor})
 \tcode{a} of type \tcode{A}
 is a random number engine
 that takes values
@@ -2078,7 +2078,7 @@
 in order to deliver a sequence of values
 with different randomness properties.
 An engine \tcode{b} of type \tcode{B} adapted in this way
-is termed a \techterm{base engine}
+is termed a \term{base engine}
 in this context.
 The expression \tcode{a.base()} shall be valid and shall return a
 const reference to \tcode{a}'s base engine.
@@ -2194,16 +2194,16 @@
 \indextext{requirements!random number distribution|(}
 
 \pnum
-A \techterm{random number distribution}
-(commonly shortened to \techterm{distribution})
+A \term{random number distribution}
+(commonly shortened to \term{distribution})
 \tcode{d} of type \tcode{D}
 is a function object
 returning values
 that are distributed according to
-an associated mathematical \techterm{probability density function}
+an associated mathematical \term{probability density function}
 $p(z)$
 or according to
-an associated \techterm{discrete probability function}
+an associated \term{discrete probability function}
 $P(z_i)$.
 A distribution's specification
 identifies its associated probability function
@@ -2212,7 +2212,7 @@
 \pnum
 An associated probability function is typically expressed
 using certain externally-supplied quantities
-known as the \techterm{parameters of the distribution}.
+known as the \term{parameters of the distribution}.
 Such distribution parameters are identified
 in this context by writing, for example,
   $p(z\,|\,a,b)$ or $P(z_i\,|\,a,b)$,
@@ -2225,7 +2225,7 @@
 \pnum
 A class \tcode{D}
 satisfies the requirements
-of a \techterm{random number distribution}
+of a \term{random number distribution}
 if the expressions shown
 in \tref{RandomDistribution}
 are valid and have the indicated semantics,
@@ -2868,7 +2868,7 @@
 defined by shift values $n$ and $m$, a twist value $r$,
 and a conditional xor-mask $a$.
 To improve the uniformity of the result,
-the bits of the raw shift register are additionally \techterm{tempered}
+the bits of the raw shift register are additionally \term{tempered}
 (i.e., scrambled) according to a bit-scrambling matrix
 defined by values $u$, $d$, $s$, $b$, $t$, $c$, and $\ell$.
 
@@ -3039,7 +3039,7 @@
 all subscripts applied to $X$ are to be taken modulo $r$.
 The state \state{x}{i}
 additionally consists of an integer $c$
-(known as the \techterm{carry})%
+(known as the \term{carry})%
 \indextext{\idxcode{subtract_with_carry_engine}!carry}%
 \indextext{carry!\idxcode{subtract_with_carry_engine}}
 whose value is either $0$ or $1$.
@@ -4760,7 +4760,7 @@
 \indextext{\idxcode{poisson_distribution}!discrete probability function}%
 \[ P(i\,|\,\mu) = \frac{e^{-\mu} \mu^{i}}{i\,!} \text{ .} \]
 The distribution parameter $\mu$
-is also known as this distribution's \techterm{mean}%
+is also known as this distribution's \term{mean}%
 \indextext{mean!\idxcode{poisson_distribution}}%
 \indextext{\idxcode{poisson_distribution}!mean}%
 .
@@ -5189,10 +5189,10 @@
  \text{ .}
 \]
 The distribution parameters $\mu$ and $\sigma$
-are also known as this distribution's \techterm{mean}%
+are also known as this distribution's \term{mean}%
 \indextext{mean!\idxcode{normal_distribution}}%
 \indextext{\idxcode{normal_distribution}!mean}
-and \techterm{standard deviation}%
+and \term{standard deviation}%
 \indextext{standard deviation!\idxcode{normal_distribution}}%
 \indextext{\idxcode{normal_distribution}!standard deviation}%
 .
@@ -5699,7 +5699,7 @@
 the distribution parameters are calculated as:
 $p_k = {w_k / S}$ for $k = 0, \dotsc, n - 1$,
 in which the values $w_k$,
-commonly known as the \techterm{weights}%
+commonly known as the \term{weights}%
 \indextext{\idxcode{discrete_distribution}!weights}%
 \indextext{weights!\idxcode{discrete_distribution}}%
 , shall be non-negative, non-NaN, and non-infinity.
@@ -5857,7 +5857,7 @@
 
 \pnum
 The $n + 1$ distribution parameters $b_i$,
-also known as this distribution's \techterm{interval boundaries}%
+also known as this distribution's \term{interval boundaries}%
 \indextext{\idxcode{piecewise_constant_distribution}!interval boundaries}%
 \indextext{interval boundaries!\idxcode{piecewise_constant_distribution}}%
 , shall satisfy the relation
@@ -5866,7 +5866,7 @@
 the remaining $n$ distribution parameters are calculated as:
 \[ \rho_k = \frac{w_k}{S \cdot (b_{k+1}-b_k)} \text{ for } k = 0, \dotsc, n - 1 \text{ ,} \]
 in which the values $w_k$,
-commonly known as the \techterm{weights}%
+commonly known as the \term{weights}%
 \indextext{\idxcode{piecewise_constant_distribution}!weights}%
 \indextext{weights!\idxcode{piecewise_constant_distribution}}%
 , shall be non-negative, non-NaN, and non-infinity.
@@ -6072,14 +6072,14 @@
 
 \pnum
 The $n + 1$ distribution parameters $b_i$,
-also known as this distribution's \techterm{interval boundaries}%
+also known as this distribution's \term{interval boundaries}%
 \indextext{\idxcode{piecewise_linear_distribution}!interval boundaries}%
 \indextext{interval boundaries!\idxcode{piecewise_linear_distribution}}%
 , shall satisfy the relation $b_i < b_{i+1}$ for $i = 0, \dotsc, n - 1$.
 Unless specified otherwise,
 the remaining $n + 1$ distribution parameters are calculated as
 $\rho_k = {w_k / S}$ for $k = 0, \dotsc, n$, in which the values $w_k$,
-commonly known as the \techterm{weights at boundaries}%
+commonly known as the \term{weights at boundaries}%
 \indextext{\idxcode{piecewise_linear_distribution}!weights at boundaries}%
 \indextext{weights at boundaries!\idxcode{piecewise_linear_distribution}}%
 , shall be non-negative, non-NaN, and non-infinity.