HomeSort by relevance Sort by last modified time
    Searched defs:_M_cur (Results 1 - 25 of 29) sorted by null

1 2

  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/tr1_impl/
hashtable_policy.h 126 : _M_cur(__p) { }
130 { _M_cur = _M_cur->_M_next; }
132 _Hash_node<_Value, __cache>* _M_cur;
139 { return __x._M_cur == __y._M_cur; }
145 { return __x._M_cur != __y._M_cur; }
172 { return this->_M_cur->_M_v; }
176 { return &this->_M_cur->_M_v;
    [all...]
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/
hashtable_policy.h 103 : _M_cur(__p) { }
107 { _M_cur = _M_cur->_M_next; }
109 _Hash_node<_Value, __cache>* _M_cur;
116 { return __x._M_cur == __y._M_cur; }
122 { return __x._M_cur != __y._M_cur; }
147 { return this->_M_cur->_M_v; }
151 { return std::__addressof(this->_M_cur->_M_v);
    [all...]
stl_deque.h 122 _Tp* _M_cur;
128 : _M_cur(__x), _M_first(*__y),
132 : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) { }
135 : _M_cur(__x._M_cur), _M_first(__x._M_first),
140 { return *_M_cur; }
144 { return _M_cur; }
149 ++_M_cur;
150 if (_M_cur == _M_last)
153 _M_cur = _M_first
    [all...]
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/tr1/
hashtable_policy.h 92 : _M_cur(__p) { }
96 { _M_cur = _M_cur->_M_next; }
98 _Hash_node<_Value, __cache>* _M_cur;
105 { return __x._M_cur == __y._M_cur; }
111 { return __x._M_cur != __y._M_cur; }
138 { return this->_M_cur->_M_v; }
142 { return std::__addressof(this->_M_cur->_M_v);
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/
hashtable_policy.h 103 : _M_cur(__p) { }
107 { _M_cur = _M_cur->_M_next; }
109 _Hash_node<_Value, __cache>* _M_cur;
116 { return __x._M_cur == __y._M_cur; }
122 { return __x._M_cur != __y._M_cur; }
147 { return this->_M_cur->_M_v; }
151 { return std::__addressof(this->_M_cur->_M_v);
    [all...]
stl_deque.h 122 _Tp* _M_cur;
128 : _M_cur(__x), _M_first(*__y),
132 : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) { }
135 : _M_cur(__x._M_cur), _M_first(__x._M_first),
140 { return *_M_cur; }
144 { return _M_cur; }
149 ++_M_cur;
150 if (_M_cur == _M_last)
153 _M_cur = _M_first
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/tr1/
hashtable_policy.h 92 : _M_cur(__p) { }
96 { _M_cur = _M_cur->_M_next; }
98 _Hash_node<_Value, __cache>* _M_cur;
105 { return __x._M_cur == __y._M_cur; }
111 { return __x._M_cur != __y._M_cur; }
138 { return this->_M_cur->_M_v; }
142 { return std::__addressof(this->_M_cur->_M_v);
    [all...]
  /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/tr1_impl/
hashtable_policy.h 126 : _M_cur(__p) { }
130 { _M_cur = _M_cur->_M_next; }
132 _Hash_node<_Value, __cache>* _M_cur;
139 { return __x._M_cur == __y._M_cur; }
145 { return __x._M_cur != __y._M_cur; }
172 { return this->_M_cur->_M_v; }
176 { return &this->_M_cur->_M_v;
    [all...]
  /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/tr1_impl/
hashtable_policy.h 126 : _M_cur(__p) { }
130 { _M_cur = _M_cur->_M_next; }
132 _Hash_node<_Value, __cache>* _M_cur;
139 { return __x._M_cur == __y._M_cur; }
145 { return __x._M_cur != __y._M_cur; }
172 { return this->_M_cur->_M_v; }
176 { return &this->_M_cur->_M_v;
    [all...]
  /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/tr1_impl/
hashtable_policy.h 126 : _M_cur(__p) { }
130 { _M_cur = _M_cur->_M_next; }
132 _Hash_node<_Value, __cache>* _M_cur;
139 { return __x._M_cur == __y._M_cur; }
145 { return __x._M_cur != __y._M_cur; }
172 { return this->_M_cur->_M_v; }
176 { return &this->_M_cur->_M_v;
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/include/tr1_impl/
hashtable_policy.h 126 : _M_cur(__p) { }
130 { _M_cur = _M_cur->_M_next; }
132 _Hash_node<_Value, __cache>* _M_cur;
139 { return __x._M_cur == __y._M_cur; }
145 { return __x._M_cur != __y._M_cur; }
172 { return this->_M_cur->_M_v; }
176 { return &this->_M_cur->_M_v;
    [all...]
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/backward/
hashtable.h 121 _Node* _M_cur;
125 : _M_cur(__n), _M_ht(__tab) { }
128 : _M_cur(0), _M_ht(0) { }
132 { return _M_cur->_M_val; }
146 { return _M_cur == __it._M_cur; }
150 { return _M_cur != __it._M_cur; }
174 const _Node* _M_cur;
178 : _M_cur(__n), _M_ht(__tab) {
    [all...]
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/backward/
hashtable.h 123 _Node* _M_cur;
127 : _M_cur(__n), _M_ht(__tab) { }
130 : _M_cur(0), _M_ht(0) { }
134 { return _M_cur->_M_val; }
148 { return _M_cur == __it._M_cur; }
152 { return _M_cur != __it._M_cur; }
176 const _Node* _M_cur;
180 : _M_cur(__n), _M_ht(__tab) {
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/backward/
hashtable.h 123 _Node* _M_cur;
127 : _M_cur(__n), _M_ht(__tab) { }
130 : _M_cur(0), _M_ht(0) { }
134 { return _M_cur->_M_val; }
148 { return _M_cur == __it._M_cur; }
152 { return _M_cur != __it._M_cur; }
176 const _Node* _M_cur;
180 : _M_cur(__n), _M_ht(__tab) {
    [all...]
  /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/backward/
hashtable.h 121 _Node* _M_cur;
125 : _M_cur(__n), _M_ht(__tab) { }
128 : _M_cur(0), _M_ht(0) { }
132 { return _M_cur->_M_val; }
146 { return _M_cur == __it._M_cur; }
150 { return _M_cur != __it._M_cur; }
174 const _Node* _M_cur;
178 : _M_cur(__n), _M_ht(__tab) {
    [all...]
  /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/backward/
hashtable.h 121 _Node* _M_cur;
125 : _M_cur(__n), _M_ht(__tab) { }
128 : _M_cur(0), _M_ht(0) { }
132 { return _M_cur->_M_val; }
146 { return _M_cur == __it._M_cur; }
150 { return _M_cur != __it._M_cur; }
174 const _Node* _M_cur;
178 : _M_cur(__n), _M_ht(__tab) {
    [all...]
  /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/backward/
hashtable.h 121 _Node* _M_cur;
125 : _M_cur(__n), _M_ht(__tab) { }
128 : _M_cur(0), _M_ht(0) { }
132 { return _M_cur->_M_val; }
146 { return _M_cur == __it._M_cur; }
150 { return _M_cur != __it._M_cur; }
174 const _Node* _M_cur;
178 : _M_cur(__n), _M_ht(__tab) {
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/include/backward/
hashtable.h 121 _Node* _M_cur;
125 : _M_cur(__n), _M_ht(__tab) { }
128 : _M_cur(0), _M_ht(0) { }
132 { return _M_cur->_M_val; }
146 { return _M_cur == __it._M_cur; }
150 { return _M_cur != __it._M_cur; }
174 const _Node* _M_cur;
178 : _M_cur(__n), _M_ht(__tab) {
    [all...]
  /external/stlport/stlport/stl/
_deque.h 101 value_type* _M_cur;
107 : _M_cur(__x), _M_first(*__y),
110 _Deque_iterator_base() : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) {}
115 : _M_cur(__other._M_cur), _M_first(__other._M_first),
121 (_M_cur - _M_first) + (__x._M_last - __x._M_cur);
125 if (++_M_cur == _M_last) {
127 _M_cur = _M_first;
132 if (_M_cur == _M_first)
    [all...]
  /ndk/sources/cxx-stl/stlport/stlport/stl/
_deque.h 101 value_type* _M_cur;
107 : _M_cur(__x), _M_first(*__y),
110 _Deque_iterator_base() : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) {}
115 : _M_cur(__other._M_cur), _M_first(__other._M_first),
121 (_M_cur - _M_first) + (__x._M_last - __x._M_cur);
125 if (++_M_cur == _M_last) {
127 _M_cur = _M_first;
132 if (_M_cur == _M_first)
    [all...]
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/
stl_deque.h 111 _Tp* _M_cur;
117 : _M_cur(__x), _M_first(*__y),
121 : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) { }
124 : _M_cur(__x._M_cur), _M_first(__x._M_first),
129 { return *_M_cur; }
133 { return _M_cur; }
138 ++_M_cur;
139 if (_M_cur == _M_last)
142 _M_cur = _M_first
    [all...]
  /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/
stl_deque.h 111 _Tp* _M_cur;
117 : _M_cur(__x), _M_first(*__y),
121 : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) { }
124 : _M_cur(__x._M_cur), _M_first(__x._M_first),
129 { return *_M_cur; }
133 { return _M_cur; }
138 ++_M_cur;
139 if (_M_cur == _M_last)
142 _M_cur = _M_first
    [all...]
  /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/
_deque.h 101 value_type* _M_cur;
107 : _M_cur(__x), _M_first(*__y),
110 _Deque_iterator_base() : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) {}
115 : _M_cur(__other._M_cur), _M_first(__other._M_first),
121 (_M_cur - _M_first) + (__x._M_last - __x._M_cur);
125 if (++_M_cur == _M_last) {
127 _M_cur = _M_first;
132 if (_M_cur == _M_first)
    [all...]
  /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/
stl_deque.h 111 _Tp* _M_cur;
117 : _M_cur(__x), _M_first(*__y),
121 : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) { }
124 : _M_cur(__x._M_cur), _M_first(__x._M_first),
129 { return *_M_cur; }
133 { return _M_cur; }
138 ++_M_cur;
139 if (_M_cur == _M_last)
142 _M_cur = _M_first
    [all...]
  /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/
_deque.h 101 value_type* _M_cur;
107 : _M_cur(__x), _M_first(*__y),
110 _Deque_iterator_base() : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) {}
115 : _M_cur(__other._M_cur), _M_first(__other._M_first),
121 (_M_cur - _M_first) + (__x._M_last - __x._M_cur);
125 if (++_M_cur == _M_last) {
127 _M_cur = _M_first;
132 if (_M_cur == _M_first)
    [all...]

Completed in 2127 milliseconds

1 2