/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/parallel/ |
H A D | checkers.h | 58 unsigned long long __position = 1; local 66 __position++;
|
/prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.8/include/parallel/ |
H A D | 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/ |
H A D | 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/ |
H A D | compatibility-list.h | 51 hook(_List_node_base * const __position) throw ();
|
/prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
H A D | _tree.c | 432 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(iterator __position, argument 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 539 insert_equal(iterator __position, const _Value& __val) argument [all...] |
H A D | _bvector.h | 396 void _M_insert_aux(iterator __position, bool __x) { argument 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, argument 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, en 685 insert(iterator __position, bool __x = bool()) argument 713 insert(iterator __position, _InputIterator __first, _InputIterator __last) argument 719 insert(iterator __position, const_iterator __first, const_iterator __last) argument 741 insert(iterator __position, const bool* __first, const bool* __last) argument 763 _M_fill_insert(iterator __position, size_type __n, bool __x) argument 783 insert(iterator __position, size_type __n, bool __x) argument 790 erase(iterator __position) argument [all...] |
/prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
H A D | _tree.c | 432 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(iterator __position, argument 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 539 insert_equal(iterator __position, const _Value& __val) argument [all...] |
H A D | _bvector.h | 396 void _M_insert_aux(iterator __position, bool __x) { argument 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, argument 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, en 685 insert(iterator __position, bool __x = bool()) argument 713 insert(iterator __position, _InputIterator __first, _InputIterator __last) argument 719 insert(iterator __position, const_iterator __first, const_iterator __last) argument 741 insert(iterator __position, const bool* __first, const bool* __last) argument 763 _M_fill_insert(iterator __position, size_type __n, bool __x) argument 783 insert(iterator __position, size_type __n, bool __x) argument 790 erase(iterator __position) argument [all...] |
/prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
H A D | _tree.c | 432 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(iterator __position, argument 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 539 insert_equal(iterator __position, const _Value& __val) argument [all...] |
H A D | _bvector.h | 396 void _M_insert_aux(iterator __position, bool __x) { argument 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, argument 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, en 685 insert(iterator __position, bool __x = bool()) argument 713 insert(iterator __position, _InputIterator __first, _InputIterator __last) argument 719 insert(iterator __position, const_iterator __first, const_iterator __last) argument 741 insert(iterator __position, const bool* __first, const bool* __last) argument 763 _M_fill_insert(iterator __position, size_type __n, bool __x) argument 783 insert(iterator __position, size_type __n, bool __x) argument 790 erase(iterator __position) argument [all...] |
/prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/ |
H A D | _tree.c | 432 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(iterator __position, argument 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 539 insert_equal(iterator __position, const _Value& __val) argument [all...] |
H A D | _bvector.h | 396 void _M_insert_aux(iterator __position, bool __x) { argument 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, argument 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, en 685 insert(iterator __position, bool __x = bool()) argument 713 insert(iterator __position, _InputIterator __first, _InputIterator __last) argument 719 insert(iterator __position, const_iterator __first, const_iterator __last) argument 741 insert(iterator __position, const bool* __first, const bool* __last) argument 763 _M_fill_insert(iterator __position, size_type __n, bool __x) argument 783 insert(iterator __position, size_type __n, bool __x) argument 790 erase(iterator __position) argument [all...] |
/prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/ |
H A D | _tree.c | 432 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(iterator __position, argument 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 539 insert_equal(iterator __position, const _Value& __val) argument [all...] |
H A D | _bvector.h | 396 void _M_insert_aux(iterator __position, bool __x) { argument 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, argument 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, en 685 insert(iterator __position, bool __x = bool()) argument 713 insert(iterator __position, _InputIterator __first, _InputIterator __last) argument 719 insert(iterator __position, const_iterator __first, const_iterator __last) argument 741 insert(iterator __position, const bool* __first, const bool* __last) argument 763 _M_fill_insert(iterator __position, size_type __n, bool __x) argument 783 insert(iterator __position, size_type __n, bool __x) argument 790 erase(iterator __position) argument [all...] |
/prebuilts/ndk/9/sources/cxx-stl/stlport/stlport/stl/ |
H A D | _tree.c | 432 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(iterator __position, argument 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 539 insert_equal(iterator __position, const _Value& __val) argument [all...] |
H A D | _bvector.h | 396 void _M_insert_aux(iterator __position, bool __x) { argument 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, argument 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, en 685 insert(iterator __position, bool __x = bool()) argument 713 insert(iterator __position, _InputIterator __first, _InputIterator __last) argument 719 insert(iterator __position, const_iterator __first, const_iterator __last) argument 741 insert(iterator __position, const bool* __first, const bool* __last) argument 763 _M_fill_insert(iterator __position, size_type __n, bool __x) argument 783 insert(iterator __position, size_type __n, bool __x) argument 790 erase(iterator __position) argument [all...] |
/prebuilts/ndk/current/sources/cxx-stl/EH/stlport/stlport/stl/ |
H A D | _tree.c | 432 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(iterator __position, argument 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 539 insert_equal(iterator __position, const _Value& __val) argument [all...] |
H A D | _bvector.h | 396 void _M_insert_aux(iterator __position, bool __x) { argument 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, argument 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, en 685 insert(iterator __position, bool __x = bool()) argument 713 insert(iterator __position, _InputIterator __first, _InputIterator __last) argument 719 insert(iterator __position, const_iterator __first, const_iterator __last) argument 741 insert(iterator __position, const bool* __first, const bool* __last) argument 763 _M_fill_insert(iterator __position, size_type __n, bool __x) argument 783 insert(iterator __position, size_type __n, bool __x) argument 790 erase(iterator __position) argument [all...] |
/prebuilts/ndk/current/sources/cxx-stl/stlport/stlport/stl/ |
H A D | _tree.c | 432 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(iterator __position, argument 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 539 insert_equal(iterator __position, const _Value& __val) argument [all...] |
H A D | _bvector.h | 396 void _M_insert_aux(iterator __position, bool __x) { argument 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, argument 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, en 685 insert(iterator __position, bool __x = bool()) argument 713 insert(iterator __position, _InputIterator __first, _InputIterator __last) argument 719 insert(iterator __position, const_iterator __first, const_iterator __last) argument 741 insert(iterator __position, const bool* __first, const bool* __last) argument 763 _M_fill_insert(iterator __position, size_type __n, bool __x) argument 783 insert(iterator __position, size_type __n, bool __x) argument 790 erase(iterator __position) argument [all...] |
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/debug/ |
H A D | multimap.h | 218 insert(const_iterator __position, const value_type& __x) argument 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) argument 234 __glibcxx_check_insert(__position); 235 return iterator(_Base::insert(__position.base(), 251 erase(const_iterator __position) argument 253 __glibcxx_check_erase(__position); 254 this->_M_invalidate_if(_Equal(__position 259 erase(iterator __position) argument 263 erase(iterator __position) argument [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/debug/ |
H A D | multimap.h | 218 insert(const_iterator __position, const value_type& __x) argument 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) argument 234 __glibcxx_check_insert(__position); 235 return iterator(_Base::insert(__position.base(), 251 erase(const_iterator __position) argument 253 __glibcxx_check_erase(__position); 254 this->_M_invalidate_if(_Equal(__position 259 erase(iterator __position) argument 263 erase(iterator __position) argument [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/debug/ |
H A D | multimap.h | 218 insert(const_iterator __position, const value_type& __x) argument 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) argument 234 __glibcxx_check_insert(__position); 235 return iterator(_Base::insert(__position.base(), 251 erase(const_iterator __position) argument 253 __glibcxx_check_erase(__position); 254 this->_M_invalidate_if(_Equal(__position 259 erase(iterator __position) argument 263 erase(iterator __position) argument [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/debug/ |
H A D | multimap.h | 218 insert(const_iterator __position, const value_type& __x) argument 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) argument 234 __glibcxx_check_insert(__position); 235 return iterator(_Base::insert(__position.base(), 251 erase(const_iterator __position) argument 253 __glibcxx_check_erase(__position); 254 this->_M_invalidate_if(_Equal(__position 259 erase(iterator __position) argument 263 erase(iterator __position) argument [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/include/debug/ |
H A D | multimap.h | 218 insert(const_iterator __position, const value_type& __x) argument 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) argument 234 __glibcxx_check_insert(__position); 235 return iterator(_Base::insert(__position.base(), 251 erase(const_iterator __position) argument 253 __glibcxx_check_erase(__position); 254 this->_M_invalidate_if(_Equal(__position 259 erase(iterator __position) argument 263 erase(iterator __position) argument [all...] |