HomeSort by relevance Sort by last modified time
    Searched defs:__right (Results 1 - 8 of 8) sorted by null

  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/parallel/
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 side: >= __pivot_po
    [all...]
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...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/parallel/
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 side: >= __pivot_po
    [all...]
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...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/
stl_algo.h 2609 _ForwardIterator __right = std::upper_bound(++__middle, __first, local
2675 _ForwardIterator __right = std::upper_bound(++__middle, __first, local
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/
ropeimpl.h 493 _S_tree_concat(_RopeRep* __left, _RopeRep* __right)
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 == __new_right
634 _RopeRep* __right = local
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
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/
stl_algo.h 2609 _ForwardIterator __right = std::upper_bound(++__middle, __first, local
2675 _ForwardIterator __right = std::upper_bound(++__middle, __first, local
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/
ropeimpl.h 493 _S_tree_concat(_RopeRep* __left, _RopeRep* __right)
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 == __new_right
634 _RopeRep* __right = local
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
    [all...]

Completed in 394 milliseconds