Searched refs:__cur (Results 1 - 7 of 7) sorted by relevance
| /haiku/headers/cpp/ |
| H A D | stl_uninitialized.h | 55 _ForwardIter __cur = __result; local
57 for ( ; __first != __last; ++__first, ++__cur)
58 construct(&*__cur, *__first);
59 return __cur;
61 __STL_UNWIND(destroy(__result, __cur));
105 _ForwardIter __cur = __result; local
107 for ( ; __count > 0 ; --__count, ++__first, ++__cur)
108 construct(&*__cur, *__first);
109 return pair<_InputIter, _ForwardIter>(__first, __cur);
111 __STL_UNWIND(destroy(__result, __cur));
156 _ForwardIter __cur = __first; local
196 _ForwardIter __cur = __first; local
[all...] |
| H A D | stl_hashtable.h | 349 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
820 _Node* __cur = __first; local
850 _Node* __cur = _M_buckets[__n]; local
959 _Node* __cur = _M_buckets[__n]; local
981 _Node* __cur = _M_buckets[__n]; local
995 _Node* __cur = _M_buckets[__i]; local
[all...] |
| H A D | stl_slist.h | 288 _Slist_node<_Tp>* __cur = (_Slist_node<_Tp>*) (__before_first->_M_next); local
289 while (__cur != __last_node) {
290 _Slist_node<_Tp>* __tmp = __cur;
291 __cur = (_Slist_node<_Tp>*) __cur->_M_next;
779 _Node_base* __cur = &_M_head; local
780 while (__cur->_M_next != 0 && __len > 0) {
782 __cur = __cur->_M_next;
784 if (__cur
793 _Node_base* __cur = &_M_head; local
805 _Node_base* __cur = _M_head._M_next; local
865 _Node_base* __cur = &_M_head; local
877 _Node* __cur = (_Node*) _M_head._M_next; local
[all...] |
| H A D | stl_deque.h | 458 _Tp** __cur; local
460 for (__cur = __nstart; __cur < __nfinish; ++__cur)
461 *__cur = _M_allocate_node();
463 __STL_UNWIND(_M_destroy_nodes(__nstart, __cur));
953 iterator __cur = begin(); local
954 for ( ; __first != __last && __cur != end(); ++__cur, ++__first)
955 *__cur
1095 _Map_pointer __cur; local
[all...] |
| H A D | stl_bvector.h | 637 iterator __cur = begin(); local
638 for ( ; __first != __last && __cur != end(); ++__cur, ++__first)
639 *__cur = *__first;
641 erase(__cur, end());
|
| H A D | stl_list.h | 235 _List_node<_Tp>* __cur = (_List_node<_Tp>*) _M_node->_M_next; local
236 while (__cur != _M_node) {
237 _List_node<_Tp>* __tmp = __cur;
238 __cur = (_List_node<_Tp>*) __cur->_M_next;
|
| H A D | stl_vector.h | 562 iterator __cur = begin(); local
563 for ( ; __first != __last && __cur != end(); ++__cur, ++__first)
564 *__cur = *__first;
566 erase(__cur, end());
|
Completed in 62 milliseconds