Searched refs:__position (Results 1 - 3 of 3) sorted by relevance
/ndk/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...] |
H A D | _list.c | 48 _List_global<_Dummy>::_Transfer(_List_node_base* __position, argument 50 if (__position != __last) { 52 __last->_M_prev->_M_next = __position; 54 __position->_M_prev->_M_next = __first; 57 _Node_base* __tmp = __position->_M_prev; 58 __position->_M_prev = __last->_M_prev;
|
Completed in 87 milliseconds