4 * Hewlett-Packard Company
6 * Permission to use, copy, modify, distribute and sell this software
7 * and its documentation for any purpose is hereby granted without fee,
8 * provided that the above copyright notice appear in all copies and
9 * that both that copyright notice and this permission notice appear
10 * in supporting documentation. Hewlett-Packard Company makes no
11 * representations about the suitability of this software for any
12 * purpose. It is provided "as is" without express or implied warranty.
15 * Copyright (c) 1996,1997
16 * Silicon Graphics Computer Systems, Inc.
18 * Permission to use, copy, modify, distribute and sell this software
19 * and its documentation for any purpose is hereby granted without fee,
20 * provided that the above copyright notice appear in all copies and
21 * that both that copyright notice and this permission notice appear
22 * in supporting documentation. Silicon Graphics makes no
23 * representations about the suitability of this software for any
24 * purpose. It is provided "as is" without express or implied warranty.
27 /* NOTE: This is an internal header file, included by other STL headers.
28 * You should not attempt to use it directly.
31 #ifndef __SGI_STL_INTERNAL_QUEUE_H
32 #define __SGI_STL_INTERNAL_QUEUE_H
36 // Forward declarations of operators < and ==, needed for friend declaration.
39 class _Sequence = deque<_Tp> >
42 template <class _Tp, class _Seq>
43 inline bool operator==(const queue<_Tp, _Seq>&, const queue<_Tp, _Seq>&);
45 template <class _Tp, class _Seq>
46 inline bool operator<(const queue<_Tp, _Seq>&, const queue<_Tp, _Seq>&);
49 template <class _Tp, class _Sequence>
52 #ifdef __STL_MEMBER_TEMPLATES
53 template <class _Tp1, class _Seq1>
54 friend bool operator== (const queue<_Tp1, _Seq1>&,
55 const queue<_Tp1, _Seq1>&);
56 template <class _Tp1, class _Seq1>
57 friend bool operator< (const queue<_Tp1, _Seq1>&,
58 const queue<_Tp1, _Seq1>&);
59 #else /* __STL_MEMBER_TEMPLATES */
60 friend bool __STD_QUALIFIER
61 operator== __STL_NULL_TMPL_ARGS (const queue&, const queue&);
62 friend bool __STD_QUALIFIER
63 operator< __STL_NULL_TMPL_ARGS (const queue&, const queue&);
64 #endif /* __STL_MEMBER_TEMPLATES */
67 typedef typename _Sequence::value_type value_type;
68 typedef typename _Sequence::size_type size_type;
69 typedef _Sequence container_type;
71 typedef typename _Sequence::reference reference;
72 typedef typename _Sequence::const_reference const_reference;
77 explicit queue(const _Sequence& __c) : c(__c) {}
79 bool empty() const { return c.empty(); }
80 size_type size() const { return c.size(); }
81 reference front() { return c.front(); }
82 const_reference front() const { return c.front(); }
83 reference back() { return c.back(); }
84 const_reference back() const { return c.back(); }
85 void push(const value_type& __x) { c.push_back(__x); }
86 void pop() { c.pop_front(); }
89 template <class _Tp, class _Sequence>
91 operator==(const queue<_Tp, _Sequence>& __x, const queue<_Tp, _Sequence>& __y)
93 return __x.c == __y.c;
96 template <class _Tp, class _Sequence>
98 operator<(const queue<_Tp, _Sequence>& __x, const queue<_Tp, _Sequence>& __y)
100 return __x.c < __y.c;
103 #ifdef __STL_FUNCTION_TMPL_PARTIAL_ORDER
105 template <class _Tp, class _Sequence>
107 operator!=(const queue<_Tp, _Sequence>& __x, const queue<_Tp, _Sequence>& __y)
109 return !(__x == __y);
112 template <class _Tp, class _Sequence>
114 operator>(const queue<_Tp, _Sequence>& __x, const queue<_Tp, _Sequence>& __y)
119 template <class _Tp, class _Sequence>
121 operator<=(const queue<_Tp, _Sequence>& __x, const queue<_Tp, _Sequence>& __y)
126 template <class _Tp, class _Sequence>
128 operator>=(const queue<_Tp, _Sequence>& __x, const queue<_Tp, _Sequence>& __y)
133 #endif /* __STL_FUNCTION_TMPL_PARTIAL_ORDER */
136 class _Sequence = vector<_Tp>,
137 class _Compare = less<typename _Sequence::value_type> >
138 class priority_queue {
140 typedef typename _Sequence::value_type value_type;
141 typedef typename _Sequence::size_type size_type;
142 typedef _Sequence container_type;
144 typedef typename _Sequence::reference reference;
145 typedef typename _Sequence::const_reference const_reference;
150 priority_queue() : c() {}
151 explicit priority_queue(const _Compare& __x) : c(), comp(__x) {}
152 priority_queue(const _Compare& __x, const _Sequence& __s)
154 { make_heap(c.begin(), c.end(), comp); }
156 #ifdef __STL_MEMBER_TEMPLATES
157 template <class _InputIterator>
158 priority_queue(_InputIterator __first, _InputIterator __last)
159 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
161 template <class _InputIterator>
162 priority_queue(_InputIterator __first,
163 _InputIterator __last, const _Compare& __x)
164 : c(__first, __last), comp(__x)
165 { make_heap(c.begin(), c.end(), comp); }
167 template <class _InputIterator>
168 priority_queue(_InputIterator __first, _InputIterator __last,
169 const _Compare& __x, const _Sequence& __s)
172 c.insert(c.end(), __first, __last);
173 make_heap(c.begin(), c.end(), comp);
176 #else /* __STL_MEMBER_TEMPLATES */
177 priority_queue(const value_type* __first, const value_type* __last)
178 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
180 priority_queue(const value_type* __first, const value_type* __last,
182 : c(__first, __last), comp(__x)
183 { make_heap(c.begin(), c.end(), comp); }
185 priority_queue(const value_type* __first, const value_type* __last,
186 const _Compare& __x, const _Sequence& __c)
189 c.insert(c.end(), __first, __last);
190 make_heap(c.begin(), c.end(), comp);
192 #endif /* __STL_MEMBER_TEMPLATES */
194 bool empty() const { return c.empty(); }
195 size_type size() const { return c.size(); }
196 const_reference top() const { return c.front(); }
197 void push(const value_type& __x) {
200 push_heap(c.begin(), c.end(), comp);
202 __STL_UNWIND(c.clear());
206 pop_heap(c.begin(), c.end(), comp);
209 __STL_UNWIND(c.clear());
213 // no equality is provided
217 #endif /* __SGI_STL_INTERNAL_QUEUE_H */