| /haiku-buildtools/gcc/libstdc++-v3/include/parallel/ |
| H A D | unique_copy.h | 98 for (_IIter __iter = __first + __begin; __iter < __first + __end;
99 ++__iter)
101 if (!__binary_pred(*__iter, *(__iter - 1)))
104 *__out++ = *__iter;
113 for (_IIter __iter = __first + __begin; __iter < __first + __end;
114 ++__iter)
116 if (!__binary_pred(*__iter, *(__ite
[all...] |
| /haiku-buildtools/gcc/libstdc++-v3/src/c++98/ |
| H A D | bitmap_allocator.cc | 113 iterator __iter = __free_list.begin(); local
114 while (__iter != __free_list.end())
116 ::operator delete((void*)*__iter);
117 ++__iter;
|
| /haiku-buildtools/gcc/libstdc++-v3/src/c++11/ |
| H A D | debug.cc | 61 __gnu_debug::_Safe_iterator_base* __iter; local
62 for (__iter = __rhs_its; __iter; __iter = __iter->_M_next)
63 __iter->_M_sequence = &__rhs;
64 for (__iter = __lhs_its; __iter; __iter = __iter
91 detach_all(__gnu_debug::_Safe_iterator_base* __iter) argument
[all...] |
| /haiku-buildtools/gcc/libstdc++-v3/include/experimental/ |
| H A D | fs_dir.h | 238 begin(directory_iterator __iter) noexcept
239 { return __iter; }
332 begin(recursive_directory_iterator __iter) noexcept
333 { return __iter; }
|
| H A D | fs_path.h | 698 iterator(const path* __path, path::_List::const_iterator __iter) argument
699 : _M_path(__path), _M_cur(__iter), _M_at_end()
|
| /haiku-buildtools/gcc/libstdc++-v3/include/bits/ |
| H A D | hashtable_policy.h | 1444 _Local_iterator_base(const _Local_iterator_base& __iter) argument
1445 : _M_cur(__iter._M_cur), _M_bucket(__iter._M_bucket),
1446 _M_bucket_count(__iter._M_bucket_count)
1449 _M_init(*__iter._M_h());
1453 operator=(const _Local_iterator_base& __iter) argument
1457 _M_cur = __iter._M_cur;
1458 _M_bucket = __iter._M_bucket;
1459 _M_bucket_count = __iter._M_bucket_count;
1461 _M_init(*__iter
[all...] |
| H A D | forward_list.h | 206 _Fwd_list_const_iterator(const iterator& __iter) noexcept
207 : _M_node(__iter._M_node) { }
|
| H A D | stl_algo.h | 3850 for (_ForwardIterator __iter = __first2; __iter != __last2; ++__iter)
3851 if (*__first1 == *__iter)
3892 for (_ForwardIterator __iter = __first2; __iter != __last2; ++__iter)
3893 if (__comp(*__first1, *__iter))
|
| H A D | stl_deque.h | 118 using __iter = _Deque_iterator<_Tp, _CvTp&, __ptr_to<_CvTp>>;
120 typedef __iter<_Tp> iterator;
121 typedef __iter<const _Tp> const_iterator;
|
| /haiku-buildtools/legacy/gcc/libstdc++/stl/ |
| 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));
|
| /haiku-buildtools/gcc/libstdc++-v3/include/ext/ |
| H A D | ropeimpl.h | 428 _S_leaf_concat_char_iter(_RopeLeaf* __r, const _CharT* __iter, size_t __len) argument
436 uninitialized_copy_n(__iter, __len, __new_data + __old_len);
457 _S_destr_leaf_concat_char_iter(_RopeLeaf* __r, const _CharT* __iter, argument
461 return _S_leaf_concat_char_iter(__r, __iter, __len);
467 uninitialized_copy_n(__iter, __len, __r->_M_data + __old_len);
481 _RopeLeaf* __result = _S_leaf_concat_char_iter(__r, __iter, __len);
|