[basic.fundamental] Rename 'range exponent' to 'width' to align with C

jfbastien · zygoloid · commit 0ba5424c1bed · 2019-03-15T13:52:39.000-07:00
diff --git a/source/basic.tex b/source/basic.tex
@@ -4512,7 +4512,7 @@
 \defnx{signed integer types}{signed integer type}.
 The range of representable values for a signed integer type is
 $-2^{N-1}$ to $2^{N-1}-1$ (inclusive),
-where \placeholder{N} is called the \defn{range exponent} of the type.
+where \placeholder{N} is called the \defn{width} of the type.
 \indextext{integral type!implementation-defined \tcode{sizeof}}%
 \begin{note}
 Plain \tcode{int}s are intended to have
@@ -4540,7 +4540,7 @@
 there exists a corresponding \defn{extended unsigned integer type}.
 The standard and extended unsigned integer types
 are collectively called \defnx{unsigned integer types}{unsigned integer type}.
-An unsigned integer type has the same range exponent \placeholder{N}
+An unsigned integer type has the same width \placeholder{N}
 as the corresponding signed integer type.
 \indextext{arithmetic!\idxcode{unsigned}}%
 The range of representable values for the unsigned type is
@@ -4568,9 +4568,9 @@
 the largest value of the corresponding unsigned type.
 \end{example}
 
-\begin{floattable}{Minimum range exponent}{tab:range.exponent}{ll}
+\begin{floattable}{Minimum width}{tab:width}{ll}
 \topline
-\lhdr{Type} & \rhdr{Minimum range exponent $N$} \\
+\lhdr{Type} & \rhdr{Minimum width $N$} \\
 \capsep
 \tcode{signed char} & 8 \\
 \tcode{short} & 16 \\
@@ -4580,10 +4580,10 @@
 \end{floattable}
 
 \pnum
-The range exponent of each signed integer type
-shall not be less than the values specified in \tref{range.exponent}.
+The width of each signed integer type
+shall not be less than the values specified in \tref{width}.
 The value representation of a signed or unsigned integer type
-comprises $N$ bits, where N is the respective range exponent.
+comprises $N$ bits, where N is the respective width.
 Each set of values for any padding bits\iref{basic.types}
 in the object representation are
 alternative representations of the value specified by the value representation.
@@ -4596,11 +4596,11 @@
 the constraints given in ISO C 5.2.4.2.1.
 \end{note}
 Except as specified above,
-the range exponent of a signed or unsigned integer type is
-\impldef{range exponent of integral type}.
+the width of a signed or unsigned integer type is
+\impldef{width of integral type}.
 
 \pnum
-Each value $x$ of an unsigned integer type with range exponent $N$ has
+Each value $x$ of an unsigned integer type with width $N$ has
 a unique representation $x = x_0 2^0 + x_1 2^1 + \ldots + x_{N-1} 2^{N-1}$,
 where each coefficient $x_i$ is either 0 or 1;
 this is called the \defn{base-2 representation} of $x$.
@@ -4652,7 +4652,7 @@
 \end{note}
 \begin{note}
 A bit-field of narrow character type whose width is larger than
-the range exponent of that type has padding bits; see \ref{basic.types}.
+the width of that type has padding bits; see \ref{basic.types}.
 \end{note}
 
 \pnum
diff --git a/source/classes.tex b/source/classes.tex
@@ -2887,7 +2887,7 @@
 with a value greater than or equal to zero and
 is called the \defn{width} of the bit-field.
 If the width of a bit-field is larger than
-the range exponent of the bit-field's type
+the width of the bit-field's type
 (or, in case of an enumeration type, of its underlying type),
 the extra bits are padding bits\iref{basic.types}.
 \indextext{allocation!implementation-defined bit-field}%
@@ -2939,7 +2939,7 @@
 If a value of integral type (other than \tcode{bool}) is stored
 into a bit-field of width $N$ and the value would be representable
 in a hypothetical signed or unsigned integer type
-with range exponent $N$ and the same signedness as the bit-field's type,
+with width $N$ and the same signedness as the bit-field's type,
 the original value and the value of the bit-field compare equal.
 If the value \tcode{true} or \tcode{false} is stored into a bit-field of
 type \tcode{bool} of any size (including a one bit bit-field), the
diff --git a/source/declarations.tex b/source/declarations.tex
@@ -6833,7 +6833,7 @@
 For an enumeration whose underlying type is fixed, the values of
 the enumeration are the values of the underlying type. Otherwise,
 the values of the enumeration are the values representable by
-a hypothetical integer type with minimal range exponent $M$
+a hypothetical integer type with minimal width $M$
 such that all enumerators can be represented.
 The width of the smallest bit-field large enough to hold all the values of the
 enumeration type is $M$.
diff --git a/source/expressions.tex b/source/expressions.tex
@@ -898,7 +898,7 @@
 \indextext{conversion!to signed}%
 Otherwise, the result is the unique value of the destination type
 that is congruent to the source integer modulo $2^N$,
-where $N$ is the range exponent of the destination type.
+where $N$ is the width of the destination type.
 
 \pnum
 The conversions allowed as integral promotions are excluded from the set
@@ -5791,12 +5791,12 @@
 left operand.
 \indextext{left shift!undefined}%
 The behavior is undefined if the right operand is negative, or greater
-than or equal to the range exponent of the promoted left operand.
+than or equal to the width of the promoted left operand.
 
 \pnum
 The value of \tcode{E1 << E2} is the unique value congruent to
 $\tcode{E1} \times 2^\tcode{E2}$ modulo $2^N$,
-where $N$ is the range exponent of the type of the result.
+where $N$ is the width of the type of the result.
 \begin{note}
 \tcode{E1} is left-shifted \tcode{E2} bit positions;
 vacated bits are zero-filled.
