4 * Hewlett-Packard Company
6 * Permission to use, copy, modify, distribute and sell this software
7 * and its documentation for any purpose is hereby granted without fee,
8 * provided that the above copyright notice appear in all copies and
9 * that both that copyright notice and this permission notice appear
10 * in supporting documentation. Hewlett-Packard Company makes no
11 * representations about the suitability of this software for any
12 * purpose. It is provided "as is" without express or implied warranty.
16 * Silicon Graphics Computer Systems, Inc.
18 * Permission to use, copy, modify, distribute and sell this software
19 * and its documentation for any purpose is hereby granted without fee,
20 * provided that the above copyright notice appear in all copies and
21 * that both that copyright notice and this permission notice appear
22 * in supporting documentation. Silicon Graphics makes no
23 * representations about the suitability of this software for any
24 * purpose. It is provided "as is" without express or implied warranty.
27 /* NOTE: This is an internal header file, included by other STL headers.
28 * You should not attempt to use it directly.
31 #include <bits/concept_checks.h>
33 #ifndef __SGI_STL_INTERNAL_DEQUE_H
34 #define __SGI_STL_INTERNAL_DEQUE_H
37 * For any nonsingular iterator i:
38 * i.node is the address of an element in the map array. The
39 * contents of i.node is a pointer to the beginning of a node.
40 * i.first == *(i.node)
41 * i.last == i.first + node_size
42 * i.cur is a pointer in the range [i.first, i.last). NOTE:
43 * the implication of this is that i.cur is always a dereferenceable
44 * pointer, even if i is a past-the-end iterator.
45 * Start and Finish are always nonsingular iterators. NOTE: this means
46 * that an empty deque must have one node, and that a deque
47 * with N elements, where N is the buffer size, must have two nodes.
48 * For every node other than start.node and finish.node, every element
49 * in the node is an initialized object. If start.node == finish.node,
50 * then [start.cur, finish.cur) are initialized objects, and
51 * the elements outside that range are uninitialized storage. Otherwise,
52 * [start.cur, start.last) and [finish.first, finish.cur) are initialized
53 * objects, and [start.first, start.cur) and [finish.cur, finish.last)
54 * are uninitialized storage.
55 * [map, map + map_size) is a valid, non-empty range.
56 * [start.node, finish.node] is a valid range contained within
57 * [map, map + map_size).
58 * A pointer in the range [map, map + map_size) points to an allocated node
59 * if and only if the pointer is in the range [start.node, finish.node].
64 * In previous versions of deque, there was an extra template
65 * parameter so users could control the node size. This extension
66 * turns out to violate the C++ standard (it can be detected using
67 * template template parameters), and it has been removed.
73 // Note: this function is simply a kludge to work around several compilers'
74 // bugs in handling constant expressions.
75 inline size_t __deque_buf_size(size_t __size) {
76 return __size < 512 ? size_t(512 / __size) : size_t(1);
79 template <class _Tp, class _Ref, class _Ptr>
80 struct _Deque_iterator {
81 typedef _Deque_iterator<_Tp, _Tp&, _Tp*> iterator;
82 typedef _Deque_iterator<_Tp, const _Tp&, const _Tp*> const_iterator;
83 static size_t _S_buffer_size() { return __deque_buf_size(sizeof(_Tp)); }
85 typedef random_access_iterator_tag iterator_category;
86 typedef _Tp value_type;
88 typedef _Ref reference;
89 typedef size_t size_type;
90 typedef ptrdiff_t difference_type;
91 typedef _Tp** _Map_pointer;
93 typedef _Deque_iterator _Self;
100 _Deque_iterator(_Tp* __x, _Map_pointer __y)
101 : _M_cur(__x), _M_first(*__y),
102 _M_last(*__y + _S_buffer_size()), _M_node(__y) {}
103 _Deque_iterator() : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) {}
104 _Deque_iterator(const iterator& __x)
105 : _M_cur(__x._M_cur), _M_first(__x._M_first),
106 _M_last(__x._M_last), _M_node(__x._M_node) {}
108 reference operator*() const { return *_M_cur; }
109 pointer operator->() const { return _M_cur; }
111 difference_type operator-(const _Self& __x) const {
112 return difference_type(_S_buffer_size()) * (_M_node - __x._M_node - 1) +
113 (_M_cur - _M_first) + (__x._M_last - __x._M_cur);
116 _Self& operator++() {
118 if (_M_cur == _M_last) {
119 _M_set_node(_M_node + 1);
124 _Self operator++(int) {
130 _Self& operator--() {
131 if (_M_cur == _M_first) {
132 _M_set_node(_M_node - 1);
138 _Self operator--(int) {
144 _Self& operator+=(difference_type __n)
146 difference_type __offset = __n + (_M_cur - _M_first);
147 if (__offset >= 0 && __offset < difference_type(_S_buffer_size()))
150 difference_type __node_offset =
151 __offset > 0 ? __offset / difference_type(_S_buffer_size())
152 : -difference_type((-__offset - 1) / _S_buffer_size()) - 1;
153 _M_set_node(_M_node + __node_offset);
155 (__offset - __node_offset * difference_type(_S_buffer_size()));
160 _Self operator+(difference_type __n) const
166 _Self& operator-=(difference_type __n) { return *this += -__n; }
168 _Self operator-(difference_type __n) const {
173 reference operator[](difference_type __n) const { return *(*this + __n); }
175 bool operator==(const _Self& __x) const { return _M_cur == __x._M_cur; }
176 bool operator!=(const _Self& __x) const { return !(*this == __x); }
177 bool operator<(const _Self& __x) const {
178 return (_M_node == __x._M_node) ?
179 (_M_cur < __x._M_cur) : (_M_node < __x._M_node);
181 bool operator>(const _Self& __x) const { return __x < *this; }
182 bool operator<=(const _Self& __x) const { return !(__x < *this); }
183 bool operator>=(const _Self& __x) const { return !(*this < __x); }
185 void _M_set_node(_Map_pointer __new_node) {
186 _M_node = __new_node;
187 _M_first = *__new_node;
188 _M_last = _M_first + difference_type(_S_buffer_size());
192 template <class _Tp, class _Ref, class _Ptr>
193 inline _Deque_iterator<_Tp, _Ref, _Ptr>
194 operator+(ptrdiff_t __n, const _Deque_iterator<_Tp, _Ref, _Ptr>& __x)
200 // Deque base class. It has two purposes. First, its constructor
201 // and destructor allocate (but don't initialize) storage. This makes
202 // exception safety easier. Second, the base class encapsulates all of
203 // the differences between SGI-style allocators and standard-conforming
206 // Base class for ordinary allocators.
207 template <class _Tp, class _Alloc, bool __is_static>
208 class _Deque_alloc_base {
210 typedef typename _Alloc_traits<_Tp,_Alloc>::allocator_type allocator_type;
211 allocator_type get_allocator() const { return _M_node_allocator; }
213 _Deque_alloc_base(const allocator_type& __a)
214 : _M_node_allocator(__a), _M_map_allocator(__a),
215 _M_map(0), _M_map_size(0)
219 typedef typename _Alloc_traits<_Tp*, _Alloc>::allocator_type
222 allocator_type _M_node_allocator;
223 _Map_allocator_type _M_map_allocator;
225 _Tp* _M_allocate_node() {
226 return _M_node_allocator.allocate(__deque_buf_size(sizeof(_Tp)));
228 void _M_deallocate_node(_Tp* __p) {
229 _M_node_allocator.deallocate(__p, __deque_buf_size(sizeof(_Tp)));
231 _Tp** _M_allocate_map(size_t __n)
232 { return _M_map_allocator.allocate(__n); }
233 void _M_deallocate_map(_Tp** __p, size_t __n)
234 { _M_map_allocator.deallocate(__p, __n); }
240 // Specialization for instanceless allocators.
241 template <class _Tp, class _Alloc>
242 class _Deque_alloc_base<_Tp, _Alloc, true>
245 typedef typename _Alloc_traits<_Tp,_Alloc>::allocator_type allocator_type;
246 allocator_type get_allocator() const { return allocator_type(); }
248 _Deque_alloc_base(const allocator_type&) : _M_map(0), _M_map_size(0) {}
251 typedef typename _Alloc_traits<_Tp, _Alloc>::_Alloc_type _Node_alloc_type;
252 typedef typename _Alloc_traits<_Tp*, _Alloc>::_Alloc_type _Map_alloc_type;
254 _Tp* _M_allocate_node() {
255 return _Node_alloc_type::allocate(__deque_buf_size(sizeof(_Tp)));
257 void _M_deallocate_node(_Tp* __p) {
258 _Node_alloc_type::deallocate(__p, __deque_buf_size(sizeof(_Tp)));
260 _Tp** _M_allocate_map(size_t __n)
261 { return _Map_alloc_type::allocate(__n); }
262 void _M_deallocate_map(_Tp** __p, size_t __n)
263 { _Map_alloc_type::deallocate(__p, __n); }
269 template <class _Tp, class _Alloc>
271 : public _Deque_alloc_base<_Tp,_Alloc,
272 _Alloc_traits<_Tp, _Alloc>::_S_instanceless>
275 typedef _Deque_alloc_base<_Tp,_Alloc,
276 _Alloc_traits<_Tp, _Alloc>::_S_instanceless>
278 typedef typename _Base::allocator_type allocator_type;
279 typedef _Deque_iterator<_Tp,_Tp&,_Tp*> iterator;
280 typedef _Deque_iterator<_Tp,const _Tp&,const _Tp*> const_iterator;
282 _Deque_base(const allocator_type& __a, size_t __num_elements)
283 : _Base(__a), _M_start(), _M_finish()
284 { _M_initialize_map(__num_elements); }
285 _Deque_base(const allocator_type& __a)
286 : _Base(__a), _M_start(), _M_finish() {}
290 void _M_initialize_map(size_t);
291 void _M_create_nodes(_Tp** __nstart, _Tp** __nfinish);
292 void _M_destroy_nodes(_Tp** __nstart, _Tp** __nfinish);
293 enum { _S_initial_map_size = 8 };
300 // Non-inline member functions from _Deque_base.
302 template <class _Tp, class _Alloc>
303 _Deque_base<_Tp,_Alloc>::~_Deque_base() {
305 _M_destroy_nodes(_M_start._M_node, _M_finish._M_node + 1);
306 _M_deallocate_map(_M_map, _M_map_size);
310 template <class _Tp, class _Alloc>
312 _Deque_base<_Tp,_Alloc>::_M_initialize_map(size_t __num_elements)
315 __num_elements / __deque_buf_size(sizeof(_Tp)) + 1;
317 _M_map_size = max((size_t) _S_initial_map_size, __num_nodes + 2);
318 _M_map = _M_allocate_map(_M_map_size);
320 _Tp** __nstart = _M_map + (_M_map_size - __num_nodes) / 2;
321 _Tp** __nfinish = __nstart + __num_nodes;
324 _M_create_nodes(__nstart, __nfinish);
326 __STL_UNWIND((_M_deallocate_map(_M_map, _M_map_size),
327 _M_map = 0, _M_map_size = 0));
328 _M_start._M_set_node(__nstart);
329 _M_finish._M_set_node(__nfinish - 1);
330 _M_start._M_cur = _M_start._M_first;
331 _M_finish._M_cur = _M_finish._M_first +
332 __num_elements % __deque_buf_size(sizeof(_Tp));
335 template <class _Tp, class _Alloc>
336 void _Deque_base<_Tp,_Alloc>::_M_create_nodes(_Tp** __nstart, _Tp** __nfinish)
340 for (__cur = __nstart; __cur < __nfinish; ++__cur)
341 *__cur = _M_allocate_node();
343 __STL_UNWIND(_M_destroy_nodes(__nstart, __cur));
346 template <class _Tp, class _Alloc>
348 _Deque_base<_Tp,_Alloc>::_M_destroy_nodes(_Tp** __nstart, _Tp** __nfinish)
350 for (_Tp** __n = __nstart; __n < __nfinish; ++__n)
351 _M_deallocate_node(*__n);
354 template <class _Tp, class _Alloc = allocator<_Tp> >
355 class deque : protected _Deque_base<_Tp, _Alloc> {
359 __STL_CLASS_REQUIRES(_Tp, _Assignable);
361 typedef _Deque_base<_Tp, _Alloc> _Base;
362 public: // Basic types
363 typedef _Tp value_type;
364 typedef value_type* pointer;
365 typedef const value_type* const_pointer;
366 typedef value_type& reference;
367 typedef const value_type& const_reference;
368 typedef size_t size_type;
369 typedef ptrdiff_t difference_type;
371 typedef typename _Base::allocator_type allocator_type;
372 allocator_type get_allocator() const { return _Base::get_allocator(); }
375 typedef typename _Base::iterator iterator;
376 typedef typename _Base::const_iterator const_iterator;
378 typedef reverse_iterator<const_iterator> const_reverse_iterator;
379 typedef reverse_iterator<iterator> reverse_iterator;
381 protected: // Internal typedefs
382 typedef pointer* _Map_pointer;
383 static size_t _S_buffer_size() { return __deque_buf_size(sizeof(_Tp)); }
386 using _Base::_M_initialize_map;
387 using _Base::_M_create_nodes;
388 using _Base::_M_destroy_nodes;
389 using _Base::_M_allocate_node;
390 using _Base::_M_deallocate_node;
391 using _Base::_M_allocate_map;
392 using _Base::_M_deallocate_map;
395 using _Base::_M_map_size;
396 using _Base::_M_start;
397 using _Base::_M_finish;
399 public: // Basic accessors
400 iterator begin() { return _M_start; }
401 iterator end() { return _M_finish; }
402 const_iterator begin() const { return _M_start; }
403 const_iterator end() const { return _M_finish; }
405 reverse_iterator rbegin() { return reverse_iterator(_M_finish); }
406 reverse_iterator rend() { return reverse_iterator(_M_start); }
407 const_reverse_iterator rbegin() const
408 { return const_reverse_iterator(_M_finish); }
409 const_reverse_iterator rend() const
410 { return const_reverse_iterator(_M_start); }
412 reference operator[](size_type __n)
413 { return _M_start[difference_type(__n)]; }
414 const_reference operator[](size_type __n) const
415 { return _M_start[difference_type(__n)]; }
417 void _M_range_check(size_type __n) const {
418 if (__n >= this->size())
419 __throw_range_error("deque");
422 reference at(size_type __n)
423 { _M_range_check(__n); return (*this)[__n]; }
424 const_reference at(size_type __n) const
425 { _M_range_check(__n); return (*this)[__n]; }
427 reference front() { return *_M_start; }
429 iterator __tmp = _M_finish;
433 const_reference front() const { return *_M_start; }
434 const_reference back() const {
435 const_iterator __tmp = _M_finish;
440 size_type size() const { return _M_finish - _M_start; }
441 size_type max_size() const { return size_type(-1); }
442 bool empty() const { return _M_finish == _M_start; }
444 public: // Constructor, destructor.
445 explicit deque(const allocator_type& __a = allocator_type())
447 deque(const deque& __x) : _Base(__x.get_allocator(), __x.size())
448 { uninitialized_copy(__x.begin(), __x.end(), _M_start); }
449 deque(size_type __n, const value_type& __value,
450 const allocator_type& __a = allocator_type()) : _Base(__a, __n)
451 { _M_fill_initialize(__value); }
452 explicit deque(size_type __n) : _Base(allocator_type(), __n)
453 { _M_fill_initialize(value_type()); }
455 // Check whether it's an integral type. If so, it's not an iterator.
456 template <class _InputIterator>
457 deque(_InputIterator __first, _InputIterator __last,
458 const allocator_type& __a = allocator_type()) : _Base(__a) {
459 typedef typename _Is_integer<_InputIterator>::_Integral _Integral;
460 _M_initialize_dispatch(__first, __last, _Integral());
463 template <class _Integer>
464 void _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type) {
465 _M_initialize_map(__n);
466 _M_fill_initialize(__x);
469 template <class _InputIter>
470 void _M_initialize_dispatch(_InputIter __first, _InputIter __last,
472 _M_range_initialize(__first, __last, __ITERATOR_CATEGORY(__first));
475 ~deque() { destroy(_M_start, _M_finish); }
477 deque& operator= (const deque& __x) {
478 const size_type __len = size();
480 if (__len >= __x.size())
481 erase(copy(__x.begin(), __x.end(), _M_start), _M_finish);
483 const_iterator __mid = __x.begin() + difference_type(__len);
484 copy(__x.begin(), __mid, _M_start);
485 insert(_M_finish, __mid, __x.end());
491 void swap(deque& __x) {
492 std::swap(_M_start, __x._M_start);
493 std::swap(_M_finish, __x._M_finish);
494 std::swap(_M_map, __x._M_map);
495 std::swap(_M_map_size, __x._M_map_size);
499 // assign(), a generalized assignment member function. Two
500 // versions: one that takes a count, and one that takes a range.
501 // The range version is a member template, so we dispatch on whether
502 // or not the type is an integer.
504 void _M_fill_assign(size_type __n, const _Tp& __val) {
506 fill(begin(), end(), __val);
507 insert(end(), __n - size(), __val);
510 erase(begin() + __n, end());
511 fill(begin(), end(), __val);
515 void assign(size_type __n, const _Tp& __val) {
516 _M_fill_assign(__n, __val);
519 template <class _InputIterator>
520 void assign(_InputIterator __first, _InputIterator __last) {
521 typedef typename _Is_integer<_InputIterator>::_Integral _Integral;
522 _M_assign_dispatch(__first, __last, _Integral());
525 private: // helper functions for assign()
527 template <class _Integer>
528 void _M_assign_dispatch(_Integer __n, _Integer __val, __true_type)
529 { _M_fill_assign((size_type) __n, (_Tp) __val); }
531 template <class _InputIterator>
532 void _M_assign_dispatch(_InputIterator __first, _InputIterator __last,
534 _M_assign_aux(__first, __last, __ITERATOR_CATEGORY(__first));
537 template <class _InputIterator>
538 void _M_assign_aux(_InputIterator __first, _InputIterator __last,
541 template <class _ForwardIterator>
542 void _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last,
543 forward_iterator_tag) {
545 distance(__first, __last, __len);
546 if (__len > size()) {
547 _ForwardIterator __mid = __first;
548 advance(__mid, size());
549 copy(__first, __mid, begin());
550 insert(end(), __mid, __last);
553 erase(copy(__first, __last, begin()), end());
556 public: // push_* and pop_*
558 void push_back(const value_type& __t) {
559 if (_M_finish._M_cur != _M_finish._M_last - 1) {
560 construct(_M_finish._M_cur, __t);
564 _M_push_back_aux(__t);
568 if (_M_finish._M_cur != _M_finish._M_last - 1) {
569 construct(_M_finish._M_cur);
576 void push_front(const value_type& __t) {
577 if (_M_start._M_cur != _M_start._M_first) {
578 construct(_M_start._M_cur - 1, __t);
582 _M_push_front_aux(__t);
586 if (_M_start._M_cur != _M_start._M_first) {
587 construct(_M_start._M_cur - 1);
596 if (_M_finish._M_cur != _M_finish._M_first) {
598 destroy(_M_finish._M_cur);
605 if (_M_start._M_cur != _M_start._M_last - 1) {
606 destroy(_M_start._M_cur);
615 iterator insert(iterator position, const value_type& __x) {
616 if (position._M_cur == _M_start._M_cur) {
620 else if (position._M_cur == _M_finish._M_cur) {
622 iterator __tmp = _M_finish;
627 return _M_insert_aux(position, __x);
631 iterator insert(iterator __position)
632 { return insert(__position, value_type()); }
634 void insert(iterator __pos, size_type __n, const value_type& __x)
635 { _M_fill_insert(__pos, __n, __x); }
637 void _M_fill_insert(iterator __pos, size_type __n, const value_type& __x);
639 // Check whether it's an integral type. If so, it's not an iterator.
640 template <class _InputIterator>
641 void insert(iterator __pos, _InputIterator __first, _InputIterator __last) {
642 typedef typename _Is_integer<_InputIterator>::_Integral _Integral;
643 _M_insert_dispatch(__pos, __first, __last, _Integral());
646 template <class _Integer>
647 void _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x,
649 _M_fill_insert(__pos, (size_type) __n, (value_type) __x);
652 template <class _InputIterator>
653 void _M_insert_dispatch(iterator __pos,
654 _InputIterator __first, _InputIterator __last,
656 insert(__pos, __first, __last, __ITERATOR_CATEGORY(__first));
659 void resize(size_type __new_size, const value_type& __x) {
660 const size_type __len = size();
661 if (__new_size < __len)
662 erase(_M_start + __new_size, _M_finish);
664 insert(_M_finish, __new_size - __len, __x);
667 void resize(size_type new_size) { resize(new_size, value_type()); }
670 iterator erase(iterator __pos) {
671 iterator __next = __pos;
673 size_type __index = __pos - _M_start;
674 if (__index < (size() >> 1)) {
675 copy_backward(_M_start, __pos, __next);
679 copy(__next, _M_finish, __pos);
682 return _M_start + __index;
685 iterator erase(iterator __first, iterator __last);
688 protected: // Internal construction/destruction
690 void _M_fill_initialize(const value_type& __value);
692 template <class _InputIterator>
693 void _M_range_initialize(_InputIterator __first, _InputIterator __last,
696 template <class _ForwardIterator>
697 void _M_range_initialize(_ForwardIterator __first, _ForwardIterator __last,
698 forward_iterator_tag);
700 protected: // Internal push_* and pop_*
702 void _M_push_back_aux(const value_type&);
703 void _M_push_back_aux();
704 void _M_push_front_aux(const value_type&);
705 void _M_push_front_aux();
706 void _M_pop_back_aux();
707 void _M_pop_front_aux();
709 protected: // Internal insert functions
711 template <class _InputIterator>
712 void insert(iterator __pos, _InputIterator __first, _InputIterator __last,
715 template <class _ForwardIterator>
716 void insert(iterator __pos,
717 _ForwardIterator __first, _ForwardIterator __last,
718 forward_iterator_tag);
720 iterator _M_insert_aux(iterator __pos, const value_type& __x);
721 iterator _M_insert_aux(iterator __pos);
722 void _M_insert_aux(iterator __pos, size_type __n, const value_type& __x);
724 template <class _ForwardIterator>
725 void _M_insert_aux(iterator __pos,
726 _ForwardIterator __first, _ForwardIterator __last,
729 iterator _M_reserve_elements_at_front(size_type __n) {
730 size_type __vacancies = _M_start._M_cur - _M_start._M_first;
731 if (__n > __vacancies)
732 _M_new_elements_at_front(__n - __vacancies);
733 return _M_start - difference_type(__n);
736 iterator _M_reserve_elements_at_back(size_type __n) {
737 size_type __vacancies = (_M_finish._M_last - _M_finish._M_cur) - 1;
738 if (__n > __vacancies)
739 _M_new_elements_at_back(__n - __vacancies);
740 return _M_finish + difference_type(__n);
743 void _M_new_elements_at_front(size_type __new_elements);
744 void _M_new_elements_at_back(size_type __new_elements);
746 protected: // Allocation of _M_map and nodes
748 // Makes sure the _M_map has space for new nodes. Does not actually
749 // add the nodes. Can invalidate _M_map pointers. (And consequently,
752 void _M_reserve_map_at_back (size_type __nodes_to_add = 1) {
753 if (__nodes_to_add + 1 > _M_map_size - (_M_finish._M_node - _M_map))
754 _M_reallocate_map(__nodes_to_add, false);
757 void _M_reserve_map_at_front (size_type __nodes_to_add = 1) {
758 if (__nodes_to_add > size_type(_M_start._M_node - _M_map))
759 _M_reallocate_map(__nodes_to_add, true);
762 void _M_reallocate_map(size_type __nodes_to_add, bool __add_at_front);
765 // Non-inline member functions
767 template <class _Tp, class _Alloc>
768 template <class _InputIter>
769 void deque<_Tp, _Alloc>
770 ::_M_assign_aux(_InputIter __first, _InputIter __last, input_iterator_tag)
772 iterator __cur = begin();
773 for ( ; __first != __last && __cur != end(); ++__cur, ++__first)
775 if (__first == __last)
778 insert(end(), __first, __last);
781 template <class _Tp, class _Alloc>
782 void deque<_Tp, _Alloc>::_M_fill_insert(iterator __pos,
783 size_type __n, const value_type& __x)
785 if (__pos._M_cur == _M_start._M_cur) {
786 iterator __new_start = _M_reserve_elements_at_front(__n);
788 uninitialized_fill(__new_start, _M_start, __x);
789 _M_start = __new_start;
791 __STL_UNWIND(_M_destroy_nodes(__new_start._M_node, _M_start._M_node));
793 else if (__pos._M_cur == _M_finish._M_cur) {
794 iterator __new_finish = _M_reserve_elements_at_back(__n);
796 uninitialized_fill(_M_finish, __new_finish, __x);
797 _M_finish = __new_finish;
799 __STL_UNWIND(_M_destroy_nodes(_M_finish._M_node + 1,
800 __new_finish._M_node + 1));
803 _M_insert_aux(__pos, __n, __x);
806 template <class _Tp, class _Alloc>
807 typename deque<_Tp,_Alloc>::iterator
808 deque<_Tp,_Alloc>::erase(iterator __first, iterator __last)
810 if (__first == _M_start && __last == _M_finish) {
815 difference_type __n = __last - __first;
816 difference_type __elems_before = __first - _M_start;
817 if (static_cast<size_type>(__elems_before) < (size() - __n) / 2) {
818 copy_backward(_M_start, __first, __last);
819 iterator __new_start = _M_start + __n;
820 destroy(_M_start, __new_start);
821 _M_destroy_nodes(__new_start._M_node, _M_start._M_node);
822 _M_start = __new_start;
825 copy(__last, _M_finish, __first);
826 iterator __new_finish = _M_finish - __n;
827 destroy(__new_finish, _M_finish);
828 _M_destroy_nodes(__new_finish._M_node + 1, _M_finish._M_node + 1);
829 _M_finish = __new_finish;
831 return _M_start + __elems_before;
835 template <class _Tp, class _Alloc>
836 void deque<_Tp,_Alloc>::clear()
838 for (_Map_pointer __node = _M_start._M_node + 1;
839 __node < _M_finish._M_node;
841 destroy(*__node, *__node + _S_buffer_size());
842 _M_deallocate_node(*__node);
845 if (_M_start._M_node != _M_finish._M_node) {
846 destroy(_M_start._M_cur, _M_start._M_last);
847 destroy(_M_finish._M_first, _M_finish._M_cur);
848 _M_deallocate_node(_M_finish._M_first);
851 destroy(_M_start._M_cur, _M_finish._M_cur);
853 _M_finish = _M_start;
856 // Precondition: _M_start and _M_finish have already been initialized,
857 // but none of the deque's elements have yet been constructed.
858 template <class _Tp, class _Alloc>
859 void deque<_Tp,_Alloc>::_M_fill_initialize(const value_type& __value) {
862 for (__cur = _M_start._M_node; __cur < _M_finish._M_node; ++__cur)
863 uninitialized_fill(*__cur, *__cur + _S_buffer_size(), __value);
864 uninitialized_fill(_M_finish._M_first, _M_finish._M_cur, __value);
866 __STL_UNWIND(destroy(_M_start, iterator(*__cur, __cur)));
869 template <class _Tp, class _Alloc> template <class _InputIterator>
870 void deque<_Tp,_Alloc>::_M_range_initialize(_InputIterator __first,
871 _InputIterator __last,
874 _M_initialize_map(0);
876 for ( ; __first != __last; ++__first)
879 __STL_UNWIND(clear());
882 template <class _Tp, class _Alloc> template <class _ForwardIterator>
883 void deque<_Tp,_Alloc>::_M_range_initialize(_ForwardIterator __first,
884 _ForwardIterator __last,
885 forward_iterator_tag)
888 distance(__first, __last, __n);
889 _M_initialize_map(__n);
891 _Map_pointer __cur_node;
893 for (__cur_node = _M_start._M_node;
894 __cur_node < _M_finish._M_node;
896 _ForwardIterator __mid = __first;
897 advance(__mid, _S_buffer_size());
898 uninitialized_copy(__first, __mid, *__cur_node);
901 uninitialized_copy(__first, __last, _M_finish._M_first);
903 __STL_UNWIND(destroy(_M_start, iterator(*__cur_node, __cur_node)));
906 // Called only if _M_finish._M_cur == _M_finish._M_last - 1.
907 template <class _Tp, class _Alloc>
908 void deque<_Tp,_Alloc>::_M_push_back_aux(const value_type& __t)
910 value_type __t_copy = __t;
911 _M_reserve_map_at_back();
912 *(_M_finish._M_node + 1) = _M_allocate_node();
914 construct(_M_finish._M_cur, __t_copy);
915 _M_finish._M_set_node(_M_finish._M_node + 1);
916 _M_finish._M_cur = _M_finish._M_first;
918 __STL_UNWIND(_M_deallocate_node(*(_M_finish._M_node + 1)));
921 // Called only if _M_finish._M_cur == _M_finish._M_last - 1.
922 template <class _Tp, class _Alloc>
923 void deque<_Tp,_Alloc>::_M_push_back_aux()
925 _M_reserve_map_at_back();
926 *(_M_finish._M_node + 1) = _M_allocate_node();
928 construct(_M_finish._M_cur);
929 _M_finish._M_set_node(_M_finish._M_node + 1);
930 _M_finish._M_cur = _M_finish._M_first;
932 __STL_UNWIND(_M_deallocate_node(*(_M_finish._M_node + 1)));
935 // Called only if _M_start._M_cur == _M_start._M_first.
936 template <class _Tp, class _Alloc>
937 void deque<_Tp,_Alloc>::_M_push_front_aux(const value_type& __t)
939 value_type __t_copy = __t;
940 _M_reserve_map_at_front();
941 *(_M_start._M_node - 1) = _M_allocate_node();
943 _M_start._M_set_node(_M_start._M_node - 1);
944 _M_start._M_cur = _M_start._M_last - 1;
945 construct(_M_start._M_cur, __t_copy);
947 __STL_UNWIND((++_M_start, _M_deallocate_node(*(_M_start._M_node - 1))));
950 // Called only if _M_start._M_cur == _M_start._M_first.
951 template <class _Tp, class _Alloc>
952 void deque<_Tp,_Alloc>::_M_push_front_aux()
954 _M_reserve_map_at_front();
955 *(_M_start._M_node - 1) = _M_allocate_node();
957 _M_start._M_set_node(_M_start._M_node - 1);
958 _M_start._M_cur = _M_start._M_last - 1;
959 construct(_M_start._M_cur);
961 __STL_UNWIND((++_M_start, _M_deallocate_node(*(_M_start._M_node - 1))));
964 // Called only if _M_finish._M_cur == _M_finish._M_first.
965 template <class _Tp, class _Alloc>
966 void deque<_Tp,_Alloc>::_M_pop_back_aux()
968 _M_deallocate_node(_M_finish._M_first);
969 _M_finish._M_set_node(_M_finish._M_node - 1);
970 _M_finish._M_cur = _M_finish._M_last - 1;
971 destroy(_M_finish._M_cur);
974 // Called only if _M_start._M_cur == _M_start._M_last - 1. Note that
975 // if the deque has at least one element (a precondition for this member
976 // function), and if _M_start._M_cur == _M_start._M_last, then the deque
977 // must have at least two nodes.
978 template <class _Tp, class _Alloc>
979 void deque<_Tp,_Alloc>::_M_pop_front_aux()
981 destroy(_M_start._M_cur);
982 _M_deallocate_node(_M_start._M_first);
983 _M_start._M_set_node(_M_start._M_node + 1);
984 _M_start._M_cur = _M_start._M_first;
987 template <class _Tp, class _Alloc> template <class _InputIterator>
988 void deque<_Tp,_Alloc>::insert(iterator __pos,
989 _InputIterator __first, _InputIterator __last,
992 copy(__first, __last, inserter(*this, __pos));
995 template <class _Tp, class _Alloc> template <class _ForwardIterator>
997 deque<_Tp,_Alloc>::insert(iterator __pos,
998 _ForwardIterator __first, _ForwardIterator __last,
999 forward_iterator_tag) {
1001 distance(__first, __last, __n);
1002 if (__pos._M_cur == _M_start._M_cur) {
1003 iterator __new_start = _M_reserve_elements_at_front(__n);
1005 uninitialized_copy(__first, __last, __new_start);
1006 _M_start = __new_start;
1008 __STL_UNWIND(_M_destroy_nodes(__new_start._M_node, _M_start._M_node));
1010 else if (__pos._M_cur == _M_finish._M_cur) {
1011 iterator __new_finish = _M_reserve_elements_at_back(__n);
1013 uninitialized_copy(__first, __last, _M_finish);
1014 _M_finish = __new_finish;
1016 __STL_UNWIND(_M_destroy_nodes(_M_finish._M_node + 1,
1017 __new_finish._M_node + 1));
1020 _M_insert_aux(__pos, __first, __last, __n);
1023 template <class _Tp, class _Alloc>
1024 typename deque<_Tp, _Alloc>::iterator
1025 deque<_Tp,_Alloc>::_M_insert_aux(iterator __pos, const value_type& __x)
1027 difference_type __index = __pos - _M_start;
1028 value_type __x_copy = __x;
1029 if (static_cast<size_type>(__index) < size() / 2) {
1030 push_front(front());
1031 iterator __front1 = _M_start;
1033 iterator __front2 = __front1;
1035 __pos = _M_start + __index;
1036 iterator __pos1 = __pos;
1038 copy(__front2, __pos1, __front1);
1042 iterator __back1 = _M_finish;
1044 iterator __back2 = __back1;
1046 __pos = _M_start + __index;
1047 copy_backward(__pos, __back2, __back1);
1053 template <class _Tp, class _Alloc>
1054 typename deque<_Tp,_Alloc>::iterator
1055 deque<_Tp,_Alloc>::_M_insert_aux(iterator __pos)
1057 difference_type __index = __pos - _M_start;
1058 if (static_cast<size_type>(__index) < size() / 2) {
1059 push_front(front());
1060 iterator __front1 = _M_start;
1062 iterator __front2 = __front1;
1064 __pos = _M_start + __index;
1065 iterator __pos1 = __pos;
1067 copy(__front2, __pos1, __front1);
1071 iterator __back1 = _M_finish;
1073 iterator __back2 = __back1;
1075 __pos = _M_start + __index;
1076 copy_backward(__pos, __back2, __back1);
1078 *__pos = value_type();
1082 template <class _Tp, class _Alloc>
1083 void deque<_Tp,_Alloc>::_M_insert_aux(iterator __pos,
1085 const value_type& __x)
1087 const difference_type __elems_before = __pos - _M_start;
1088 size_type __length = this->size();
1089 value_type __x_copy = __x;
1090 if (__elems_before < difference_type(__length / 2)) {
1091 iterator __new_start = _M_reserve_elements_at_front(__n);
1092 iterator __old_start = _M_start;
1093 __pos = _M_start + __elems_before;
1095 if (__elems_before >= difference_type(__n)) {
1096 iterator __start_n = _M_start + difference_type(__n);
1097 uninitialized_copy(_M_start, __start_n, __new_start);
1098 _M_start = __new_start;
1099 copy(__start_n, __pos, __old_start);
1100 fill(__pos - difference_type(__n), __pos, __x_copy);
1103 __uninitialized_copy_fill(_M_start, __pos, __new_start,
1104 _M_start, __x_copy);
1105 _M_start = __new_start;
1106 fill(__old_start, __pos, __x_copy);
1109 __STL_UNWIND(_M_destroy_nodes(__new_start._M_node, _M_start._M_node));
1112 iterator __new_finish = _M_reserve_elements_at_back(__n);
1113 iterator __old_finish = _M_finish;
1114 const difference_type __elems_after =
1115 difference_type(__length) - __elems_before;
1116 __pos = _M_finish - __elems_after;
1118 if (__elems_after > difference_type(__n)) {
1119 iterator __finish_n = _M_finish - difference_type(__n);
1120 uninitialized_copy(__finish_n, _M_finish, _M_finish);
1121 _M_finish = __new_finish;
1122 copy_backward(__pos, __finish_n, __old_finish);
1123 fill(__pos, __pos + difference_type(__n), __x_copy);
1126 __uninitialized_fill_copy(_M_finish, __pos + difference_type(__n),
1127 __x_copy, __pos, _M_finish);
1128 _M_finish = __new_finish;
1129 fill(__pos, __old_finish, __x_copy);
1132 __STL_UNWIND(_M_destroy_nodes(_M_finish._M_node + 1,
1133 __new_finish._M_node + 1));
1137 template <class _Tp, class _Alloc> template <class _ForwardIterator>
1138 void deque<_Tp,_Alloc>::_M_insert_aux(iterator __pos,
1139 _ForwardIterator __first,
1140 _ForwardIterator __last,
1143 const difference_type __elemsbefore = __pos - _M_start;
1144 size_type __length = size();
1145 if (static_cast<size_type>(__elemsbefore) < __length / 2) {
1146 iterator __new_start = _M_reserve_elements_at_front(__n);
1147 iterator __old_start = _M_start;
1148 __pos = _M_start + __elemsbefore;
1150 if (__elemsbefore >= difference_type(__n)) {
1151 iterator __start_n = _M_start + difference_type(__n);
1152 uninitialized_copy(_M_start, __start_n, __new_start);
1153 _M_start = __new_start;
1154 copy(__start_n, __pos, __old_start);
1155 copy(__first, __last, __pos - difference_type(__n));
1158 _ForwardIterator __mid = __first;
1159 advance(__mid, difference_type(__n) - __elemsbefore);
1160 __uninitialized_copy_copy(_M_start, __pos, __first, __mid,
1162 _M_start = __new_start;
1163 copy(__mid, __last, __old_start);
1166 __STL_UNWIND(_M_destroy_nodes(__new_start._M_node, _M_start._M_node));
1169 iterator __new_finish = _M_reserve_elements_at_back(__n);
1170 iterator __old_finish = _M_finish;
1171 const difference_type __elemsafter =
1172 difference_type(__length) - __elemsbefore;
1173 __pos = _M_finish - __elemsafter;
1175 if (__elemsafter > difference_type(__n)) {
1176 iterator __finish_n = _M_finish - difference_type(__n);
1177 uninitialized_copy(__finish_n, _M_finish, _M_finish);
1178 _M_finish = __new_finish;
1179 copy_backward(__pos, __finish_n, __old_finish);
1180 copy(__first, __last, __pos);
1183 _ForwardIterator __mid = __first;
1184 advance(__mid, __elemsafter);
1185 __uninitialized_copy_copy(__mid, __last, __pos, _M_finish, _M_finish);
1186 _M_finish = __new_finish;
1187 copy(__first, __mid, __pos);
1190 __STL_UNWIND(_M_destroy_nodes(_M_finish._M_node + 1,
1191 __new_finish._M_node + 1));
1195 template <class _Tp, class _Alloc>
1196 void deque<_Tp,_Alloc>::_M_new_elements_at_front(size_type __new_elems)
1198 size_type __new_nodes
1199 = (__new_elems + _S_buffer_size() - 1) / _S_buffer_size();
1200 _M_reserve_map_at_front(__new_nodes);
1203 for (__i = 1; __i <= __new_nodes; ++__i)
1204 *(_M_start._M_node - __i) = _M_allocate_node();
1206 # ifdef __STL_USE_EXCEPTIONS
1208 for (size_type __j = 1; __j < __i; ++__j)
1209 _M_deallocate_node(*(_M_start._M_node - __j));
1212 # endif /* __STL_USE_EXCEPTIONS */
1215 template <class _Tp, class _Alloc>
1216 void deque<_Tp,_Alloc>::_M_new_elements_at_back(size_type __new_elems)
1218 size_type __new_nodes
1219 = (__new_elems + _S_buffer_size() - 1) / _S_buffer_size();
1220 _M_reserve_map_at_back(__new_nodes);
1223 for (__i = 1; __i <= __new_nodes; ++__i)
1224 *(_M_finish._M_node + __i) = _M_allocate_node();
1226 # ifdef __STL_USE_EXCEPTIONS
1228 for (size_type __j = 1; __j < __i; ++__j)
1229 _M_deallocate_node(*(_M_finish._M_node + __j));
1232 # endif /* __STL_USE_EXCEPTIONS */
1235 template <class _Tp, class _Alloc>
1236 void deque<_Tp,_Alloc>::_M_reallocate_map(size_type __nodes_to_add,
1237 bool __add_at_front)
1239 size_type __old_num_nodes = _M_finish._M_node - _M_start._M_node + 1;
1240 size_type __new_num_nodes = __old_num_nodes + __nodes_to_add;
1242 _Map_pointer __new_nstart;
1243 if (_M_map_size > 2 * __new_num_nodes) {
1244 __new_nstart = _M_map + (_M_map_size - __new_num_nodes) / 2
1245 + (__add_at_front ? __nodes_to_add : 0);
1246 if (__new_nstart < _M_start._M_node)
1247 copy(_M_start._M_node, _M_finish._M_node + 1, __new_nstart);
1249 copy_backward(_M_start._M_node, _M_finish._M_node + 1,
1250 __new_nstart + __old_num_nodes);
1253 size_type __new_map_size =
1254 _M_map_size + max(_M_map_size, __nodes_to_add) + 2;
1256 _Map_pointer __new_map = _M_allocate_map(__new_map_size);
1257 __new_nstart = __new_map + (__new_map_size - __new_num_nodes) / 2
1258 + (__add_at_front ? __nodes_to_add : 0);
1259 copy(_M_start._M_node, _M_finish._M_node + 1, __new_nstart);
1260 _M_deallocate_map(_M_map, _M_map_size);
1263 _M_map_size = __new_map_size;
1266 _M_start._M_set_node(__new_nstart);
1267 _M_finish._M_set_node(__new_nstart + __old_num_nodes - 1);
1271 // Nonmember functions.
1273 template <class _Tp, class _Alloc>
1274 inline bool operator==(const deque<_Tp, _Alloc>& __x,
1275 const deque<_Tp, _Alloc>& __y) {
1276 return __x.size() == __y.size() &&
1277 equal(__x.begin(), __x.end(), __y.begin());
1280 template <class _Tp, class _Alloc>
1281 inline bool operator<(const deque<_Tp, _Alloc>& __x,
1282 const deque<_Tp, _Alloc>& __y) {
1283 return lexicographical_compare(__x.begin(), __x.end(),
1284 __y.begin(), __y.end());
1287 template <class _Tp, class _Alloc>
1288 inline bool operator!=(const deque<_Tp, _Alloc>& __x,
1289 const deque<_Tp, _Alloc>& __y) {
1290 return !(__x == __y);
1293 template <class _Tp, class _Alloc>
1294 inline bool operator>(const deque<_Tp, _Alloc>& __x,
1295 const deque<_Tp, _Alloc>& __y) {
1299 template <class _Tp, class _Alloc>
1300 inline bool operator<=(const deque<_Tp, _Alloc>& __x,
1301 const deque<_Tp, _Alloc>& __y) {
1302 return !(__y < __x);
1304 template <class _Tp, class _Alloc>
1305 inline bool operator>=(const deque<_Tp, _Alloc>& __x,
1306 const deque<_Tp, _Alloc>& __y) {
1307 return !(__x < __y);
1310 template <class _Tp, class _Alloc>
1311 inline void swap(deque<_Tp,_Alloc>& __x, deque<_Tp,_Alloc>& __y) {
1317 #endif /* __SGI_STL_INTERNAL_DEQUE_H */