Searched refs:__cur (Results 1 - 4 of 4) sorted by relevance

/freebsd-11-stable/contrib/libstdc++/include/bits/
H A Dstl_uninitialized.h83 _ForwardIterator __cur = __result; local
86 for (; __first != __last; ++__first, ++__cur)
87 std::_Construct(&*__cur, *__first);
88 return __cur;
92 std::_Destroy(__result, __cur);
146 _ForwardIterator __cur = __first; local
149 for (; __cur != __last; ++__cur)
150 std::_Construct(&*__cur, __x);
154 std::_Destroy(__first, __cur);
191 _ForwardIterator __cur = __first; local
235 _ForwardIterator __cur = __result; local
261 _ForwardIterator __cur = __first; local
287 _ForwardIterator __cur = __first; local
[all...]
H A Dstl_bvector.h873 iterator __cur = begin(); local
874 for (; __first != __last && __cur != end(); ++__cur, ++__first)
875 *__cur = *__first;
877 _M_erase_at_end(__cur);
H A Dstl_deque.h531 _Tp** __cur; local
534 for (__cur = __nstart; __cur < __nfinish; ++__cur)
535 *__cur = this->_M_allocate_node();
539 _M_destroy_nodes(__nstart, __cur);
/freebsd-11-stable/contrib/libstdc++/include/ext/
H A Dhashtable.h538 for (const _Node* __cur = _M_buckets[__n]; __cur;
539 __cur = __cur->_M_next)
540 if (_M_equals(_M_get_key(__cur->_M_val), __key))
754 for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
755 if (_M_equals(_M_get_key(__cur
877 _Node* __cur = __first; local
914 _Node* __cur = _M_buckets[__n]; local
1039 _Node* __cur = _M_buckets[__n]; local
1064 _Node* __cur = _M_buckets[__n]; local
1086 _Node* __cur = _M_buckets[__i]; local
1109 const _Node* __cur = __ht._M_buckets[__i]; local
[all...]

Completed in 128 milliseconds