30#ifndef _STLP_INTERNAL_QUEUE_H
31#define _STLP_INTERNAL_QUEUE_H
33#ifndef _STLP_INTERNAL_DEQUE_H
37#ifndef _STLP_INTERNAL_VECTOR_H
41#ifndef _STLP_INTERNAL_HEAP_H
45#ifndef _STLP_INTERNAL_FUNCTION_BASE_H
51# if ! defined ( _STLP_LIMITED_DEFAULT_TEMPLATES )
52template <
class _Tp,
class _Sequence = deque<_Tp> >
53# elif defined ( _STLP_MINIMUM_DEFAULT_TEMPLATE_PARAMS )
54# define _STLP_QUEUE_ARGS _Tp
57template <
class _Tp,
class _Sequence>
60#
if defined (_STLP_USE_PARTIAL_SPEC_WORKAROUND)
68# if defined ( _STLP_QUEUE_ARGS )
89#if !defined (_STLP_NO_MOVE_SEMANTIC)
94 bool empty()
const {
return c.empty(); }
104#if defined (_STLP_USE_PARTIAL_SPEC_WORKAROUND) && !defined (_STLP_FUNCTION_TMPL_PARTIAL_ORDER)
105 void _M_swap_workaround(
_Self& __x) {
113#ifndef _STLP_QUEUE_ARGS
114# define _STLP_QUEUE_ARGS _Tp, _Sequence
115# define _STLP_QUEUE_HEADER_ARGS class _Tp, class _Sequence
117# define _STLP_QUEUE_HEADER_ARGS class _Tp
120template < _STLP_QUEUE_HEADER_ARGS >
126template < _STLP_QUEUE_HEADER_ARGS >
134# if !(defined ( _STLP_LIMITED_DEFAULT_TEMPLATES ) || defined ( _STLP_TEMPLATE_PARAM_SUBTYPE_BUG ))
135template <
class _Tp,
class _Sequence = vector<_Tp>,
136 class _Compare = less<_STLP_HEADER_TYPENAME _Sequence::value_type> >
137# elif defined ( _STLP_MINIMUM_DEFAULT_TEMPLATE_PARAMS )
140template <
class _Tp,
class _Sequence,
class _Compare>
143#
if defined (_STLP_USE_PARTIAL_SPEC_WORKAROUND)
144#
if defined (_STLP_MINIMUM_DEFAULT_TEMPLATE_PARAMS)
151# ifdef _STLP_MINIMUM_DEFAULT_TEMPLATE_PARAMS
176#if !defined (_STLP_NO_MOVE_SEMANTIC)
182#ifdef _STLP_MEMBER_TEMPLATES
183 template <
class _InputIterator>
187 template <
class _InputIterator>
189 _InputIterator
__last,
const _Compare& __x)
193 template <
class _InputIterator>
195 const _Compare& __x,
const _Sequence& __s)
212 const _Compare& __x,
const _Sequence&
__c)
237#if defined (_STLP_USE_PARTIAL_SPEC_WORKAROUND) && !defined (_STLP_FUNCTION_TMPL_PARTIAL_ORDER)
238 void _M_swap_workaround(
_Self& __x) {
246#if defined (_STLP_CLASS_PARTIAL_SPECIALIZATION) && !defined (_STLP_NO_MOVE_SEMANTIC)
247template <
class _Tp,
class _Sequence>
252template <
class _Tp,
class _Sequence,
class _Compare>
260#undef _STLP_QUEUE_ARGS
261#undef _STLP_QUEUE_HEADER_ARGS
_STLP_INLINE_LOOP _InputIter __last
void push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
void pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
void make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
_STLP_TYPENAME_ON_RETURN_TYPE _MoveSourceTraits< _Tp >::_Type _AsMoveSource(_Tp &src)
bool _STLP_CALL operator==(const queue< _STLP_QUEUE_ARGS > &__x, const queue< _STLP_QUEUE_ARGS > &__y)
bool _STLP_CALL operator<(const queue< _STLP_QUEUE_ARGS > &__x, const queue< _STLP_QUEUE_ARGS > &__y)
void get(int argc, const char *argv[])
priority_queue(const value_type *__first, const value_type *__last)
_Sequence::value_type value_type
_Sequence::size_type size_type
priority_queue(const value_type *__first, const value_type *__last, const _Compare &__x)
_Sequence::const_reference const_reference
priority_queue(const _Compare &__x)
const_reference top() const
void push(const value_type &__x)
priority_queue(const _Compare &__x, const _Sequence &__s)
priority_queue< _Tp, _Sequence, _Compare > _Self
_Sequence::reference reference
priority_queue(const value_type *__first, const value_type *__last, const _Compare &__x, const _Sequence &__c)
priority_queue(__move_source< _Self > src)
_Sequence::reference reference
const _Sequence & _Get_s() const
queue< _Tp, _Sequence > _Self
_Sequence::value_type value_type
queue(__move_source< _Self > src)
void push(const value_type &__x)
queue(const _Sequence &__c)
_Sequence::const_reference const_reference
_Sequence::size_type size_type
const_reference front() const
const_reference back() const
#define _STLP_UNWIND(action)
#define _STLP_RELOPS_OPERATORS(_TMPL, _TP)
#define _STLP_BEGIN_NAMESPACE
#define _STLP_END_NAMESPACE