Lines Matching defs:queue
0 // Queue implementation -*- C++ -*-
53 * Do not attempt to use it directly. @headername{queue}
81 * wrapper is what enforces strict first-in-first-out %queue behavior.
90 * @c pop, which are standard %queue/FIFO operations.
93 class queue
104 operator==(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&);
108 operator<(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&);
134 queue(const _Sequence& __c = _Sequence())
138 queue(const _Sequence& __c)
142 queue(_Sequence&& __c = _Sequence())
147 * Returns true if the %queue is empty.
153 /** Returns the number of elements in the %queue. */
160 * element of the %queue.
171 * element of the %queue.
182 * element of the %queue.
193 * element of the %queue.
203 * @brief Add data to the end of the %queue.
206 * This is a typical %queue operation. The function creates an
207 * element at the end of the %queue and assigns the given data
229 * This is a typical %queue operation. It shrinks the %queue by one.
246 swap(queue& __q)
256 * @brief Queue equality comparison.
257 * @param __x A %queue.
258 * @param __y A %queue of the same type as @a __x.
268 operator==(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)
272 * @brief Queue ordering relation.
273 * @param __x A %queue.
274 * @param __y A %queue of the same type as @a x.
286 operator<(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)
292 operator!=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)
298 operator>(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)
304 operator<=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)
310 operator>=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)
316 swap(queue<_Tp, _Seq>& __x, queue<_Tp, _Seq>& __y)
321 struct uses_allocator<queue<_Tp, _Seq>, _Alloc>
338 * and %queue behavior. Very few of the standard container/sequence
353 * push, @c pop, and @c top, which are standard %queue operations.
386 // See queue::c for notes on these names.
415 * @brief Builds a %queue from a range.
465 * Returns true if the %queue is empty.
471 /** Returns the number of elements in the %queue. */
478 queue.
488 * @brief Add data to the %queue.
491 * This is a typical %queue operation.
522 * This is a typical %queue operation. It shrinks the %queue
