Fixup: define \oldconcept macro

.... with which to style the names of "requirements tables"

Author: CaseyCarter

source/algorithms.tex

@@ -727,7 +727,7 @@
 
 \pnum
 \begin{note}
-Unlike the \textit{Cpp98Destructible} requirements~(\tref{destructible}), this concept
+Unlike the \oldconcept{Destructible} requirements~(\tref{destructible}), this concept
 forbids destructors that are potentially throwing, even if non-throwing.
 \end{note}
 \end{itemdescr}

source/concepts.tex

@@ -239,7 +239,7 @@
 \begin{itemdescr}
 \pnum
 \requires
-Type \tcode{T} is \textit{Cpp98EqualityComparable} (\tref{equalitycomparable}).
+Type \tcode{T} is \oldconcept{EqualityComparable} (\tref{equalitycomparable}).
 
 \pnum
 \returns
@@ -254,7 +254,7 @@
 \begin{itemdescr}
 \pnum
 \requires
-Type \tcode{T} is \textit{Cpp98LessThanComparable} (\tref{lessthancomparable}).
+Type \tcode{T} is \oldconcept{LessThanComparable} (\tref{lessthancomparable}).
 
 \pnum
 \returns
@@ -269,7 +269,7 @@
 \begin{itemdescr}
 \pnum
 \requires
-Type \tcode{T} is \textit{Cpp98LessThanComparable} (\tref{lessthancomparable}).
+Type \tcode{T} is \oldconcept{LessThanComparable} (\tref{lessthancomparable}).
 
 \pnum
 \returns
@@ -284,7 +284,7 @@
 \begin{itemdescr}
 \pnum
 \requires
-Type \tcode{T} is \textit{Cpp98LessThanComparable} (\tref{lessthancomparable}).
+Type \tcode{T} is \oldconcept{LessThanComparable} (\tref{lessthancomparable}).
 
 \pnum
 \returns
@@ -2012,7 +2012,7 @@
 \begin{itemdescr}
 \pnum
 \requires
-\tcode{T} shall be \textit{Cpp98CopyConstructible}.
+\tcode{T} shall be \oldconcept{CopyConstructible}.
 
 \pnum
 \effects
@@ -2031,7 +2031,7 @@
 \begin{itemdescr}
 \pnum
 \requires
-\tcode{T} shall be \textit{Cpp98MoveConstructible}.
+\tcode{T} shall be \oldconcept{MoveConstructible}.
 
 \pnum
 \effects
@@ -2185,7 +2185,7 @@
 \tcode{remove_all_extents_t<T>} shall be a complete type or \cv{}~\tcode{void}.
 
 \pnum
-\tcode{is_literal_type<T>} is a \textit{Cpp98UnaryTypeTrait}\iref{meta.rqmts}
+\tcode{is_literal_type<T>} is a \oldconcept{UnaryTypeTrait}\iref{meta.rqmts}
 with a base characteristic of \tcode{true_type}
 if \tcode{T} is a literal type\iref{basic.types}, and
 \tcode{false_type} otherwise.
@@ -2203,7 +2203,7 @@
 
 \pnum
 The partial specialization \tcode{result_of<Fn(ArgTypes...)>} is a
-\textit{Cpp98TransformationTrait}\iref{meta.rqmts} whose member typedef \tcode{type} is defined
+\oldconcept{TransformationTrait}\iref{meta.rqmts} whose member typedef \tcode{type} is defined
 if and only if \tcode{invoke_result<Fn, ArgTypes...>::type}\iref{func.invoke} is defined.
 If \tcode{type} is defined, it names the same type as \tcode{invoke_result_t<Fn, ArgTypes...>}.
 \end{itemdescr}
@@ -2218,7 +2218,7 @@
 \tcode{remove_all_extents_t<T>} shall be a complete type or \cv{} \tcode{void}.
 
 \pnum
-\tcode{is_pod<T>} is a \textit{Cpp98UnaryTypeTrait}\iref{meta.rqmts}
+\tcode{is_pod<T>} is a \oldconcept{UnaryTypeTrait}\iref{meta.rqmts}
 with a base characteristic of \tcode{true_type}
 if \tcode{T} is a POD type,
 and \tcode{false_type} otherwise.

source/containers.tex

@@ -10418,7 +10418,7 @@
 \end{codeblock}
 
 \pnum
-\tcode{Allocator} shall satisfy the \textit{Cpp98Allocator} requirements
+\tcode{Allocator} shall satisfy the \oldconcept{Allocator} requirements
 (\tref{utilities.allocator.requirements}).
 
 \pnum
@@ -10750,7 +10750,7 @@
 
 \pnum
 Template parameters named \tcode{InputIterator} shall satisfy the
-\textit{Cpp98InputIterator} requirements\iref{input.iterators} and shall
+\oldconcept{InputIterator} requirements\iref{input.iterators} and shall
 have a value type that is one of the encoded character types.
 
 \pnum
@@ -10762,7 +10762,7 @@
 
 \pnum
 Template parameters named \tcode{Allocator} shall satisfy the
-\textit{Cpp98Allocator} requirements (\tref{utilities.allocator.requirements}).
+\oldconcept{Allocator} requirements (\tref{utilities.allocator.requirements}).
 
 \rSec3[fs.req.namespace]{Namespaces and headers}
 
@@ -10987,7 +10987,7 @@
 
 \pnum
 \tcode{\textit{trivial-clock}} is an \impldef{type of filesystem trivial clock} type
-that satisfies the \textit{Cpp98TrivialClock} requirements\iref{time.clock.req}
+that satisfies the \oldconcept{TrivialClock} requirements\iref{time.clock.req}
 and that is capable of representing and measuring file time values.
 Implementations should ensure that the resolution and range of
 \tcode{file_time_type} reflect the operating system dependent resolution and range
@@ -11550,7 +11550,7 @@
 \item \tcode{basic_string_view<EcharT, traits>}. A function
   argument \tcode{const Source\&} \tcode{source} shall have an
   effective range \range{source.begin()}{source.end()}.
-\item A type meeting the \textit{Cpp98InputIterator} requirements that iterates over a NTCTS.
+\item A type meeting the \oldconcept{InputIterator} requirements that iterates over a NTCTS.
   The value type shall be an encoded character type. A function argument
   \tcode{const Source\&} \tcode{source} shall have an effective range
   \range{source}{end} where \tcode{end} is the first
@@ -13866,7 +13866,7 @@
 
 \pnum
  \tcode{directory_iterator} satisfies the
- \textit{Cpp98InputIterator} requirements\iref{input.iterators}.
+ \oldconcept{InputIterator} requirements\iref{input.iterators}.
 
 \pnum
 If an iterator of type \tcode{directory_iterator} reports an error or

source/future.tex

@@ -156,7 +156,7 @@
 the only exceptions are destroying an iterator that holds a singular value,
 the assignment of a non-singular value to
 an iterator that holds a singular value, and, for iterators that satisfy the
-\textit{Cpp98DefaultConstructible} requirements, using a value-initialized iterator
+\oldconcept{DefaultConstructible} requirements, using a value-initialized iterator
 as the source of a copy or move operation. \begin{note} This guarantee is not
 offered for default-initialization, although the distinction only matters for types
 with trivial default constructors such as pointers or aggregates holding pointers.
@@ -266,31 +266,31 @@
 \begin{note} For an iterator type \tcode{X} there must be an instantiation
 of \tcode{iterator_traits<X>}\iref{iterator.traits}. \end{note}
 
-\rSec2[iterator.iterators]{\textit{Cpp98Iterator}}
+\rSec2[iterator.iterators]{\oldconcept{Iterator}}
 
 \pnum
-The \textit{Cpp98Iterator} requirements form the basis of the iterator
-taxonomy; every iterator satisfies the \textit{Cpp98Iterator} requirements. This
+The \oldconcept{Iterator} requirements form the basis of the iterator
+taxonomy; every iterator satisfies the \oldconcept{Iterator} requirements. This
 set of requirements specifies operations for dereferencing and incrementing
 an iterator. Most algorithms will require additional operations to
 read\iref{input.iterators} or write\iref{output.iterators} values, or
 to provide a richer set of iterator movements~(\ref{forward.iterators},
 \ref{bidirectional.iterators}, \ref{random.access.iterators}).
 
 \pnum
-A type \tcode{X} satisfies the \textit{Cpp98Iterator} requirements if:
+A type \tcode{X} satisfies the \oldconcept{Iterator} requirements if:
 
 \begin{itemize}
-\item \tcode{X} satisfies the \textit{Cpp98CopyConstructible}, \textit{Cpp98CopyAssignable}, and
-\textit{Cpp98Destructible} requirements\iref{utility.arg.requirements} and lvalues
+\item \tcode{X} satisfies the \oldconcept{CopyConstructible}, \oldconcept{CopyAssignable}, and
+\oldconcept{Destructible} requirements\iref{utility.arg.requirements} and lvalues
 of type \tcode{X} are swappable\iref{swappable.requirements}, and
 
 \item the expressions in \tref{iterator.requirements} are valid and have
 the indicated semantics.
 \end{itemize}
 
 \begin{libreqtab4b}
-{\textit{Cpp98Iterator} requirements}
+{\oldconcept{Iterator} requirements}
 {tab:iterator.requirements}
 \\ \topline
 \lhdr{Expression}   &   \chdr{Return type}  &   \chdr{Operational}  &   \rhdr{Assertion/note}       \\
@@ -322,8 +322,8 @@
 satisfies the requirements of an input iterator for the value type
 \tcode{T}
 if
-\tcode{X} satisfies the \textit{Cpp98Iterator}\iref{iterator.iterators} and
-\textit{Cpp98EqualityComparable} (\tref{equalitycomparable}) requirements and
+\tcode{X} satisfies the \oldconcept{Iterator}\iref{iterator.iterators} and
+\oldconcept{EqualityComparable} (\tref{equalitycomparable}) requirements and
 the expressions in \tref{iterator.input.requirements} are valid and have
 the indicated semantics.
 
@@ -357,7 +357,7 @@
 \end{example}
 
 \begin{libreqtab4b}
-{\textit{Cpp98InputIterator} requirements (in addition to \textit{Cpp98Iterator})}
+{\oldconcept{InputIterator} requirements (in addition to \oldconcept{Iterator})}
 {tab:iterator.input.requirements}
 \\ \topline
 \lhdr{Expression}   &   \chdr{Return type}  &   \chdr{Operational}  &   \rhdr{Assertion/note}       \\
@@ -415,7 +415,7 @@
 They should be
 \term{single pass}
 algorithms.
-Value type \tcode{T} is not required to be a \textit{Cpp98CopyAssignable} type (\tref{copyassignable}).
+Value type \tcode{T} is not required to be a \oldconcept{CopyAssignable} type (\tref{copyassignable}).
 These algorithms can be used with istreams as the source of the input data through the
 \tcode{istream_iterator}
 class template.
@@ -427,12 +427,12 @@
 A class or pointer type
 \tcode{X}
 satisfies the requirements of an output iterator
-if \tcode{X} satisfies the \textit{Cpp98Iterator} requirements\iref{iterator.iterators}
+if \tcode{X} satisfies the \oldconcept{Iterator} requirements\iref{iterator.iterators}
 and the expressions in \tref{iterator.output.requirements}
 are valid and have the indicated semantics.
 
 \begin{libreqtab4b}
-{\textit{Cpp98OutputIterator} requirements (in addition to \textit{Cpp98Iterator})}
+{\oldconcept{OutputIterator} requirements (in addition to \oldconcept{Iterator})}
 {tab:iterator.output.requirements}
 \\ \topline
 \lhdr{Expression}   &   \chdr{Return type}  &   \chdr{Operational}  &   \rhdr{Assertion/note}       \\
@@ -495,9 +495,9 @@
 satisfies the requirements of a forward iterator if
 
 \begin{itemize}
-\item \tcode{X} satisfies the \textit{Cpp98InputIterator} requirements\iref{input.iterators},
+\item \tcode{X} satisfies the \oldconcept{InputIterator} requirements\iref{input.iterators},
 
-\item \tcode{X} satisfies the \textit{Cpp98DefaultConstructible}
+\item \tcode{X} satisfies the \oldconcept{DefaultConstructible}
 requirements\iref{utility.arg.requirements},
 
 \item if \tcode{X} is a mutable iterator, \tcode{reference} is a reference to \tcode{T};
@@ -540,7 +540,7 @@
 \end{note}
 
 \begin{libreqtab4b}
-{\textit{Cpp98ForwardIterator} requirements (in addition to \textit{Cpp98InputIterator})}
+{\oldconcept{ForwardIterator} requirements (in addition to \oldconcept{InputIterator})}
 {tab:iterator.forward.requirements}
 \\ \topline
 \lhdr{Expression}   &   \chdr{Return type}  &   \chdr{Operational}  &   \rhdr{Assertion/note}       \\
@@ -577,11 +577,11 @@
 A class or pointer type
 \tcode{X}
 satisfies the requirements of a bidirectional iterator if,
-in addition to satisfying the \textit{Cpp98ForwardIterator} requirements,
+in addition to satisfying the \oldconcept{ForwardIterator} requirements,
 the following expressions are valid as shown in \tref{iterator.bidirectional.requirements}.
 
 \begin{libreqtab4b}
-{\textit{Cpp98BidirectionalIterator} requirements (in addition to \textit{Cpp98ForwardIterator})}
+{\oldconcept{BidirectionalIterator} requirements (in addition to \oldconcept{ForwardIterator})}
 {tab:iterator.bidirectional.requirements}
 \\ \topline
 \lhdr{Expression}   &   \chdr{Return type}  &   \chdr{Operational}  &   \rhdr{Assertion/note}       \\
@@ -622,11 +622,11 @@
 A class or pointer type
 \tcode{X}
 satisfies the requirements of a random access iterator if,
-in addition to satisfying the \textit{Cpp98BidirectionalIterator} requirements,
+in addition to satisfying the \oldconcept{BidirectionalIterator} requirements,
 the following expressions are valid as shown in \tref{iterator.random.access.requirements}.
 
 \begin{libreqtab4b}
-{\textit{Cpp98RandomAccessIterator} requirements (in addition to \textit{Cpp98BidirectionalIterator})}
+{\oldconcept{RandomAccessIterator} requirements (in addition to \oldconcept{BidirectionalIterator})}
 {tab:iterator.random.access.requirements}
 \\ \topline
 \lhdr{Expression}   &   \chdr{Return type}  &   \chdr{Operational}  &   \rhdr{Assertion/note}       \\
@@ -1128,7 +1128,7 @@
 \begin{itemdescr}
 \pnum
 \effects
-If \tcode{InputIterator} meets the \textit{Cpp98RandomAccessIterator} requirements,
+If \tcode{InputIterator} meets the \oldconcept{RandomAccessIterator} requirements,
 returns \tcode{(last - first)}; otherwise, returns
 the number of increments needed to get from
 \tcode{first}
@@ -1137,7 +1137,7 @@
 
 \pnum
 \requires
-If \tcode{InputIterator} meets the \textit{Cpp98RandomAccessIterator} requirements,
+If \tcode{InputIterator} meets the \oldconcept{RandomAccessIterator} requirements,
 \tcode{last} shall be reachable from \tcode{first} or \tcode{first} shall be
 reachable from \tcode{last}; otherwise,
 \tcode{last}
@@ -1262,12 +1262,12 @@
 \pnum
 The template parameter
 \tcode{Iterator}
-shall satisfy all the requirements of a \textit{Cpp98BidirectionalIterator}\iref{bidirectional.iterators}.
+shall satisfy all the requirements of a \oldconcept{BidirectionalIterator}\iref{bidirectional.iterators}.
 
 \pnum
 Additionally,
 \tcode{Iterator}
-shall satisfy the requirements of a \textit{Cpp98RandomAccessIterator}\iref{random.access.iterators}
+shall satisfy the requirements of a \oldconcept{RandomAccessIterator}\iref{random.access.iterators}
 if any of the members
 \tcode{operator+},
 \tcode{operator-},
@@ -2149,11 +2149,11 @@
 
 \pnum
 The template parameter \tcode{Iterator} shall satisfy
-the \textit{Cpp98InputIterator} requirements\iref{input.iterators}.
+the \oldconcept{InputIterator} requirements\iref{input.iterators}.
 Additionally, if any of the bidirectional or random access traversal
 functions are instantiated, the template parameter shall satisfy the
-\textit{Cpp98BidirectionalIterator} requirements\iref{bidirectional.iterators}
-or \textit{Cpp98RandomAccessIterator} requirements\iref{random.access.iterators}, respectively.
+\oldconcept{BidirectionalIterator} requirements\iref{bidirectional.iterators}
+or \oldconcept{RandomAccessIterator} requirements\iref{random.access.iterators}, respectively.
 
 \rSec3[move.iter.ops]{\tcode{move_iterator} operations}
 
@@ -2549,8 +2549,8 @@
 The behavior of a program that applies \tcode{operator++()} to an end-of-stream
 iterator is undefined.
 It is impossible to store things into istream iterators.
-The type \tcode{T} shall satisfy the \textit{Cpp98DefaultConstructible},
-\textit{Cpp98CopyConstructible}, and \textit{Cpp98CopyAssignable} requirements.
+The type \tcode{T} shall satisfy the \oldconcept{DefaultConstructible},
+\oldconcept{CopyConstructible}, and \oldconcept{CopyAssignable} requirements.
 
 \pnum
 Two end-of-stream iterators are always equal.