Lines Matching refs:queue

83    *  wrapper is what enforces strict first-in-first-out %queue behavior.
92 * @c pop, which are standard %queue/FIFO operations.
95 class queue
106 operator==(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&);
110 operator<(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&);
135 queue(const _Sequence& __c = _Sequence()) : c(__c) {}
138 * Returns true if the %queue is empty.
144 /** Returns the number of elements in the %queue. */
151 * element of the %queue.
162 * element of the %queue.
173 * element of the %queue.
184 * element of the %queue.
194 * @brief Add data to the end of the %queue.
197 * This is a typical %queue operation. The function creates an
198 * element at the end of the %queue and assigns the given data
209 * This is a typical %queue operation. It shrinks the %queue by one.
228 * @param x A %queue.
229 * @param y A %queue of the same type as @a x.
239 operator==(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)
244 * @param x A %queue.
245 * @param y A %queue of the same type as @a x.
257 operator<(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)
263 operator!=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)
269 operator>(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)
275 operator<=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)
281 operator>=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)
293 * and %queue behavior. Very few of the standard container/sequence
308 * push, @c pop, and @c top, which are standard %queue operations.
341 // See queue::c for notes on these names.
356 * @brief Builds a %queue from a range.
382 * Returns true if the %queue is empty.
388 /** Returns the number of elements in the %queue. */
395 * element of the %queue.
405 * @brief Add data to the %queue.
408 * This is a typical %queue operation.
422 * This is a typical %queue operation. It shrinks the %queue