Home
last modified time | relevance | path

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

/haiku/headers/cpp/
H A Dstl_uninitialized.h55 _ForwardIter __cur = __result; in __uninitialized_copy_aux() local
57 for ( ; __first != __last; ++__first, ++__cur) in __uninitialized_copy_aux()
58 construct(&*__cur, *__first); in __uninitialized_copy_aux()
59 return __cur; in __uninitialized_copy_aux()
61 __STL_UNWIND(destroy(__result, __cur)); in __uninitialized_copy_aux()
105 _ForwardIter __cur = __result; in __uninitialized_copy_n() local
107 for ( ; __count > 0 ; --__count, ++__first, ++__cur) in __uninitialized_copy_n()
108 construct(&*__cur, *__first); in __uninitialized_copy_n()
109 return pair<_InputIter, _ForwardIter>(__first, __cur); in __uninitialized_copy_n()
111 __STL_UNWIND(destroy(__result, __cur)); in __uninitialized_copy_n()
[all …]
H A Dstl_hashtable.h349 for (_Node* __cur = _M_buckets[__bucket]; __cur; __cur = __cur->_M_next)
485 for (const _Node* __cur = _M_buckets[__n]; __cur; __cur = __cur->_M_next)
486 if (_M_equals(_M_get_key(__cur->_M_val), __key))
705 for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
706 if (_M_equals(_M_get_key(__cur->_M_val), _M_get_key(__obj)))
707 return pair<iterator, bool>(iterator(__cur, this), false);
724 for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
725 if (_M_equals(_M_get_key(__cur->_M_val), _M_get_key(__obj))) {
727 __tmp->_M_next = __cur->_M_next;
728 __cur->_M_next = __tmp;
[all …]
H A Dstl_slist.h288 _Slist_node<_Tp>* __cur = (_Slist_node<_Tp>*) (__before_first->_M_next); in _M_erase_after() local
289 while (__cur != __last_node) { in _M_erase_after()
290 _Slist_node<_Tp>* __tmp = __cur; in _M_erase_after()
291 __cur = (_Slist_node<_Tp>*) __cur->_M_next; in _M_erase_after()
779 _Node_base* __cur = &_M_head; in resize() local
780 while (__cur->_M_next != 0 && __len > 0) { in resize()
782 __cur = __cur->_M_next; in resize()
784 if (__cur->_M_next) in resize()
785 _M_erase_after(__cur, 0); in resize()
787 _M_insert_after_fill(__cur, __len, __x); in resize()
[all …]
H A Dstl_deque.h458 _Tp** __cur; in _M_create_nodes() local
460 for (__cur = __nstart; __cur < __nfinish; ++__cur) in _M_create_nodes()
461 *__cur = _M_allocate_node(); in _M_create_nodes()
463 __STL_UNWIND(_M_destroy_nodes(__nstart, __cur)); in _M_create_nodes()
953 iterator __cur = begin(); in _M_assign_aux() local
954 for ( ; __first != __last && __cur != end(); ++__cur, ++__first) in _M_assign_aux()
955 *__cur = *__first; in _M_assign_aux()
957 erase(__cur, end()); in _M_assign_aux()
1095 _Map_pointer __cur; in _M_fill_initialize() local
1097 for (__cur = _M_start._M_node; __cur < _M_finish._M_node; ++__cur) in _M_fill_initialize()
[all …]
H A Dstl_bvector.h637 iterator __cur = begin(); in _M_assign_aux() local
638 for ( ; __first != __last && __cur != end(); ++__cur, ++__first) in _M_assign_aux()
639 *__cur = *__first; in _M_assign_aux()
641 erase(__cur, end()); in _M_assign_aux()
H A Dstl_list.h235 _List_node<_Tp>* __cur = (_List_node<_Tp>*) _M_node->_M_next; in clear() local
236 while (__cur != _M_node) { in clear()
237 _List_node<_Tp>* __tmp = __cur; in clear()
238 __cur = (_List_node<_Tp>*) __cur->_M_next; in clear()
H A Dstl_vector.h562 iterator __cur = begin(); in _M_assign_aux() local
563 for ( ; __first != __last && __cur != end(); ++__cur, ++__first) in _M_assign_aux()
564 *__cur = *__first; in _M_assign_aux()
566 erase(__cur, end()); in _M_assign_aux()