HomeSort by relevance Sort by last modified time
    Searched refs:_M_last (Results 1 - 4 of 4) sorted by null

  /external/stlport/stlport/stl/pointers/
_deque.h 45 tmp._M_last = cast_traits::to_value_type_ptr(__ite._M_last);
53 tmp._M_last = cast_traits::to_storage_type_ptr(__ite._M_last);
62 tmp._M_last = cast_traits::to_value_type_ptr(__ite._M_last);
71 tmp._M_last = cast_traits::to_storage_type_ptr(__ite._M_last);
  /external/stlport/stlport/stl/
_deque.h 103 value_type* _M_last;
108 _M_last(*__y + _S_buffer_size()), _M_node(__y) {}
110 _Deque_iterator_base() : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) {}
116 _M_last(__other._M_last), _M_node(__other._M_node) {}
121 (_M_cur - _M_first) + (__x._M_last - __x._M_cur);
125 if (++_M_cur == _M_last) {
134 _M_cur = _M_last;
156 _M_last = (_M_first = *(_M_node = __new_node)) + difference_type(_S_buffer_size());
672 if (this->_M_finish._M_cur != this->_M_finish._M_last - 1)
    [all...]
_deque.c 355 _STLP_STD::_Destroy_Range(this->_M_start._M_cur, this->_M_start._M_last);
380 // Called only if this->_M_finish._M_cur == this->_M_finish._M_last - 1.
395 // Called only if this->_M_finish._M_cur == this->_M_finish._M_last - 1.
417 this->_M_start._M_cur = this->_M_start._M_last - 1;
433 this->_M_start._M_cur = this->_M_start._M_last - 1;
446 this->_M_finish._M_cur = this->_M_finish._M_last - 1;
450 // function), and if this->_M_start._M_cur == this->_M_start._M_last, then the deque
454 if (this->_M_start._M_cur != this->_M_start._M_last - 1)
_string.c 62 const _CharT* _M_last;
65 : _M_first(__f), _M_last(__l) {}
68 return find_if(_M_first, _M_last,
69 _STLP_PRIV _Eq_char_bound<_Traits>(__x)) == _M_last;

Completed in 21 milliseconds