| /haiku-buildtools/gcc/libstdc++-v3/include/parallel/ |
| H A D | losertree.h | 191 unsigned int __right = __init_winner(2 * __root + 1); local
192 if (_M_losers[__right]._M_sup
194 && !_M_comp(_M_losers[__right]._M_key,
198 _M_losers[__root] = _M_losers[__right];
205 return __right;
291 unsigned int __right = __init_winner(2 * __root + 1); local
292 if (_M_losers[__right]._M_sup
294 && !_M_comp(_M_losers[__right]._M_key,
298 _M_losers[__root] = _M_losers[__right];
305 return __right;
430 unsigned int __right = __init_winner(2 * __root + 1); local
512 unsigned int __right = __init_winner(2 * __root + 1); local
668 unsigned int __right = __init_winner(2 * __root + 1); local
756 unsigned int __right = __init_winner(2 * __root + 1); local
913 unsigned int __right = __init_winner(2 * __root + 1); local
999 unsigned int __right = __init_winner(2 * __root + 1); local
[all...] |
| H A D | partition.h | 70 _GLIBCXX_VOLATILE _DifferenceType __left = 0, __right = __n - 1, local
160 __fetch_and_add(&__right, -__chunk_size);
201 __rightold = __right,
202 __rightnew = __right + __leftover_right * __chunk_size;
218 __reserved_right[((__thread_right_border - 1) - __right)
281 __right = __rightnew;
282 __dist = __right - __left + 1;
285 # pragma omp flush(__left, __right)
288 _DifferenceType __final_left = __left, __final_right = __right;
375 // Left side: < __pivot_pos; __right sid
[all...] |
| /haiku-buildtools/legacy/gcc/libstdc++/stl/ |
| H A D | ropeimpl.h | 444 rope<_CharT,_Alloc>::_S_tree_concat (_RopeRep* __left, _RopeRep* __right) argument
447 _S_new_RopeConcatenation(__left, __right, __left->get_allocator());
451 __stl_assert(__left->get_allocator() == __right->get_allocator());
500 _RopeLeaf* __right = local
502 if (__right->_M_size + __slen <= _S_copy_max) {
505 _S_leaf_concat_char_iter((_RopeLeaf*)__right, __s, __slen);
554 _RopeLeaf* __right = (_RopeLeaf*)(((_RopeConcatenation*)__r)->_M_right); local
555 if (_RopeRep::_S_leaf == __right->_M_tag
556 && __right->_M_size + __slen <= _S_copy_max) {
558 _S_destr_leaf_concat_char_iter(__right, __
577 _RopeRep* __right = local
591 _S_concat(_RopeRep* __left, _RopeRep* __right) argument
659 _RopeRep* __right = __c->_M_right; local
852 _RopeRep* __right = __conc->_M_right; local
970 _RopeRep* __right = __c->_M_right; local
1008 _RopeRep* __right = __c->_M_right; local
1279 _S_compare(const _RopeRep* __left, const _RopeRep* __right) argument
[all...] |
| H A D | stl_rope.h | 891 // __right. Assumes path_cache_len <= 9.
1400 static _RopeRep* _S_concat(_RopeRep* __left, _RopeRep* __right);
1439 _RopeRep* __left, _RopeRep* __right,
1447 return new(__space) _RopeConcatenation(__left, __right, __a);
1511 _S_tree_concat(_RopeRep* __left, _RopeRep* __right);
1577 _RopeRep* __right)
1579 _RopeRep* __result = _S_concat(__left, __right);
1863 const rope<_CharT,_Alloc>& __right);
1867 const _CharT* __right);
1871 _CharT __right);
1438 _S_new_RopeConcatenation( _RopeRep* __left, _RopeRep* __right, allocator_type __a) argument
1576 _S_concat_and_set_balanced(_RopeRep* __left, _RopeRep* __right) argument
2396 operator +(const rope<_CharT,_Alloc>& __left, const rope<_CharT,_Alloc>& __right) argument
2411 operator +=(rope<_CharT,_Alloc>& __left, const rope<_CharT,_Alloc>& __right) argument
2421 operator +(const rope<_CharT,_Alloc>& __left, const _CharT* __right) argument
2432 operator +=(rope<_CharT,_Alloc>& __left, const _CharT* __right) argument
2441 operator +(const rope<_CharT,_Alloc>& __left, _CharT __right) argument
2450 operator +=(rope<_CharT,_Alloc>& __left, _CharT __right) argument
2457 operator <(const rope<_CharT,_Alloc>& __left, const rope<_CharT,_Alloc>& __right) argument
2464 operator ==(const rope<_CharT,_Alloc>& __left, const rope<_CharT,_Alloc>& __right) argument
[all...] |
| H A D | stl_algo.h | 1854 _ForwardIter __middle, __left, __right; local
1870 __right = upper_bound(++__middle, __first, __val);
1871 return pair<_ForwardIter, _ForwardIter>(__left, __right);
1892 _ForwardIter __middle, __left, __right; local
1908 __right = upper_bound(++__middle, __first, __val, __comp);
1909 return pair<_ForwardIter, _ForwardIter>(__left, __right);
|
| /haiku-buildtools/gcc/libstdc++-v3/include/ext/ |
| H A D | ropeimpl.h | 493 _S_tree_concat(_RopeRep* __left, _RopeRep* __right) argument
495 _RopeConcatenation* __result = _S_new_RopeConcatenation(__left, __right,
549 _RopeLeaf* __right = local
551 if (__right->_M_size + __slen <= size_t(_S_copy_max))
555 _S_leaf_concat_char_iter((_RopeLeaf*)__right, __s, __slen);
612 _RopeLeaf* __right = (_RopeLeaf*)(((_RopeConcatenation*) local
614 if (__detail::_S_leaf == __right->_M_tag
615 && __right->_M_size + __slen <= size_t(_S_copy_max))
618 _S_destr_leaf_concat_char_iter(__right, __s, __slen);
619 if (__right
634 _RopeRep* __right = local
652 _S_concat(_RopeRep* __left, _RopeRep* __right) argument
743 _RopeRep* __right = __c->_M_right; local
942 _RopeRep* __right = __conc->_M_right; local
1084 _RopeRep* __right = __c->_M_right; local
1124 _RopeRep* __right = __c->_M_right; local
1425 _S_compare(const _RopeRep* __left, const _RopeRep* __right) argument
[all...] |
| /haiku-buildtools/gcc/libstdc++-v3/include/bits/ |
| H A D | stl_algo.h | 2154 _ForwardIterator __right local
2156 return pair<_ForwardIterator, _ForwardIterator>(__left, __right);
|