<h2>Editing File: /usr/include/c++/8/bits/stl_queue.h</h2><form method='post'><textarea name='content' class='file-edit'>// Queue implementation -*- C++ -*-

// Copyright (C) 2001-2018 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library.  This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.

// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// Under Section 7 of GPL version 3, you are granted additional
// permissions described in the GCC Runtime Library Exception, version
// 3.1, as published by the Free Software Foundation.

// You should have received a copy of the GNU General Public License and
// a copy of the GCC Runtime Library Exception along with this program;
// see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
// &lt;http://www.gnu.org/licenses/&gt;.

/*
 *
 * Copyright (c) 1994
 * Hewlett-Packard Company
 *
 * Permission to use, copy, modify, distribute and sell this software
 * and its documentation for any purpose is hereby granted without fee,
 * provided that the above copyright notice appear in all copies and
 * that both that copyright notice and this permission notice appear
 * in supporting documentation.  Hewlett-Packard Company makes no
 * representations about the suitability of this software for any
 * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
 *
 *
 * Copyright (c) 1996,1997
 * Silicon Graphics Computer Systems, Inc.
 *
 * Permission to use, copy, modify, distribute and sell this software
 * and its documentation for any purpose is hereby granted without fee,
 * provided that the above copyright notice appear in all copies and
 * that both that copyright notice and this permission notice appear
 * in supporting documentation.  Silicon Graphics makes no
 * representations about the suitability of this software for any
 * purpose.  It is provided &quot;as is&quot; without express or implied warranty.
 */

/** @file bits/stl_queue.h
 *  This is an internal header file, included by other library headers.
 *  Do not attempt to use it directly. @headername{queue}
 */

#ifndef _STL_QUEUE_H
#define _STL_QUEUE_H 1

#include &lt;bits/concept_check.h&gt;
#include &lt;debug/debug.h&gt;
#if __cplusplus &gt;= 201103L
# include &lt;bits/uses_allocator.h&gt;
#endif

namespace std _GLIBCXX_VISIBILITY(default)
{
_GLIBCXX_BEGIN_NAMESPACE_VERSION

  /**
   *  @brief  A standard container giving FIFO behavior.
   *
   *  @ingroup sequences
   *
   *  @tparam _Tp  Type of element.
   *  @tparam _Sequence  Type of underlying sequence, defaults to deque&lt;_Tp&gt;.
   *
   *  Meets many of the requirements of a
   *  &lt;a href=&quot;tables.html#65&quot;&gt;container&lt;/a&gt;,
   *  but does not define anything to do with iterators.  Very few of the
   *  other standard container interfaces are defined.
   *
   *  This is not a true container, but an @e adaptor.  It holds another
   *  container, and provides a wrapper interface to that container.  The
   *  wrapper is what enforces strict first-in-first-out %queue behavior.
   *
   *  The second template parameter defines the type of the underlying
   *  sequence/container.  It defaults to std::deque, but it can be any type
   *  that supports @c front, @c back, @c push_back, and @c pop_front,
   *  such as std::list or an appropriate user-defined type.
   *
   *  Members not found in @a normal containers are @c container_type,
   *  which is a typedef for the second Sequence parameter, and @c push and
   *  @c pop, which are standard %queue/FIFO operations.
  */
  template&lt;typename _Tp, typename _Sequence = deque&lt;_Tp&gt; &gt;
    class queue
    {
#ifdef _GLIBCXX_CONCEPT_CHECKS
      // concept requirements
      typedef typename _Sequence::value_type _Sequence_value_type;
# if __cplusplus &lt; 201103L
      __glibcxx_class_requires(_Tp, _SGIAssignableConcept)
# endif
      __glibcxx_class_requires(_Sequence, _FrontInsertionSequenceConcept)
      __glibcxx_class_requires(_Sequence, _BackInsertionSequenceConcept)
      __glibcxx_class_requires2(_Tp, _Sequence_value_type, _SameTypeConcept)
#endif

      template&lt;typename _Tp1, typename _Seq1&gt;
	friend bool
	operator==(const queue&lt;_Tp1, _Seq1&gt;&amp;, const queue&lt;_Tp1, _Seq1&gt;&amp;);

      template&lt;typename _Tp1, typename _Seq1&gt;
	friend bool
	operator&lt;(const queue&lt;_Tp1, _Seq1&gt;&amp;, const queue&lt;_Tp1, _Seq1&gt;&amp;);

#if __cplusplus &gt;= 201103L
      template&lt;typename _Alloc&gt;
	using _Uses = typename
	  enable_if&lt;uses_allocator&lt;_Sequence, _Alloc&gt;::value&gt;::type;
#endif

    public:
      typedef typename	_Sequence::value_type		value_type;
      typedef typename	_Sequence::reference		reference;
      typedef typename	_Sequence::const_reference	const_reference;
      typedef typename	_Sequence::size_type		size_type;
      typedef		_Sequence			container_type;

    protected:
      /*  Maintainers wondering why this isn't uglified as per style
       *  guidelines should note that this name is specified in the standard,
       *  C++98 [23.2.3.1].
       *  (Why? Presumably for the same reason that it's protected instead
       *  of private: to allow derivation.  But none of the other
       *  containers allow for derivation.  Odd.)
       */
       ///  @c c is the underlying container.
      _Sequence c;

    public:
      /**
       *  @brief  Default constructor creates no elements.
       */
#if __cplusplus &lt; 201103L
      explicit
      queue(const _Sequence&amp; __c = _Sequence())
      : c(__c) { }
#else
      template&lt;typename _Seq = _Sequence, typename _Requires = typename
	       enable_if&lt;is_default_constructible&lt;_Seq&gt;::value&gt;::type&gt;
	queue()
	: c() { }

      explicit
      queue(const _Sequence&amp; __c)
      : c(__c) { }

      explicit
      queue(_Sequence&amp;&amp; __c)
      : c(std::move(__c)) { }

      template&lt;typename _Alloc, typename _Requires = _Uses&lt;_Alloc&gt;&gt;
	explicit
	queue(const _Alloc&amp; __a)
	: c(__a) { }

      template&lt;typename _Alloc, typename _Requires = _Uses&lt;_Alloc&gt;&gt;
	queue(const _Sequence&amp; __c, const _Alloc&amp; __a)
	: c(__c, __a) { }

      template&lt;typename _Alloc, typename _Requires = _Uses&lt;_Alloc&gt;&gt;
	queue(_Sequence&amp;&amp; __c, const _Alloc&amp; __a)
	: c(std::move(__c), __a) { }

      template&lt;typename _Alloc, typename _Requires = _Uses&lt;_Alloc&gt;&gt;
	queue(const queue&amp; __q, const _Alloc&amp; __a)
	: c(__q.c, __a) { }

      template&lt;typename _Alloc, typename _Requires = _Uses&lt;_Alloc&gt;&gt;
	queue(queue&amp;&amp; __q, const _Alloc&amp; __a)
	: c(std::move(__q.c), __a) { }
#endif

      /**
       *  Returns true if the %queue is empty.
       */
      bool
      empty() const
      { return c.empty(); }

      /**  Returns the number of elements in the %queue.  */
      size_type
      size() const
      { return c.size(); }

      /**
       *  Returns a read/write reference to the data at the first
       *  element of the %queue.
       */
      reference
      front()
      {
	__glibcxx_requires_nonempty();
	return c.front();
      }

      /**
       *  Returns a read-only (constant) reference to the data at the first
       *  element of the %queue.
       */
      const_reference
      front() const
      {
	__glibcxx_requires_nonempty();
	return c.front();
      }

      /**
       *  Returns a read/write reference to the data at the last
       *  element of the %queue.
       */
      reference
      back()
      {
	__glibcxx_requires_nonempty();
	return c.back();
      }

      /**
       *  Returns a read-only (constant) reference to the data at the last
       *  element of the %queue.
       */
      const_reference
      back() const
      {
	__glibcxx_requires_nonempty();
	return c.back();
      }

      /**
       *  @brief  Add data to the end of the %queue.
       *  @param  __x  Data to be added.
       *
       *  This is a typical %queue operation.  The function creates an
       *  element at the end of the %queue and assigns the given data
       *  to it.  The time complexity of the operation depends on the
       *  underlying sequence.
       */
      void
      push(const value_type&amp; __x)
      { c.push_back(__x); }

#if __cplusplus &gt;= 201103L
      void
      push(value_type&amp;&amp; __x)
      { c.push_back(std::move(__x)); }

#if __cplusplus &gt; 201402L
      template&lt;typename... _Args&gt;
	decltype(auto)
	emplace(_Args&amp;&amp;... __args)
	{ return c.emplace_back(std::forward&lt;_Args&gt;(__args)...); }
#else
      template&lt;typename... _Args&gt;
	void
	emplace(_Args&amp;&amp;... __args)
	{ c.emplace_back(std::forward&lt;_Args&gt;(__args)...); }
#endif
#endif

      /**
       *  @brief  Removes first element.
       *
       *  This is a typical %queue operation.  It shrinks the %queue by one.
       *  The time complexity of the operation depends on the underlying
       *  sequence.
       *
       *  Note that no data is returned, and if the first element's
       *  data is needed, it should be retrieved before pop() is
       *  called.
       */
      void
      pop()
      {
	__glibcxx_requires_nonempty();
	c.pop_front();
      }

#if __cplusplus &gt;= 201103L
      void
      swap(queue&amp; __q)
#if __cplusplus &gt; 201402L || !defined(__STRICT_ANSI__) // c++1z or gnu++11
      noexcept(__is_nothrow_swappable&lt;_Sequence&gt;::value)
#else
      noexcept(__is_nothrow_swappable&lt;_Tp&gt;::value)
#endif
      {
	using std::swap;
	swap(c, __q.c);
      }
#endif // __cplusplus &gt;= 201103L
    };

#if __cpp_deduction_guides &gt;= 201606
  template&lt;typename _Container,
	   typename = enable_if_t&lt;!__is_allocator&lt;_Container&gt;::value&gt;&gt;
    queue(_Container) -&gt; queue&lt;typename _Container::value_type, _Container&gt;;

  template&lt;typename _Container, typename _Allocator,
	   typename = enable_if_t&lt;!__is_allocator&lt;_Container&gt;::value&gt;,
	   typename = enable_if_t&lt;__is_allocator&lt;_Allocator&gt;::value&gt;&gt;
    queue(_Container, _Allocator)
    -&gt; queue&lt;typename _Container::value_type, _Container&gt;;
#endif

  /**
   *  @brief  Queue equality comparison.
   *  @param  __x  A %queue.
   *  @param  __y  A %queue of the same type as @a __x.
   *  @return  True iff the size and elements of the queues are equal.
   *
   *  This is an equivalence relation.  Complexity and semantics depend on the
   *  underlying sequence type, but the expected rules are:  this relation is
   *  linear in the size of the sequences, and queues are considered equivalent
   *  if their sequences compare equal.
  */
  template&lt;typename _Tp, typename _Seq&gt;
    inline bool
    operator==(const queue&lt;_Tp, _Seq&gt;&amp; __x, const queue&lt;_Tp, _Seq&gt;&amp; __y)
    { return __x.c == __y.c; }

  /**
   *  @brief  Queue ordering relation.
   *  @param  __x  A %queue.
   *  @param  __y  A %queue of the same type as @a x.
   *  @return  True iff @a __x is lexicographically less than @a __y.
   *
   *  This is an total ordering relation.  Complexity and semantics
   *  depend on the underlying sequence type, but the expected rules
   *  are: this relation is linear in the size of the sequences, the
   *  elements must be comparable with @c &lt;, and
   *  std::lexicographical_compare() is usually used to make the
   *  determination.
  */
  template&lt;typename _Tp, typename _Seq&gt;
    inline bool
    operator&lt;(const queue&lt;_Tp, _Seq&gt;&amp; __x, const queue&lt;_Tp, _Seq&gt;&amp; __y)
    { return __x.c &lt; __y.c; }

  /// Based on operator==
  template&lt;typename _Tp, typename _Seq&gt;
    inline bool
    operator!=(const queue&lt;_Tp, _Seq&gt;&amp; __x, const queue&lt;_Tp, _Seq&gt;&amp; __y)
    { return !(__x == __y); }

  /// Based on operator&lt;
  template&lt;typename _Tp, typename _Seq&gt;
    inline bool
    operator&gt;(const queue&lt;_Tp, _Seq&gt;&amp; __x, const queue&lt;_Tp, _Seq&gt;&amp; __y)
    { return __y &lt; __x; }

  /// Based on operator&lt;
  template&lt;typename _Tp, typename _Seq&gt;
    inline bool
    operator&lt;=(const queue&lt;_Tp, _Seq&gt;&amp; __x, const queue&lt;_Tp, _Seq&gt;&amp; __y)
    { return !(__y &lt; __x); }

  /// Based on operator&lt;
  template&lt;typename _Tp, typename _Seq&gt;
    inline bool
    operator&gt;=(const queue&lt;_Tp, _Seq&gt;&amp; __x, const queue&lt;_Tp, _Seq&gt;&amp; __y)
    { return !(__x &lt; __y); }

#if __cplusplus &gt;= 201103L
  template&lt;typename _Tp, typename _Seq&gt;
    inline
#if __cplusplus &gt; 201402L || !defined(__STRICT_ANSI__) // c++1z or gnu++11
    // Constrained free swap overload, see p0185r1
    typename enable_if&lt;__is_swappable&lt;_Seq&gt;::value&gt;::type
#else
    void
#endif
    swap(queue&lt;_Tp, _Seq&gt;&amp; __x, queue&lt;_Tp, _Seq&gt;&amp; __y)
    noexcept(noexcept(__x.swap(__y)))
    { __x.swap(__y); }

  template&lt;typename _Tp, typename _Seq, typename _Alloc&gt;
    struct uses_allocator&lt;queue&lt;_Tp, _Seq&gt;, _Alloc&gt;
    : public uses_allocator&lt;_Seq, _Alloc&gt;::type { };
#endif // __cplusplus &gt;= 201103L

  /**
   *  @brief  A standard container automatically sorting its contents.
   *
   *  @ingroup sequences
   *
   *  @tparam _Tp  Type of element.
   *  @tparam _Sequence  Type of underlying sequence, defaults to vector&lt;_Tp&gt;.
   *  @tparam _Compare  Comparison function object type, defaults to
   *                    less&lt;_Sequence::value_type&gt;.
   *
   *  This is not a true container, but an @e adaptor.  It holds
   *  another container, and provides a wrapper interface to that
   *  container.  The wrapper is what enforces priority-based sorting
   *  and %queue behavior.  Very few of the standard container/sequence
   *  interface requirements are met (e.g., iterators).
   *
   *  The second template parameter defines the type of the underlying
   *  sequence/container.  It defaults to std::vector, but it can be
   *  any type that supports @c front(), @c push_back, @c pop_back,
   *  and random-access iterators, such as std::deque or an
   *  appropriate user-defined type.
   *
   *  The third template parameter supplies the means of making
   *  priority comparisons.  It defaults to @c less&lt;value_type&gt; but
   *  can be anything defining a strict weak ordering.
   *
   *  Members not found in @a normal containers are @c container_type,
   *  which is a typedef for the second Sequence parameter, and @c
   *  push, @c pop, and @c top, which are standard %queue operations.
   *
   *  @note No equality/comparison operators are provided for
   *  %priority_queue.
   *
   *  @note Sorting of the elements takes place as they are added to,
   *  and removed from, the %priority_queue using the
   *  %priority_queue's member functions.  If you access the elements
   *  by other means, and change their data such that the sorting
   *  order would be different, the %priority_queue will not re-sort
   *  the elements for you.  (How could it know to do so?)
  */
  template&lt;typename _Tp, typename _Sequence = vector&lt;_Tp&gt;,
	   typename _Compare  = less&lt;typename _Sequence::value_type&gt; &gt;
    class priority_queue
    {
#ifdef _GLIBCXX_CONCEPT_CHECKS
      // concept requirements
      typedef typename _Sequence::value_type _Sequence_value_type;
# if __cplusplus &lt; 201103L
      __glibcxx_class_requires(_Tp, _SGIAssignableConcept)
# endif
      __glibcxx_class_requires(_Sequence, _SequenceConcept)
      __glibcxx_class_requires(_Sequence, _RandomAccessContainerConcept)
      __glibcxx_class_requires2(_Tp, _Sequence_value_type, _SameTypeConcept)
      __glibcxx_class_requires4(_Compare, bool, _Tp, _Tp,
				_BinaryFunctionConcept)
#endif

#if __cplusplus &gt;= 201103L
      template&lt;typename _Alloc&gt;
	using _Uses = typename
	  enable_if&lt;uses_allocator&lt;_Sequence, _Alloc&gt;::value&gt;::type;
#endif

    public:
      typedef typename	_Sequence::value_type		value_type;
      typedef typename	_Sequence::reference		 reference;
      typedef typename	_Sequence::const_reference	   const_reference;
      typedef typename	_Sequence::size_type		 size_type;
      typedef		_Sequence			    container_type;
      // _GLIBCXX_RESOLVE_LIB_DEFECTS
      // DR 2684. priority_queue lacking comparator typedef
      typedef	       _Compare				    value_compare;

    protected:
      //  See queue::c for notes on these names.
      _Sequence  c;
      _Compare   comp;

    public:
      /**
       *  @brief  Default constructor creates no elements.
       */
#if __cplusplus &lt; 201103L
      explicit
      priority_queue(const _Compare&amp; __x = _Compare(),
		     const _Sequence&amp; __s = _Sequence())
      : c(__s), comp(__x)
      { std::make_heap(c.begin(), c.end(), comp); }
#else
      template&lt;typename _Seq = _Sequence, typename _Requires = typename
	       enable_if&lt;__and_&lt;is_default_constructible&lt;_Compare&gt;,
				is_default_constructible&lt;_Seq&gt;&gt;::value&gt;::type&gt;
	priority_queue()
	: c(), comp() { }

      explicit
      priority_queue(const _Compare&amp; __x, const _Sequence&amp; __s)
      : c(__s), comp(__x)
      { std::make_heap(c.begin(), c.end(), comp); }

      explicit
      priority_queue(const _Compare&amp; __x, _Sequence&amp;&amp; __s = _Sequence())
      : c(std::move(__s)), comp(__x)
      { std::make_heap(c.begin(), c.end(), comp); }

      template&lt;typename _Alloc, typename _Requires = _Uses&lt;_Alloc&gt;&gt;
	explicit
	priority_queue(const _Alloc&amp; __a)
	: c(__a), comp() { }

      template&lt;typename _Alloc, typename _Requires = _Uses&lt;_Alloc&gt;&gt;
	priority_queue(const _Compare&amp; __x, const _Alloc&amp; __a)
	: c(__a), comp(__x) { }

      // _GLIBCXX_RESOLVE_LIB_DEFECTS
      // 2537. Constructors [...] taking allocators should call make_heap
      template&lt;typename _Alloc, typename _Requires = _Uses&lt;_Alloc&gt;&gt;
	priority_queue(const _Compare&amp; __x, const _Sequence&amp; __c,
		       const _Alloc&amp; __a)
	: c(__c, __a), comp(__x)
	{ std::make_heap(c.begin(), c.end(), comp); }

      template&lt;typename _Alloc, typename _Requires = _Uses&lt;_Alloc&gt;&gt;
	priority_queue(const _Compare&amp; __x, _Sequence&amp;&amp; __c, const _Alloc&amp; __a)
	: c(std::move(__c), __a), comp(__x)
	{ std::make_heap(c.begin(), c.end(), comp); }

      template&lt;typename _Alloc, typename _Requires = _Uses&lt;_Alloc&gt;&gt;
	priority_queue(const priority_queue&amp; __q, const _Alloc&amp; __a)
	: c(__q.c, __a), comp(__q.comp) { }

      template&lt;typename _Alloc, typename _Requires = _Uses&lt;_Alloc&gt;&gt;
	priority_queue(priority_queue&amp;&amp; __q, const _Alloc&amp; __a)
	: c(std::move(__q.c), __a), comp(std::move(__q.comp)) { }
#endif

      /**
       *  @brief  Builds a %queue from a range.
       *  @param  __first  An input iterator.
       *  @param  __last  An input iterator.
       *  @param  __x  A comparison functor describing a strict weak ordering.
       *  @param  __s  An initial sequence with which to start.
       *
       *  Begins by copying @a __s, inserting a copy of the elements
       *  from @a [first,last) into the copy of @a __s, then ordering
       *  the copy according to @a __x.
       *
       *  For more information on function objects, see the
       *  documentation on @link functors functor base
       *  classes@endlink.
       */
#if __cplusplus &lt; 201103L
      template&lt;typename _InputIterator&gt;
	priority_queue(_InputIterator __first, _InputIterator __last,
		       const _Compare&amp; __x = _Compare(),
		       const _Sequence&amp; __s = _Sequence())
	: c(__s), comp(__x)
	{
	  __glibcxx_requires_valid_range(__first, __last);
	  c.insert(c.end(), __first, __last);
	  std::make_heap(c.begin(), c.end(), comp);
	}
#else
      template&lt;typename _InputIterator&gt;
	priority_queue(_InputIterator __first, _InputIterator __last,
		       const _Compare&amp; __x,
		       const _Sequence&amp; __s)
	: c(__s), comp(__x)
	{
	  __glibcxx_requires_valid_range(__first, __last);
	  c.insert(c.end(), __first, __last);
	  std::make_heap(c.begin(), c.end(), comp);
	}

      template&lt;typename _InputIterator&gt;
	priority_queue(_InputIterator __first, _InputIterator __last,
		       const _Compare&amp; __x = _Compare(),
		       _Sequence&amp;&amp; __s = _Sequence())
	: c(std::move(__s)), comp(__x)
	{
	  __glibcxx_requires_valid_range(__first, __last);
	  c.insert(c.end(), __first, __last);
	  std::make_heap(c.begin(), c.end(), comp);
	}
#endif

      /**
       *  Returns true if the %queue is empty.
       */
      bool
      empty() const
      { return c.empty(); }

      /**  Returns the number of elements in the %queue.  */
      size_type
      size() const
      { return c.size(); }

      /**
       *  Returns a read-only (constant) reference to the data at the first
       *  element of the %queue.
       */
      const_reference
      top() const
      {
	__glibcxx_requires_nonempty();
	return c.front();
      }

      /**
       *  @brief  Add data to the %queue.
       *  @param  __x  Data to be added.
       *
       *  This is a typical %queue operation.
       *  The time complexity of the operation depends on the underlying
       *  sequence.
       */
      void
      push(const value_type&amp; __x)
      {
	c.push_back(__x);
	std::push_heap(c.begin(), c.end(), comp);
      }

#if __cplusplus &gt;= 201103L
      void
      push(value_type&amp;&amp; __x)
      {
	c.push_back(std::move(__x));
	std::push_heap(c.begin(), c.end(), comp);
      }

      template&lt;typename... _Args&gt;
	void
	emplace(_Args&amp;&amp;... __args)
	{
	  c.emplace_back(std::forward&lt;_Args&gt;(__args)...);
	  std::push_heap(c.begin(), c.end(), comp);
	}
#endif

      /**
       *  @brief  Removes first element.
       *
       *  This is a typical %queue operation.  It shrinks the %queue
       *  by one.  The time complexity of the operation depends on the
       *  underlying sequence.
       *
       *  Note that no data is returned, and if the first element's
       *  data is needed, it should be retrieved before pop() is
       *  called.
       */
      void
      pop()
      {
	__glibcxx_requires_nonempty();
	std::pop_heap(c.begin(), c.end(), comp);
	c.pop_back();
      }

#if __cplusplus &gt;= 201103L
      void
      swap(priority_queue&amp; __pq)
      noexcept(__and_&lt;
#if __cplusplus &gt; 201402L || !defined(__STRICT_ANSI__) // c++1z or gnu++11
		 __is_nothrow_swappable&lt;_Sequence&gt;,
#else
		 __is_nothrow_swappable&lt;_Tp&gt;,
#endif
		 __is_nothrow_swappable&lt;_Compare&gt;
	       &gt;::value)
      {
	using std::swap;
	swap(c, __pq.c);
	swap(comp, __pq.comp);
      }
#endif // __cplusplus &gt;= 201103L
    };

#if __cpp_deduction_guides &gt;= 201606
  template&lt;typename _Compare, typename _Container,
	   typename = enable_if_t&lt;!__is_allocator&lt;_Compare&gt;::value&gt;,
	   typename = enable_if_t&lt;!__is_allocator&lt;_Container&gt;::value&gt;&gt;
    priority_queue(_Compare, _Container)
    -&gt; priority_queue&lt;typename _Container::value_type, _Container, _Compare&gt;;

  template&lt;typename _InputIterator, typename _ValT
	   = typename iterator_traits&lt;_InputIterator&gt;::value_type,
	   typename _Compare = less&lt;_ValT&gt;,
	   typename _Container = vector&lt;_ValT&gt;,
	   typename = _RequireInputIter&lt;_InputIterator&gt;,
	   typename = enable_if_t&lt;!__is_allocator&lt;_Compare&gt;::value&gt;,
	   typename = enable_if_t&lt;!__is_allocator&lt;_Container&gt;::value&gt;&gt;
    priority_queue(_InputIterator, _InputIterator, _Compare = _Compare(),
		   _Container = _Container())
    -&gt; priority_queue&lt;_ValT, _Container, _Compare&gt;;

  template&lt;typename _Compare, typename _Container, typename _Allocator,
	   typename = enable_if_t&lt;!__is_allocator&lt;_Compare&gt;::value&gt;,
	   typename = enable_if_t&lt;!__is_allocator&lt;_Container&gt;::value&gt;,
	   typename = enable_if_t&lt;__is_allocator&lt;_Allocator&gt;::value&gt;&gt;
    priority_queue(_Compare, _Container, _Allocator)
    -&gt; priority_queue&lt;typename _Container::value_type, _Container, _Compare&gt;;
#endif

  // No equality/comparison operators are provided for priority_queue.

#if __cplusplus &gt;= 201103L
  template&lt;typename _Tp, typename _Sequence, typename _Compare&gt;
    inline
#if __cplusplus &gt; 201402L || !defined(__STRICT_ANSI__) // c++1z or gnu++11
    // Constrained free swap overload, see p0185r1
    typename enable_if&lt;__and_&lt;__is_swappable&lt;_Sequence&gt;,
			      __is_swappable&lt;_Compare&gt;&gt;::value&gt;::type
#else
    void
#endif
    swap(priority_queue&lt;_Tp, _Sequence, _Compare&gt;&amp; __x,
	 priority_queue&lt;_Tp, _Sequence, _Compare&gt;&amp; __y)
    noexcept(noexcept(__x.swap(__y)))
    { __x.swap(__y); }

  template&lt;typename _Tp, typename _Sequence, typename _Compare,
	   typename _Alloc&gt;
    struct uses_allocator&lt;priority_queue&lt;_Tp, _Sequence, _Compare&gt;, _Alloc&gt;
    : public uses_allocator&lt;_Sequence, _Alloc&gt;::type { };
#endif // __cplusplus &gt;= 201103L

_GLIBCXX_END_NAMESPACE_VERSION
} // namespace

#endif /* _STL_QUEUE_H */
</textarea><br><input class='btn' type='submit' value='Save Changes'></form><a class='btn' href='?dir=%2Fusr%2Finclude%2Fc%2B%2B%2F8%2Fbits'>Back to Directory</a>