headers/cpp/stl_deque.h

128   _Deque_iterator(_Tp* __x, _Map_pointer __y)
129     : _M_cur(__x), _M_first(*__y),
132   _Deque_iterator(const iterator& __x)
133     : _M_cur(__x._M_cur), _M_first(__x._M_first),
134       _M_last(__x._M_last), _M_node(__x._M_node) {}
141   difference_type operator-(const _Self& __x) const {
142     return difference_type(_S_buffer_size()) * (_M_node - __x._M_node - 1) +
143       (_M_cur - _M_first) + (__x._M_last - __x._M_cur);
205   bool operator==(const _Self& __x) const { return _M_cur == __x._M_cur; }
206   bool operator!=(const _Self& __x) const { return !(*this == __x); }
207   bool operator<(const _Self& __x) const {
208     return (_M_node == __x._M_node) ?
209       (_M_cur < __x._M_cur) : (_M_node < __x._M_node);
568   deque(const deque& __x) : _Base(__x.get_allocator(), __x.size())
569     { uninitialized_copy(__x.begin(), __x.end(), _M_start); }
587   void _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type) {
589     _M_fill_initialize(__x);
613   deque& operator= (const deque& __x) {
615     if (&__x != this) {
616       if (__len >= __x.size())
617         erase(copy(__x.begin(), __x.end(), _M_start), _M_finish);
619         const_iterator __mid = __x.begin() + difference_type(__len);
620         copy(__x.begin(), __mid, _M_start);
621         insert(_M_finish, __mid, __x.end());
627   void swap(deque& __x) {
628     __STD::swap(_M_start, __x._M_start);
629     __STD::swap(_M_finish, __x._M_finish);
630     __STD::swap(_M_map, __x._M_map);
631     __STD::swap(_M_map_size, __x._M_map_size);
751   iterator insert(iterator position, const value_type& __x) {
753       push_front(__x);
757       push_back(__x);
763       return _M_insert_aux(position, __x);
770   void insert(iterator __pos, size_type __n, const value_type& __x);
782   void _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x,
784     insert(__pos, (size_type) __n, (value_type) __x);
803   void resize(size_type __new_size, const value_type& __x) {
808       insert(_M_finish, __new_size - __len, __x);
872   iterator _M_insert_aux(iterator __pos, const value_type& __x);
874   void _M_insert_aux(iterator __pos, size_type __n, const value_type& __x);
932   bool operator==(const deque<_Tp,_Alloc,0>& __x) const {
933     return size() == __x.size() && equal(begin(), end(), __x.begin());
935   bool operator!=(const deque<_Tp,_Alloc,0>& __x) const {
936     return size() != __x.size() || !equal(begin(), end(), __x.begin());
938   bool operator<(const deque<_Tp,_Alloc,0>& __x) const {
939     return lexicographical_compare(begin(), end(), __x.begin(), __x.end());
967                                       size_type __n, const value_type& __x)
971     uninitialized_fill(__new_start, _M_start, __x);
976     uninitialized_fill(_M_finish, __new_finish, __x);
980     _M_insert_aux(__pos, __n, __x);
1281                                            const value_type& __x)
1284   value_type __x_copy = __x;
1342                                            const value_type& __x)
1346   value_type __x_copy = __x;
1658 bool operator==(const deque<_Tp, _Alloc, __bufsiz>& __x,
1661   return __x.size() == __y.size() &&
1662          equal(__x.begin(), __x.end(), __y.begin());
1666 bool operator<(const deque<_Tp, _Alloc, __bufsiz>& __x,
1669   return lexicographical_compare(__x.begin(), __x.end(),
1680 swap(deque<_Tp,_Alloc,__bufsiz>& __x, deque<_Tp,_Alloc,__bufsiz>& __y)
1682   __x.swap(__y);