difference_type
return ::allocate((difference_type)n, (pointer)0);
typename iterator_traits<_RandomAccessIter>::difference_type __trip_count
typename iterator_traits<_RandomAccessIter>::difference_type __trip_count
typename iterator_traits<_InputIter>::difference_type
typename iterator_traits<_InputIter>::difference_type __n = 0;
typename iterator_traits<_InputIter>::difference_type
typename iterator_traits<_InputIter>::difference_type __n = 0;
typedef typename iterator_traits<_InputIter>::difference_type _Distance;
typedef typename iterator_traits<_BidirectionalIter1>::difference_type
iterator& operator+=(difference_type __i) {
difference_type __n = __i + _M_offset;
iterator& operator-=(difference_type __i) {
iterator operator+(difference_type __i) const {
iterator operator-(difference_type __i) const {
difference_type operator-(iterator __x) const {
reference operator[](difference_type __i) { return *(*this + __i); }
const_iterator& operator+=(difference_type __i) {
difference_type __n = __i + _M_offset;
const_iterator& operator-=(difference_type __i) {
const_iterator operator+(difference_type __i) const {
const_iterator operator-(difference_type __i) const {
difference_type operator-(const_iterator __x) const {
const_reference operator[](difference_type __i) {
difference_type> const_reverse_iterator;
typedef reverse_iterator<iterator, value_type, reference, difference_type>
_M_finish = _M_start + difference_type(__n);
copy_backward(__position, end(), _M_finish + difference_type(__n));
_M_finish += difference_type(__n);
return *(begin() + difference_type(__n));
return *(begin() + difference_type(__n));
_M_finish = begin() + difference_type(__x.size());
difference_type __n = __position - begin();
copy_backward(__position, end(), _M_finish + difference_type(__n));
fill(__position, __position + difference_type(__n), __x);
_M_finish += difference_type(__n);
_M_finish = copy(__position, end(), __i + difference_type(__n));
erase(begin() + difference_type(__new_size), end());
difference_type __n = __last - __first;
difference_type __elems_before = __first - _M_start;
difference_type __index = __pos - _M_start;
difference_type __index = __pos - _M_start;
const difference_type __elems_before = __pos - _M_start;
if (__elems_before >= difference_type(__n)) {
iterator __start_n = _M_start + difference_type(__n);
fill(__pos - difference_type(__n), __pos, __x_copy);
const difference_type __elems_after =
difference_type(__length) - __elems_before;
if (__elems_after > difference_type(__n)) {
iterator __finish_n = _M_finish - difference_type(__n);
fill(__pos, __pos + difference_type(__n), __x_copy);
__uninitialized_fill_copy(_M_finish, __pos + difference_type(__n),
const difference_type __elemsbefore = __pos - _M_start;
difference_type operator-(const _Self& __x) const {
if (__elemsbefore >= difference_type(__n)) {
iterator __start_n = _M_start + difference_type(__n);
copy(__first, __last, __pos - difference_type(__n));
return difference_type(_S_buffer_size()) * (_M_node - __x._M_node - 1) +
advance(__mid, difference_type(__n) - __elemsbefore);
const difference_type __elemsafter =
difference_type(__length) - __elemsbefore;
if (__elemsafter > difference_type(__n)) {
iterator __finish_n = _M_finish - difference_type(__n);
const difference_type __elemsbefore = __pos - _M_start;
if (__elemsbefore >= difference_type(__n)) {
iterator __start_n = _M_start + difference_type(__n);
copy(__first, __last, __pos - difference_type(__n));
__first + (difference_type(__n) - __elemsbefore);
const difference_type __elemsafter =
difference_type(__length) - __elemsbefore;
if (__elemsafter > difference_type(__n)) {
iterator __finish_n = _M_finish - difference_type(__n);
const difference_type __elemsbefore = __pos - _M_start;
copy(__first, __last, __pos - difference_type(__n));
const difference_type __elemsafter = __length - __elemsbefore;
iterator __finish_n = _M_finish - difference_type(__n);
_Self& operator+=(difference_type __n)
difference_type __offset = __n + (_M_cur - _M_first);
if (__offset >= 0 && __offset < difference_type(_S_buffer_size()))
difference_type __node_offset =
__offset > 0 ? __offset / difference_type(_S_buffer_size())
: -difference_type((-__offset - 1) / _S_buffer_size()) - 1;
(__offset - __node_offset * difference_type(_S_buffer_size()));
_Self operator+(difference_type __n) const
_Self& operator-=(difference_type __n) { return *this += -__n; }
_Self operator-(difference_type __n) const {
reference operator[](difference_type __n) const { return *(*this + __n); }
_M_last = _M_first + difference_type(_S_buffer_size());
difference_type>
typedef reverse_iterator<iterator, value_type, reference, difference_type>
{ return _M_start[difference_type(__n)]; }
{ return _M_start[difference_type(__n)]; }
const_iterator __mid = __x.begin() + difference_type(__len);
difference_type __index = __pos - _M_start;
return _M_start - difference_type(__n);
return _M_finish + difference_type(__n);
typedef typename _Ht::difference_type difference_type;
typedef typename _Ht::difference_type difference_type;
typedef typename _Ht::difference_type difference_type;
typedef typename _Ht::difference_type difference_type;
inline hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>::difference_type*
return (hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>::difference_type*) 0;
inline hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>::difference_type*
return (hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>::difference_type*) 0;
typedef typename _Iterator::difference_type difference_type;
inline typename iterator_traits<_Iter>::difference_type*
return static_cast<typename iterator_traits<_Iter>::difference_type*>(0);
inline typename iterator_traits<_Iter>::difference_type*
inline typename iterator_traits<_InputIterator>::difference_type
typename iterator_traits<_InputIterator>::difference_type __n = 0;
inline typename iterator_traits<_RandomAccessIterator>::difference_type
inline typename iterator_traits<_InputIterator>::difference_type
typedef typename iterator_traits<_Iterator>::difference_type
_Self operator+(difference_type __n) const {
_Self& operator+=(difference_type __n) {
_Self operator-(difference_type __n) const {
_Self& operator-=(difference_type __n) {
reference operator[](difference_type __n) const { return *(*this + __n); }
inline typename reverse_iterator<_Iterator>::difference_type
operator+(typename reverse_iterator<_Iterator>::difference_type __n,
const_reference,difference_type>
difference_type>
typedef typename _Rep_type::difference_type difference_type;
typedef typename _Rep_type::difference_type difference_type;
typedef typename _Rep_type::difference_type difference_type;
_Rope_iterator& operator+=(difference_type __n) {
_Rope_iterator& operator-=(difference_type __n) {
difference_type> const_reverse_iterator;
difference_type> reverse_iterator;
typedef typename _Rep_type::difference_type difference_type;
inline _Rb_tree_base_iterator::difference_type*
return (_Rb_tree_base_iterator::difference_type*) 0;
difference_type>
const_reference, difference_type>
difference_type> const_reverse_iterator;
typedef reverse_iterator<iterator, value_type, reference, difference_type>