Home
last modified time | relevance | path

Searched refs:n_block_left (Results 1 – 1 of 1) sorted by relevance

/third_party/boost/boost/move/algo/detail/
Dadaptive_sort_merge.hpp327 size_type n_block_left = n_block_b + n_block_a; in merge_blocks_bufferless() local
330 size_type min_check = n_block_a == n_block_left ? 0u : n_block_a; in merge_blocks_bufferless()
331 size_type max_check = min_value<size_type>(min_check+1, n_block_left); in merge_blocks_bufferless()
332 …for (RandIt f = first+l_irreg1; n_block_left; --n_block_left, ++key_range2, f += l_block, min_chec… in merge_blocks_bufferless()
335 …k = min_value<size_type>(max_value<size_type>(max_check, next_key_idx+size_type(2)), n_block_left); in merge_blocks_bufferless()
934 , typename iterator_traits<RandIt>::size_type n_block_left in op_merge_blocks_with_irreg() argument
941 …for(; n_block_left; --n_block_left, ++key_first, min_check -= min_check != 0, max_check -= max_che… in op_merge_blocks_with_irreg()
943 …k = min_value<size_type>(max_value<size_type>(max_check, next_key_idx+size_type(2)), n_block_left); in op_merge_blocks_with_irreg()
1005 size_type n_block_left = n_block_b + n_block_a; in op_merge_blocks_left() local
1012 RandIt const irreg2 = first2 + n_block_left*l_block; in op_merge_blocks_left()
[all …]