LWG3775 Broken dependencies in the Cpp17Allocator requirements

Author: burblebee

source/lib-intro.tex

@@ -2047,11 +2047,11 @@
 \begin{itemdescr}
 \pnum
 \mandates
-\tcode{X::pointer} is convertible to \tcode{X::const_pointer}.
+\tcode{XX::pointer} is convertible to \tcode{XX::const_pointer}.
 
 \pnum
 \remarks
-Default: \tcode{pointer_traits<X::pointer>::rebind<const T>}
+Default: \tcode{pointer_traits<XX::pointer>::rebind<const T>}
 \end{itemdescr}
 
 \begin{itemdecl}
@@ -2062,13 +2062,13 @@
 \begin{itemdescr}
 \pnum
 \mandates
-\tcode{X::pointer} is convertible to \tcode{X::void_pointer}.
-\tcode{X::void_pointer} and \tcode{Y::void_pointer} are the same type.
+\tcode{XX::pointer} is convertible to \tcode{XX::void_pointer}.
+\tcode{XX::void_pointer} and \tcode{YY::void_pointer} are the same type.
 
 \pnum
 \remarks
 Default:
-\tcode{pointer_traits<X::pointer>::rebind<void>}
+\tcode{pointer_traits<XX::pointer>::rebind<void>}
 \end{itemdescr}
 
 \begin{itemdecl}
@@ -2079,15 +2079,15 @@
 \begin{itemdescr}
 \pnum
 \mandates
-\tcode{X::pointer}, \tcode{X::const_pointer}, and \tcode{X::void_pointer}
-are convertible to \tcode{X::const_void_pointer}.
-\tcode{X::const_void_pointer} and \tcode{Y::const_void_pointer}
+\tcode{XX::pointer}, \tcode{XX::const_pointer}, and \tcode{XX::void_pointer}
+are convertible to \tcode{XX::const_void_pointer}.
+\tcode{XX::const_void_pointer} and \tcode{YY::const_void_pointer}
 are the same type.
 
 \pnum
 \remarks
 Default:
-\tcode{pointer_traits<X::pointer>::rebind<const void>}
+\tcode{pointer_traits<XX::pointer>::rebind<const void>}
 \end{itemdescr}
 
 \begin{itemdecl}
@@ -2113,7 +2113,7 @@
 \pnum
 \remarks
 Default:
-\tcode{make_unsigned_t<X::difference_type>}
+\tcode{make_unsigned_t<XX::difference_type>}
 \end{itemdescr}
 
 \begin{itemdecl}
@@ -2129,7 +2129,7 @@
 \pnum
 \remarks
 Default:
-\tcode{pointer_traits<X::pointer>::difference_type}
+\tcode{pointer_traits<XX::pointer>::difference_type}
 \end{itemdescr}
 
 \begin{itemdecl}
@@ -2144,7 +2144,7 @@
 \pnum
 \ensures
 For all \tcode{U} (including \tcode{T}),
-\tcode{Y::template rebind<T>::other} is \tcode{X}.
+\tcode{YY::rebind_alloc<T>} is \tcode{X}.
 
 \pnum
 \remarks
@@ -2230,41 +2230,41 @@
 \end{itemdescr}
 
 \begin{itemdecl}
-static_cast<X::pointer>(w)
+static_cast<XX::pointer>(w)
 \end{itemdecl}
 
 \begin{itemdescr}
 \pnum
 \result
-\tcode{X::pointer}
+\tcode{XX::pointer}
 
 \pnum
 \ensures
-\tcode{static_cast<X::pointer>(w) == p}.
+\tcode{static_cast<XX::pointer>(w) == p}.
 \end{itemdescr}
 
 \begin{itemdecl}
-static_cast<X::const_pointer>(x)
+static_cast<XX::const_pointer>(x)
 \end{itemdecl}
 
 \begin{itemdescr}
 \pnum
 \result
-\tcode{X::const_pointer}
+\tcode{XX::const_pointer}
 
 \pnum
 \ensures
-\tcode{static_cast<X::const_pointer>(x) == q}.
+\tcode{static_cast<XX::const_pointer>(x) == q}.
 \end{itemdescr}
 
 \begin{itemdecl}
-pointer_traits<X::pointer>::pointer_to(r)
+pointer_traits<XX::pointer>::pointer_to(r)
 \end{itemdecl}
 
 \begin{itemdescr}
 \pnum
 \result
-\tcode{X::pointer}
+\tcode{XX::pointer}
 
 \pnum
 \ensures
@@ -2278,7 +2278,7 @@
 \begin{itemdescr}
 \pnum
 \result
-\tcode{X::pointer}
+\tcode{XX::pointer}
 
 \pnum
 \effects
@@ -2316,7 +2316,7 @@
 \begin{itemdescr}
 \pnum
 \result
-\tcode{X::pointer}
+\tcode{XX::pointer}
 
 \pnum
 \effects
@@ -2335,11 +2335,11 @@
 \begin{itemdescr}
 \pnum
 \result
-\tcode{allocation_result<X::pointer>}
+\tcode{allocation_result<XX::pointer>}
 
 \pnum
 \returns
-\tcode{allocation_result<X::pointer>\{ptr, count\}}
+\tcode{allocation_result<XX::pointer>\{ptr, count\}}
 where \tcode{ptr} is memory allocated for an array of \tcode{count} \tcode{T}
 and such an object is created but array elements are not constructed,
 such that $\tcode{count} \geq \tcode{n}$.
@@ -2397,11 +2397,11 @@
 \begin{itemdescr}
 \pnum
 \result
-\tcode{X::size_type}
+\tcode{XX::size_type}
 
 \pnum
 \returns
-The largest value that can meaningfully be passed to \tcode{X::allocate()}.
+The largest value \tcode{n} that can meaningfully be passed to \tcode{a.allocate(n)}.
 
 \pnum
 \remarks
@@ -2458,7 +2458,7 @@
 
 \pnum
 \returns
-\tcode{a == Y::rebind<T>::other(b)}.
+\tcode{a == YY::rebind_alloc<T>(b)}.
 \end{itemdescr}
 
 \begin{itemdecl}
@@ -2677,43 +2677,43 @@
 \pnum
 An allocator type \tcode{X} shall meet the
 \oldconcept{CopyConstructible} requirements (\tref{cpp17.copyconstructible}).
-The \tcode{X::pointer}, \tcode{X::const_pointer}, \tcode{X::void_pointer}, and
-\tcode{X::const_void_pointer} types shall meet the
+The \tcode{XX::pointer}, \tcode{XX::const_pointer}, \tcode{XX::void_pointer}, and
+\tcode{XX::const_void_pointer} types shall meet the
 \oldconcept{Nullable\-Pointer} requirements (\tref{cpp17.nullablepointer}).
 No constructor,
 comparison operator function, copy operation, move operation, or swap operation on
-these pointer types shall exit via an exception. \tcode{X::pointer} and \tcode{X::const_pointer} shall also
+these pointer types shall exit via an exception. \tcode{XX::pointer} and \tcode{XX::const_pointer} shall also
 meet the requirements for
 a \oldconcept{RandomAccessIterator}\iref{random.access.iterators} and
-the additional requirement that, when \tcode{a} and \tcode{(a + n)} are
+the additional requirement that, when \tcode{p} and \tcode{(p + n)} are
 dereferenceable pointer values for some integral value \tcode{n},
 \begin{codeblock}
-addressof(*(a + n)) == addressof(*a) + n
+addressof(*(p + n)) == addressof(*p) + n
 \end{codeblock}
 is \tcode{true}.
 
 \pnum
 Let \tcode{x1} and \tcode{x2} denote objects of (possibly different) types
-\tcode{X::void_pointer}, \tcode{X::const_void_pointer}, \tcode{X::pointer},
-or \tcode{X::const_pointer}. Then, \tcode{x1} and \tcode{x2} are
+\tcode{XX::void_pointer}, \tcode{XX::const_void_pointer}, \tcode{XX::pointer},
+or \tcode{XX::const_pointer}. Then, \tcode{x1} and \tcode{x2} are
 \defn{equivalently-valued} pointer values, if and only if both \tcode{x1} and \tcode{x2}
 can be explicitly converted to the two corresponding objects \tcode{px1} and \tcode{px2}
-of type \tcode{X::const_pointer}, using a sequence of \keyword{static_cast}s
+of type \tcode{XX::const_pointer}, using a sequence of \keyword{static_cast}s
 using only these four types, and the expression \tcode{px1 == px2}
 evaluates to \tcode{true}.
 
 \pnum
-Let \tcode{w1} and \tcode{w2} denote objects of type \tcode{X::void_pointer}.
+Let \tcode{w1} and \tcode{w2} denote objects of type \tcode{XX::void_pointer}.
 Then for the expressions
 \begin{codeblock}
 w1 == w2
 w1 != w2
 \end{codeblock}
 either or both objects may be replaced by an equivalently-valued object of type
-\tcode{X::const_void_pointer} with no change in semantics.
+\tcode{XX::const_void_pointer} with no change in semantics.
 
 \pnum
-Let \tcode{p1} and \tcode{p2} denote objects of type \tcode{X::pointer}.
+Let \tcode{p1} and \tcode{p2} denote objects of type \tcode{XX::pointer}.
 Then for the expressions
 \begin{codeblock}
 p1 == p2
@@ -2725,7 +2725,7 @@
 p1 - p2
 \end{codeblock}
 either or both objects may be replaced by an equivalently-valued object of type
-\tcode{X::const_pointer} with no change in semantics.
+\tcode{XX::const_pointer} with no change in semantics.
 
 \pnum
 An allocator may constrain the types on which it can be instantiated and the