Searched refs:__next (Results 1 - 9 of 9) sorted by relevance

/haiku/headers/cpp/
H A Dstl_hashtable.h821 _Node* __next = __cur->_M_next; local
822 while (__next) {
823 if (_M_equals(_M_get_key(__next->_M_val), __key)) {
824 __cur->_M_next = __next->_M_next;
825 _M_delete_node(__next);
826 __next = __cur->_M_next;
831 __cur = __next;
832 __next = __cur->_M_next;
858 _Node* __next = __cur->_M_next; local
859 while (__next) {
963 _Node* __next; local
983 _Node* __next = __cur->_M_next; local
997 _Node* __next = __cur->_M_next; local
[all...]
H A Dstl_list.h668 iterator __next = __first; local
669 ++__next;
671 __first = __next;
681 iterator __next = __first;
682 while (++__next != __last) {
683 if (*__first == *__next)
684 erase(__next);
686 __first = __next;
687 __next = __first;
700 iterator __next local
759 iterator __next = __first; local
792 iterator __next = __first2; local
[all...]
H A Dstl_slist.h81 _Slist_node_base* __next = __node->_M_next; local
84 __node = __next;
242 _Slist_node<_Tp>* __next = (_Slist_node<_Tp>*) (__pos->_M_next); local
243 _Slist_node_base* __next_next = __next->_M_next;
245 destroy(&__next->_M_data);
246 _M_put_node(__next);
269 _Slist_node<_Tp>* __next = (_Slist_node<_Tp>*) (__pos->_M_next); local
270 _Slist_node_base* __next_next = __next->_M_next;
272 destroy(&__next->_M_data);
273 _M_put_node(__next);
[all...]
H A Dstl_algo.h208 _ForwardIter __next = __first;
209 while(++__next != __last) {
210 if (*__first == *__next)
212 __first = __next;
222 _ForwardIter __next = __first;
223 while(++__next != __last) {
224 if (__binary_pred(*__first, *__next))
226 __first = __next;
987 _ForwardIter __next = __first;
989 while (++__next !
1152 _RandomAccessIter __next = __last; local
1165 _RandomAccessIter __next = __last; local
[all...]
H A Dpthread_alloc55 _Pthread_alloc_per_thread_state<_Max_size> * __next;
61 _Pthread_alloc_per_thread_state() : __next(0)
181 __s -> __next = _S_free_per_thread_states;
193 _S_free_per_thread_states = _S_free_per_thread_states -> __next;
H A Dstl_deque.h815 iterator __next = __pos; local
816 ++__next;
819 copy_backward(_M_start, __pos, __next);
823 copy(__next, _M_finish, __pos);
H A Dstl_rope.h966 __GC_CONST _CharT* __next; local
967 if (0 != _M_buf_ptr && (__next = _M_buf_ptr + 1) < _M_buf_end) {
968 _M_buf_ptr = __next;
/haiku/src/system/libroot/posix/glibc/iconv/
H A Dgconv.h110 struct __gconv_trans_data *__next; member in struct:__gconv_trans_data
H A Dskeleton.c645 for (trans = data->__trans; trans != NULL; trans = trans->__next)

Completed in 230 milliseconds