Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | File Members | Related Pages | Search for 

_GLIBCXX_STD::deque< _Tp, _Alloc > Class Template Reference

A standard container using fixed-size memory allocation and constant-time manipulation of elements at either end. More...

#include <stl_deque.h>

Inheritance diagram for _GLIBCXX_STD::deque< _Tp, _Alloc >:

_GLIBCXX_STD::_Deque_base< _Tp, _Alloc > List of all members.

Public Types

typedef _Tp value_type
typedef _Alloc::pointer pointer
typedef _Alloc::const_pointer const_pointer
typedef _Alloc::reference reference
typedef _Alloc::const_reference const_reference
typedef _Base::iterator iterator
typedef _Base::const_iterator const_iterator
typedef std::reverse_iterator<
const_iterator > 		const_reverse_iterator
typedef std::reverse_iterator<
iterator > 		reverse_iterator
typedef size_t size_type
typedef ptrdiff_t difference_type
typedef _Base::allocator_type allocator_type

Public Member Functions

 deque (const allocator_type &__a=allocator_type())
 Default constructor creates no elements.

 deque (size_type __n, const value_type &__value, const allocator_type &__a=allocator_type())
 Create a deque with copies of an exemplar element.

 deque (size_type __n)
 Create a deque with default elements.

 deque (const deque &__x)
 Deque copy constructor.

template<typename _InputIterator>  deque (_InputIterator __first, _InputIterator __last, const allocator_type &__a=allocator_type())
 Builds a deque from a range.

 ~deque ()
deque & operator= (const deque &__x)
 Deque assignment operator.

void assign (size_type __n, const value_type &__val)
 Assigns a given value to a deque.

template<typename _InputIterator> void assign (_InputIterator __first, _InputIterator __last)
 Assigns a range to a deque.

allocator_type get_allocator () const
 Get a copy of the memory allocation object.

iterator begin ()
const_iterator begin () const
iterator end ()
const_iterator end () const
reverse_iterator rbegin ()
const_reverse_iterator rbegin () const
reverse_iterator rend ()
const_reverse_iterator rend () const
size_type size () const
size_type max_size () const
void resize (size_type __new_size, const value_type &__x)
 Resizes the deque to the specified number of elements.

void resize (size_type new_size)
 Resizes the deque to the specified number of elements.

bool empty () const
reference operator[] (size_type __n)
 Subscript access to the data contained in the deque.

const_reference operator[] (size_type __n) const
 Subscript access to the data contained in the deque.

reference at (size_type __n)
 Provides access to the data contained in the deque.

const_reference at (size_type __n) const
 Provides access to the data contained in the deque.

reference front ()
const_reference front () const
reference back ()
const_reference back () const
void push_front (const value_type &__x)
 Add data to the front of the deque.

void push_back (const value_type &__x)
 Add data to the end of the deque.

void pop_front ()
 Removes first element.

void pop_back ()
 Removes last element.

iterator insert (iterator position, const value_type &__x)
 Inserts given value into deque before specified iterator.

void insert (iterator __position, size_type __n, const value_type &__x)
 Inserts a number of copies of given data into the deque.

template<typename _InputIterator> void insert (iterator __position, _InputIterator __first, _InputIterator __last)
 Inserts a range into the deque.

iterator erase (iterator __position)
 Remove element at given position.

iterator erase (iterator __first, iterator __last)
 Remove a range of elements.

void swap (deque &__x)
 Swaps data with another deque.

void clear ()

Protected Types

typedef pointer * _Map_pointer

Protected Member Functions

void _M_range_check (size_type __n) const
template<typename _Integer> void _M_initialize_dispatch (_Integer __n, _Integer __x, __true_type)
template<typename _InputIterator> void _M_initialize_dispatch (_InputIterator __first, _InputIterator __last, __false_type)
void _M_fill_initialize (const value_type &__value)
template<typename _Integer> void _M_assign_dispatch (_Integer __n, _Integer __val, __true_type)
template<typename _InputIterator> void _M_assign_dispatch (_InputIterator __first, _InputIterator __last, __false_type)
template<typename _InputIterator> void _M_assign_aux (_InputIterator __first, _InputIterator __last, input_iterator_tag)
template<typename _ForwardIterator> void _M_assign_aux (_ForwardIterator __first, _ForwardIterator __last, forward_iterator_tag)
void _M_fill_assign (size_type __n, const value_type &__val)
template<typename _Integer> void _M_insert_dispatch (iterator __pos, _Integer __n, _Integer __x, __true_type)
template<typename _InputIterator> void _M_insert_dispatch (iterator __pos, _InputIterator __first, _InputIterator __last, __false_type)
template<typename _InputIterator> void _M_range_insert_aux (iterator __pos, _InputIterator __first, _InputIterator __last, input_iterator_tag)
template<typename _ForwardIterator> void _M_range_insert_aux (iterator __pos, _ForwardIterator __first, _ForwardIterator __last, forward_iterator_tag)
void _M_fill_insert (iterator __pos, size_type __n, const value_type &__x)
iterator _M_insert_aux (iterator __pos, const value_type &__x)
void _M_insert_aux (iterator __pos, size_type __n, const value_type &__x)
template<typename _ForwardIterator> void _M_insert_aux (iterator __pos, _ForwardIterator __first, _ForwardIterator __last, size_type __n)
template<typename _InputIterator> void _M_range_initialize (_InputIterator __first, _InputIterator __last, input_iterator_tag)
template<typename _ForwardIterator> void _M_range_initialize (_ForwardIterator __first, _ForwardIterator __last, forward_iterator_tag)
void _M_push_back_aux (const value_type &)
void _M_push_front_aux (const value_type &)
void _M_pop_back_aux ()
void _M_pop_front_aux ()
iterator _M_reserve_elements_at_front (size_type __n)
iterator _M_reserve_elements_at_back (size_type __n)
void _M_new_elements_at_front (size_type __new_elements)
void _M_new_elements_at_back (size_type __new_elements)
void _M_reserve_map_at_back (size_type __nodes_to_add=1)
void _M_reserve_map_at_front (size_type __nodes_to_add=1)
void _M_reallocate_map (size_type __nodes_to_add, bool __add_at_front)

Static Protected Member Functions

size_t _S_buffer_size ()

Private Member Functions

 __glibcxx_class_requires (_Tp, _SGIAssignableConcept) typedef _Deque_base< _Tp

Private Attributes

_Alloc _Base

Detailed Description

template<typename _Tp, typename _Alloc = allocator<_Tp>>
class _GLIBCXX_STD::deque< _Tp, _Alloc >

A standard container using fixed-size memory allocation and constant-time manipulation of elements at either end.

Meets the requirements of a container, a reversible container, and a sequence, including the optional sequence requirements.

In previous HP/SGI versions of deque, there was an extra template parameter so users could control the node size. This extension turned out to violate the C++ standard (it can be detected using template template parameters), and it was removed.

Definition at line 581 of file stl_deque.h.

Member Typedef Documentation

template<typename _Tp, typename _Alloc = allocator<_Tp>>
typedef pointer* _GLIBCXX_STD::deque< _Tp, _Alloc >::_Map_pointer [protected]
 

Definition at line 603 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
typedef _Base::allocator_type _GLIBCXX_STD::deque< _Tp, _Alloc >::allocator_type
 

Reimplemented from _GLIBCXX_STD::_Deque_base< _Tp, _Alloc >.

Reimplemented in __gnu_debug_def::deque< _Tp, _Allocator >.

Definition at line 600 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
typedef _Base::const_iterator _GLIBCXX_STD::deque< _Tp, _Alloc >::const_iterator
 

Reimplemented from _GLIBCXX_STD::_Deque_base< _Tp, _Alloc >.

Reimplemented in __gnu_debug_def::deque< _Tp, _Allocator >.

Definition at line 595 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
typedef _Alloc::const_pointer _GLIBCXX_STD::deque< _Tp, _Alloc >::const_pointer
 

Reimplemented in __gnu_debug_def::deque< _Tp, _Allocator >.

Definition at line 591 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
typedef _Alloc::const_reference _GLIBCXX_STD::deque< _Tp, _Alloc >::const_reference
 

Reimplemented in __gnu_debug_def::deque< _Tp, _Allocator >.

Definition at line 593 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
typedef std::reverse_iterator<const_iterator> _GLIBCXX_STD::deque< _Tp, _Alloc >::const_reverse_iterator
 

Reimplemented in __gnu_debug_def::deque< _Tp, _Allocator >.

Definition at line 596 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
typedef ptrdiff_t _GLIBCXX_STD::deque< _Tp, _Alloc >::difference_type
 

Reimplemented in __gnu_debug_def::deque< _Tp, _Allocator >.

Definition at line 599 of file stl_deque.h.

Referenced by _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_insert_aux(), and _GLIBCXX_STD::deque< _Tp, _Alloc >::operator=().

template<typename _Tp, typename _Alloc = allocator<_Tp>>
typedef _Base::iterator _GLIBCXX_STD::deque< _Tp, _Alloc >::iterator
 

Reimplemented from _GLIBCXX_STD::_Deque_base< _Tp, _Alloc >.

Reimplemented in __gnu_debug_def::deque< _Tp, _Allocator >.

Definition at line 594 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
typedef _Alloc::pointer _GLIBCXX_STD::deque< _Tp, _Alloc >::pointer
 

Reimplemented in __gnu_debug_def::deque< _Tp, _Allocator >.

Definition at line 590 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
typedef _Alloc::reference _GLIBCXX_STD::deque< _Tp, _Alloc >::reference
 

Reimplemented in __gnu_debug_def::deque< _Tp, _Allocator >.

Definition at line 592 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
typedef std::reverse_iterator<iterator> _GLIBCXX_STD::deque< _Tp, _Alloc >::reverse_iterator
 

Reimplemented in __gnu_debug_def::deque< _Tp, _Allocator >.

Definition at line 597 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
typedef size_t _GLIBCXX_STD::deque< _Tp, _Alloc >::size_type
 

Reimplemented in __gnu_debug_def::deque< _Tp, _Allocator >.

Definition at line 598 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
typedef _Tp _GLIBCXX_STD::deque< _Tp, _Alloc >::value_type
 

Reimplemented in __gnu_debug_def::deque< _Tp, _Allocator >.

Definition at line 589 of file stl_deque.h.

Constructor & Destructor Documentation

template<typename _Tp, typename _Alloc = allocator<_Tp>>
_GLIBCXX_STD::deque< _Tp, _Alloc >::deque (  const allocator_type &  __a = allocator_type()  )  [inline, explicit]
 

Default constructor creates no elements.

Definition at line 631 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
_GLIBCXX_STD::deque< _Tp, _Alloc >::deque (  size_type  __n,
const value_type &  __value,
const allocator_type &  __a = allocator_type()
)  [inline]
 

Create a deque with copies of an exemplar element.

Parameters:
n The number of elements to initially create.
value An element to copy.
This constructor fills the deque with n copies of value.

Definition at line 641 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
_GLIBCXX_STD::deque< _Tp, _Alloc >::deque (  size_type  __n  )  [inline, explicit]
 

Create a deque with default elements.

Parameters:
n The number of elements to initially create.
This constructor fills the deque with n copies of a default-constructed element.

Definition at line 654 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
_GLIBCXX_STD::deque< _Tp, _Alloc >::deque (  const deque< _Tp, _Alloc > &  __x  )  [inline]
 

Deque copy constructor.

Parameters:
x A deque of identical element and allocator types.
The newly-created deque uses a copy of the allocation object used by x.

Definition at line 665 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
template<typename _InputIterator>
_GLIBCXX_STD::deque< _Tp, _Alloc >::deque (  _InputIterator  __first,
_InputIterator  __last,
const allocator_type &  __a = allocator_type()
)  [inline]
 

Builds a deque from a range.

Parameters:
first An input iterator.
last An input iterator.
Create a deque consisting of copies of the elements from [first, last).

If the iterators are forward, bidirectional, or random-access, then this will call the elements' copy constructor N times (where N is distance(first,last)) and do no memory reallocation. But if only input iterators are used, then this will do at most 2N calls to the copy constructor, and logN memory reallocations.

Definition at line 684 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
_GLIBCXX_STD::deque< _Tp, _Alloc >::~deque (   )  [inline]
 

The dtor only erases the elements, and note that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibilty.

Reimplemented in __gnu_debug_def::deque< _Tp, _Allocator >.

Definition at line 698 of file stl_deque.h.

Member Function Documentation

template<typename _Tp, typename _Alloc = allocator<_Tp>>
_GLIBCXX_STD::deque< _Tp, _Alloc >::__glibcxx_class_requires (  _Tp  ,
_SGIAssignableConcept 
)  [private]
 

template<typename _Tp, typename _Alloc = allocator<_Tp>>
template<typename _ForwardIterator>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_assign_aux (  _ForwardIterator  __first,
_ForwardIterator  __last,
forward_iterator_tag 
)  [inline, protected]
 

Definition at line 1259 of file stl_deque.h.

template<typename _Tp, class _Alloc>
template<typename _InputIterator>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_assign_aux (  _InputIterator  __first,
_InputIterator  __last,
input_iterator_tag 
)  [protected]
 

Definition at line 193 of file deque.tcc.

References _GLIBCXX_STD::deque< _Tp, _Alloc >::begin(), _GLIBCXX_STD::deque< _Tp, _Alloc >::end(), _GLIBCXX_STD::deque< _Tp, _Alloc >::erase(), and _GLIBCXX_STD::deque< _Tp, _Alloc >::insert().

Referenced by _GLIBCXX_STD::deque< _Tp, _Allocator >::_M_assign_dispatch().

template<typename _Tp, typename _Alloc = allocator<_Tp>>
template<typename _InputIterator>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_assign_dispatch (  _InputIterator  __first,
_InputIterator  __last,
__false_type 
)  [inline, protected]
 

Definition at line 1242 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
template<typename _Integer>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_assign_dispatch (  _Integer  __n,
_Integer  __val,
__true_type 
)  [inline, protected]
 

Definition at line 1233 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_fill_assign (  size_type  __n,
const value_type &  __val
)  [inline, protected]
 

Definition at line 1277 of file stl_deque.h.

Referenced by _GLIBCXX_STD::deque< _Tp, _Allocator >::_M_assign_dispatch().

template<typename _Tp, typename _Alloc>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_fill_initialize (  const value_type &  __value  )  [protected]
 

Definition at line 246 of file deque.tcc.

References __throw_exception_again, std::_Destroy(), _GLIBCXX_STD::deque< _Tp, _Alloc >::_S_buffer_size(), and std::uninitialized_fill().

Referenced by _GLIBCXX_STD::deque< _Tp, _Allocator >::_M_initialize_dispatch().

template<typename _Tp, typename _Alloc>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_fill_insert (  iterator  __pos,
size_type  __n,
const value_type &  __x
)  [protected]
 

Definition at line 208 of file deque.tcc.

References __throw_exception_again, _GLIBCXX_STD::_Deque_base< _Tp, _Alloc >::_M_destroy_nodes(), _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_insert_aux(), _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_reserve_elements_at_back(), _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_reserve_elements_at_front(), and std::uninitialized_fill().

Referenced by _GLIBCXX_STD::deque< _Tp, _Allocator >::_M_insert_dispatch().

template<typename _Tp, typename _Alloc = allocator<_Tp>>
template<typename _InputIterator>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_initialize_dispatch (  _InputIterator  __first,
_InputIterator  __last,
__false_type 
)  [inline, protected]
 

Definition at line 1178 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
template<typename _Integer>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_initialize_dispatch (  _Integer  __n,
_Integer  __x,
__true_type 
)  [inline, protected]
 

Definition at line 1169 of file stl_deque.h.

template<typename _Tp, typename _Alloc>
template<typename _ForwardIterator>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_insert_aux (  iterator  __pos,
_ForwardIterator  __first,
_ForwardIterator  __last,
size_type  __n
)  [protected]
 

Definition at line 551 of file deque.tcc.

References __throw_exception_again, std::__uninitialized_copy_copy(), _GLIBCXX_STD::_Deque_base< _Tp, _Alloc >::_M_destroy_nodes(), _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_reserve_elements_at_back(), _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_reserve_elements_at_front(), std::advance(), std::copy(), std::copy_backward(), _GLIBCXX_STD::deque< _Tp, _Alloc >::difference_type, _GLIBCXX_STD::deque< _Tp, _Alloc >::size(), and std::uninitialized_copy().

template<typename _Tp, typename _Alloc>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_insert_aux (  iterator  __pos,
size_type  __n,
const value_type &  __x
)  [protected]
 

Definition at line 474 of file deque.tcc.

References __throw_exception_again, std::__uninitialized_copy_fill(), std::__uninitialized_fill_copy(), _GLIBCXX_STD::_Deque_base< _Tp, _Alloc >::_M_destroy_nodes(), _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_reserve_elements_at_back(), _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_reserve_elements_at_front(), std::copy(), std::copy_backward(), _GLIBCXX_STD::deque< _Tp, _Alloc >::difference_type, std::fill(), _GLIBCXX_STD::deque< _Tp, _Alloc >::size(), and std::uninitialized_copy().

template<typename _Tp, typename _Alloc>
deque< _Tp, _Alloc >::iterator _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_insert_aux (  iterator  __pos,
const value_type &  __x
)  [protected]
 

Definition at line 441 of file deque.tcc.

References _GLIBCXX_STD::deque< _Tp, _Alloc >::back(), std::copy(), std::copy_backward(), _GLIBCXX_STD::deque< _Tp, _Alloc >::front(), _GLIBCXX_STD::deque< _Tp, _Alloc >::push_back(), _GLIBCXX_STD::deque< _Tp, _Alloc >::push_front(), and _GLIBCXX_STD::deque< _Tp, _Alloc >::size().

Referenced by _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_fill_insert(), _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_range_insert_aux(), and _GLIBCXX_STD::deque< _Tp, _Alloc >::insert().

template<typename _Tp, typename _Alloc = allocator<_Tp>>
template<typename _InputIterator>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_insert_dispatch (  iterator  __pos,
_InputIterator  __first,
_InputIterator  __last,
__false_type 
)  [inline, protected]
 

Definition at line 1319 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
template<typename _Integer>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_insert_dispatch (  iterator  __pos,
_Integer  __n,
_Integer  __x,
__true_type 
)  [inline, protected]
 

Definition at line 1309 of file stl_deque.h.

template<typename _Tp, typename _Alloc>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_new_elements_at_back (  size_type  __new_elements  )  [protected]
 

Definition at line 653 of file deque.tcc.

References __throw_exception_again, _GLIBCXX_STD::_Deque_base< _Tp, _Alloc >::_M_allocate_node(), _GLIBCXX_STD::_Deque_base< _Tp, _Alloc >::_M_deallocate_node(), _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_reserve_map_at_back(), and _GLIBCXX_STD::deque< _Tp, _Alloc >::_S_buffer_size().

template<typename _Tp, typename _Alloc>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_new_elements_at_front (  size_type  __new_elements  )  [protected]
 

Definition at line 631 of file deque.tcc.

References __throw_exception_again, _GLIBCXX_STD::_Deque_base< _Tp, _Alloc >::_M_allocate_node(), _GLIBCXX_STD::_Deque_base< _Tp, _Alloc >::_M_deallocate_node(), _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_reserve_map_at_front(), and _GLIBCXX_STD::deque< _Tp, _Alloc >::_S_buffer_size().

template<typename _Tp, typename _Alloc>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_pop_back_aux (   )  [protected]
 

Definition at line 365 of file deque.tcc.

References std::_Destroy(), and _GLIBCXX_STD::_Deque_base< _Tp, _Alloc >::_M_deallocate_node().

template<typename _Tp, typename _Alloc>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_pop_front_aux (   )  [protected]
 

Definition at line 379 of file deque.tcc.

References std::_Destroy(), and _GLIBCXX_STD::_Deque_base< _Tp, _Alloc >::_M_deallocate_node().

template<typename _Tp, typename _Alloc>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_push_back_aux (  const value_type &   )  [protected]
 

Definition at line 321 of file deque.tcc.

References __throw_exception_again, std::_Construct(), _GLIBCXX_STD::_Deque_base< _Tp, _Alloc >::_M_allocate_node(), _GLIBCXX_STD::_Deque_base< _Tp, _Alloc >::_M_deallocate_node(), and _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_reserve_map_at_back().

template<typename _Tp, typename _Alloc>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_push_front_aux (  const value_type &   )  [protected]
 

Definition at line 343 of file deque.tcc.

References __throw_exception_again, std::_Construct(), _GLIBCXX_STD::_Deque_base< _Tp, _Alloc >::_M_allocate_node(), _GLIBCXX_STD::_Deque_base< _Tp, _Alloc >::_M_deallocate_node(), and _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_reserve_map_at_front().

template<typename _Tp, typename _Alloc = allocator<_Tp>>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_range_check (  size_type  __n  )  const [inline, protected]
 

Definition at line 898 of file stl_deque.h.

template<typename _Tp, typename _Alloc>
template<typename _ForwardIterator>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_range_initialize (  _ForwardIterator  __first,
_ForwardIterator  __last,
forward_iterator_tag 
)  [protected]
 

Definition at line 290 of file deque.tcc.

References __throw_exception_again, std::_Destroy(), _GLIBCXX_STD::_Deque_base< _Tp, _Alloc >::_M_initialize_map(), _GLIBCXX_STD::deque< _Tp, _Alloc >::_S_buffer_size(), std::advance(), std::distance(), and std::uninitialized_copy().

template<typename _Tp, typename _Alloc>
template<typename _InputIterator>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_range_initialize (  _InputIterator  __first,
_InputIterator  __last,
input_iterator_tag 
)  [protected]
 

Definition at line 270 of file deque.tcc.

References __throw_exception_again, _GLIBCXX_STD::_Deque_base< _Tp, _Alloc >::_M_initialize_map(), _GLIBCXX_STD::deque< _Tp, _Alloc >::clear(), and _GLIBCXX_STD::deque< _Tp, _Alloc >::push_back().

Referenced by _GLIBCXX_STD::deque< _Tp, _Allocator >::_M_initialize_dispatch().

template<typename _Tp, typename _Alloc>
template<typename _ForwardIterator>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_range_insert_aux (  iterator  __pos,
_ForwardIterator  __first,
_ForwardIterator  __last,
forward_iterator_tag 
)  [protected]
 

Definition at line 400 of file deque.tcc.

References __throw_exception_again, _GLIBCXX_STD::_Deque_base< _Tp, _Alloc >::_M_destroy_nodes(), _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_insert_aux(), _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_reserve_elements_at_back(), _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_reserve_elements_at_front(), std::distance(), and std::uninitialized_copy().

template<typename _Tp, typename _Alloc>
template<typename _InputIterator>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_range_insert_aux (  iterator  __pos,
_InputIterator  __first,
_InputIterator  __last,
input_iterator_tag 
)  [protected]
 

Definition at line 391 of file deque.tcc.

References std::copy().

Referenced by _GLIBCXX_STD::deque< _Tp, _Allocator >::_M_insert_dispatch().

template<typename _Tp, typename _Alloc>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_reallocate_map (  size_type  __nodes_to_add,
bool  __add_at_front
)  [protected]
 

Definition at line 675 of file deque.tcc.

References _GLIBCXX_STD::_Deque_base< _Tp, _Alloc >::_M_allocate_map(), _GLIBCXX_STD::_Deque_base< _Tp, _Alloc >::_M_deallocate_map(), std::copy(), std::copy_backward(), and std::max().

template<typename _Tp, typename _Alloc = allocator<_Tp>>
iterator _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_reserve_elements_at_back (  size_type  __n  )  [inline, protected]
 

Definition at line 1379 of file stl_deque.h.

Referenced by _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_fill_insert(), _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_insert_aux(), and _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_range_insert_aux().

template<typename _Tp, typename _Alloc = allocator<_Tp>>
iterator _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_reserve_elements_at_front (  size_type  __n  )  [inline, protected]
 

Definition at line 1369 of file stl_deque.h.

Referenced by _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_fill_insert(), _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_insert_aux(), and _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_range_insert_aux().

template<typename _Tp, typename _Alloc = allocator<_Tp>>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_reserve_map_at_back (  size_type  __nodes_to_add = 1  )  [inline, protected]
 

Definition at line 1407 of file stl_deque.h.

Referenced by _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_new_elements_at_back(), and _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_push_back_aux().

template<typename _Tp, typename _Alloc = allocator<_Tp>>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_reserve_map_at_front (  size_type  __nodes_to_add = 1  )  [inline, protected]
 

Definition at line 1415 of file stl_deque.h.

Referenced by _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_new_elements_at_front(), and _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_push_front_aux().

template<typename _Tp, typename _Alloc = allocator<_Tp>>
size_t _GLIBCXX_STD::deque< _Tp, _Alloc >::_S_buffer_size (   )  [inline, static, protected]
 

Definition at line 605 of file stl_deque.h.

Referenced by _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_fill_initialize(), _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_new_elements_at_back(), _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_new_elements_at_front(), _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_range_initialize(), and _GLIBCXX_STD::deque< _Tp, _Alloc >::clear().

template<typename _Tp, typename _Alloc = allocator<_Tp>>
template<typename _InputIterator>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::assign (  _InputIterator  __first,
_InputIterator  __last
)  [inline]
 

Assigns a range to a deque.

Parameters:
first An input iterator.
last An input iterator.
This function fills a deque with copies of the elements in the range [first,last).

Note that the assignment completely changes the deque and that the resulting deque's size is the same as the number of elements assigned. Old data may be lost.

Reimplemented in __gnu_debug_def::deque< _Tp, _Allocator >.

Definition at line 739 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::assign (  size_type  __n,
const value_type &  __val
)  [inline]
 

Assigns a given value to a deque.

Parameters:
n Number of elements to be assigned.
val Value to be assigned.
This function fills a deque with n copies of the given value. Note that the assignment completely changes the deque and that the resulting deque's size is the same as the number of elements assigned. Old data may be lost.

Definition at line 722 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
const_reference _GLIBCXX_STD::deque< _Tp, _Alloc >::at (  size_type  __n  )  const [inline]
 

Provides access to the data contained in the deque.

Parameters:
n The index of the element for which data should be accessed.
Returns:
Read-only (constant) reference to data.
Exceptions:
std::out_of_range If n is an invalid index.
This function provides for safer data access. The parameter is first checked that it is in the range of the deque. The function throws out_of_range if the check fails.

Definition at line 930 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
reference _GLIBCXX_STD::deque< _Tp, _Alloc >::at (  size_type  __n  )  [inline]
 

Provides access to the data contained in the deque.

Parameters:
n The index of the element for which data should be accessed.
Returns:
Read/write reference to data.
Exceptions:
std::out_of_range If n is an invalid index.
This function provides for safer data access. The parameter is first checked that it is in the range of the deque. The function throws out_of_range if the check fails.

Definition at line 916 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
const_reference _GLIBCXX_STD::deque< _Tp, _Alloc >::back (   )  const [inline]
 

Returns a read-only (constant) reference to the data at the last element of the deque.

Reimplemented in __gnu_debug_def::deque< _Tp, _Allocator >.

Definition at line 969 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
reference _GLIBCXX_STD::deque< _Tp, _Alloc >::back (   )  [inline]
 

Returns a read/write reference to the data at the last element of the deque.

Reimplemented in __gnu_debug_def::deque< _Tp, _Allocator >.

Definition at line 957 of file stl_deque.h.

Referenced by _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_insert_aux().

template<typename _Tp, typename _Alloc = allocator<_Tp>>
const_iterator _GLIBCXX_STD::deque< _Tp, _Alloc >::begin (   )  const [inline]
 

Returns a read-only (constant) iterator that points to the first element in the deque. Iteration is done in ordinary element order.

Reimplemented in __gnu_debug_def::deque< _Tp, _Allocator >.

Definition at line 764 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
iterator _GLIBCXX_STD::deque< _Tp, _Alloc >::begin (   )  [inline]
 

Returns a read/write iterator that points to the first element in the deque. Iteration is done in ordinary element order.

Reimplemented in __gnu_debug_def::deque< _Tp, _Allocator >.

Definition at line 756 of file stl_deque.h.

Referenced by _GLIBCXX_STD::deque< _Tp, _Allocator >::_M_assign_aux(), _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_assign_aux(), _GLIBCXX_STD::deque< _Tp, _Allocator >::_M_fill_assign(), and _GLIBCXX_STD::deque< _Tp, _Alloc >::operator=().

template<typename _Tp, typename _Alloc>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::clear (   ) 
 

Erases all the elements. Note that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibilty.

Reimplemented in __gnu_debug_def::deque< _Tp, _Allocator >.

Definition at line 167 of file deque.tcc.

References std::_Destroy(), _GLIBCXX_STD::_Deque_base< _Tp, _Alloc >::_M_deallocate_node(), and _GLIBCXX_STD::deque< _Tp, _Alloc >::_S_buffer_size().

Referenced by _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_range_initialize(), and _GLIBCXX_STD::deque< _Tp, _Alloc >::erase().

template<typename _Tp, typename _Alloc = allocator<_Tp>>
bool _GLIBCXX_STD::deque< _Tp, _Alloc >::empty (   )  const [inline]
 

Returns true if the deque is empty. (Thus begin() would equal end().)

Definition at line 865 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
const_iterator _GLIBCXX_STD::deque< _Tp, _Alloc >::end (   )  const [inline]
 

Returns a read-only (constant) iterator that points one past the last element in the deque. Iteration is done in ordinary element order.

Reimplemented in __gnu_debug_def::deque< _Tp, _Allocator >.

Definition at line 780 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
iterator _GLIBCXX_STD::deque< _Tp, _Alloc >::end (   )  [inline]
 

Returns a read/write iterator that points one past the last element in the deque. Iteration is done in ordinary element order.

Reimplemented in __gnu_debug_def::deque< _Tp, _Allocator >.

Definition at line 772 of file stl_deque.h.

Referenced by _GLIBCXX_STD::deque< _Tp, _Allocator >::_M_assign_aux(), _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_assign_aux(), _GLIBCXX_STD::deque< _Tp, _Allocator >::_M_fill_assign(), and _GLIBCXX_STD::deque< _Tp, _Alloc >::operator=().

template<typename _Tp, typename _Alloc>
deque< _Tp, _Alloc >::iterator _GLIBCXX_STD::deque< _Tp, _Alloc >::erase (  iterator  __first,
iterator  __last
) 
 

Remove a range of elements.

Parameters:
first Iterator pointing to the first element to be erased.
last Iterator pointing to one past the last element to be erased.
Returns:
An iterator pointing to the element pointed to by last prior to erasing (or end()).
This function will erase the elements in the range [first,last) and shorten the deque accordingly.

The user is cautioned that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibilty.

Reimplemented in __gnu_debug_def::deque< _Tp, _Allocator >.

Definition at line 132 of file deque.tcc.

References std::_Destroy(), _GLIBCXX_STD::_Deque_base< _Tp, _Alloc >::_M_destroy_nodes(), _GLIBCXX_STD::deque< _Tp, _Alloc >::clear(), std::copy(), std::copy_backward(), and _GLIBCXX_STD::deque< _Tp, _Alloc >::size().

template<typename _Tp, typename _Alloc>
deque< _Tp, _Alloc >::iterator _GLIBCXX_STD::deque< _Tp, _Alloc >::erase (  iterator  __position  ) 
 

Remove element at given position.

Parameters:
position Iterator pointing to element to be erased.
Returns:
An iterator pointing to the next element (or end()).
This function will erase the element at the given position and thus shorten the deque by one.

The user is cautioned that this function only erases the element, and that if the element is itself a pointer, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibilty.

Reimplemented in __gnu_debug_def::deque< _Tp, _Allocator >.

Definition at line 111 of file deque.tcc.

References std::copy(), std::copy_backward(), _GLIBCXX_STD::deque< _Tp, _Alloc >::pop_back(), and _GLIBCXX_STD::deque< _Tp, _Alloc >::pop_front().

Referenced by _GLIBCXX_STD::deque< _Tp, _Allocator >::_M_assign_aux(), _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_assign_aux(), _GLIBCXX_STD::deque< _Tp, _Allocator >::_M_fill_assign(), and _GLIBCXX_STD::deque< _Tp, _Alloc >::operator=().

template<typename _Tp, typename _Alloc = allocator<_Tp>>
const_reference _GLIBCXX_STD::deque< _Tp, _Alloc >::front (   )  const [inline]
 

Returns a read-only (constant) reference to the data at the first element of the deque.

Reimplemented in __gnu_debug_def::deque< _Tp, _Allocator >.

Definition at line 949 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
reference _GLIBCXX_STD::deque< _Tp, _Alloc >::front (   )  [inline]
 

Returns a read/write reference to the data at the first element of the deque.

Reimplemented in __gnu_debug_def::deque< _Tp, _Allocator >.

Definition at line 941 of file stl_deque.h.

Referenced by _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_insert_aux().

template<typename _Tp, typename _Alloc = allocator<_Tp>>
allocator_type _GLIBCXX_STD::deque< _Tp, _Alloc >::get_allocator (   )  const [inline]
 

Get a copy of the memory allocation object.

Reimplemented from _GLIBCXX_STD::_Deque_base< _Tp, _Alloc >.

Definition at line 747 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
template<typename _InputIterator>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::insert (  iterator  __position,
_InputIterator  __first,
_InputIterator  __last
)  [inline]
 

Inserts a range into the deque.

Parameters:
position An iterator into the deque.
first An input iterator.
last An input iterator.
This function will insert copies of the data in the range [first,last) into the deque before the location specified by pos. This is known as "range insert."

Reimplemented in __gnu_debug_def::deque< _Tp, _Allocator >.

Definition at line 1094 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::insert (  iterator  __position,
size_type  __n,
const value_type &  __x
)  [inline]
 

Inserts a number of copies of given data into the deque.

Parameters:
position An iterator into the deque.
n Number of elements to be inserted.
x Data to be inserted.
This function will insert a specified number of copies of the given data before the location specified by position.

Definition at line 1079 of file stl_deque.h.

template<typename _Tp, typename _Alloc>
deque< _Tp, _Alloc >::iterator _GLIBCXX_STD::deque< _Tp, _Alloc >::insert (  iterator  position,
const value_type &  __x
) 
 

Inserts given value into deque before specified iterator.

Parameters:
position An iterator into the deque.
x Data to be inserted.
Returns:
An iterator that points to the inserted data.
This function will insert a copy of the given value before the specified location.

Definition at line 90 of file deque.tcc.

References _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_insert_aux(), _GLIBCXX_STD::deque< _Tp, _Alloc >::push_back(), and _GLIBCXX_STD::deque< _Tp, _Alloc >::push_front().

Referenced by _GLIBCXX_STD::deque< _Tp, _Allocator >::_M_assign_aux(), _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_assign_aux(), _GLIBCXX_STD::deque< _Tp, _Allocator >::_M_fill_assign(), and _GLIBCXX_STD::deque< _Tp, _Alloc >::operator=().

template<typename _Tp, typename _Alloc = allocator<_Tp>>
size_type _GLIBCXX_STD::deque< _Tp, _Alloc >::max_size (   )  const [inline]
 

Returns the size() of the largest possible deque.

Definition at line 825 of file stl_deque.h.

template<typename _Tp, typename _Alloc>
deque< _Tp, _Alloc > & _GLIBCXX_STD::deque< _Tp, _Alloc >::operator= (  const deque< _Tp, _Alloc > &  __x  ) 
 

Deque assignment operator.

Parameters:
x A deque of identical element and allocator types.
All the elements of x are copied, but unlike the copy constructor, the allocator object is not copied.

Definition at line 69 of file deque.tcc.

References _GLIBCXX_STD::deque< _Tp, _Alloc >::begin(), std::copy(), _GLIBCXX_STD::deque< _Tp, _Alloc >::difference_type, _GLIBCXX_STD::deque< _Tp, _Alloc >::end(), _GLIBCXX_STD::deque< _Tp, _Alloc >::erase(), _GLIBCXX_STD::deque< _Tp, _Alloc >::insert(), and _GLIBCXX_STD::deque< _Tp, _Alloc >::size().

template<typename _Tp, typename _Alloc = allocator<_Tp>>
const_reference _GLIBCXX_STD::deque< _Tp, _Alloc >::operator[] (  size_type  __n  )  const [inline]
 

Subscript access to the data contained in the deque.

Parameters:
n The index of the element for which data should be accessed.
Returns:
Read-only (constant) reference to data.
This operator allows for easy, array-style, data access. Note that data access with this operator is unchecked and out_of_range lookups are not defined. (For checked lookups see at().)

Reimplemented in __gnu_debug_def::deque< _Tp, _Allocator >.

Definition at line 892 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
reference _GLIBCXX_STD::deque< _Tp, _Alloc >::operator[] (  size_type  __n  )  [inline]
 

Subscript access to the data contained in the deque.

Parameters:
n The index of the element for which data should be accessed.
Returns:
Read/write reference to data.
This operator allows for easy, array-style, data access. Note that data access with this operator is unchecked and out_of_range lookups are not defined. (For checked lookups see at().)

Reimplemented in __gnu_debug_def::deque< _Tp, _Allocator >.

Definition at line 879 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::pop_back (   )  [inline]
 

Removes last element.

This is a typical stack operation. It shrinks the deque by one.

Note that no data is returned, and if the last element's data is needed, it should be retrieved before pop_back() is called.

Reimplemented in __gnu_debug_def::deque< _Tp, _Allocator >.

Definition at line 1046 of file stl_deque.h.

Referenced by _GLIBCXX_STD::deque< _Tp, _Alloc >::erase().

template<typename _Tp, typename _Alloc = allocator<_Tp>>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::pop_front (   )  [inline]
 

Removes first element.

This is a typical stack operation. It shrinks the deque by one.

Note that no data is returned, and if the first element's data is needed, it should be retrieved before pop_front() is called.

Reimplemented in __gnu_debug_def::deque< _Tp, _Allocator >.

Definition at line 1026 of file stl_deque.h.

Referenced by _GLIBCXX_STD::deque< _Tp, _Alloc >::erase().

template<typename _Tp, typename _Alloc = allocator<_Tp>>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::push_back (  const value_type &  __x  )  [inline]
 

Add data to the end of the deque.

Parameters:
x Data to be added.
This is a typical stack operation. The function creates an element at the end of the deque and assigns the given data to it. Due to the nature of a deque this operation can be done in constant time.

Definition at line 1006 of file stl_deque.h.

Referenced by _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_insert_aux(), _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_range_initialize(), and _GLIBCXX_STD::deque< _Tp, _Alloc >::insert().

template<typename _Tp, typename _Alloc = allocator<_Tp>>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::push_front (  const value_type &  __x  )  [inline]
 

Add data to the front of the deque.

Parameters:
x Data to be added.
This is a typical stack operation. The function creates an element at the front of the deque and assigns the given data to it. Due to the nature of a deque this operation can be done in constant time.

Definition at line 986 of file stl_deque.h.

Referenced by _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_insert_aux(), and _GLIBCXX_STD::deque< _Tp, _Alloc >::insert().

template<typename _Tp, typename _Alloc = allocator<_Tp>>
const_reverse_iterator _GLIBCXX_STD::deque< _Tp, _Alloc >::rbegin (   )  const [inline]
 

Returns a read-only (constant) reverse iterator that points to the last element in the deque. Iteration is done in reverse element order.

Reimplemented in __gnu_debug_def::deque< _Tp, _Allocator >.

Definition at line 797 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
reverse_iterator _GLIBCXX_STD::deque< _Tp, _Alloc >::rbegin (   )  [inline]
 

Returns a read/write reverse iterator that points to the last element in the deque. Iteration is done in reverse element order.

Reimplemented in __gnu_debug_def::deque< _Tp, _Allocator >.

Definition at line 788 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
const_reverse_iterator _GLIBCXX_STD::deque< _Tp, _Alloc >::rend (   )  const [inline]
 

Returns a read-only (constant) reverse iterator that points to one before the first element in the deque. Iteration is done in reverse element order.

Reimplemented in __gnu_debug_def::deque< _Tp, _Allocator >.

Definition at line 814 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
reverse_iterator _GLIBCXX_STD::deque< _Tp, _Alloc >::rend (   )  [inline]
 

Returns a read/write reverse iterator that points to one before the first element in the deque. Iteration is done in reverse element order.

Reimplemented in __gnu_debug_def::deque< _Tp, _Allocator >.

Definition at line 806 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::resize (  size_type  new_size  )  [inline]
 

Resizes the deque to the specified number of elements.

Parameters:
new_size Number of elements the deque should contain.
This function will resize the deque to the specified number of elements. If the number is smaller than the deque's current size the deque is truncated, otherwise the deque is extended and new elements are default-constructed.

Definition at line 858 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::resize (  size_type  __new_size,
const value_type &  __x
)  [inline]
 

Resizes the deque to the specified number of elements.

Parameters:
new_size Number of elements the deque should contain.
x Data with which new elements should be populated.
This function will resize the deque to the specified number of elements. If the number is smaller than the deque's current size the deque is truncated, otherwise the deque is extended and new elements are populated with given data.

Definition at line 839 of file stl_deque.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>>
size_type _GLIBCXX_STD::deque< _Tp, _Alloc >::size (   )  const [inline]
 

Returns the number of elements in the deque.

Definition at line 820 of file stl_deque.h.

Referenced by _GLIBCXX_STD::deque< _Tp, _Allocator >::_M_assign_aux(), _GLIBCXX_STD::deque< _Tp, _Allocator >::_M_fill_assign(), _GLIBCXX_STD::deque< _Tp, _Alloc >::_M_insert_aux(), _GLIBCXX_STD::deque< _Tp, _Allocator >::_M_range_check(), _GLIBCXX_STD::deque< _Tp, _Alloc >::erase(), and _GLIBCXX_STD::deque< _Tp, _Alloc >::operator=().

template<typename _Tp, typename _Alloc = allocator<_Tp>>
void _GLIBCXX_STD::deque< _Tp, _Alloc >::swap (  deque< _Tp, _Alloc > &  __x  )  [inline]
 

Swaps data with another deque.

Parameters:
x A deque of the same element and allocator types.
This exchanges the elements between two deques in constant time. (Four pointers, so it should be quite fast.) Note that the global std::swap() function is specialized such that std::swap(d1,d2) will feed to this function.

Definition at line 1147 of file stl_deque.h.

Referenced by _GLIBCXX_STD::swap().

Member Data Documentation

template<typename _Tp, typename _Alloc = allocator<_Tp>>
_Alloc _GLIBCXX_STD::deque< _Tp, _Alloc >::_Base [private]
 

Reimplemented in __gnu_debug_def::deque< _Tp, _Allocator >.

Definition at line 586 of file stl_deque.h.

The documentation for this class was generated from the following files:
Generated on Tue Jan 30 17:32:07 2007 for GNU C++ STL by doxygen 1.3.6