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

1 2 3

  /ndk/tests/device/test-stlport_shared-exception/jni/
alias2.cpp 7 int _M_cur;
11 _Deque_iterator() : _M_cur(0), _M_node(0) {}
13 : _M_cur(__x._M_cur),
43 _M_start._M_cur = yy;
  /ndk/tests/device/test-stlport_static-exception/jni/
alias2.cpp 7 int _M_cur;
11 _Deque_iterator() : _M_cur(0), _M_node(0) {}
13 : _M_cur(__x._M_cur),
43 _M_start._M_cur = yy;
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/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...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/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.11-4.8/x86_64-linux/include/c++/4.8/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-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/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++/4.4.3/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++/4.6/include/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...]
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/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/8/sources/cxx-stl/gnu-libstdc++/4.7/include/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/9/sources/cxx-stl/gnu-libstdc++/4.6/include/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...]
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/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/9/sources/cxx-stl/gnu-libstdc++/4.7/include/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/9/sources/cxx-stl/gnu-libstdc++/4.8/include/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/9/sources/cxx-stl/gnu-libstdc++/4.9/include/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.11-4.6/x86_64-linux/include/c++/4.6/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.11-4.8/x86_64-linux/include/c++/4.8/backward/
hashtable.h 122 _Node* _M_cur;
126 : _M_cur(__n), _M_ht(__tab) { }
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) { }
183 : _M_cur(__it._M_cur), _M_ht(__it._M_ht) {
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/
hashtable_policy.h 207 __node_type* _M_cur;
210 : _M_cur(__p) { }
214 { _M_cur = _M_cur->_M_next(); }
221 { return __x._M_cur == __y._M_cur; }
227 { return __x._M_cur != __y._M_cur; }
258 { return this->_M_cur->_M_v; }
262 { return std::__addressof(this->_M_cur->_M_v);
    [all...]
stl_deque.h 123 _Tp* _M_cur;
129 : _M_cur(__x), _M_first(*__y),
133 : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) { }
136 : _M_cur(__x._M_cur), _M_first(__x._M_first),
141 { return *_M_cur; }
145 { return _M_cur; }
150 ++_M_cur;
151 if (_M_cur == _M_last)
154 _M_cur = _M_first
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/backward/
hashtable.h 122 _Node* _M_cur;
126 : _M_cur(__n), _M_ht(__tab) { }
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) { }
183 : _M_cur(__it._M_cur), _M_ht(__it._M_ht) {
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/
hashtable_policy.h 207 __node_type* _M_cur;
210 : _M_cur(__p) { }
214 { _M_cur = _M_cur->_M_next(); }
221 { return __x._M_cur == __y._M_cur; }
227 { return __x._M_cur != __y._M_cur; }
258 { return this->_M_cur->_M_v; }
262 { return std::__addressof(this->_M_cur->_M_v);
    [all...]
stl_deque.h 123 _Tp* _M_cur;
129 : _M_cur(__x), _M_first(*__y),
133 : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) { }
136 : _M_cur(__x._M_cur), _M_first(__x._M_first),
141 { return *_M_cur; }
145 { return _M_cur; }
150 ++_M_cur;
151 if (_M_cur == _M_last)
154 _M_cur = _M_first
    [all...]

Completed in 498 milliseconds

1 2 3