1 // Deque implementation -*- C++ -*-
3 // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007
4 // Free Software Foundation, Inc.
6 // This file is part of the GNU ISO C++ Library. This library is free
7 // software; you can redistribute it and/or modify it under the
8 // terms of the GNU General Public License as published by the
9 // Free Software Foundation; either version 2, or (at your option)
12 // This library is distributed in the hope that it will be useful,
13 // but WITHOUT ANY WARRANTY; without even the implied warranty of
14 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 // GNU General Public License for more details.
17 // You should have received a copy of the GNU General Public License along
18 // with this library; see the file COPYING. If not, write to the Free
19 // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
22 // As a special exception, you may use this file as part of a free software
23 // library without restriction. Specifically, if other files instantiate
24 // templates or use macros or inline functions from this file, or you compile
25 // this file and link it with other files to produce an executable, this
26 // file does not by itself cause the resulting executable to be covered by
27 // the GNU General Public License. This exception does not however
28 // invalidate any other reasons why the executable file might be covered by
29 // the GNU General Public License.
34 * Hewlett-Packard Company
36 * Permission to use, copy, modify, distribute and sell this software
37 * and its documentation for any purpose is hereby granted without fee,
38 * provided that the above copyright notice appear in all copies and
39 * that both that copyright notice and this permission notice appear
40 * in supporting documentation. Hewlett-Packard Company makes no
41 * representations about the suitability of this software for any
42 * purpose. It is provided "as is" without express or implied warranty.
46 * Silicon Graphics Computer Systems, Inc.
48 * Permission to use, copy, modify, distribute and sell this software
49 * and its documentation for any purpose is hereby granted without fee,
50 * provided that the above copyright notice appear in all copies and
51 * that both that copyright notice and this permission notice appear
52 * in supporting documentation. Silicon Graphics makes no
53 * representations about the suitability of this software for any
54 * purpose. It is provided "as is" without express or implied warranty.
58 * This is an internal header file, included by other library headers.
59 * You should not attempt to use it directly.
63 #define _STL_DEQUE_H 1
65 #include <bits/concept_check.h>
66 #include <bits/stl_iterator_base_types.h>
67 #include <bits/stl_iterator_base_funcs.h>
69 _GLIBCXX_BEGIN_NESTED_NAMESPACE(std
, _GLIBCXX_STD_D
)
73 * @brief This function controls the size of memory nodes.
74 * @param size The size of an element.
75 * @return The number (not byte size) of elements per node.
77 * This function started off as a compiler kludge from SGI, but seems to
78 * be a useful wrapper around a repeated constant expression. The '512' is
79 * tuneable (and no other code needs to change), but no investigation has
80 * been done since inheriting the SGI code.
84 __deque_buf_size(size_t __size
)
85 { return __size
< 512 ? size_t(512 / __size
) : size_t(1); }
89 * @brief A deque::iterator.
91 * Quite a bit of intelligence here. Much of the functionality of
92 * deque is actually passed off to this class. A deque holds two
93 * of these internally, marking its valid range. Access to
94 * elements is done as offsets of either of those two, relying on
95 * operator overloading in this class.
98 * All the functions are op overloads except for _M_set_node.
101 template<typename _Tp
, typename _Ref
, typename _Ptr
>
102 struct _Deque_iterator
104 typedef _Deque_iterator
<_Tp
, _Tp
&, _Tp
*> iterator
;
105 typedef _Deque_iterator
<_Tp
, const _Tp
&, const _Tp
*> const_iterator
;
107 static size_t _S_buffer_size()
108 { return __deque_buf_size(sizeof(_Tp
)); }
110 typedef std::random_access_iterator_tag iterator_category
;
111 typedef _Tp value_type
;
112 typedef _Ptr pointer
;
113 typedef _Ref reference
;
114 typedef size_t size_type
;
115 typedef ptrdiff_t difference_type
;
116 typedef _Tp
** _Map_pointer
;
117 typedef _Deque_iterator _Self
;
122 _Map_pointer _M_node
;
124 _Deque_iterator(_Tp
* __x
, _Map_pointer __y
)
125 : _M_cur(__x
), _M_first(*__y
),
126 _M_last(*__y
+ _S_buffer_size()), _M_node(__y
) { }
129 : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) { }
131 _Deque_iterator(const iterator
& __x
)
132 : _M_cur(__x
._M_cur
), _M_first(__x
._M_first
),
133 _M_last(__x
._M_last
), _M_node(__x
._M_node
) { }
147 if (_M_cur
== _M_last
)
149 _M_set_node(_M_node
+ 1);
166 if (_M_cur
== _M_first
)
168 _M_set_node(_M_node
- 1);
184 operator+=(difference_type __n
)
186 const difference_type __offset
= __n
+ (_M_cur
- _M_first
);
187 if (__offset
>= 0 && __offset
< difference_type(_S_buffer_size()))
191 const difference_type __node_offset
=
192 __offset
> 0 ? __offset
/ difference_type(_S_buffer_size())
193 : -difference_type((-__offset
- 1)
194 / _S_buffer_size()) - 1;
195 _M_set_node(_M_node
+ __node_offset
);
196 _M_cur
= _M_first
+ (__offset
- __node_offset
197 * difference_type(_S_buffer_size()));
203 operator+(difference_type __n
) const
210 operator-=(difference_type __n
)
211 { return *this += -__n
; }
214 operator-(difference_type __n
) const
221 operator[](difference_type __n
) const
222 { return *(*this + __n
); }
225 * Prepares to traverse new_node. Sets everything except
226 * _M_cur, which should therefore be set by the caller
227 * immediately afterwards, based on _M_first and _M_last.
231 _M_set_node(_Map_pointer __new_node
)
233 _M_node
= __new_node
;
234 _M_first
= *__new_node
;
235 _M_last
= _M_first
+ difference_type(_S_buffer_size());
239 // Note: we also provide overloads whose operands are of the same type in
240 // order to avoid ambiguous overload resolution when std::rel_ops operators
241 // are in scope (for additional details, see libstdc++/3628)
242 template<typename _Tp
, typename _Ref
, typename _Ptr
>
244 operator==(const _Deque_iterator
<_Tp
, _Ref
, _Ptr
>& __x
,
245 const _Deque_iterator
<_Tp
, _Ref
, _Ptr
>& __y
)
246 { return __x
._M_cur
== __y
._M_cur
; }
248 template<typename _Tp
, typename _RefL
, typename _PtrL
,
249 typename _RefR
, typename _PtrR
>
251 operator==(const _Deque_iterator
<_Tp
, _RefL
, _PtrL
>& __x
,
252 const _Deque_iterator
<_Tp
, _RefR
, _PtrR
>& __y
)
253 { return __x
._M_cur
== __y
._M_cur
; }
255 template<typename _Tp
, typename _Ref
, typename _Ptr
>
257 operator!=(const _Deque_iterator
<_Tp
, _Ref
, _Ptr
>& __x
,
258 const _Deque_iterator
<_Tp
, _Ref
, _Ptr
>& __y
)
259 { return !(__x
== __y
); }
261 template<typename _Tp
, typename _RefL
, typename _PtrL
,
262 typename _RefR
, typename _PtrR
>
264 operator!=(const _Deque_iterator
<_Tp
, _RefL
, _PtrL
>& __x
,
265 const _Deque_iterator
<_Tp
, _RefR
, _PtrR
>& __y
)
266 { return !(__x
== __y
); }
268 template<typename _Tp
, typename _Ref
, typename _Ptr
>
270 operator<(const _Deque_iterator
<_Tp
, _Ref
, _Ptr
>& __x
,
271 const _Deque_iterator
<_Tp
, _Ref
, _Ptr
>& __y
)
272 { return (__x
._M_node
== __y
._M_node
) ? (__x
._M_cur
< __y
._M_cur
)
273 : (__x
._M_node
< __y
._M_node
); }
275 template<typename _Tp
, typename _RefL
, typename _PtrL
,
276 typename _RefR
, typename _PtrR
>
278 operator<(const _Deque_iterator
<_Tp
, _RefL
, _PtrL
>& __x
,
279 const _Deque_iterator
<_Tp
, _RefR
, _PtrR
>& __y
)
280 { return (__x
._M_node
== __y
._M_node
) ? (__x
._M_cur
< __y
._M_cur
)
281 : (__x
._M_node
< __y
._M_node
); }
283 template<typename _Tp
, typename _Ref
, typename _Ptr
>
285 operator>(const _Deque_iterator
<_Tp
, _Ref
, _Ptr
>& __x
,
286 const _Deque_iterator
<_Tp
, _Ref
, _Ptr
>& __y
)
287 { return __y
< __x
; }
289 template<typename _Tp
, typename _RefL
, typename _PtrL
,
290 typename _RefR
, typename _PtrR
>
292 operator>(const _Deque_iterator
<_Tp
, _RefL
, _PtrL
>& __x
,
293 const _Deque_iterator
<_Tp
, _RefR
, _PtrR
>& __y
)
294 { return __y
< __x
; }
296 template<typename _Tp
, typename _Ref
, typename _Ptr
>
298 operator<=(const _Deque_iterator
<_Tp
, _Ref
, _Ptr
>& __x
,
299 const _Deque_iterator
<_Tp
, _Ref
, _Ptr
>& __y
)
300 { return !(__y
< __x
); }
302 template<typename _Tp
, typename _RefL
, typename _PtrL
,
303 typename _RefR
, typename _PtrR
>
305 operator<=(const _Deque_iterator
<_Tp
, _RefL
, _PtrL
>& __x
,
306 const _Deque_iterator
<_Tp
, _RefR
, _PtrR
>& __y
)
307 { return !(__y
< __x
); }
309 template<typename _Tp
, typename _Ref
, typename _Ptr
>
311 operator>=(const _Deque_iterator
<_Tp
, _Ref
, _Ptr
>& __x
,
312 const _Deque_iterator
<_Tp
, _Ref
, _Ptr
>& __y
)
313 { return !(__x
< __y
); }
315 template<typename _Tp
, typename _RefL
, typename _PtrL
,
316 typename _RefR
, typename _PtrR
>
318 operator>=(const _Deque_iterator
<_Tp
, _RefL
, _PtrL
>& __x
,
319 const _Deque_iterator
<_Tp
, _RefR
, _PtrR
>& __y
)
320 { return !(__x
< __y
); }
322 // _GLIBCXX_RESOLVE_LIB_DEFECTS
323 // According to the resolution of DR179 not only the various comparison
324 // operators but also operator- must accept mixed iterator/const_iterator
326 template<typename _Tp
, typename _Ref
, typename _Ptr
>
327 inline typename _Deque_iterator
<_Tp
, _Ref
, _Ptr
>::difference_type
328 operator-(const _Deque_iterator
<_Tp
, _Ref
, _Ptr
>& __x
,
329 const _Deque_iterator
<_Tp
, _Ref
, _Ptr
>& __y
)
331 return typename _Deque_iterator
<_Tp
, _Ref
, _Ptr
>::difference_type
332 (_Deque_iterator
<_Tp
, _Ref
, _Ptr
>::_S_buffer_size())
333 * (__x
._M_node
- __y
._M_node
- 1) + (__x
._M_cur
- __x
._M_first
)
334 + (__y
._M_last
- __y
._M_cur
);
337 template<typename _Tp
, typename _RefL
, typename _PtrL
,
338 typename _RefR
, typename _PtrR
>
339 inline typename _Deque_iterator
<_Tp
, _RefL
, _PtrL
>::difference_type
340 operator-(const _Deque_iterator
<_Tp
, _RefL
, _PtrL
>& __x
,
341 const _Deque_iterator
<_Tp
, _RefR
, _PtrR
>& __y
)
343 return typename _Deque_iterator
<_Tp
, _RefL
, _PtrL
>::difference_type
344 (_Deque_iterator
<_Tp
, _RefL
, _PtrL
>::_S_buffer_size())
345 * (__x
._M_node
- __y
._M_node
- 1) + (__x
._M_cur
- __x
._M_first
)
346 + (__y
._M_last
- __y
._M_cur
);
349 template<typename _Tp
, typename _Ref
, typename _Ptr
>
350 inline _Deque_iterator
<_Tp
, _Ref
, _Ptr
>
351 operator+(ptrdiff_t __n
, const _Deque_iterator
<_Tp
, _Ref
, _Ptr
>& __x
)
352 { return __x
+ __n
; }
354 template<typename _Tp
>
356 fill(const _Deque_iterator
<_Tp
, _Tp
&, _Tp
*>& __first
,
357 const _Deque_iterator
<_Tp
, _Tp
&, _Tp
*>& __last
, const _Tp
& __value
);
361 * Deque base class. This class provides the unified face for %deque's
362 * allocation. This class's constructor and destructor allocate and
363 * deallocate (but do not initialize) storage. This makes %exception
366 * Nothing in this class ever constructs or destroys an actual Tp element.
367 * (Deque handles that itself.) Only/All memory management is performed
371 template<typename _Tp
, typename _Alloc
>
375 typedef _Alloc allocator_type
;
378 get_allocator() const
379 { return allocator_type(_M_get_Tp_allocator()); }
381 typedef _Deque_iterator
<_Tp
, _Tp
&, _Tp
*> iterator
;
382 typedef _Deque_iterator
<_Tp
, const _Tp
&, const _Tp
*> const_iterator
;
386 { _M_initialize_map(0); }
388 _Deque_base(const allocator_type
& __a
, size_t __num_elements
)
390 { _M_initialize_map(__num_elements
); }
392 _Deque_base(const allocator_type
& __a
)
396 #ifdef __GXX_EXPERIMENTAL_CXX0X__
397 _Deque_base(_Deque_base
&& __x
)
398 : _M_impl(__x
._M_get_Tp_allocator())
400 _M_initialize_map(0);
401 if (__x
._M_impl
._M_map
)
403 std::swap(this->_M_impl
._M_start
, __x
._M_impl
._M_start
);
404 std::swap(this->_M_impl
._M_finish
, __x
._M_impl
._M_finish
);
405 std::swap(this->_M_impl
._M_map
, __x
._M_impl
._M_map
);
406 std::swap(this->_M_impl
._M_map_size
, __x
._M_impl
._M_map_size
);
414 //This struct encapsulates the implementation of the std::deque
415 //standard container and at the same time makes use of the EBO
416 //for empty allocators.
417 typedef typename
_Alloc::template rebind
<_Tp
*>::other _Map_alloc_type
;
419 typedef typename
_Alloc::template rebind
<_Tp
>::other _Tp_alloc_type
;
422 : public _Tp_alloc_type
430 : _Tp_alloc_type(), _M_map(0), _M_map_size(0),
431 _M_start(), _M_finish()
434 _Deque_impl(const _Tp_alloc_type
& __a
)
435 : _Tp_alloc_type(__a
), _M_map(0), _M_map_size(0),
436 _M_start(), _M_finish()
441 _M_get_Tp_allocator()
442 { return *static_cast<_Tp_alloc_type
*>(&this->_M_impl
); }
444 const _Tp_alloc_type
&
445 _M_get_Tp_allocator() const
446 { return *static_cast<const _Tp_alloc_type
*>(&this->_M_impl
); }
449 _M_get_map_allocator() const
450 { return _Map_alloc_type(_M_get_Tp_allocator()); }
455 return _M_impl
._Tp_alloc_type::allocate(__deque_buf_size(sizeof(_Tp
)));
459 _M_deallocate_node(_Tp
* __p
)
461 _M_impl
._Tp_alloc_type::deallocate(__p
, __deque_buf_size(sizeof(_Tp
)));
465 _M_allocate_map(size_t __n
)
466 { return _M_get_map_allocator().allocate(__n
); }
469 _M_deallocate_map(_Tp
** __p
, size_t __n
)
470 { _M_get_map_allocator().deallocate(__p
, __n
); }
473 void _M_initialize_map(size_t);
474 void _M_create_nodes(_Tp
** __nstart
, _Tp
** __nfinish
);
475 void _M_destroy_nodes(_Tp
** __nstart
, _Tp
** __nfinish
);
476 enum { _S_initial_map_size
= 8 };
481 template<typename _Tp
, typename _Alloc
>
482 _Deque_base
<_Tp
, _Alloc
>::
485 if (this->_M_impl
._M_map
)
487 _M_destroy_nodes(this->_M_impl
._M_start
._M_node
,
488 this->_M_impl
._M_finish
._M_node
+ 1);
489 _M_deallocate_map(this->_M_impl
._M_map
, this->_M_impl
._M_map_size
);
495 * @brief Layout storage.
496 * @param num_elements The count of T's for which to allocate space
500 * The initial underlying memory layout is a bit complicated...
503 template<typename _Tp
, typename _Alloc
>
505 _Deque_base
<_Tp
, _Alloc
>::
506 _M_initialize_map(size_t __num_elements
)
508 const size_t __num_nodes
= (__num_elements
/ __deque_buf_size(sizeof(_Tp
))
511 this->_M_impl
._M_map_size
= std::max((size_t) _S_initial_map_size
,
512 size_t(__num_nodes
+ 2));
513 this->_M_impl
._M_map
= _M_allocate_map(this->_M_impl
._M_map_size
);
515 // For "small" maps (needing less than _M_map_size nodes), allocation
516 // starts in the middle elements and grows outwards. So nstart may be
517 // the beginning of _M_map, but for small maps it may be as far in as
520 _Tp
** __nstart
= (this->_M_impl
._M_map
521 + (this->_M_impl
._M_map_size
- __num_nodes
) / 2);
522 _Tp
** __nfinish
= __nstart
+ __num_nodes
;
525 { _M_create_nodes(__nstart
, __nfinish
); }
528 _M_deallocate_map(this->_M_impl
._M_map
, this->_M_impl
._M_map_size
);
529 this->_M_impl
._M_map
= 0;
530 this->_M_impl
._M_map_size
= 0;
531 __throw_exception_again
;
534 this->_M_impl
._M_start
._M_set_node(__nstart
);
535 this->_M_impl
._M_finish
._M_set_node(__nfinish
- 1);
536 this->_M_impl
._M_start
._M_cur
= _M_impl
._M_start
._M_first
;
537 this->_M_impl
._M_finish
._M_cur
= (this->_M_impl
._M_finish
._M_first
539 % __deque_buf_size(sizeof(_Tp
)));
542 template<typename _Tp
, typename _Alloc
>
544 _Deque_base
<_Tp
, _Alloc
>::
545 _M_create_nodes(_Tp
** __nstart
, _Tp
** __nfinish
)
550 for (__cur
= __nstart
; __cur
< __nfinish
; ++__cur
)
551 *__cur
= this->_M_allocate_node();
555 _M_destroy_nodes(__nstart
, __cur
);
556 __throw_exception_again
;
560 template<typename _Tp
, typename _Alloc
>
562 _Deque_base
<_Tp
, _Alloc
>::
563 _M_destroy_nodes(_Tp
** __nstart
, _Tp
** __nfinish
)
565 for (_Tp
** __n
= __nstart
; __n
< __nfinish
; ++__n
)
566 _M_deallocate_node(*__n
);
570 * @brief A standard container using fixed-size memory allocation and
571 * constant-time manipulation of elements at either end.
573 * @ingroup Containers
576 * Meets the requirements of a <a href="tables.html#65">container</a>, a
577 * <a href="tables.html#66">reversible container</a>, and a
578 * <a href="tables.html#67">sequence</a>, including the
579 * <a href="tables.html#68">optional sequence requirements</a>.
581 * In previous HP/SGI versions of deque, there was an extra template
582 * parameter so users could control the node size. This extension turned
583 * out to violate the C++ standard (it can be detected using template
584 * template parameters), and it was removed.
587 * Here's how a deque<Tp> manages memory. Each deque has 4 members:
590 * - size_t _M_map_size
591 * - iterator _M_start, _M_finish
593 * map_size is at least 8. %map is an array of map_size
594 * pointers-to-"nodes". (The name %map has nothing to do with the
595 * std::map class, and "nodes" should not be confused with
596 * std::list's usage of "node".)
598 * A "node" has no specific type name as such, but it is referred
599 * to as "node" in this file. It is a simple array-of-Tp. If Tp
600 * is very large, there will be one Tp element per node (i.e., an
601 * "array" of one). For non-huge Tp's, node size is inversely
602 * related to Tp size: the larger the Tp, the fewer Tp's will fit
603 * in a node. The goal here is to keep the total size of a node
604 * relatively small and constant over different Tp's, to improve
605 * allocator efficiency.
607 * Not every pointer in the %map array will point to a node. If
608 * the initial number of elements in the deque is small, the
609 * /middle/ %map pointers will be valid, and the ones at the edges
610 * will be unused. This same situation will arise as the %map
611 * grows: available %map pointers, if any, will be on the ends. As
612 * new nodes are created, only a subset of the %map's pointers need
613 * to be copied "outward".
616 * - For any nonsingular iterator i:
617 * - i.node points to a member of the %map array. (Yes, you read that
618 * correctly: i.node does not actually point to a node.) The member of
619 * the %map array is what actually points to the node.
620 * - i.first == *(i.node) (This points to the node (first Tp element).)
621 * - i.last == i.first + node_size
622 * - i.cur is a pointer in the range [i.first, i.last). NOTE:
623 * the implication of this is that i.cur is always a dereferenceable
624 * pointer, even if i is a past-the-end iterator.
625 * - Start and Finish are always nonsingular iterators. NOTE: this
626 * means that an empty deque must have one node, a deque with <N
627 * elements (where N is the node buffer size) must have one node, a
628 * deque with N through (2N-1) elements must have two nodes, etc.
629 * - For every node other than start.node and finish.node, every
630 * element in the node is an initialized object. If start.node ==
631 * finish.node, then [start.cur, finish.cur) are initialized
632 * objects, and the elements outside that range are uninitialized
633 * storage. Otherwise, [start.cur, start.last) and [finish.first,
634 * finish.cur) are initialized objects, and [start.first, start.cur)
635 * and [finish.cur, finish.last) are uninitialized storage.
636 * - [%map, %map + map_size) is a valid, non-empty range.
637 * - [start.node, finish.node] is a valid range contained within
638 * [%map, %map + map_size).
639 * - A pointer in the range [%map, %map + map_size) points to an allocated
640 * node if and only if the pointer is in the range
641 * [start.node, finish.node].
643 * Here's the magic: nothing in deque is "aware" of the discontiguous
646 * The memory setup and layout occurs in the parent, _Base, and the iterator
647 * class is entirely responsible for "leaping" from one node to the next.
648 * All the implementation routines for deque itself work only through the
649 * start and finish iterators. This keeps the routines simple and sane,
650 * and we can use other standard algorithms as well.
653 template<typename _Tp
, typename _Alloc
= std::allocator
<_Tp
> >
654 class deque
: protected _Deque_base
<_Tp
, _Alloc
>
656 // concept requirements
657 typedef typename
_Alloc::value_type _Alloc_value_type
;
658 __glibcxx_class_requires(_Tp
, _SGIAssignableConcept
)
659 __glibcxx_class_requires2(_Tp
, _Alloc_value_type
, _SameTypeConcept
)
661 typedef _Deque_base
<_Tp
, _Alloc
> _Base
;
662 typedef typename
_Base::_Tp_alloc_type _Tp_alloc_type
;
665 typedef _Tp value_type
;
666 typedef typename
_Tp_alloc_type::pointer pointer
;
667 typedef typename
_Tp_alloc_type::const_pointer const_pointer
;
668 typedef typename
_Tp_alloc_type::reference reference
;
669 typedef typename
_Tp_alloc_type::const_reference const_reference
;
670 typedef typename
_Base::iterator iterator
;
671 typedef typename
_Base::const_iterator const_iterator
;
672 typedef std::reverse_iterator
<const_iterator
> const_reverse_iterator
;
673 typedef std::reverse_iterator
<iterator
> reverse_iterator
;
674 typedef size_t size_type
;
675 typedef ptrdiff_t difference_type
;
676 typedef _Alloc allocator_type
;
679 typedef pointer
* _Map_pointer
;
681 static size_t _S_buffer_size()
682 { return __deque_buf_size(sizeof(_Tp
)); }
684 // Functions controlling memory layout, and nothing else.
685 using _Base::_M_initialize_map
;
686 using _Base::_M_create_nodes
;
687 using _Base::_M_destroy_nodes
;
688 using _Base::_M_allocate_node
;
689 using _Base::_M_deallocate_node
;
690 using _Base::_M_allocate_map
;
691 using _Base::_M_deallocate_map
;
692 using _Base::_M_get_Tp_allocator
;
695 * A total of four data members accumulated down the heirarchy.
696 * May be accessed via _M_impl.*
699 using _Base::_M_impl
;
702 // [23.2.1.1] construct/copy/destroy
703 // (assign() and get_allocator() are also listed in this section)
705 * @brief Default constructor creates no elements.
711 * @brief Creates a %deque with no elements.
712 * @param a An allocator object.
715 deque(const allocator_type
& __a
)
719 * @brief Creates a %deque with copies of an exemplar element.
720 * @param n The number of elements to initially create.
721 * @param value An element to copy.
722 * @param a An allocator.
724 * This constructor fills the %deque with @a n copies of @a value.
727 deque(size_type __n
, const value_type
& __value
= value_type(),
728 const allocator_type
& __a
= allocator_type())
730 { _M_fill_initialize(__value
); }
733 * @brief %Deque copy constructor.
734 * @param x A %deque of identical element and allocator types.
736 * The newly-created %deque uses a copy of the allocation object used
739 deque(const deque
& __x
)
740 : _Base(__x
._M_get_Tp_allocator(), __x
.size())
741 { std::__uninitialized_copy_a(__x
.begin(), __x
.end(),
742 this->_M_impl
._M_start
,
743 _M_get_Tp_allocator()); }
745 #ifdef __GXX_EXPERIMENTAL_CXX0X__
747 * @brief %Deque move constructor.
748 * @param x A %deque of identical element and allocator types.
750 * The newly-created %deque contains the exact contents of @a x.
751 * The contents of @a x are a valid, but unspecified %deque.
754 : _Base(std::forward
<_Base
>(__x
)) { }
758 * @brief Builds a %deque from a range.
759 * @param first An input iterator.
760 * @param last An input iterator.
761 * @param a An allocator object.
763 * Create a %deque consisting of copies of the elements from [first,
766 * If the iterators are forward, bidirectional, or random-access, then
767 * this will call the elements' copy constructor N times (where N is
768 * distance(first,last)) and do no memory reallocation. But if only
769 * input iterators are used, then this will do at most 2N calls to the
770 * copy constructor, and logN memory reallocations.
772 template<typename _InputIterator
>
773 deque(_InputIterator __first
, _InputIterator __last
,
774 const allocator_type
& __a
= allocator_type())
777 // Check whether it's an integral type. If so, it's not an iterator.
778 typedef typename
std::__is_integer
<_InputIterator
>::__type _Integral
;
779 _M_initialize_dispatch(__first
, __last
, _Integral());
783 * The dtor only erases the elements, and note that if the elements
784 * themselves are pointers, the pointed-to memory is not touched in any
785 * way. Managing the pointer is the user's responsibilty.
788 { _M_destroy_data(begin(), end(), _M_get_Tp_allocator()); }
791 * @brief %Deque assignment operator.
792 * @param x A %deque of identical element and allocator types.
794 * All the elements of @a x are copied, but unlike the copy constructor,
795 * the allocator object is not copied.
798 operator=(const deque
& __x
);
800 #ifdef __GXX_EXPERIMENTAL_CXX0X__
802 * @brief %Deque move assignment operator.
803 * @param x A %deque of identical element and allocator types.
805 * The contents of @a x are moved into this deque (without copying).
806 * @a x is a valid, but unspecified %deque.
809 operator=(deque
&& __x
)
819 * @brief Assigns a given value to a %deque.
820 * @param n Number of elements to be assigned.
821 * @param val Value to be assigned.
823 * This function fills a %deque with @a n copies of the given
824 * value. Note that the assignment completely changes the
825 * %deque and that the resulting %deque's size is the same as
826 * the number of elements assigned. Old data may be lost.
829 assign(size_type __n
, const value_type
& __val
)
830 { _M_fill_assign(__n
, __val
); }
833 * @brief Assigns a range to a %deque.
834 * @param first An input iterator.
835 * @param last An input iterator.
837 * This function fills a %deque with copies of the elements in the
838 * range [first,last).
840 * Note that the assignment completely changes the %deque and that the
841 * resulting %deque's size is the same as the number of elements
842 * assigned. Old data may be lost.
844 template<typename _InputIterator
>
846 assign(_InputIterator __first
, _InputIterator __last
)
848 typedef typename
std::__is_integer
<_InputIterator
>::__type _Integral
;
849 _M_assign_dispatch(__first
, __last
, _Integral());
852 /// Get a copy of the memory allocation object.
854 get_allocator() const
855 { return _Base::get_allocator(); }
859 * Returns a read/write iterator that points to the first element in the
860 * %deque. Iteration is done in ordinary element order.
864 { return this->_M_impl
._M_start
; }
867 * Returns a read-only (constant) iterator that points to the first
868 * element in the %deque. Iteration is done in ordinary element order.
872 { return this->_M_impl
._M_start
; }
875 * Returns a read/write iterator that points one past the last
876 * element in the %deque. Iteration is done in ordinary
881 { return this->_M_impl
._M_finish
; }
884 * Returns a read-only (constant) iterator that points one past
885 * the last element in the %deque. Iteration is done in
886 * ordinary element order.
890 { return this->_M_impl
._M_finish
; }
893 * Returns a read/write reverse iterator that points to the
894 * last element in the %deque. Iteration is done in reverse
899 { return reverse_iterator(this->_M_impl
._M_finish
); }
902 * Returns a read-only (constant) reverse iterator that points
903 * to the last element in the %deque. Iteration is done in
904 * reverse element order.
906 const_reverse_iterator
908 { return const_reverse_iterator(this->_M_impl
._M_finish
); }
911 * Returns a read/write reverse iterator that points to one
912 * before the first element in the %deque. Iteration is done
913 * in reverse element order.
917 { return reverse_iterator(this->_M_impl
._M_start
); }
920 * Returns a read-only (constant) reverse iterator that points
921 * to one before the first element in the %deque. Iteration is
922 * done in reverse element order.
924 const_reverse_iterator
926 { return const_reverse_iterator(this->_M_impl
._M_start
); }
928 #ifdef __GXX_EXPERIMENTAL_CXX0X__
930 * Returns a read-only (constant) iterator that points to the first
931 * element in the %deque. Iteration is done in ordinary element order.
935 { return this->_M_impl
._M_start
; }
938 * Returns a read-only (constant) iterator that points one past
939 * the last element in the %deque. Iteration is done in
940 * ordinary element order.
944 { return this->_M_impl
._M_finish
; }
947 * Returns a read-only (constant) reverse iterator that points
948 * to the last element in the %deque. Iteration is done in
949 * reverse element order.
951 const_reverse_iterator
953 { return const_reverse_iterator(this->_M_impl
._M_finish
); }
956 * Returns a read-only (constant) reverse iterator that points
957 * to one before the first element in the %deque. Iteration is
958 * done in reverse element order.
960 const_reverse_iterator
962 { return const_reverse_iterator(this->_M_impl
._M_start
); }
965 // [23.2.1.2] capacity
966 /** Returns the number of elements in the %deque. */
969 { return this->_M_impl
._M_finish
- this->_M_impl
._M_start
; }
971 /** Returns the size() of the largest possible %deque. */
974 { return _M_get_Tp_allocator().max_size(); }
977 * @brief Resizes the %deque to the specified number of elements.
978 * @param new_size Number of elements the %deque should contain.
979 * @param x Data with which new elements should be populated.
981 * This function will %resize the %deque to the specified
982 * number of elements. If the number is smaller than the
983 * %deque's current size the %deque is truncated, otherwise the
984 * %deque is extended and new elements are populated with given
988 resize(size_type __new_size
, value_type __x
= value_type())
990 const size_type __len
= size();
991 if (__new_size
< __len
)
992 _M_erase_at_end(this->_M_impl
._M_start
+ difference_type(__new_size
));
994 insert(this->_M_impl
._M_finish
, __new_size
- __len
, __x
);
998 * Returns true if the %deque is empty. (Thus begin() would
1003 { return this->_M_impl
._M_finish
== this->_M_impl
._M_start
; }
1007 * @brief Subscript access to the data contained in the %deque.
1008 * @param n The index of the element for which data should be
1010 * @return Read/write reference to data.
1012 * This operator allows for easy, array-style, data access.
1013 * Note that data access with this operator is unchecked and
1014 * out_of_range lookups are not defined. (For checked lookups
1018 operator[](size_type __n
)
1019 { return this->_M_impl
._M_start
[difference_type(__n
)]; }
1022 * @brief Subscript access to the data contained in the %deque.
1023 * @param n The index of the element for which data should be
1025 * @return Read-only (constant) reference to data.
1027 * This operator allows for easy, array-style, data access.
1028 * Note that data access with this operator is unchecked and
1029 * out_of_range lookups are not defined. (For checked lookups
1033 operator[](size_type __n
) const
1034 { return this->_M_impl
._M_start
[difference_type(__n
)]; }
1037 /// @if maint Safety check used only from at(). @endif
1039 _M_range_check(size_type __n
) const
1041 if (__n
>= this->size())
1042 __throw_out_of_range(__N("deque::_M_range_check"));
1047 * @brief Provides access to the data contained in the %deque.
1048 * @param n The index of the element for which data should be
1050 * @return Read/write reference to data.
1051 * @throw std::out_of_range If @a n is an invalid index.
1053 * This function provides for safer data access. The parameter
1054 * is first checked that it is in the range of the deque. The
1055 * function throws out_of_range if the check fails.
1060 _M_range_check(__n
);
1061 return (*this)[__n
];
1065 * @brief Provides access to the data contained in the %deque.
1066 * @param n The index of the element for which data should be
1068 * @return Read-only (constant) reference to data.
1069 * @throw std::out_of_range If @a n is an invalid index.
1071 * This function provides for safer data access. The parameter is first
1072 * checked that it is in the range of the deque. The function throws
1073 * out_of_range if the check fails.
1076 at(size_type __n
) const
1078 _M_range_check(__n
);
1079 return (*this)[__n
];
1083 * Returns a read/write reference to the data at the first
1084 * element of the %deque.
1088 { return *begin(); }
1091 * Returns a read-only (constant) reference to the data at the first
1092 * element of the %deque.
1096 { return *begin(); }
1099 * Returns a read/write reference to the data at the last element of the
1105 iterator __tmp
= end();
1111 * Returns a read-only (constant) reference to the data at the last
1112 * element of the %deque.
1117 const_iterator __tmp
= end();
1122 // [23.2.1.2] modifiers
1124 * @brief Add data to the front of the %deque.
1125 * @param x Data to be added.
1127 * This is a typical stack operation. The function creates an
1128 * element at the front of the %deque and assigns the given
1129 * data to it. Due to the nature of a %deque this operation
1130 * can be done in constant time.
1133 push_front(const value_type
& __x
)
1135 if (this->_M_impl
._M_start
._M_cur
!= this->_M_impl
._M_start
._M_first
)
1137 this->_M_impl
.construct(this->_M_impl
._M_start
._M_cur
- 1, __x
);
1138 --this->_M_impl
._M_start
._M_cur
;
1141 _M_push_front_aux(__x
);
1145 * @brief Add data to the end of the %deque.
1146 * @param x Data to be added.
1148 * This is a typical stack operation. The function creates an
1149 * element at the end of the %deque and assigns the given data
1150 * to it. Due to the nature of a %deque this operation can be
1151 * done in constant time.
1154 push_back(const value_type
& __x
)
1156 if (this->_M_impl
._M_finish
._M_cur
1157 != this->_M_impl
._M_finish
._M_last
- 1)
1159 this->_M_impl
.construct(this->_M_impl
._M_finish
._M_cur
, __x
);
1160 ++this->_M_impl
._M_finish
._M_cur
;
1163 _M_push_back_aux(__x
);
1167 * @brief Removes first element.
1169 * This is a typical stack operation. It shrinks the %deque by one.
1171 * Note that no data is returned, and if the first element's data is
1172 * needed, it should be retrieved before pop_front() is called.
1177 if (this->_M_impl
._M_start
._M_cur
1178 != this->_M_impl
._M_start
._M_last
- 1)
1180 this->_M_impl
.destroy(this->_M_impl
._M_start
._M_cur
);
1181 ++this->_M_impl
._M_start
._M_cur
;
1188 * @brief Removes last element.
1190 * This is a typical stack operation. It shrinks the %deque by one.
1192 * Note that no data is returned, and if the last element's data is
1193 * needed, it should be retrieved before pop_back() is called.
1198 if (this->_M_impl
._M_finish
._M_cur
1199 != this->_M_impl
._M_finish
._M_first
)
1201 --this->_M_impl
._M_finish
._M_cur
;
1202 this->_M_impl
.destroy(this->_M_impl
._M_finish
._M_cur
);
1209 * @brief Inserts given value into %deque before specified iterator.
1210 * @param position An iterator into the %deque.
1211 * @param x Data to be inserted.
1212 * @return An iterator that points to the inserted data.
1214 * This function will insert a copy of the given value before the
1215 * specified location.
1218 insert(iterator __position
, const value_type
& __x
);
1221 * @brief Inserts a number of copies of given data into the %deque.
1222 * @param position An iterator into the %deque.
1223 * @param n Number of elements to be inserted.
1224 * @param x Data to be inserted.
1226 * This function will insert a specified number of copies of the given
1227 * data before the location specified by @a position.
1230 insert(iterator __position
, size_type __n
, const value_type
& __x
)
1231 { _M_fill_insert(__position
, __n
, __x
); }
1234 * @brief Inserts a range into the %deque.
1235 * @param position An iterator into the %deque.
1236 * @param first An input iterator.
1237 * @param last An input iterator.
1239 * This function will insert copies of the data in the range
1240 * [first,last) into the %deque before the location specified
1241 * by @a pos. This is known as "range insert."
1243 template<typename _InputIterator
>
1245 insert(iterator __position
, _InputIterator __first
,
1246 _InputIterator __last
)
1248 // Check whether it's an integral type. If so, it's not an iterator.
1249 typedef typename
std::__is_integer
<_InputIterator
>::__type _Integral
;
1250 _M_insert_dispatch(__position
, __first
, __last
, _Integral());
1254 * @brief Remove element at given position.
1255 * @param position Iterator pointing to element to be erased.
1256 * @return An iterator pointing to the next element (or end()).
1258 * This function will erase the element at the given position and thus
1259 * shorten the %deque by one.
1261 * The user is cautioned that
1262 * this function only erases the element, and that if the element is
1263 * itself a pointer, the pointed-to memory is not touched in any way.
1264 * Managing the pointer is the user's responsibilty.
1267 erase(iterator __position
);
1270 * @brief Remove a range of elements.
1271 * @param first Iterator pointing to the first element to be erased.
1272 * @param last Iterator pointing to one past the last element to be
1274 * @return An iterator pointing to the element pointed to by @a last
1275 * prior to erasing (or end()).
1277 * This function will erase the elements in the range [first,last) and
1278 * shorten the %deque accordingly.
1280 * The user is cautioned that
1281 * this function only erases the elements, and that if the elements
1282 * themselves are pointers, the pointed-to memory is not touched in any
1283 * way. Managing the pointer is the user's responsibilty.
1286 erase(iterator __first
, iterator __last
);
1289 * @brief Swaps data with another %deque.
1290 * @param x A %deque of the same element and allocator types.
1292 * This exchanges the elements between two deques in constant time.
1293 * (Four pointers, so it should be quite fast.)
1294 * Note that the global std::swap() function is specialized such that
1295 * std::swap(d1,d2) will feed to this function.
1298 #ifdef __GXX_EXPERIMENTAL_CXX0X__
1304 std::swap(this->_M_impl
._M_start
, __x
._M_impl
._M_start
);
1305 std::swap(this->_M_impl
._M_finish
, __x
._M_impl
._M_finish
);
1306 std::swap(this->_M_impl
._M_map
, __x
._M_impl
._M_map
);
1307 std::swap(this->_M_impl
._M_map_size
, __x
._M_impl
._M_map_size
);
1309 // _GLIBCXX_RESOLVE_LIB_DEFECTS
1310 // 431. Swapping containers with unequal allocators.
1311 std::__alloc_swap
<_Tp_alloc_type
>::_S_do_it(_M_get_Tp_allocator(),
1312 __x
._M_get_Tp_allocator());
1316 * Erases all the elements. Note that this function only erases the
1317 * elements, and that if the elements themselves are pointers, the
1318 * pointed-to memory is not touched in any way. Managing the pointer is
1319 * the user's responsibilty.
1323 { _M_erase_at_end(begin()); }
1326 // Internal constructor functions follow.
1328 // called by the range constructor to implement [23.1.1]/9
1330 // _GLIBCXX_RESOLVE_LIB_DEFECTS
1331 // 438. Ambiguity in the "do the right thing" clause
1332 template<typename _Integer
>
1334 _M_initialize_dispatch(_Integer __n
, _Integer __x
, __true_type
)
1336 _M_initialize_map(static_cast<size_type
>(__n
));
1337 _M_fill_initialize(__x
);
1340 // called by the range constructor to implement [23.1.1]/9
1341 template<typename _InputIterator
>
1343 _M_initialize_dispatch(_InputIterator __first
, _InputIterator __last
,
1346 typedef typename
std::iterator_traits
<_InputIterator
>::
1347 iterator_category _IterCategory
;
1348 _M_range_initialize(__first
, __last
, _IterCategory());
1351 // called by the second initialize_dispatch above
1355 * @brief Fills the deque with whatever is in [first,last).
1356 * @param first An input iterator.
1357 * @param last An input iterator.
1360 * If the iterators are actually forward iterators (or better), then the
1361 * memory layout can be done all at once. Else we move forward using
1362 * push_back on each value from the iterator.
1365 template<typename _InputIterator
>
1367 _M_range_initialize(_InputIterator __first
, _InputIterator __last
,
1368 std::input_iterator_tag
);
1370 // called by the second initialize_dispatch above
1371 template<typename _ForwardIterator
>
1373 _M_range_initialize(_ForwardIterator __first
, _ForwardIterator __last
,
1374 std::forward_iterator_tag
);
1379 * @brief Fills the %deque with copies of value.
1380 * @param value Initial value.
1382 * @pre _M_start and _M_finish have already been initialized,
1383 * but none of the %deque's elements have yet been constructed.
1385 * This function is called only when the user provides an explicit size
1386 * (with or without an explicit exemplar value).
1390 _M_fill_initialize(const value_type
& __value
);
1392 // Internal assign functions follow. The *_aux functions do the actual
1393 // assignment work for the range versions.
1395 // called by the range assign to implement [23.1.1]/9
1397 // _GLIBCXX_RESOLVE_LIB_DEFECTS
1398 // 438. Ambiguity in the "do the right thing" clause
1399 template<typename _Integer
>
1401 _M_assign_dispatch(_Integer __n
, _Integer __val
, __true_type
)
1402 { _M_fill_assign(__n
, __val
); }
1404 // called by the range assign to implement [23.1.1]/9
1405 template<typename _InputIterator
>
1407 _M_assign_dispatch(_InputIterator __first
, _InputIterator __last
,
1410 typedef typename
std::iterator_traits
<_InputIterator
>::
1411 iterator_category _IterCategory
;
1412 _M_assign_aux(__first
, __last
, _IterCategory());
1415 // called by the second assign_dispatch above
1416 template<typename _InputIterator
>
1418 _M_assign_aux(_InputIterator __first
, _InputIterator __last
,
1419 std::input_iterator_tag
);
1421 // called by the second assign_dispatch above
1422 template<typename _ForwardIterator
>
1424 _M_assign_aux(_ForwardIterator __first
, _ForwardIterator __last
,
1425 std::forward_iterator_tag
)
1427 const size_type __len
= std::distance(__first
, __last
);
1430 _ForwardIterator __mid
= __first
;
1431 std::advance(__mid
, size());
1432 std::copy(__first
, __mid
, begin());
1433 insert(end(), __mid
, __last
);
1436 _M_erase_at_end(std::copy(__first
, __last
, begin()));
1439 // Called by assign(n,t), and the range assign when it turns out
1440 // to be the same thing.
1442 _M_fill_assign(size_type __n
, const value_type
& __val
)
1446 std::fill(begin(), end(), __val
);
1447 insert(end(), __n
- size(), __val
);
1451 _M_erase_at_end(begin() + difference_type(__n
));
1452 std::fill(begin(), end(), __val
);
1459 * @brief Helper functions for push_* and pop_*.
1462 void _M_push_back_aux(const value_type
&);
1464 void _M_push_front_aux(const value_type
&);
1466 void _M_pop_back_aux();
1468 void _M_pop_front_aux();
1471 // Internal insert functions follow. The *_aux functions do the actual
1472 // insertion work when all shortcuts fail.
1474 // called by the range insert to implement [23.1.1]/9
1476 // _GLIBCXX_RESOLVE_LIB_DEFECTS
1477 // 438. Ambiguity in the "do the right thing" clause
1478 template<typename _Integer
>
1480 _M_insert_dispatch(iterator __pos
,
1481 _Integer __n
, _Integer __x
, __true_type
)
1482 { _M_fill_insert(__pos
, __n
, __x
); }
1484 // called by the range insert to implement [23.1.1]/9
1485 template<typename _InputIterator
>
1487 _M_insert_dispatch(iterator __pos
,
1488 _InputIterator __first
, _InputIterator __last
,
1491 typedef typename
std::iterator_traits
<_InputIterator
>::
1492 iterator_category _IterCategory
;
1493 _M_range_insert_aux(__pos
, __first
, __last
, _IterCategory());
1496 // called by the second insert_dispatch above
1497 template<typename _InputIterator
>
1499 _M_range_insert_aux(iterator __pos
, _InputIterator __first
,
1500 _InputIterator __last
, std::input_iterator_tag
);
1502 // called by the second insert_dispatch above
1503 template<typename _ForwardIterator
>
1505 _M_range_insert_aux(iterator __pos
, _ForwardIterator __first
,
1506 _ForwardIterator __last
, std::forward_iterator_tag
);
1508 // Called by insert(p,n,x), and the range insert when it turns out to be
1509 // the same thing. Can use fill functions in optimal situations,
1510 // otherwise passes off to insert_aux(p,n,x).
1512 _M_fill_insert(iterator __pos
, size_type __n
, const value_type
& __x
);
1514 // called by insert(p,x)
1516 _M_insert_aux(iterator __pos
, const value_type
& __x
);
1518 // called by insert(p,n,x) via fill_insert
1520 _M_insert_aux(iterator __pos
, size_type __n
, const value_type
& __x
);
1522 // called by range_insert_aux for forward iterators
1523 template<typename _ForwardIterator
>
1525 _M_insert_aux(iterator __pos
,
1526 _ForwardIterator __first
, _ForwardIterator __last
,
1530 // Internal erase functions follow.
1533 _M_destroy_data_aux(iterator __first
, iterator __last
);
1535 // Called by ~deque().
1536 // NB: Doesn't deallocate the nodes.
1537 template<typename _Alloc1
>
1539 _M_destroy_data(iterator __first
, iterator __last
, const _Alloc1
&)
1540 { _M_destroy_data_aux(__first
, __last
); }
1543 _M_destroy_data(iterator __first
, iterator __last
,
1544 const std::allocator
<_Tp
>&)
1546 if (!__has_trivial_destructor(value_type
))
1547 _M_destroy_data_aux(__first
, __last
);
1550 // Called by erase(q1, q2).
1552 _M_erase_at_begin(iterator __pos
)
1554 _M_destroy_data(begin(), __pos
, _M_get_Tp_allocator());
1555 _M_destroy_nodes(this->_M_impl
._M_start
._M_node
, __pos
._M_node
);
1556 this->_M_impl
._M_start
= __pos
;
1559 // Called by erase(q1, q2), resize(), clear(), _M_assign_aux,
1560 // _M_fill_assign, operator=.
1562 _M_erase_at_end(iterator __pos
)
1564 _M_destroy_data(__pos
, end(), _M_get_Tp_allocator());
1565 _M_destroy_nodes(__pos
._M_node
+ 1,
1566 this->_M_impl
._M_finish
._M_node
+ 1);
1567 this->_M_impl
._M_finish
= __pos
;
1573 * @brief Memory-handling helpers for the previous internal insert
1578 _M_reserve_elements_at_front(size_type __n
)
1580 const size_type __vacancies
= this->_M_impl
._M_start
._M_cur
1581 - this->_M_impl
._M_start
._M_first
;
1582 if (__n
> __vacancies
)
1583 _M_new_elements_at_front(__n
- __vacancies
);
1584 return this->_M_impl
._M_start
- difference_type(__n
);
1588 _M_reserve_elements_at_back(size_type __n
)
1590 const size_type __vacancies
= (this->_M_impl
._M_finish
._M_last
1591 - this->_M_impl
._M_finish
._M_cur
) - 1;
1592 if (__n
> __vacancies
)
1593 _M_new_elements_at_back(__n
- __vacancies
);
1594 return this->_M_impl
._M_finish
+ difference_type(__n
);
1598 _M_new_elements_at_front(size_type __new_elements
);
1601 _M_new_elements_at_back(size_type __new_elements
);
1608 * @brief Memory-handling helpers for the major %map.
1610 * Makes sure the _M_map has space for new nodes. Does not
1611 * actually add the nodes. Can invalidate _M_map pointers.
1612 * (And consequently, %deque iterators.)
1616 _M_reserve_map_at_back(size_type __nodes_to_add
= 1)
1618 if (__nodes_to_add
+ 1 > this->_M_impl
._M_map_size
1619 - (this->_M_impl
._M_finish
._M_node
- this->_M_impl
._M_map
))
1620 _M_reallocate_map(__nodes_to_add
, false);
1624 _M_reserve_map_at_front(size_type __nodes_to_add
= 1)
1626 if (__nodes_to_add
> size_type(this->_M_impl
._M_start
._M_node
1627 - this->_M_impl
._M_map
))
1628 _M_reallocate_map(__nodes_to_add
, true);
1632 _M_reallocate_map(size_type __nodes_to_add
, bool __add_at_front
);
1638 * @brief Deque equality comparison.
1639 * @param x A %deque.
1640 * @param y A %deque of the same type as @a x.
1641 * @return True iff the size and elements of the deques are equal.
1643 * This is an equivalence relation. It is linear in the size of the
1644 * deques. Deques are considered equivalent if their sizes are equal,
1645 * and if corresponding elements compare equal.
1647 template<typename _Tp
, typename _Alloc
>
1649 operator==(const deque
<_Tp
, _Alloc
>& __x
,
1650 const deque
<_Tp
, _Alloc
>& __y
)
1651 { return __x
.size() == __y
.size()
1652 && std::equal(__x
.begin(), __x
.end(), __y
.begin()); }
1655 * @brief Deque ordering relation.
1656 * @param x A %deque.
1657 * @param y A %deque of the same type as @a x.
1658 * @return True iff @a x is lexicographically less than @a y.
1660 * This is a total ordering relation. It is linear in the size of the
1661 * deques. The elements must be comparable with @c <.
1663 * See std::lexicographical_compare() for how the determination is made.
1665 template<typename _Tp
, typename _Alloc
>
1667 operator<(const deque
<_Tp
, _Alloc
>& __x
,
1668 const deque
<_Tp
, _Alloc
>& __y
)
1669 { return std::lexicographical_compare(__x
.begin(), __x
.end(),
1670 __y
.begin(), __y
.end()); }
1672 /// Based on operator==
1673 template<typename _Tp
, typename _Alloc
>
1675 operator!=(const deque
<_Tp
, _Alloc
>& __x
,
1676 const deque
<_Tp
, _Alloc
>& __y
)
1677 { return !(__x
== __y
); }
1679 /// Based on operator<
1680 template<typename _Tp
, typename _Alloc
>
1682 operator>(const deque
<_Tp
, _Alloc
>& __x
,
1683 const deque
<_Tp
, _Alloc
>& __y
)
1684 { return __y
< __x
; }
1686 /// Based on operator<
1687 template<typename _Tp
, typename _Alloc
>
1689 operator<=(const deque
<_Tp
, _Alloc
>& __x
,
1690 const deque
<_Tp
, _Alloc
>& __y
)
1691 { return !(__y
< __x
); }
1693 /// Based on operator<
1694 template<typename _Tp
, typename _Alloc
>
1696 operator>=(const deque
<_Tp
, _Alloc
>& __x
,
1697 const deque
<_Tp
, _Alloc
>& __y
)
1698 { return !(__x
< __y
); }
1700 /// See std::deque::swap().
1701 template<typename _Tp
, typename _Alloc
>
1703 swap(deque
<_Tp
,_Alloc
>& __x
, deque
<_Tp
,_Alloc
>& __y
)
1706 #ifdef __GXX_EXPERIMENTAL_CXX0X__
1707 template<typename _Tp
, typename _Alloc
>
1709 swap(deque
<_Tp
,_Alloc
>&& __x
, deque
<_Tp
,_Alloc
>& __y
)
1712 template<typename _Tp
, typename _Alloc
>
1714 swap(deque
<_Tp
,_Alloc
>& __x
, deque
<_Tp
,_Alloc
>&& __y
)
1718 _GLIBCXX_END_NESTED_NAMESPACE
1720 #endif /* _STL_DEQUE_H */