| /external/stlport/stlport/stl/ |
| _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;
|
| _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...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _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;
|
| _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...] |
| /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
| _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;
|
| _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...] |
| /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
| _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;
|
| _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...] |
| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
| _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;
|
| _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...] |
| /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/ |
| _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;
|
| _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...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
| stl_deque.h | 113 _Tp* _M_last;
118 _M_last(*__y + _S_buffer_size()), _M_node(__y) { }
121 : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) { }
125 _M_last(__x._M_last), _M_node(__x._M_node) { }
139 if (_M_cur == _M_last)
161 _M_cur = _M_last;
219 * immediately afterwards, based on _M_first and _M_last.
226 _M_last = _M_first + difference_type(_S_buffer_size());
325 + (__y._M_last - __y._M_cur)
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/ |
| stl_deque.h | 124 _Tp* _M_last;
129 _M_last(*__y + _S_buffer_size()), _M_node(__y) { }
132 : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) { }
136 _M_last(__x._M_last), _M_node(__x._M_node) { }
150 if (_M_cur == _M_last)
172 _M_cur = _M_last;
230 * immediately afterwards, based on _M_first and _M_last.
237 _M_last = _M_first + difference_type(_S_buffer_size());
336 + (__y._M_last - __y._M_cur)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/ |
| stl_deque.h | 124 _Tp* _M_last;
129 _M_last(*__y + _S_buffer_size()), _M_node(__y) { }
132 : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) { }
136 _M_last(__x._M_last), _M_node(__x._M_node) { }
150 if (_M_cur == _M_last)
172 _M_cur = _M_last;
230 * immediately afterwards, based on _M_first and _M_last.
237 _M_last = _M_first + difference_type(_S_buffer_size());
336 + (__y._M_last - __y._M_cur)
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_deque.h | 113 _Tp* _M_last;
118 _M_last(*__y + _S_buffer_size()), _M_node(__y) { }
121 : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) { }
125 _M_last(__x._M_last), _M_node(__x._M_node) { }
139 if (_M_cur == _M_last)
161 _M_cur = _M_last;
219 * immediately afterwards, based on _M_first and _M_last.
226 _M_last = _M_first + difference_type(_S_buffer_size());
325 + (__y._M_last - __y._M_cur)
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_deque.h | 113 _Tp* _M_last;
118 _M_last(*__y + _S_buffer_size()), _M_node(__y) { }
121 : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) { }
125 _M_last(__x._M_last), _M_node(__x._M_node) { }
139 if (_M_cur == _M_last)
161 _M_cur = _M_last;
219 * immediately afterwards, based on _M_first and _M_last.
226 _M_last = _M_first + difference_type(_S_buffer_size());
325 + (__y._M_last - __y._M_cur)
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_deque.h | 113 _Tp* _M_last;
118 _M_last(*__y + _S_buffer_size()), _M_node(__y) { }
121 : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) { }
125 _M_last(__x._M_last), _M_node(__x._M_node) { }
139 if (_M_cur == _M_last)
161 _M_cur = _M_last;
219 * immediately afterwards, based on _M_first and _M_last.
226 _M_last = _M_first + difference_type(_S_buffer_size());
325 + (__y._M_last - __y._M_cur)
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_deque.h | 113 _Tp* _M_last;
118 _M_last(*__y + _S_buffer_size()), _M_node(__y) { }
121 : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) { }
125 _M_last(__x._M_last), _M_node(__x._M_node) { }
139 if (_M_cur == _M_last)
161 _M_cur = _M_last;
219 * immediately afterwards, based on _M_first and _M_last.
226 _M_last = _M_first + difference_type(_S_buffer_size());
325 + (__y._M_last - __y._M_cur)
[all...] |
