[std] Use \keyword for void.

Author: jensmaurer

source/basic.tex

@@ -5148,7 +5148,7 @@
 
 \pnum
 \indextext{terminology!pointer}%
-The type of a pointer to \cv{}~\tcode{void} or a pointer to an object type is
+The type of a pointer to \cv{}~\keyword{void} or a pointer to an object type is
 called an \defn{object pointer type}.
 \begin{note}
 A pointer to \keyword{void}

source/classes.tex

@@ -2500,10 +2500,10 @@
 A conversion function is never used to convert a (possibly cv-qualified) object
 to the (possibly cv-qualified) same object type (or a reference to it),
 to a (possibly cv-qualified) base class of that type (or a reference to it),
-or to \cv{}~\tcode{void}.
+or to \cv{}~\keyword{void}.
 \begin{footnote}
 These conversions are considered
-as standard conversions for the purposes of overload resolution~(\ref{over.best.ics}, \ref{over.ics.ref}) and therefore initialization\iref{dcl.init} and explicit casts\iref{expr.static.cast}. A conversion to \tcode{void} does not invoke any conversion function\iref{expr.static.cast}.
+as standard conversions for the purposes of overload resolution~(\ref{over.best.ics}, \ref{over.ics.ref}) and therefore initialization\iref{dcl.init} and explicit casts\iref{expr.static.cast}. A conversion to \keyword{void} does not invoke any conversion function\iref{expr.static.cast}.
 Even though never directly called to perform a conversion,
 such conversion functions can be declared and can potentially
 be reached through a call to a virtual conversion function in a base class.
@@ -2699,7 +2699,7 @@
 The declaration of a non-inline
 static data member in its class definition
 is not a definition and may be of an incomplete type other than
-\cv{}~\tcode{void}.
+\cv{}~\keyword{void}.
 \indextext{operator use!scope resolution}%
 \begin{note}
 The \grammarterm{initializer} in the definition of a

source/compatibility.tex

@@ -521,7 +521,7 @@
 \diffref{forward.list,list}
 \change
 Return types of \tcode{remove}, \tcode{remove_if}, and \tcode{unique}
-changed from \tcode{void} to \tcode{container::size_type}.
+changed from \keyword{void} to \tcode{container::size_type}.
 \rationale
 Improve efficiency and convenience of finding number of removed elements.
 \effect
@@ -1641,7 +1641,7 @@
 
 \diffref{sequence.reqmts,associative.reqmts}
 \change
-Signature changes: from \tcode{void} return types.
+Signature changes: from \keyword{void} return types.
 \rationale
 Old signature threw away useful information that may be expensive
 to recalculate.
@@ -1654,7 +1654,7 @@
 \item \tcode{insert(pos, beg, end)} for \tcode{vector}, \tcode{deque}, \tcode{list}, \tcode{forward_list}
 \end{itemize}
 
-Valid \CppIII{} code that relies on these functions returning \tcode{void}
+Valid \CppIII{} code that relies on these functions returning \keyword{void}
 (e.g., code that creates a pointer to member function that points to one
 of these functions) will fail to compile with this revision of \Cpp{}.
 

source/concepts.tex

@@ -662,7 +662,7 @@
 \begin{note}
 Whenever \tcode{ranges::swap(E1, E2)} is a valid expression, it
 exchanges the values denoted by
-\tcode{E1} and \tcode{E2} and has type \tcode{void}.
+\tcode{E1} and \tcode{E2} and has type \keyword{void}.
 \end{note}
 
 \begin{itemdecl}

source/containers.tex

@@ -193,7 +193,7 @@
    linear                     \\ \rowsep
 
 \tcode{a.\~X()}    &
- \tcode{void}               &
+ \keyword{void}               &
                             &
  \effects destroys every element of \tcode{a}; any memory obtained is deallocated. &
  linear                     \\ \rowsep
@@ -243,13 +243,13 @@
  linear                             \\ \rowsep
 
 \tcode{a.swap(b)}          &
- \tcode{void}               &
+ \keyword{void}               &
                             &
  \effects exchanges the contents of \tcode{a} and \tcode{b}          &
  (Note A)                   \\ \rowsep
 
 \tcode{swap(a, b)}          &
-  \tcode{void}              &
+  \keyword{void}              &
   Equivalent to \tcode{a.swap(b)}         &
                             &
   (Note A)                  \\ \rowsep
@@ -732,7 +732,7 @@
   linear                \\ \rowsep
 
 \tcode{a.swap(b)}       &
-  \tcode{void}          &
+  \keyword{void}          &
   \effects exchanges the contents of \tcode{a} and \tcode{b} &
   constant      \\ \rowsep
 
@@ -961,14 +961,14 @@
  \effects\ Erases the elements in the range \tcode{[q1, q2)}.  \\ \rowsep
 
 \tcode{a.clear()}   &
- \tcode{void}       &
+ \keyword{void}       &
  \effects Destroys all elements in \tcode{a}. Invalidates all references, pointers, and
  iterators referring to the elements of \tcode{a} and may invalidate the past-the-end iterator.\br
  \ensures \tcode{a.empty()} is \tcode{true}.\br
  \complexity Linear.      \\ \rowsep
 
 \tcode{a.assign(i,j)}   &
- \tcode{void}           &
+ \keyword{void}           &
  \expects \tcode{T} is \oldconcept{EmplaceConstructible} into \tcode{X} from \tcode{*i}
  and assignable from \tcode{*i}. For \tcode{vector}, if the iterator does not
  meet the forward iterator requirements\iref{forward.iterators}, \tcode{T}
@@ -984,11 +984,11 @@
  Each iterator in the range \range{i}{j} shall be dereferenced exactly once.  \\ \rowsep
 
 \tcode{a.assign(il)}    &
-  \tcode{void}          &
+  \keyword{void}          &
   \tcode{a.assign(il.begin(), il.end())}. \\ \rowsep
 
 \tcode{a.assign(n,t)}   &
- \tcode{void}           &
+ \keyword{void}           &
  \expects \tcode{T} is
  \oldconcept{CopyInsertable} into \tcode{X}
  and \oldconcept{CopyAssignable}.
@@ -1151,7 +1151,7 @@
  \\ \rowsep
 
 \tcode{a.push_front(t)} &
-  \tcode{void}          &
+  \keyword{void}          &
   \effects Prepends a copy of \tcode{t}.\br
   \expects \tcode{T} is
   \oldconcept{CopyInsertable} into \tcode{X}.
@@ -1162,7 +1162,7 @@
   \\ \rowsep
 
 \tcode{a.push_front(rv)} &
-  \tcode{void}          &
+  \keyword{void}          &
   \effects Prepends a copy of \tcode{rv}.\br
   \expects \tcode{T} is
   \oldconcept{MoveInsertable} into \tcode{X}.
@@ -1173,7 +1173,7 @@
   \\ \rowsep
 
 \tcode{a.push_back(t)} &
-  \tcode{void}          &
+  \keyword{void}          &
   \effects Appends a copy of \tcode{t}.\br
   \expects \tcode{T} is
   \oldconcept{CopyInsertable} into \tcode{X}.
@@ -1185,7 +1185,7 @@
   \\ \rowsep
 
 \tcode{a.push_back(rv)} &
-  \tcode{void}          &
+  \keyword{void}          &
   \effects Appends a copy of \tcode{rv}.\br
   \expects \tcode{T} is
   \oldconcept{MoveInsertable} into \tcode{X}.
@@ -1197,7 +1197,7 @@
   \\ \rowsep
 
 \tcode{a.pop_front()}      &
- \tcode{void}               &
+ \keyword{void}               &
  \effects Destroys the first element.\br
  \expects \tcode{a.empty()} is \tcode{false}. &
  \tcode{deque},
@@ -1206,7 +1206,7 @@
  \\ \rowsep
 
 \tcode{a.pop_back()}       &
- \tcode{void}               &
+ \keyword{void}               &
  \effects Destroys the last element.\br
  \expects \tcode{a.empty()} is \tcode{false}. &
  \tcode{basic_string},
@@ -1935,7 +1935,7 @@
   is inserted right before \tcode{p}. \\ \rowsep
 
 \tcode{a.\brk{}insert(\brk{}i, j)}          &
-  \tcode{void}                   &
+  \keyword{void}                   &
   \expects \tcode{value_type} is \oldconcept{EmplaceConstructible} into \tcode{X} from \tcode{*i}.
   Neither \tcode{i} nor \tcode{j} are iterators into \tcode{a}.\br
   \effects Inserts each element from the range \range{i}{j} if and only if there
@@ -1944,7 +1944,7 @@
   $N \log (\tcode{a.size()} + N)$, where $N$ has the value \tcode{distance(i, j)} \\ \rowsep
 
 \tcode{a.\brk{}insert(\brk{}il)}           &
-  \tcode{void}                  &
+  \keyword{void}                  &
   \effects
   Equivalent to \tcode{a.insert(il.begin(), il.end())} &
                                           \\ \rowsep
@@ -2008,7 +2008,7 @@
 
 \indexordmem{merge}%
 \tcode{a.merge(a2)}              &
- \tcode{void}             &
+ \keyword{void}             &
  \expects \tcode{a.get_allocator() == a2.get_allocator()}.\br
  \effects Attempts to extract each element in \tcode{a2} and insert it into \tcode{a}
  using the comparison object of \tcode{a}. In containers with unique keys,
@@ -2056,7 +2056,7 @@
 
 \indexordmem{clear}%
 \tcode{a.clear()}       &
- \tcode{void}           &
+ \keyword{void}           &
  \effects Equivalent to \tcode{a.erase(a.begin(), a.end())}.\br
  \ensures \tcode{a.empty()} is \tcode{true}.  &
  linear in \tcode{a.size()}.  \\ \rowsep
@@ -2747,7 +2747,7 @@
 \\ \rowsep
 %
 \tcode{a.insert(i, j)}
-&   \tcode{void}
+&   \keyword{void}
 &   \expects \tcode{value_type} is \oldconcept{EmplaceConstructible} into \tcode{X} from \tcode{*i}.
     Neither \tcode{i} nor \tcode{j} are iterators into \tcode{a}.\br
     \effects Equivalent to \tcode{a.insert(t)} for each element in \tcode{[i,j)}.%
@@ -2756,7 +2756,7 @@
 \\ \rowsep
 %
 \tcode{a.insert(il)}
-&   \tcode{void}
+&   \keyword{void}
 &   Same as \tcode{a.insert(il.begin(), il.end())}.
 &   Same as \tcode{a.insert(} \tcode{il.begin(),} \tcode{il.end())}.
 \\ \rowsep
@@ -2820,7 +2820,7 @@
 %
 \indexunordmem{merge}%
 \tcode{a.merge(a2)}              &
- \tcode{void}             &
+ \keyword{void}             &
  \expects \tcode{a.get_allocator() == a2.get_allocator()}.\br
  Attempts to extract each element in \tcode{a2} and insert it into \tcode{a}
  using the hash function and key equality predicate of \tcode{a}.
@@ -2869,7 +2869,7 @@
 %
 \indexunordmem{clear}%
 \tcode{a.clear()}
-& \tcode{void}
+& \keyword{void}
 & \effects Erases all elements in the container.\br
    \ensures \tcode{a.empty()} is \tcode{true}%
 & Linear in \tcode{a.size()}.
@@ -3034,23 +3034,23 @@
 \\ \rowsep
 %
 \tcode{a.max_load_factor(z)}
-&   \tcode{void}
+&   \keyword{void}
 &   \expects \tcode{z} is positive.
     May change the container's maximum load factor, using \tcode{z} as a hint.%
 & Constant
 \\ \rowsep
 %
 \indexunordmem{rehash}%
 \tcode{a.rehash(n)}
-& \tcode{void}
+& \keyword{void}
 & \ensures \tcode{a.bucket_count() >= a.size() / a.max_load_factor()} and
         \tcode{a.bucket_count() >= n}.%
 & Average case linear in \tcode{a.size()}, worst case quadratic.
 \\ \rowsep
 
 \indexunordmem{reserve}%
 \tcode{a.reserve(n)}  &
-  \tcode{void}        &
+  \keyword{void}        &
   Same as \tcode{a.rehash(ceil(n /} \tcode{a.max_load_factor()))}.  &
   Average case linear in \tcode{a.size()}, worst case quadratic. \\
 

source/declarations.tex

@@ -1400,7 +1400,7 @@
 \tcode{float}                     & ``\tcode{float}''                 \\
 \tcode{double}                    & ``\tcode{double}''                \\
 \tcode{long double}               & ``\tcode{long double}''           \\
-\tcode{void}                      & ``\tcode{void}''                  \\
+\keyword{void}                      & ``\tcode{void}''                  \\
 \end{simpletypetable}
 
 \pnum
@@ -1768,7 +1768,7 @@
 body.
 \begin{example}
 \begin{codeblock}
-auto  f() { }                   // OK, return type is \tcode{void}
+auto  f() { }                   // OK, return type is \keyword{void}
 auto* g() { }                   // error: cannot deduce \tcode{auto*} from \tcode{void()}
 \end{codeblock}
 \end{example}
@@ -1925,7 +1925,7 @@
 \end{itemize}
 
 In the case of a \tcode{return} statement with no operand
-or with an operand of type \tcode{void},
+or with an operand of type \keyword{void},
 \tcode{T} shall be either
 \opt{\grammarterm{type-constraint}} \tcode{decltype(auto)} or
 \cv{}~\opt{\grammarterm{type-constraint}} \tcode{auto}.
@@ -2850,7 +2850,7 @@
 \end{note}
 \indextext{\idxcode{void\&}}%
 A declarator that specifies the type
-``reference to \cv{}~\tcode{void}''
+``reference to \cv{}~\keyword{void}''
 is ill-formed.
 
 
@@ -3091,7 +3091,7 @@
 of a class\iref{class.static},
 a member with reference type,
 or
-``\cv{}~\tcode{void}''.
+``\cv{}~\keyword{void}''.
 
 \pnum
 \begin{note}
@@ -3147,10 +3147,10 @@
 a reference type,
 a function type,
 an array of unknown bound, or
-\cv{}~\tcode{void}.
+\cv{}~\keyword{void}.
 \begin{note}
 An array can be constructed
-from one of the fundamental types (except \tcode{void}),
+from one of the fundamental types (except \keyword{void}),
 from a pointer,
 from a pointer to member,
 from a class,
@@ -3437,10 +3437,10 @@
 \grammarterm{parameter-declaration-clause}
 is empty, the function takes no arguments.
 A parameter list consisting of a single unnamed parameter of
-non-dependent type \tcode{void} is equivalent to an empty parameter
+non-dependent type \keyword{void} is equivalent to an empty parameter
 list.
 \indextext{parameter!\idxcode{void}}%
-Except for this special case, a parameter shall not have type \cv{}~\tcode{void}.
+Except for this special case, a parameter shall not have type \cv{}~\keyword{void}.
 A parameter with volatile-qualified type is deprecated;
 see~\ref{depr.volatile.type}.
 If the
@@ -3605,7 +3605,7 @@
 \pnum
 \indextext{function return type|see{return type}}%
 \indextext{return type}%
-The return type shall be a non-array object type, a reference type, or \cv{}~\tcode{void}.
+The return type shall be a non-array object type, a reference type, or \cv{}~\keyword{void}.
 
 \pnum
 A volatile-qualified return type is deprecated;
@@ -5994,7 +5994,7 @@
 
 \pnum
 In a \grammarterm{function-definition},
-either \tcode{void} \grammarterm{declarator} \tcode{;}
+either \keyword{void} \grammarterm{declarator} \tcode{;}
 or \grammarterm{declarator} \tcode{;}
 shall be a well-formed function declaration
 as described in~\ref{dcl.fct}.
@@ -8833,7 +8833,7 @@
 \recommended
 Appearance of a nodiscard call as
 a potentially-evaluated discarded-value expression\iref{expr.prop}
-is discouraged unless explicitly cast to \tcode{void}.
+is discouraged unless explicitly cast to \keyword{void}.
 Implementations should issue a warning in such cases.
 \begin{note}
 This is typically because discarding the return value
@@ -8859,7 +8859,7 @@
 void launch_missiles();
 void test_missiles() {
   my_scopeguard();              // warning encouraged
-  (void)my_scopeguard(),        // warning not encouraged, cast to \tcode{void}
+  (void)my_scopeguard(),        // warning not encouraged, cast to \keyword{void}
     launch_missiles();          // comma operator, statement continues
   my_unique(42);                // warning encouraged
   my_unique();                  // warning not encouraged