deque File Reference

#include <xmemory>
#include <stdexcept>

Classes
class	_Deque_unchecked_const_iterator< _Mydeque >
class	_Deque_unchecked_iterator< _Mydeque >
class	_Deque_const_iterator< _Mydeque >
class	_Deque_iterator< _Mydeque >
struct	_Deque_iter_types< _Value_type, _Size_type, _Difference_type, _Pointer, _Const_pointer, _Reference, _Const_reference, _Mapptr_type >
struct	_Deque_simple_types< _Ty >
struct	_Deque_base_types< _Ty, _Alloc0 >
class	_Deque_val< _Val_types >
class	_Deque_alloc< _Al_has_storage, _Alloc_types >
class	_Deque_alloc< false, _Alloc_types >
class	deque< _Ty, _Alloc >

Macros
#define	_DEQUE_
#define	_DEQUEMAPSIZ   8 /* minimum map size, at least 1 */
#define	_DEQUESIZ
#define	_PUSH_FRONT_BEGIN
#define	_PUSH_FRONT_END
#define	_PUSH_BACK_BEGIN
#define	_PUSH_BACK_END   ++this->_Mysize

Functions
template<class _Mydeque >
_Deque_unchecked_const_iterator< _Mydeque >	operator+ (typename _Deque_unchecked_const_iterator< _Mydeque >::difference_type _Off, _Deque_unchecked_const_iterator< _Mydeque > _Next)
template<class _Mydeque >
_Deque_unchecked_iterator< _Mydeque >	operator+ (typename _Deque_unchecked_iterator< _Mydeque >::difference_type _Off, _Deque_unchecked_iterator< _Mydeque > _Next)
template<class _Mydeque >
_Deque_const_iterator< _Mydeque >::_Unchecked_type	_Unchecked (_Deque_const_iterator< _Mydeque > _Iter)
template<class _Mydeque >
_Deque_const_iterator< _Mydeque > &	_Rechecked (_Deque_const_iterator< _Mydeque > &_Iter, typename _Deque_const_iterator< _Mydeque >::_Unchecked_type _Right)
template<class _Mydeque >
_Deque_const_iterator< _Mydeque >	operator+ (typename _Deque_const_iterator< _Mydeque >::difference_type _Off, _Deque_const_iterator< _Mydeque > _Next)
template<class _Mydeque >
_Deque_iterator< _Mydeque >::_Unchecked_type	_Unchecked (_Deque_iterator< _Mydeque > _Iter)
template<class _Mydeque >
_Deque_iterator< _Mydeque > &	_Rechecked (_Deque_iterator< _Mydeque > &_Iter, typename _Deque_iterator< _Mydeque >::_Unchecked_type _Right)
template<class _Mydeque >
_Deque_iterator< _Mydeque >	operator+ (typename _Deque_iterator< _Mydeque >::difference_type _Off, _Deque_iterator< _Mydeque > _Next)
template<class _Ty , class _Alloc >
void	swap (deque< _Ty, _Alloc > &_Left, deque< _Ty, _Alloc > &_Right)
template<class _Ty , class _Alloc >
bool	operator== (const deque< _Ty, _Alloc > &_Left, const deque< _Ty, _Alloc > &_Right)
template<class _Ty , class _Alloc >
bool	operator!= (const deque< _Ty, _Alloc > &_Left, const deque< _Ty, _Alloc > &_Right)
template<class _Ty , class _Alloc >
bool	operator< (const deque< _Ty, _Alloc > &_Left, const deque< _Ty, _Alloc > &_Right)
template<class _Ty , class _Alloc >
bool	operator<= (const deque< _Ty, _Alloc > &_Left, const deque< _Ty, _Alloc > &_Right)
template<class _Ty , class _Alloc >
bool	operator> (const deque< _Ty, _Alloc > &_Left, const deque< _Ty, _Alloc > &_Right)
template<class _Ty , class _Alloc >
bool	operator>= (const deque< _Ty, _Alloc > &_Left, const deque< _Ty, _Alloc > &_Right)

Macro Definition Documentation

#define _DEQUE_

#define _DEQUEMAPSIZ   8 /* minimum map size, at least 1 */

#define _DEQUESIZ

Value:

(sizeof (value_type) <= 1 ? 16 \
    : sizeof (value_type) <= 2 ? 8 \
    : sizeof (value_type) <= 4 ? 4 \
    : sizeof (value_type) <= 8 ? 2 \
    : 1)    /* elements per block (a power of 2) */

#define _PUSH_BACK_BEGIN

Value:

if ((this->_Myoff + this->_Mysize) % _DEQUESIZ == 0 \
        && this->_Mapsize <= (this->_Mysize + _DEQUESIZ) / _DEQUESIZ) \
        _Growmap(1); \
    this->_Myoff &= this->_Mapsize * _DEQUESIZ - 1; \
    size_type _Newoff = this->_Myoff + this->_Mysize; \
    size_type _Block = this->_Getblock(_Newoff); \
	if (this->_Map[_Block] == pointer()) \
        this->_Map[_Block] = this->_Getal().allocate(_DEQUESIZ)

#define _PUSH_BACK_END   ++this->_Mysize

#define _PUSH_FRONT_BEGIN

Value:

if (this->_Myoff % _DEQUESIZ == 0 \
        && this->_Mapsize <= (this->_Mysize + _DEQUESIZ) / _DEQUESIZ) \
        _Growmap(1); \
    this->_Myoff &= this->_Mapsize * _DEQUESIZ - 1; \
    size_type _Newoff = this->_Myoff != 0 ? this->_Myoff \
        : this->_Mapsize * _DEQUESIZ; \
    size_type _Block = this->_Getblock(--_Newoff); \
	if (this->_Map[_Block] == pointer()) \
        this->_Map[_Block] = this->_Getal().allocate(_DEQUESIZ)

#define _PUSH_FRONT_END

Value:

this->_Myoff = _Newoff; \
    ++this->_Mysize

Function Documentation

template<class _Mydeque >

_Deque_const_iterator<_Mydeque>& _Rechecked ( _Deque_const_iterator< _Mydeque > &  _Iter, typename _Deque_const_iterator< _Mydeque >::_Unchecked_type  _Right  )

inline

    {   // convert to checked
    return (_Iter._Rechecked(_Right));
    }

template<class _Mydeque >

_Deque_iterator<_Mydeque>& _Rechecked ( _Deque_iterator< _Mydeque > &  _Iter, typename _Deque_iterator< _Mydeque >::_Unchecked_type  _Right  )

inline

    {   // convert to checked
    return (_Iter._Rechecked(_Right));
    }

template<class _Mydeque >

_Deque_const_iterator<_Mydeque>::_Unchecked_type _Unchecked ( _Deque_const_iterator< _Mydeque >  _Iter )

inline

    {   // convert to unchecked
    return (_Iter._Unchecked());
    }

template<class _Mydeque >

_Deque_iterator<_Mydeque>::_Unchecked_type _Unchecked ( _Deque_iterator< _Mydeque >  _Iter )

inline

    {   // convert to unchecked
    return (_Iter._Unchecked());
    }

template<class _Ty , class _Alloc >

bool operator!= ( const deque< _Ty, _Alloc > &  _Left, const deque< _Ty, _Alloc > &  _Right  )

inline

    {   // test for deque inequality
    return (!(_Left == _Right));
    }

template<class _Mydeque >

_Deque_unchecked_const_iterator<_Mydeque> operator+ ( typename _Deque_unchecked_const_iterator< _Mydeque >::difference_type  _Off, _Deque_unchecked_const_iterator< _Mydeque >  _Next  )

inline

    {   // add offset to iterator
    return (_Next += _Off);
    }

template<class _Mydeque >

_Deque_unchecked_iterator<_Mydeque> operator+ ( typename _Deque_unchecked_iterator< _Mydeque >::difference_type  _Off, _Deque_unchecked_iterator< _Mydeque >  _Next  )

inline

    {   // add offset to iterator
    return (_Next += _Off);
    }

template<class _Mydeque >

_Deque_const_iterator<_Mydeque> operator+ ( typename _Deque_const_iterator< _Mydeque >::difference_type  _Off, _Deque_const_iterator< _Mydeque >  _Next  )

inline

    {   // add offset to iterator
    return (_Next += _Off);
    }

template<class _Mydeque >

_Deque_iterator<_Mydeque> operator+ ( typename _Deque_iterator< _Mydeque >::difference_type  _Off, _Deque_iterator< _Mydeque >  _Next  )

inline

    {   // add offset to iterator
    return (_Next += _Off);
    }

template<class _Ty , class _Alloc >

bool operator< ( const deque< _Ty, _Alloc > &  _Left, const deque< _Ty, _Alloc > &  _Right  )

inline

    {   // test if _Left < _Right for deques
    return (lexicographical_compare(_Left.begin(), _Left.end(),
        _Right.begin(), _Right.end()));
    }

template<class _Ty , class _Alloc >

bool operator<= ( const deque< _Ty, _Alloc > &  _Left, const deque< _Ty, _Alloc > &  _Right  )

inline

    {   // test if _Left <= _Right for deques
    return (!(_Right < _Left));
    }

template<class _Ty , class _Alloc >

bool operator== ( const deque< _Ty, _Alloc > &  _Left, const deque< _Ty, _Alloc > &  _Right  )

inline

    {   // test for deque equality
    return (_Left.size() == _Right.size()
        && equal(_Left.begin(), _Left.end(), _Right.begin()));
    }

template<class _Ty , class _Alloc >

bool operator> ( const deque< _Ty, _Alloc > &  _Left, const deque< _Ty, _Alloc > &  _Right  )

inline

    {   // test if _Left > _Right for deques
    return (_Right < _Left);
    }

template<class _Ty , class _Alloc >

bool operator>= ( const deque< _Ty, _Alloc > &  _Left, const deque< _Ty, _Alloc > &  _Right  )

inline

    {   // test if _Left >= _Right for deques
    return (!(_Left < _Right));
        }

template<class _Ty , class _Alloc >

void swap ( deque< _Ty, _Alloc > &  _Left, deque< _Ty, _Alloc > &  _Right  )

inline

    {   // swap _Left and _Right deques
    _Left.swap(_Right);
    }