[rand] Use itemize envs instead of enumeratea

source/numerics.tex

@@ -1542,7 +1542,7 @@
 With \tcode{T} as the \tcode{result_type}
 thus associated with such an entity,
 that entity is characterized:
-\begin{enumeratea}
+\begin{itemize}
  \item
    as \term{boolean} or equivalently as \term{boolean-valued},
    if \tcode{T} is \tcode{bool};
@@ -1553,7 +1553,7 @@
  \item
    otherwise
    as \term{floating} or equivalently as \term{real-valued}.
-\end{enumeratea}
+\end{itemize}
 \noindent
 If integer-valued,
 an entity may optionally be further characterized as
@@ -1573,15 +1573,15 @@
 denote the respective conventional bitwise operations.
 Further:
 
-\begin{enumeratea}
+\begin{itemize}
  \item
    the operator \rightshift{} denotes a bitwise right shift
    with zero-valued bits appearing in the high bits of the result, and
  \item
    the operator \leftshift{w} denotes a bitwise left shift
    with zero-valued bits appearing in the low bits of the result,
    and whose result is always taken modulo $2^w$.
-\end{enumeratea}
+\end{itemize}
 
 
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
@@ -1760,7 +1760,7 @@
 \pnum
 Throughout this subclause \ref{rand},
 the effect of instantiating a template:
-\begin{enumeratea}
+\begin{itemize}
   \item
     that has a template type parameter
     named \tcode{Sseq}
@@ -1815,7 +1815,7 @@
       \tcode{unsigned long},
       or
       \tcode{unsigned long long}.
-\end{enumeratea}
+\end{itemize}
 
 \pnum
 Throughout this subclause \ref{rand},
@@ -1863,7 +1863,7 @@
 and if \tcode{S} also satisfies all other requirements
 of this subclause \ref{rand.req.seedseq}.
 In that Table and throughout this subclause:
-\begin{enumeratea}
+\begin{itemize}
   \item
     \tcode{T} is the type named by
     \tcode{S}'s associated \tcode{result_type};
@@ -1882,7 +1882,7 @@
   and
   \item
     \tcode{il} is a value of \tcode{initializer_list<T>}.
-\end{enumeratea}
+\end{itemize}
 
 
 \begin{libreqtab4d}
@@ -2059,7 +2059,7 @@
 
 \pnum
 \tcode{E}'s specification shall define:
-\begin{enumeratea}
+\begin{itemize}
  \item
    the size of \tcode{E}'s state
    in multiples of the size of \tcode{result_type},
@@ -2076,7 +2076,7 @@
    $\mathsf{GA}$
    by which an engine's state is mapped
    to a value of type \tcode{result_type}.
-\end{enumeratea}
+\end{itemize}
 
 \pnum
 A class \tcode{E}
@@ -2090,7 +2090,7 @@
 and if \tcode{E} also satisfies all other requirements
 of this subclause \ref{rand.req.eng}.
 In that Table and throughout this subclause:
-\begin{enumeratea}
+\begin{itemize}
   \item
     \tcode{T} is the type named by
     \tcode{E}'s associated \tcode{result_type};
@@ -2113,7 +2113,7 @@
   \item
     \tcode{is} is an lvalue of the type of some class template specialization
     \tcode{basic_istream<charT,} \tcode{traits>};
-\end{enumeratea}
+\end{itemize}
 where \tcode{charT} and \tcode{traits} are constrained
 according to \ref{strings} and \ref{input.output}.
 
@@ -2401,7 +2401,7 @@
 \pnum
 \tcode{A} shall also satisfy
 the following additional requirements:
-\begin{enumeratea}
+\begin{itemize}
  \item
    The complexity
    of each function
@@ -2425,7 +2425,7 @@
    of \tcode{A}
    shall include
    the textual representation of its base engine.
-\end{enumeratea}
+\end{itemize}
 
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 % Random Number Distribution requirements:
@@ -2474,7 +2474,7 @@
 also satisfy all other requirements
 of this subclause \ref{rand.req.dist}.
 In that Table and throughout this subclause,
-\begin{enumeratea}
+\begin{itemize}
   \item
     \tcode{T} is the type named by
     \tcode{D}'s associated \tcode{result_type};
@@ -2506,7 +2506,7 @@
   \item
     \tcode{is} is an lvalue of the type of some class template specialization
     \tcode{basic_istream<charT,} \tcode{traits>};
-\end{enumeratea}
+\end{itemize}
 where \tcode{charT} and \tcode{traits} are constrained
 according to \ref{strings} and \ref{input.output}.
 
@@ -2965,7 +2965,7 @@
 defined by values $u$, $d$, $s$, $b$, $t$, $c$, and $\ell$.
 
 The state transition is performed as follows:
-\begin{enumeratea}
+\begin{itemize}
  \item
    Concatenate
      the upper $w-r$ bits of $X_{i-n}$
@@ -2976,7 +2976,7 @@
    With $\alpha = a \cdot (Y \bitand 1)$,
    set $X_i$ to
      $X_{i+m-n} \xor (Y \rightshift 1) \xor \alpha$.
-\end{enumeratea}
+\end{itemize}
 The sequence $X$ is initialized
 with the help of an initialization multiplier $f$.
 
@@ -2986,7 +2986,7 @@
 \indextext{generation algorithm!\idxcode{mersenne_twister_engine}}
  determines the unsigned integer values $z_1, z_2, z_3, z_4$ as follows,
  then delivers $z_4$ as its result:
-\begin{enumeratea}
+\begin{itemize}
  \item
    Let $z_1 = X_i \xor \bigl(( X_i \rightshift u ) \bitand d\bigr)$.
  \item
@@ -2995,7 +2995,7 @@
    Let $z_3 = z_2 \xor \bigl( (z_2 \leftshift{w} t) \bitand c \bigr)$.
  \item
    Let $z_4 = z_3 \xor ( z_3 \rightshift \ell )$.
-\end{enumeratea}
+\end{itemize}
 
 \indexlibrary{\idxcode{mersenne_twister_engine}}%
 \begin{codeblock}
@@ -3142,14 +3142,14 @@
 \indextext{\idxcode{subtract_with_carry_engine}!transition algorithm}%
 \indextext{transition algorithm!\idxcode{subtract_with_carry_engine}}
 is performed as follows:
-\begin{enumeratea}
+\begin{itemize}
  \item
    Let $Y = X_{i-s} - X_{i-r} - c$.
  \item
    Set $X_i$ to $y = Y \bmod m$.
    Set $c$ to 1 if $Y < 0$,
    otherwise set $c$ to 0.
-\end{enumeratea}
+\end{itemize}
 \begin{note}
  This algorithm corresponds
  to a modular linear function
@@ -3457,7 +3457,7 @@
 The transition and generation algorithms
 are described in terms
 of the following integral constants:%
-\begin{enumeratea}
+\begin{itemize}
  \item
    Let
      $R = \tcode{e.max() - e.min() + 1}$
@@ -3479,7 +3479,7 @@
    holds as a result.
    Otherwise let
      $n = 1 + \left\lceil w / m \right\rceil$.
-\end{enumeratea}
+\end{itemize}
 \begin{note}
  The relation
  $w = n_0 w_0 + (n - n_0)(w_0 + 1)$
@@ -3595,7 +3595,7 @@
 \indextext{transition algorithm!\idxcode{shuffle_order_engine}}
 permutes the values produced by $e$.
 The state transition is performed as follows:
-\begin{enumeratea}
+\begin{itemize}
  \item
    Calculate an integer
    $j = \left\lfloor \frac{k \cdot (Y - e_{\min})}
@@ -3605,7 +3605,7 @@
    .
  \item
    Set $Y$ to $V_j$ and then set $V_j$ to $\tcode{e()}$.
-\end{enumeratea}
+\end{itemize}
 
 \pnum
 The generation algorithm%
@@ -4106,7 +4106,7 @@
  each indexing operator applied to \tcode{begin} is to be taken modulo $n$,
  and $T(x)$ is defined as $x \xor (x \rightshift 27)$:
 
-\begin{enumeratea}
+\begin{itemize}
  \item
    By way of initialization,
    set each element of the range to the value \tcode{0x8b8b8b8b}.
@@ -4165,7 +4165,7 @@
    update $\tcode{begin[}k+q\tcode{]}$ by xoring it with $r_4$,
    and
    set $\tcode{begin[}k\tcode{]}$ to $r_4$.
-\end{enumeratea}
+\end{itemize}
 
 \pnum\throws
 What and when \tcode{RandomAccessIterator} operations of \tcode{begin}