LWG3529 priority_queue(first, last) should construct c with (first, last)

Author: jensmaurer

source/containers.tex

@@ -10120,12 +10120,14 @@
     explicit priority_queue(const Compare& x) : priority_queue(x, Container()) {}
     priority_queue(const Compare& x, const Container&);
     priority_queue(const Compare& x, Container&&);
+    template<class InputIterator>
+      priority_queue(InputIterator first, InputIterator last, const Compare& x = Compare());
     template<class InputIterator>
       priority_queue(InputIterator first, InputIterator last, const Compare& x,
                      const Container&);
     template<class InputIterator>
-      priority_queue(InputIterator first, InputIterator last,
-                     const Compare& x = Compare(), Container&& = Container());
+      priority_queue(InputIterator first, InputIterator last, const Compare& x,
+                     Container&&);
     template<class Alloc> explicit priority_queue(const Alloc&);
     template<class Alloc> priority_queue(const Compare&, const Alloc&);
     template<class Alloc> priority_queue(const Compare&, const Container&, const Alloc&);
@@ -10215,13 +10217,32 @@
 \tcode{make_heap(c.begin(), c.end(), comp)}.
 \end{itemdescr}
 
+\indexlibraryctor{priority_queue}%
+\begin{itemdecl}
+template<class InputIterator>
+  priority_queue(InputIterator first, InputIterator last, const Compare& x = Compare());
+\end{itemdecl}
+
+\begin{itemdescr}
+\pnum
+\expects
+\tcode{x} defines a strict weak ordering\iref{alg.sorting}.
+
+\pnum
+\effects
+Initializes \tcode{c} with
+\tcode{first} as the first argument and
+\tcode{last} as the second argument, and
+initializes \tcode{comp} with \tcode{x};
+then calls \tcode{make_heap(c.begin(), c.end(), comp)}.
+\end{itemdescr}
+
 \indexlibraryctor{priority_queue}%
 \begin{itemdecl}
 template<class InputIterator>
   priority_queue(InputIterator first, InputIterator last, const Compare& x, const Container& y);
 template<class InputIterator>
-  priority_queue(InputIterator first, InputIterator last, const Compare& x = Compare(),
-                 Container&& y = Container());
+  priority_queue(InputIterator first, InputIterator last, const Compare& x, Container&& y);
 \end{itemdecl}
 
 \begin{itemdescr}