Home
last modified time | relevance | path

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

/haiku/headers/cpp/
H A Dropeimpl.h386 (_RopeLeaf* __r, const _CharT* __iter, size_t __len) in _S_leaf_concat_char_iter() argument
394 uninitialized_copy_n(__iter, __len, __new_data + __old_len); in _S_leaf_concat_char_iter()
410 (_RopeLeaf* __r, const _CharT* __iter, size_t __len) in _S_destr_leaf_concat_char_iter() argument
414 return _S_leaf_concat_char_iter(__r, __iter, __len); in _S_destr_leaf_concat_char_iter()
419 uninitialized_copy_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()
H A Dstl_rope.h1384 const _CharT* __iter, size_t __slen);
1389 const _CharT* __iter, size_t __slen)
1395 { return _S_concat_char_iter(__r, __iter, __slen); }
1516 const _CharT* __iter, size_t __slen);
1522 (_RopeLeaf* __r, const _CharT* __iter, size_t __slen);
1879 rope& append(const _CharT* __iter, size_t __n) {
1881 _S_destr_concat_char_iter(_M_tree_ptr, __iter, __n);
H A Dstl_algo.h2653 for (_ForwardIter __iter = __first2; __iter != __last2; ++__iter) in find_first_of() local
2654 if (*__first1 == *__iter) in find_first_of()
2665 for (_ForwardIter __iter = __first2; __iter != __last2; ++__iter) in find_first_of() local
2666 if (__comp(*__first1, *__iter)) in find_first_of()
H A Dstl_iterator.h465 typedef typename _Container::iterator __iter;
466 return insert_iterator<_Container>(__x, __iter(__i));