Home
last modified time | relevance | path

Searched refs:__cur (Results 1 – 21 of 21) sorted by relevance

/openbsd/gnu/gcc/libstdc++-v3/include/bits/
H A Dstl_uninitialized.h88 return __cur; in __uninitialized_copy_aux()
92 std::_Destroy(__result, __cur); in __uninitialized_copy_aux()
149 for (; __cur != __last; ++__cur) in __uninitialized_fill_aux()
150 std::_Construct(&*__cur, __x); in __uninitialized_fill_aux()
154 std::_Destroy(__first, __cur); in __uninitialized_fill_aux()
194 for (; __n > 0; --__n, ++__cur) in __uninitialized_fill_n_aux()
195 std::_Construct(&*__cur, __x); in __uninitialized_fill_n_aux()
199 std::_Destroy(__first, __cur); in __uninitialized_fill_n_aux()
240 return __cur; in __uninitialized_copy_a()
264 for (; __cur != __last; ++__cur) in __uninitialized_fill_a()
[all …]
H A Ddeque.tcc169 iterator __cur = begin(); in _M_assign_aux() local
170 for (; __first != __last && __cur != end(); ++__cur, ++__first) in _M_assign_aux()
171 *__cur = *__first; in _M_assign_aux()
173 _M_erase_at_end(__cur); in _M_assign_aux()
225 _Map_pointer __cur; in _M_fill_initialize() local
228 for (__cur = this->_M_impl._M_start._M_node; in _M_fill_initialize()
229 __cur < this->_M_impl._M_finish._M_node; in _M_fill_initialize()
230 ++__cur) in _M_fill_initialize()
231 std::__uninitialized_fill_a(*__cur, *__cur + _S_buffer_size(), in _M_fill_initialize()
239 std::_Destroy(this->_M_impl._M_start, iterator(*__cur, __cur), in _M_fill_initialize()
H A Dlist.tcc73 _Node* __cur = static_cast<_Node*>(this->_M_impl._M_node._M_next); in _GLIBCXX_BEGIN_NESTED_NAMESPACE() local
74 while (__cur != &this->_M_impl._M_node) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
76 _Node* __tmp = __cur; in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
77 __cur = static_cast<_Node*>(__cur->_M_next); in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
H A Dvector.tcc197 pointer __cur(this->_M_impl._M_start); in _M_assign_aux() local
198 for (; __first != __last && __cur != this->_M_impl._M_finish; in _M_assign_aux()
199 ++__cur, ++__first) in _M_assign_aux()
200 *__cur = *__first; in _M_assign_aux()
202 _M_erase_at_end(__cur); in _M_assign_aux()
H A Dstl_bvector.h861 iterator __cur = begin(); in _GLIBCXX_BEGIN_NESTED_NAMESPACE() local
862 for (; __first != __last && __cur != end(); ++__cur, ++__first) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
863 *__cur = *__first; in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
865 _M_erase_at_end(__cur); in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
H A Dstl_deque.h522 _Tp** __cur; in _M_create_nodes() local
525 for (__cur = __nstart; __cur < __nfinish; ++__cur) in _M_create_nodes()
526 *__cur = this->_M_allocate_node(); in _M_create_nodes()
530 _M_destroy_nodes(__nstart, __cur); in _M_create_nodes()
/openbsd/gnu/lib/libstdc++/libstdc++/include/ext/
H A Dstl_hashtable.h371 for (_Node* __cur = _M_buckets[__bucket]; __cur; __cur = __cur->_M_next)
468 for (const _Node* __cur = _M_buckets[__n]; __cur; __cur = __cur->_M_next)
658 for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
677 for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
702 for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
723 for (_Node* __cur = __first->_M_next; __cur; __cur = __cur->_M_next)
749 __cur;
750 __cur = __cur->_M_next)
918 __cur = __next, __next = __cur->_M_next)
969 if (__cur) {
[all …]
H A Dslist290 __cur = (_Slist_node<_Tp>*) __cur->_M_next;
762 __cur = __cur->_M_next;
764 if (__cur->_M_next)
774 while (__cur && __cur->_M_next) {
778 __cur = __cur->_M_next;
786 if (__cur) {
792 __cur = __cur->_M_next;
845 while (__cur->_M_next) {
849 __cur = __cur->_M_next;
857 if (__cur) {
[all …]
H A Dmemory83 _ForwardIter __cur = __result;
85 for ( ; __count > 0 ; --__count, ++__first, ++__cur)
86 std::_Construct(&*__cur, *__first);
87 return pair<_InputIter, _ForwardIter>(__first, __cur);
91 std::_Destroy(__result, __cur);
/openbsd/gnu/gcc/libstdc++-v3/include/ext/
H A Dhashtable.h537 for (const _Node* __cur = _M_buckets[__n]; __cur;
538 __cur = __cur->_M_next)
753 for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
772 for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
799 for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
823 for (_Node* __cur = __first->_M_next; __cur;
824 __cur = __cur->_M_next)
850 for (const _Node* __cur = __first->_M_next; __cur;
851 __cur = __cur->_M_next)
1046 __cur = __next, __next = __cur->_M_next)
[all …]
H A Dslist281 __cur = (_Slist_node<_Tp>*) __cur->_M_next;
852 __cur = __cur->_M_next;
854 if (__cur->_M_next)
865 while (__cur && __cur->_M_next)
870 __cur = __cur->_M_next;
879 if (__cur)
887 __cur = __cur->_M_next;
947 while (__cur->_M_next)
952 __cur = __cur->_M_next;
962 if (__cur)
[all …]
H A Dmemory81 _ForwardIter __cur = __result;
84 for (; __count > 0 ; --__count, ++__first, ++__cur)
85 std::_Construct(&*__cur, *__first);
86 return pair<_InputIter, _ForwardIter>(__first, __cur);
90 std::_Destroy(__result, __cur);
140 _ForwardIter __cur = __result;
143 for (; __count > 0 ; --__count, ++__first, ++__cur)
144 __alloc.construct(&*__cur, *__first);
145 return pair<_InputIter, _ForwardIter>(__first, __cur);
149 std::_Destroy(__result, __cur, __alloc);
/openbsd/gnu/lib/libstdc++/libstdc++/include/bits/
H A Dstl_uninitialized.h87 _Construct(&*__cur, *__first); in __uninitialized_copy_aux()
88 return __cur; in __uninitialized_copy_aux()
92 _Destroy(__result, __cur); in __uninitialized_copy_aux()
143 _ForwardIter __cur = __first; in __uninitialized_fill_aux() local
145 for ( ; __cur != __last; ++__cur) in __uninitialized_fill_aux()
146 _Construct(&*__cur, __x); in __uninitialized_fill_aux()
150 _Destroy(__first, __cur); in __uninitialized_fill_aux()
190 for ( ; __n > 0; --__n, ++__cur) in __uninitialized_fill_n_aux()
191 _Construct(&*__cur, __x); in __uninitialized_fill_n_aux()
192 return __cur; in __uninitialized_fill_n_aux()
[all …]
H A Ddeque.tcc193 iterator __cur = begin(); in _M_assign_aux() local
194 for ( ; __first != __last && __cur != end(); ++__cur, ++__first) in _M_assign_aux()
195 *__cur = *__first; in _M_assign_aux()
197 erase(__cur, end()); in _M_assign_aux()
244 _Map_pointer __cur; in _M_fill_initialize() local
247 for (__cur = _M_start._M_node; __cur < _M_finish._M_node; ++__cur) in _M_fill_initialize()
248 uninitialized_fill(*__cur, *__cur + _S_buffer_size(), __value); in _M_fill_initialize()
253 _Destroy(_M_start, iterator(*__cur, __cur)); in _M_fill_initialize()
H A Dlist.tcc72 _Node* __cur = static_cast<_Node*>(_M_node->_M_next); in __clear() local
73 while (__cur != _M_node) in __clear()
75 _Node* __tmp = __cur; in __clear()
76 __cur = static_cast<_Node*>(__cur->_M_next); in __clear()
H A Dvector.tcc179 iterator __cur(begin()); in _M_assign_aux() local
180 for ( ; __first != __last && __cur != end(); ++__cur, ++__first) in _M_assign_aux()
181 *__cur = *__first; in _M_assign_aux()
183 erase(__cur, end()); in _M_assign_aux()
H A Dstl_bvector.h583 iterator __cur = begin(); in _M_assign_aux() local
584 for ( ; __first != __last && __cur != end(); ++__cur, ++__first) in _M_assign_aux()
585 *__cur = *__first; in _M_assign_aux()
587 erase(__cur, end()); in _M_assign_aux()
H A Dstl_deque.h530 _Tp** __cur; in _M_create_nodes() local
533 for (__cur = __nstart; __cur < __nfinish; ++__cur) in _M_create_nodes()
534 *__cur = _M_allocate_node(); in _M_create_nodes()
538 _M_destroy_nodes(__nstart, __cur); in _M_create_nodes()
/openbsd/gnu/llvm/libcxx/include/experimental/
H A Dfunctional249 _RandomAccessIterator2 __cur = __f;
254 while (__cur <= __last)
263 return std::make_pair(__cur, __cur + __pattern_length_);
267 difference_type __k = __skip[__cur [ __j - 1 ]];
270 __cur += __m;
272 __cur += __suffix[ __j ];
397 _RandomAccessIterator2 __cur = __f;
401 while (__cur <= __last)
405 while (__pred_(__first_[__j-1], __cur[__j-1]))
410 return std::make_pair(__cur, __cur + __pattern_length_);
[all …]
/openbsd/gnu/llvm/libcxx/include/__ranges/
H A Dlazy_split_view.h316 const auto& __cur = __i_.__current();
317 if (__cur == __end)
322 return *__cur == *__pcur;
325 auto __cur = __i_.__current();
326 if (__cur == __end)
332 if (*__cur != *__pcur)
336 } while (++__cur != __end);
/openbsd/gnu/gcc/libstdc++-v3/include/tr1/
H A Dhashtable974 _Node* __cur = *__b;
975 if (__cur == __p)
976 *__b = __cur->_M_next;
979 _Node* __next = __cur->_M_next;
982 __cur = __next;
983 __next = __cur->_M_next;
985 __cur->_M_next = __next->_M_next;