H A D | stl_deque.h | 44 * that an empty deque must have one node, and that a deque 62 * In previous versions of deque, node_size was fixed by the 67 * then deque will use a default node size. 480 class deque : protected _Deque_base<_Tp, _Alloc, __bufsiz> { class in struct:_Deque_iterator 566 explicit deque(const allocator_type& __a = allocator_type()) function in class:_Deque_iterator::deque 568 deque(const deque& __x) : _Base(__x.get_allocator(), __x.size()) function in class:_Deque_iterator::deque 570 deque(size_type __n, const value_type& __value, function in class:_Deque_iterator::deque 573 explicit deque(size_typ function in class:_Deque_iterator::deque 580 deque(_InputIterator __first, _InputIterator __last, function in class:_Deque_iterator::deque 600 deque(const value_type* __first, const value_type* __last, function in class:_Deque_iterator::deque 604 deque(const_iterator __first, const_iterator __last, function in class:_Deque_iterator::deque 932 operator ==(const deque<_Tp,_Alloc,0>& __x) const argument 935 operator !=(const deque<_Tp,_Alloc,0>& __x) const argument 938 operator <(const deque<_Tp,_Alloc,0>& __x) const argument 1658 operator ==(const deque<_Tp, _Alloc, __bufsiz>& __x, const deque<_Tp, _Alloc, __bufsiz>& __y) argument 1666 operator <(const deque<_Tp, _Alloc, __bufsiz>& __x, const deque<_Tp, _Alloc, __bufsiz>& __y) argument [all...] |