| /third_party/boost/boost/sort/common/util/ |
| D | merge.hpp | 106 if (buf1 == end_buf1) return move_forward(buf_out, buf2, end_buf2); in merge()
107 if (buf2 == end_buf2) return move_forward(buf_out, buf1, end_buf1); in merge()
111 Iter3_t mid = move_forward(buf_out, buf1, end_buf1); in merge()
112 return move_forward(mid, buf2, end_buf2); in merge()
117 Iter3_t mid = move_forward(buf_out, buf2, end_buf2); in merge()
118 return move_forward(mid, buf1, end_buf1); in merge()
128 move_forward(buf_out, buf2, end_buf2) : in merge()
129 move_forward(buf_out, buf1, end_buf1); in merge()
232 if (buf2 == end_buf2) return move_forward(buf_out, buf1, end_buf1); in merge_half()
236 move_forward(buf_out, buf1, end_buf1); in merge_half()
[all …]
|
| D | insert.hpp | 82 move_forward(it_aux, mid, last); in insert_sorted()
119 move_forward(it_aux, first, mid); in insert_sorted_backward()
129 Iter1_t it1 = move_forward(mv_first - (ndata - i), mv_first, mv_last); in insert_sorted_backward()
|
| D | algorithm.hpp | 201 inline Iter2_t move_forward (Iter2_t it_dest, Iter1_t first, Iter1_t last) in move_forward() function
|
| /third_party/boost/boost/sort/common/ |
| D | merge_vector.hpp | 66 v_output.emplace_back(move_forward(dest, v_input[0])); in merge_level4()
167 return move_forward(range_output, v_input[0]); in merge_vector4()
187 return (sw) ? v_output[0] : move_forward(range_output, v_input[0]); in merge_vector4()
|
| D | range.hpp | 121 inline range<Iter2_t> move_forward(const range<Iter2_t> &dest, in move_forward() function
125 Iter2_t it_aux = util::move_forward(dest.first, src.first, src.last); in move_forward()
389 if (rbx.first == rbx.last) move_forward(rbuf, rng2); in merge_flow()
|
| D | merge_block.hpp | 397 rng_buf = move_forward(rng_buf, get_range(pos_ini)); in rearrange_with_index()
402 move_forward(get_range(pos_dest), get_range(pos_src)); in rearrange_with_index()
407 move_forward(get_range(pos_dest), rng_buf); in rearrange_with_index()
|
| D | sort_basic.hpp | 322 move_forward(rng_aux, rng_data); in range_sort_buffer()
|
| D | merge_four.hpp | 102 if (nrange_input == 1) return move_forward(rdest, vrange_input[0]); in full_merge4()
|
| /third_party/boost/boost/sort/block_indirect_sort/blk_detail/ |
| D | move_blocks.hpp | 222 move_forward(rbuf, range2); in move_sequence()
229 move_forward(range1, range2); in move_sequence()
231 move_forward(range2, rbuf); in move_sequence()
|
| D | merge_blocks.hpp | 329 move_forward(rbuf, rng_prev); in merge_range_pos()
339 move_forward(rng_posx, rbuf); in merge_range_pos()
|
| /third_party/boost/boost/sort/spinsort/ |
| D | spinsort.hpp | 269 move_forward(range2, range1); in range_sort()
345 move_forward(rng_data, rng_buffer); in sort_range_sort()
|
| /third_party/boost/boost/sort/parallel_stable_sort/ |
| D | parallel_stable_sort.hpp | 192 range_buffer = move_forward(range_buffer, range_first); in parallel_stable_sort()
|
| /third_party/boost/boost/intrusive/ |
| D | circular_slist_algorithms.hpp | 349 static node_ptr move_forward(node_ptr p, std::size_t n) in move_forward() function in boost::intrusive::circular_slist_algorithms
|
| D | circular_list_algorithms.hpp | 339 static void move_forward(node_ptr p, std::size_t n) in move_forward() function in boost::intrusive::circular_list_algorithms
|
| D | list.hpp | 565 { node_algorithms::move_forward(this->get_root_node(), n); } in shift_backwards()
|
| D | slist.hpp | 2033 node_ptr l = node_algorithms::move_forward(this->get_root_node(), (std::size_t)n); in priv_shift_backwards()
|