| /freebsd-9-stable/contrib/libstdc++/include/bits/ |
| D | list.tcc | 181 iterator __next = __first; in remove() local
182 ++__next; in remove()
185 __first = __next; in remove()
198 iterator __next = __first; in unique() local
199 while (++__next != __last) in unique()
201 if (*__first == *__next) in unique()
202 _M_erase(__next); in unique()
204 __first = __next; in unique()
205 __next = __first; in unique()
227 iterator __next = __first2; in merge() local
[all …]
|
| D | stl_algo.h | 371 _ForwardIterator __next = __first; in adjacent_find() local
372 while(++__next != __last) in adjacent_find()
374 if (*__first == *__next) in adjacent_find()
376 __first = __next; in adjacent_find()
404 _ForwardIterator __next = __first; in adjacent_find() local
405 while(++__next != __last) in adjacent_find()
407 if (__binary_pred(*__first, *__next)) in adjacent_find()
409 __first = __next; in adjacent_find()
1319 _ForwardIterator __next = __first; in __unique_copy() local
1321 while (++__next != __last) in __unique_copy()
[all …]
|
| D | deque.tcc | 114 iterator __next = __position; in erase() local
115 ++__next; in erase()
120 std::copy_backward(begin(), __position, __next); in erase()
125 if (__next != end()) in erase()
126 std::copy(__next, end(), __position); in erase()
|
| D | fstream.tcc | 786 char* __next; in _M_terminate_output() local
788 __buf + __blen, __next); in _M_terminate_output()
794 __ilen = __next - __buf; in _M_terminate_output()
|
| /freebsd-9-stable/contrib/libstdc++/include/debug/ |
| D | functions.h | 207 _ForwardIterator __next = __first; in __check_sorted_aux() local
208 for (++__next; __next != __last; __first = __next, ++__next) { in __check_sorted_aux()
209 if (*__next < *__first) in __check_sorted_aux()
234 _ForwardIterator __next = __first; in __check_sorted_aux() local
235 for (++__next; __next != __last; __first = __next, ++__next) { in __check_sorted_aux()
236 if (__pred(*__next, *__first)) in __check_sorted_aux()
|
| D | list | 420 iterator __next = __first;
421 while (++__next != __last)
423 if (*__first == *__next)
424 erase(__next);
426 __first = __next;
427 __next = __first;
439 iterator __next = __first;
440 while (++__next != __last)
442 if (__binary_pred(*__first, *__next))
443 erase(__next);
[all …]
|
| /freebsd-9-stable/contrib/libstdc++/include/ext/ |
| D | hashtable.h | 878 _Node* __next = __cur->_M_next;
879 while (__next)
881 if (_M_equals(_M_get_key(__next->_M_val), __key))
883 __cur->_M_next = __next->_M_next;
884 _M_delete_node(__next);
885 __next = __cur->_M_next;
891 __cur = __next;
892 __next = __cur->_M_next;
924 _Node* __next = __cur->_M_next;
925 while (__next)
[all …]
|
| D | algorithm | 491 _ForwardIterator __next = __first;
492 for (++__next; __next != __last; __first = __next, ++__next)
493 if (*__next < *__first)
518 _ForwardIterator __next = __first;
519 for (++__next; __next != __last; __first = __next, ++__next)
520 if (__comp(*__next, *__first))
|
| D | slist | 136 _Slist_node_base* __next = __node->_M_next;
139 __node = __next;
262 _Slist_node<_Tp>* __next = (_Slist_node<_Tp>*) (__pos->_M_next);
263 _Slist_node_base* __next_next = __next->_M_next;
265 get_allocator().destroy(&__next->_M_data);
266 _M_put_node(__next);
|
| D | rope | 1168 __GC_CONST _CharT* __next;
1170 && (__next = this->_M_buf_ptr + 1) < this->_M_buf_end)
1172 this->_M_buf_ptr = __next;
|
| /freebsd-9-stable/contrib/libc++/include/ |
| D | __debug | 55 __i_node(void* __i, __i_node* __next, __c_node* __c)
56 : __i_(__i), __next_(__next), __c_(__c) {}
78 __c_node(void* __c, __c_node* __next)
79 : __c_(__c), __next_(__next), beg_(nullptr), end_(nullptr), cap_(nullptr) {}
|
| D | __tree | 1224 __node_pointer __next = __detach(__cache);
1226 __cache = __next;
1264 __node_pointer __next = __detach(__cache);
1266 __cache = __next;
1388 __node_pointer __next = __detach(__cache);
1390 __cache = __next;
1682 const_iterator __next = _VSTD::next(__hint);
1683 if (__next == end() || value_comp()(__v, *__next))
1693 __parent = static_cast<__node_base_pointer>(__next.__ptr_);
|
| D | forward_list | 542 __node_pointer __next = __p->__next_;
545 __p = __next;
1166 __node_pointer __next = __first->__next_;
1169 __first = __next;
1216 __node_pointer __next = __first->__next_;
1219 __first = __next;
|
| D | __hash_table | 1327 __node_pointer __next = __np->__next_;
1345 __np = __next;
1418 __node_pointer __next = __cache->__next_;
1420 __cache = __next;
1476 __node_pointer __next = __cache->__next_;
1478 __cache = __next;
1510 __node_pointer __next = __cache->__next_;
1512 __cache = __next;
|
| D | regex | 2303 const _CharT* __next = _VSTD::next(__s.__current_);
2304 if (__next != __s.__last_)
2306 pair<_CharT, _CharT> __ch2(*__s.__current_, *__next);
|
| /freebsd-9-stable/contrib/libstdc++/src/ |
| D | ios.cc | 187 _Callback_list* __next = __p->_M_next; in _M_dispose_callbacks() local
189 __p = __next; in _M_dispose_callbacks()
|
| /freebsd-9-stable/contrib/libstdc++/include/tr1/ |
| D | hashtable | 979 _Node* __next = __cur->_M_next;
980 while (__next != __p)
982 __cur = __next;
983 __next = __cur->_M_next;
985 __cur->_M_next = __next->_M_next;
|