Merge 2021-06 LWG Motion 7

P1425R4 Iterators pair constructors for stack and queue

Author: tkoeppe

source/containers.tex

@@ -9852,11 +9852,14 @@
     queue() : queue(Container()) {}
     explicit queue(const Container&);
     explicit queue(Container&&);
+    template<class InputIterator> queue(InputIterator first, InputIterator last);
     template<class Alloc> explicit queue(const Alloc&);
     template<class Alloc> queue(const Container&, const Alloc&);
     template<class Alloc> queue(Container&&, const Alloc&);
     template<class Alloc> queue(const queue&, const Alloc&);
     template<class Alloc> queue(queue&&, const Alloc&);
+    template<class InputIterator, class Alloc>
+      queue(InputIterator first, InputIterator last, const Alloc&);
 
     [[nodiscard]] bool empty() const    { return c.empty(); }
     size_type         size()  const     { return c.size(); }
@@ -9877,9 +9880,17 @@
   template<class Container>
     queue(Container) -> queue<typename Container::value_type, Container>;
 
+  template<class InputIterator>
+    queue(InputIterator, InputIterator) -> queue<@\exposid{iter-value-type}@<InputIterator>>;
+
   template<class Container, class Allocator>
     queue(Container, Allocator) -> queue<typename Container::value_type, Container>;
 
+  template<class InputIterator, class Allocator>
+    queue(InputIterator, InputIterator, Allocator)
+      -> queue<@\exposid{iter-value-type}@<InputIterator>, deque<@\exposid{iter-value-type}@<InputIterator>,
+               Allocator>>;
+
   template<class T, class Container, class Alloc>
     struct uses_allocator<queue<T, Container>, Alloc>
       : uses_allocator<Container, Alloc>::type { };
@@ -9888,6 +9899,7 @@
 
 \rSec3[queue.cons]{Constructors}
 
+\indexlibraryctor{queue}%
 \begin{itemdecl}
 explicit queue(const Container& cont);
 \end{itemdecl}
@@ -9898,6 +9910,7 @@
 Initializes \tcode{c} with \tcode{cont}.
 \end{itemdescr}
 
+\indexlibraryctor{queue}%
 \begin{itemdecl}
 explicit queue(Container&& cont);
 \end{itemdecl}
@@ -9908,12 +9921,26 @@
 Initializes \tcode{c} with \tcode{std::move(cont)}.
 \end{itemdescr}
 
+\indexlibraryctor{queue}%
+\begin{itemdecl}
+template<class InputIterator>
+  queue(InputIterator first, InputIterator last);
+\end{itemdecl}
+
+\begin{itemdescr}
+\pnum
+\effects
+Initializes \tcode{c} with
+\tcode{first} as the first argument and \tcode{last} as the second argument.
+\end{itemdescr}
+
 \rSec3[queue.cons.alloc]{Constructors with allocators}
 
 \pnum
 If \tcode{uses_allocator_v<container_type, Alloc>} is \tcode{false}
 the constructors in this subclause shall not participate in overload resolution.
 
+\indexlibraryctor{queue}%
 \begin{itemdecl}
 template<class Alloc> explicit queue(const Alloc& a);
 \end{itemdecl}
@@ -9924,6 +9951,7 @@
 Initializes \tcode{c} with \tcode{a}.
 \end{itemdescr}
 
+\indexlibraryctor{queue}%
 \begin{itemdecl}
 template<class Alloc> queue(const container_type& cont, const Alloc& a);
 \end{itemdecl}
@@ -9935,6 +9963,7 @@
 as the second argument.
 \end{itemdescr}
 
+\indexlibraryctor{queue}%
 \begin{itemdecl}
 template<class Alloc> queue(container_type&& cont, const Alloc& a);
 \end{itemdecl}
@@ -9946,6 +9975,7 @@
 as the second argument.
 \end{itemdescr}
 
+\indexlibraryctor{queue}%
 \begin{itemdecl}
 template<class Alloc> queue(const queue& q, const Alloc& a);
 \end{itemdecl}
@@ -9957,6 +9987,7 @@
 second argument.
 \end{itemdescr}
 
+\indexlibraryctor{queue}%
 \begin{itemdecl}
 template<class Alloc> queue(queue&& q, const Alloc& a);
 \end{itemdecl}
@@ -9968,6 +9999,21 @@
 as the second argument.
 \end{itemdescr}
 
+\indexlibraryctor{queue}%
+\begin{itemdecl}
+template<class InputIterator, class Alloc>
+  queue(InputIterator first, InputIterator last, const Alloc& alloc);
+\end{itemdecl}
+
+\begin{itemdescr}
+\pnum
+\effects
+Initializes \tcode{c} with
+\tcode{first} as the first argument,
+\tcode{last} as the second argument, and
+\tcode{alloc} as the third argument.
+\end{itemdescr}
+
 \rSec3[queue.ops]{Operators}
 
 \indexlibrarymember{operator==}{queue}%
@@ -10535,11 +10581,14 @@
     stack() : stack(Container()) {}
     explicit stack(const Container&);
     explicit stack(Container&&);
+    template<class InputIterator> stack(InputIterator first, InputIterator last);
     template<class Alloc> explicit stack(const Alloc&);
     template<class Alloc> stack(const Container&, const Alloc&);
     template<class Alloc> stack(Container&&, const Alloc&);
     template<class Alloc> stack(const stack&, const Alloc&);
     template<class Alloc> stack(stack&&, const Alloc&);
+    template<class InputIterator, class Alloc>
+      stack(InputIterator first, InputIterator last, const Alloc&);
 
     [[nodiscard]] bool empty() const    { return c.empty(); }
     size_type size()  const             { return c.size(); }
@@ -10558,9 +10607,17 @@
   template<class Container>
     stack(Container) -> stack<typename Container::value_type, Container>;
 
+  template<class InputIterator>
+    stack(InputIterator, InputIterator) -> stack<@\exposid{iter-value-type}@<InputIterator>>;
+
   template<class Container, class Allocator>
     stack(Container, Allocator) -> stack<typename Container::value_type, Container>;
 
+  template<class InputIterator, class Allocator>
+    stack(InputIterator, InputIterator, Allocator)
+      -> stack<@\exposid{iter-value-type}@<InputIterator>, deque<@\exposid{iter-value-type}@<InputIterator>,
+               Allocator>>;
+
   template<class T, class Container, class Alloc>
     struct uses_allocator<stack<T, Container>, Alloc>
       : uses_allocator<Container, Alloc>::type { };
@@ -10591,6 +10648,19 @@
 Initializes \tcode{c} with \tcode{std::move(cont)}.
 \end{itemdescr}
 
+\indexlibraryctor{stack}%
+\begin{itemdecl}
+template<class InputIterator>
+  stack(InputIterator first, InputIterator last);
+\end{itemdecl}
+
+\begin{itemdescr}
+\pnum
+\effects
+Initializes \tcode{c} with
+\tcode{first} as the first argument and \tcode{last} as the second argument.
+\end{itemdescr}
+
 \rSec3[stack.cons.alloc]{Constructors with allocators}
 
 \pnum
@@ -10656,6 +10726,21 @@
 as the second argument.
 \end{itemdescr}
 
+\indexlibraryctor{stack}%
+\begin{itemdecl}
+template<class InputIterator, class Alloc>
+  stack(InputIterator first, InputIterator last, const Alloc& alloc);
+\end{itemdecl}
+
+\begin{itemdescr}
+\pnum
+\effects
+Initializes \tcode{c} with
+\tcode{first} as the first argument,
+\tcode{last} as the second argument, and
+\tcode{alloc} as the third argument.
+\end{itemdescr}
+
 \rSec3[stack.ops]{Operators}
 
 \indexlibrarymember{operator==}{stack}%

source/support.tex

@@ -556,6 +556,7 @@
 #define @\defnlibxname{cpp_lib_allocator_traits_is_always_equal}@  201411L
   // also in \libheader{memory}, \libheader{scoped_allocator}, \libheader{string}, \libheader{deque}, \libheader{forward_list}, \libheader{list}, \libheader{vector},
   // \libheader{map}, \libheader{set}, \libheader{unordered_map}, \libheader{unordered_set}
+#define @\defnlibxname{cpp_lib_adaptor_iterator_pair_constructor}@ 202106L // also in \libheader{stack}, \libheader{queue>}
 #define @\defnlibxname{cpp_lib_any}@                               201606L // also in \libheader{any}
 #define @\defnlibxname{cpp_lib_apply}@                             201603L // also in \libheader{tuple}
 #define @\defnlibxname{cpp_lib_array_constexpr}@                   201811L // also in \libheader{iterator}, \libheader{array}