Home
last modified time | relevance | path

Searched refs:__iter (Results 1 – 4 of 4) sorted by relevance

/ndk/sources/cxx-stl/stlport/stlport/stl/
D_algobase.c352 for (_ForwardIter __iter = __first2; __iter != __last2; ++__iter) {
353 if (__comp(*__first1, *__iter)) {
D_iterator.h251 typedef typename _Container::iterator __iter; in inserter() typedef
252 return insert_iterator<_Container>(__x, __iter(__i)); in inserter()
D_rope.c378 _RopeLeaf* __r, const _CharT* __iter, size_t __len) { in _S_leaf_concat_char_iter() argument
384 _STLP_PRIV __ucopy_n(__iter, __len, __new_data + __old_len); in _S_leaf_concat_char_iter()
413 rope<_CharT,_Alloc>::_S_destr_leaf_concat_char_iter (_RopeLeaf* __r, const _CharT* __iter, size_t _… in _S_destr_leaf_concat_char_iter() argument
417 return _S_leaf_concat_char_iter(__r, __iter, __len); in _S_destr_leaf_concat_char_iter()
424 _STLP_PRIV __ucopy_n(__iter, __len, __r->_M_data + __old_len); in _S_destr_leaf_concat_char_iter()
432 _RopeLeaf* __result = _S_leaf_concat_char_iter(__r, __iter, __len); in _S_destr_leaf_concat_char_iter()
D_rope.h1166 const _CharT* __iter, size_t __slen);
1171 const _CharT* __iter, size_t __slen);
1260 const _CharT* __iter, size_t __slen);
1265 (_RopeLeaf* __r, const _CharT* __iter, size_t __slen);
1661 _Self& append(const _CharT* __iter, size_t __n) {
1662 _M_reset(_S_destr_concat_char_iter(_M_tree_ptr._M_data, __iter, __n));