Searched refs:__iter (Results 1 - 4 of 4) sorted by relevance
/haiku/headers/cpp/ |
H A D | ropeimpl.h | 386 (_RopeLeaf* __r, const _CharT* __iter, size_t __len) 394 uninitialized_copy_n(__iter, __len, __new_data + __old_len); 410 (_RopeLeaf* __r, const _CharT* __iter, size_t __len) 414 return _S_leaf_concat_char_iter(__r, __iter, __len); 419 uninitialized_copy_n(__iter, __len, __r->_M_data + __old_len); 432 _RopeLeaf* __result = _S_leaf_concat_char_iter(__r, __iter, __len); 385 _S_leaf_concat_char_iter(_RopeLeaf* __r, const _CharT* __iter, size_t __len) argument 409 _S_destr_leaf_concat_char_iter(_RopeLeaf* __r, const _CharT* __iter, size_t __len) argument
|
H A D | stl_rope.h | 1384 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) { argument 1881 _S_destr_concat_char_iter(_M_tree_ptr, __iter, __n); 1388 _S_destr_concat_char_iter(_RopeRep* __r, const _CharT* __iter, size_t __slen) argument
|
H A D | stl_algo.h | 2653 for (_ForwardIter __iter = __first2; __iter != __last2; ++__iter) 2654 if (*__first1 == *__iter) 2665 for (_ForwardIter __iter = __first2; __iter != __last2; ++__iter) 2666 if (__comp(*__first1, *__iter))
|
H A D | stl_iterator.h | 465 typedef typename _Container::iterator __iter; typedef 466 return insert_iterator<_Container>(__x, __iter(__i));
|
Completed in 108 milliseconds