| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/parallel/ |
| checkers.h | 58 unsigned long long __position = 1; local
66 __position++;
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/ |
| compatibility-list.h | 51 hook(_List_node_base * const __position) throw ();
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/ |
| compatibility-list.h | 51 hook(_List_node_base * const __position) throw ();
|
| /external/stlport/stlport/stl/ |
| _tree.c | 432 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(iterator __position,
434 if (__position._M_node == this->_M_header._M_data._M_left) { // begin()
440 if (_M_key_compare(_KeyOfValue()(__val), _S_key(__position._M_node))) {
441 return _M_insert(__position._M_node, __val, __position._M_node);
445 bool __comp_pos_v = _M_key_compare( _S_key(__position._M_node), _KeyOfValue()(__val) );
448 return __position;
453 iterator __after = __position;
456 // Check for only one member -- in that case, __position points to itself,
462 return _M_insert(__position._M_node, __val, 0, __position._M_node)
[all...] |
| _bvector.h | 396 void _M_insert_aux(iterator __position, bool __x) {
398 _STLP_PRIV __copy_backward(__position, this->_M_finish, this->_M_finish + 1,
400 *__position = __x;
406 iterator __i = _STLP_STD::copy(begin(), __position, iterator(__q, 0));
408 this->_M_finish = _STLP_STD::copy(__position, end(), __i);
445 void _M_insert_range(iterator __position,
451 _STLP_PRIV __copy_backward(__position, end(), this->_M_finish + difference_type(__n),
453 _STLP_STD::copy(__first, __last, __position);
459 iterator __i = _STLP_STD::copy(begin(), __position, iterator(__q, 0));
461 this->_M_finish = _STLP_STD::copy(__position, end(), __i)
[all...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.c | 432 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(iterator __position,
434 if (__position._M_node == this->_M_header._M_data._M_left) { // begin()
440 if (_M_key_compare(_KeyOfValue()(__val), _S_key(__position._M_node))) {
441 return _M_insert(__position._M_node, __val, __position._M_node);
445 bool __comp_pos_v = _M_key_compare( _S_key(__position._M_node), _KeyOfValue()(__val) );
448 return __position;
453 iterator __after = __position;
456 // Check for only one member -- in that case, __position points to itself,
462 return _M_insert(__position._M_node, __val, 0, __position._M_node)
[all...] |
| _bvector.h | 396 void _M_insert_aux(iterator __position, bool __x) {
398 _STLP_PRIV __copy_backward(__position, this->_M_finish, this->_M_finish + 1,
400 *__position = __x;
406 iterator __i = _STLP_STD::copy(begin(), __position, iterator(__q, 0));
408 this->_M_finish = _STLP_STD::copy(__position, end(), __i);
445 void _M_insert_range(iterator __position,
451 _STLP_PRIV __copy_backward(__position, end(), this->_M_finish + difference_type(__n),
453 _STLP_STD::copy(__first, __last, __position);
459 iterator __i = _STLP_STD::copy(begin(), __position, iterator(__q, 0));
461 this->_M_finish = _STLP_STD::copy(__position, end(), __i)
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.c | 432 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(iterator __position,
434 if (__position._M_node == this->_M_header._M_data._M_left) { // begin()
440 if (_M_key_compare(_KeyOfValue()(__val), _S_key(__position._M_node))) {
441 return _M_insert(__position._M_node, __val, __position._M_node);
445 bool __comp_pos_v = _M_key_compare( _S_key(__position._M_node), _KeyOfValue()(__val) );
448 return __position;
453 iterator __after = __position;
456 // Check for only one member -- in that case, __position points to itself,
462 return _M_insert(__position._M_node, __val, 0, __position._M_node)
[all...] |
| _bvector.h | 396 void _M_insert_aux(iterator __position, bool __x) {
398 _STLP_PRIV __copy_backward(__position, this->_M_finish, this->_M_finish + 1,
400 *__position = __x;
406 iterator __i = _STLP_STD::copy(begin(), __position, iterator(__q, 0));
408 this->_M_finish = _STLP_STD::copy(__position, end(), __i);
445 void _M_insert_range(iterator __position,
451 _STLP_PRIV __copy_backward(__position, end(), this->_M_finish + difference_type(__n),
453 _STLP_STD::copy(__first, __last, __position);
459 iterator __i = _STLP_STD::copy(begin(), __position, iterator(__q, 0));
461 this->_M_finish = _STLP_STD::copy(__position, end(), __i)
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.c | 432 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(iterator __position,
434 if (__position._M_node == this->_M_header._M_data._M_left) { // begin()
440 if (_M_key_compare(_KeyOfValue()(__val), _S_key(__position._M_node))) {
441 return _M_insert(__position._M_node, __val, __position._M_node);
445 bool __comp_pos_v = _M_key_compare( _S_key(__position._M_node), _KeyOfValue()(__val) );
448 return __position;
453 iterator __after = __position;
456 // Check for only one member -- in that case, __position points to itself,
462 return _M_insert(__position._M_node, __val, 0, __position._M_node)
[all...] |
| _bvector.h | 396 void _M_insert_aux(iterator __position, bool __x) {
398 _STLP_PRIV __copy_backward(__position, this->_M_finish, this->_M_finish + 1,
400 *__position = __x;
406 iterator __i = _STLP_STD::copy(begin(), __position, iterator(__q, 0));
408 this->_M_finish = _STLP_STD::copy(__position, end(), __i);
445 void _M_insert_range(iterator __position,
451 _STLP_PRIV __copy_backward(__position, end(), this->_M_finish + difference_type(__n),
453 _STLP_STD::copy(__first, __last, __position);
459 iterator __i = _STLP_STD::copy(begin(), __position, iterator(__q, 0));
461 this->_M_finish = _STLP_STD::copy(__position, end(), __i)
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.c | 432 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(iterator __position,
434 if (__position._M_node == this->_M_header._M_data._M_left) { // begin()
440 if (_M_key_compare(_KeyOfValue()(__val), _S_key(__position._M_node))) {
441 return _M_insert(__position._M_node, __val, __position._M_node);
445 bool __comp_pos_v = _M_key_compare( _S_key(__position._M_node), _KeyOfValue()(__val) );
448 return __position;
453 iterator __after = __position;
456 // Check for only one member -- in that case, __position points to itself,
462 return _M_insert(__position._M_node, __val, 0, __position._M_node)
[all...] |
| _bvector.h | 396 void _M_insert_aux(iterator __position, bool __x) {
398 _STLP_PRIV __copy_backward(__position, this->_M_finish, this->_M_finish + 1,
400 *__position = __x;
406 iterator __i = _STLP_STD::copy(begin(), __position, iterator(__q, 0));
408 this->_M_finish = _STLP_STD::copy(__position, end(), __i);
445 void _M_insert_range(iterator __position,
451 _STLP_PRIV __copy_backward(__position, end(), this->_M_finish + difference_type(__n),
453 _STLP_STD::copy(__first, __last, __position);
459 iterator __i = _STLP_STD::copy(begin(), __position, iterator(__q, 0));
461 this->_M_finish = _STLP_STD::copy(__position, end(), __i)
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.c | 432 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(iterator __position,
434 if (__position._M_node == this->_M_header._M_data._M_left) { // begin()
440 if (_M_key_compare(_KeyOfValue()(__val), _S_key(__position._M_node))) {
441 return _M_insert(__position._M_node, __val, __position._M_node);
445 bool __comp_pos_v = _M_key_compare( _S_key(__position._M_node), _KeyOfValue()(__val) );
448 return __position;
453 iterator __after = __position;
456 // Check for only one member -- in that case, __position points to itself,
462 return _M_insert(__position._M_node, __val, 0, __position._M_node)
[all...] |
| _bvector.h | 396 void _M_insert_aux(iterator __position, bool __x) {
398 _STLP_PRIV __copy_backward(__position, this->_M_finish, this->_M_finish + 1,
400 *__position = __x;
406 iterator __i = _STLP_STD::copy(begin(), __position, iterator(__q, 0));
408 this->_M_finish = _STLP_STD::copy(__position, end(), __i);
445 void _M_insert_range(iterator __position,
451 _STLP_PRIV __copy_backward(__position, end(), this->_M_finish + difference_type(__n),
453 _STLP_STD::copy(__first, __last, __position);
459 iterator __i = _STLP_STD::copy(begin(), __position, iterator(__q, 0));
461 this->_M_finish = _STLP_STD::copy(__position, end(), __i)
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/ |
| _tree.c | 432 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(iterator __position,
434 if (__position._M_node == this->_M_header._M_data._M_left) { // begin()
440 if (_M_key_compare(_KeyOfValue()(__val), _S_key(__position._M_node))) {
441 return _M_insert(__position._M_node, __val, __position._M_node);
445 bool __comp_pos_v = _M_key_compare( _S_key(__position._M_node), _KeyOfValue()(__val) );
448 return __position;
453 iterator __after = __position;
456 // Check for only one member -- in that case, __position points to itself,
462 return _M_insert(__position._M_node, __val, 0, __position._M_node)
[all...] |
| _bvector.h | 396 void _M_insert_aux(iterator __position, bool __x) {
398 _STLP_PRIV __copy_backward(__position, this->_M_finish, this->_M_finish + 1,
400 *__position = __x;
406 iterator __i = _STLP_STD::copy(begin(), __position, iterator(__q, 0));
408 this->_M_finish = _STLP_STD::copy(__position, end(), __i);
445 void _M_insert_range(iterator __position,
451 _STLP_PRIV __copy_backward(__position, end(), this->_M_finish + difference_type(__n),
453 _STLP_STD::copy(__first, __last, __position);
459 iterator __i = _STLP_STD::copy(begin(), __position, iterator(__q, 0));
461 this->_M_finish = _STLP_STD::copy(__position, end(), __i)
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
| stl_list.h | 87 hook(_List_node_base * const __position);
963 emplace(iterator __position, _Args&&... __args);
978 insert(iterator __position, const value_type& __x);
993 insert(iterator __position, value_type&& __x)
994 { return emplace(__position, std::move(__x)); }
1027 insert(iterator __position, size_type __n, const value_type& __x)
1030 splice(__position, __tmp);
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_list.h | 87 hook(_List_node_base * const __position);
963 emplace(iterator __position, _Args&&... __args);
978 insert(iterator __position, const value_type& __x);
993 insert(iterator __position, value_type&& __x)
994 { return emplace(__position, std::move(__x)); }
1027 insert(iterator __position, size_type __n, const value_type& __x)
1030 splice(__position, __tmp);
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_list.h | 87 hook(_List_node_base * const __position);
963 emplace(iterator __position, _Args&&... __args);
978 insert(iterator __position, const value_type& __x);
993 insert(iterator __position, value_type&& __x)
994 { return emplace(__position, std::move(__x)); }
1027 insert(iterator __position, size_type __n, const value_type& __x)
1030 splice(__position, __tmp);
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_list.h | 87 hook(_List_node_base * const __position);
963 emplace(iterator __position, _Args&&... __args);
978 insert(iterator __position, const value_type& __x);
993 insert(iterator __position, value_type&& __x)
994 { return emplace(__position, std::move(__x)); }
1027 insert(iterator __position, size_type __n, const value_type& __x)
1030 splice(__position, __tmp);
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/debug/ |
| map.h | 237 insert(const_iterator __position, const value_type& __x)
239 insert(iterator __position, const value_type& __x)
242 __glibcxx_check_insert(__position);
243 return iterator(_Base::insert(__position.base(), __x), this);
251 insert(const_iterator __position, _Pair&& __x)
253 __glibcxx_check_insert(__position);
254 return iterator(_Base::insert(__position.base(),
270 erase(const_iterator __position)
272 __glibcxx_check_erase(__position);
273 this->_M_invalidate_if(_Equal(__position.base()))
[all...] |
| multimap.h | 218 insert(const_iterator __position, const value_type& __x)
220 insert(iterator __position, const value_type& __x)
223 __glibcxx_check_insert(__position);
224 return iterator(_Base::insert(__position.base(), __x), this);
232 insert(const_iterator __position, _Pair&& __x)
234 __glibcxx_check_insert(__position);
235 return iterator(_Base::insert(__position.base(),
251 erase(const_iterator __position)
253 __glibcxx_check_erase(__position);
254 this->_M_invalidate_if(_Equal(__position.base()))
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/debug/ |
| map.h | 237 insert(const_iterator __position, const value_type& __x)
239 insert(iterator __position, const value_type& __x)
242 __glibcxx_check_insert(__position);
243 return iterator(_Base::insert(__position.base(), __x), this);
251 insert(const_iterator __position, _Pair&& __x)
253 __glibcxx_check_insert(__position);
254 return iterator(_Base::insert(__position.base(),
270 erase(const_iterator __position)
272 __glibcxx_check_erase(__position);
273 this->_M_invalidate_if(_Equal(__position.base()))
[all...] |
| multimap.h | 218 insert(const_iterator __position, const value_type& __x)
220 insert(iterator __position, const value_type& __x)
223 __glibcxx_check_insert(__position);
224 return iterator(_Base::insert(__position.base(), __x), this);
232 insert(const_iterator __position, _Pair&& __x)
234 __glibcxx_check_insert(__position);
235 return iterator(_Base::insert(__position.base(),
251 erase(const_iterator __position)
253 __glibcxx_check_erase(__position);
254 this->_M_invalidate_if(_Equal(__position.base()))
[all...] |
