Lines Matching full:queue

1 // Queue implementation -*- C++ -*-
71   class queue;  variable
74   inline bool operator==(const queue<_Tp,_Seq>&, const queue<_Tp,_Seq>&);
77   inline bool operator<(const queue<_Tp,_Seq>&, const queue<_Tp,_Seq>&);
93    *  wrapper is what enforces strict first-in-first-out %queue behavior.
102    *  @c pop, which are standard %queue/FIFO operations.
105     class queue
115     friend bool operator== (const queue<_Tp1, _Seq1>&,
116                             const queue<_Tp1, _Seq1>&);
118     friend bool operator< (const queue<_Tp1, _Seq1>&,
119                            const queue<_Tp1, _Seq1>&);
143     queue(const _Sequence& __c = _Sequence())
147      *  Returns true if the %queue is empty.
152     /**  Returns the number of elements in the %queue.  */
158      *  %queue.
165      *  element of the %queue.
172      *  %queue.
179      *  element of the %queue.
185      *  @brief  Add data to the end of the %queue.
188      *  This is a typical %queue operation.  The function creates an element at
189      *  the end of the %queue and assigns the given data to it.
199      *  This is a typical %queue operation.  It shrinks the %queue by one.
212    *  @brief  Queue equality comparison.
213    *  @param  x  A %queue.
214    *  @param  y  A %queue of the same type as @a x.
224     operator==(const queue<_Tp,_Sequence>& __x, const queue<_Tp,_Sequence>& __y)
228    *  @brief  Queue ordering relation.
229    *  @param  x  A %queue.
230    *  @param  y  A %queue of the same type as @a x.
241     operator<(const queue<_Tp,_Sequence>& __x, const queue<_Tp,_Sequence>& __y)
247     operator!=(const queue<_Tp,_Sequence>& __x, const queue<_Tp,_Sequence>& __y)
253     operator>(const queue<_Tp,_Sequence>& __x, const queue<_Tp,_Sequence>& __y)
259     operator<=(const queue<_Tp,_Sequence>& __x, const queue<_Tp,_Sequence>& __y)
265     operator>=(const queue<_Tp,_Sequence>& __x, const queue<_Tp,_Sequence>& __y)
277    *  wrapper is what enforces sorting and first-in-first-out %queue behavior.
292    *  @c pop, and @c top, which are standard %queue/FIFO operations.
323     //  See queue::c for notes on these names.
338      *  @brief  Builds a %queue from a range.
362      *  Returns true if the %queue is empty.
367     /**  Returns the number of elements in the %queue.  */
373      *  element of the %queue.
379      *  @brief  Add data to the %queue.
382      *  This is a typical %queue operation.
404      *  This is a typical %queue operation.  It shrinks the %queue by one.