Functions — github.com/Voultapher/sort-research-rs

CodeHub MCPcopy Create free account

hub / github.com/Voultapher/sort-research-rs / functions

Functions1,504 in github.com/Voultapher/sort-research-rs

⨍ Functions 1,504◇ Types & classes 407

↓ 1 callersFunctionpartition_at_index_loop

( mut v: &'a mut [T], mut index: usize, is_less: &mut F, mut pred: Option<&'a T>, )

src/other/selection/rust_std.rs:72

↓ 1 callersFunctionpartition_avx2

(v: &mut [T], pivot: &T, is_less: &mut F)

src/other/partition/graveyard/graveyard.rs:1579

↓ 1 callersFunctionpartition_down

( elem_ptr: *const T, ge_count: usize, lt_out_base_ptr: *mut T, ge_out_base_ptr: *mut T, p

src/other/partition/graveyard/graveyard.rs:2805

↓ 1 callersFunctionpartition_equal

Partitions `v` into elements equal to `v[pivot]` followed by elements greater than `v[pivot]`. Returns the number of elements equal to the pivot. It

src/unstable/rust_std_vendored.rs:648

↓ 1 callersFunctionpartition_equal

Partitions `v` into elements equal to `v[pivot]` followed by elements greater than `v[pivot]`. Returns the number of elements equal to the pivot. It

src/graveyard/rust_new_unstable_04_11_2022.rs:652

↓ 1 callersFunctionpartition_equal

Partitions `v` into elements equal to `v[pivot]` followed by elements greater than `v[pivot]`. Returns the number of elements equal to the pivot. It

src/other/selection/rust_std.rs:677

↓ 1 callersFunctionpartition_equal_stable

( v: &mut [T], pivot_pos: usize, buf: *mut T, is_equal: &mut F, )

src/graveyard/ipn_stable_with_probe_common.rs:1364

↓ 1 callersFunctionpartition_hoare_branchy

src/cpp/idisort/quick_sort.h:51

↓ 1 callersFunctionpartition_impl

(v: &mut [T], pivot: &T, is_less: &mut F)

src/other/partition/graveyard/graveyard.rs:2593

↓ 1 callersFunctionpartition_in_blocks

Partitions `v` into elements smaller than `pivot`, followed by elements greater than or equal to `pivot`. Returns the number of elements smaller than

src/unstable/rust_std_vendored.rs:329

↓ 1 callersFunctionpartition_in_blocks

Partitions `v` into elements smaller than `pivot`, followed by elements greater than or equal to `pivot`. Returns the number of elements smaller than

src/graveyard/rust_new_unstable_04_11_2022.rs:333

↓ 1 callersFunctionpartition_in_blocks

Partitions `v` into elements smaller than `pivot`, followed by elements greater than or equal to `pivot`. Returns the number of elements smaller than

src/other/selection/rust_std.rs:341

↓ 1 callersFunctionpartition_lomuto_branchless

src/cpp/idisort/quick_sort.h:27

↓ 1 callersFunctionpartition_point

(arr: &[T], mut pred: P)

src/other/partition_point/std.rs:3

↓ 1 callersFunctionpin_thread_to_core

util/rustc-sort-bench/src/benchmark.rs:222

↓ 1 callersFunctionplot_comp

util/graph_bench_result/comp_count.py:183

↓ 1 callersFunctionplot_comparison_evolution

util/graph_bench_result/comp_count.py:161

↓ 1 callersFunctionplot_comparison_evolution_single

(sort_names, groups, sort_name)

util/graph_bench_result/comp_count.py:92

↓ 1 callersFunctionplot_detailed

(name_a, groups_a, name_b, groups_b)

util/graph_bench_result/produce_graphs.py:155

↓ 1 callersFunctionplot_distribution

(temp, transform, name_a, groups_a, name_b, groups_b)

util/graph_bench_result/produce_graphs.py:191

↓ 1 callersFunctionplot_name_suffix

util/graph_bench_result/util.py:72

↓ 1 callersFunctionplot_overview

(name_a, groups_a, name_b, groups_b)

util/graph_bench_result/produce_graphs.py:257

↓ 1 callersFunctionplot_patterns

util/graph_bench_result/scaling.py:158

↓ 1 callersFunctionplot_patterns

util/graph_bench_result/scaling_pattern.py:122

↓ 1 callersFunctionplot_scaling

(ty, prediction_state, pattern, values)

util/graph_bench_result/scaling.py:81

↓ 1 callersFunctionplot_scaling

(ty, prediction_state, prefix, test_len, values)

util/graph_bench_result/scaling_pattern.py:80

↓ 1 callersFunctionplot_single_size

(ty, prediction_state, test_len, values)

util/graph_bench_result/single_size.py:52

↓ 1 callersFunctionplot_sizes

util/graph_bench_result/single_size.py:142

↓ 1 callersFunctionplot_types

(sort_name_a, sort_name_b, groups)

util/graph_bench_result/direct_versus.py:228

↓ 1 callersFunctionplot_versus

(sort_name_a, sort_name_b, ty, prediction_state, clip_mode, values)

util/graph_bench_result/direct_versus.py:99

↓ 1 callersFunctionprint_simple_swap_if

util/generate_swap_if.py:30

↓ 1 callersFunctionprobe_for_common_val

(v: &[T], is_equal: &mut F)

src/graveyard/ipn_stable_with_probe_common.rs:1289

↓ 1 callersFunctionprovide_sorted_batch

(v: &mut [T], start: usize, mut end: usize, is_less: &mut F)

src/other/sort_evolution/stable/timsort_evo3.rs:419

↓ 1 callersFunctionprovide_sorted_batch

(v: &mut [T], start: usize, mut end: usize, is_less: &mut F)

src/other/sort_evolution/stable/timsort_evo4.rs:419

↓ 1 callersFunctionquick_sort_impl

src/cpp/idisort/quick_sort.h:106

↓ 1 callersFunctionquicksort

Sorts `v` recursively. If the slice had a predecessor in the original array, it is specified as `ancestor_pivot`. `limit` is the number of allowed i

ipnsort/src/quicksort.rs:14

↓ 1 callersFunctionquicksort

(v_full: &mut [T], mut limit: u32, is_less: &mut F)

src/other/sort_evolution/unstable/quicksort_stack_evo0.rs:46

↓ 1 callersFunctionquicksort

(mut v: &mut [T], is_less: &mut F)

src/other/sort_evolution/unstable/quicksort_evo0.rs:41

↓ 1 callersFunctionrandom_sorted

(len: usize, sorted_percent: f64)

sort_test_tools/src/patterns.rs:56

↓ 1 callersFunctionrect_ctor

util/animation/lomcyc_partition/scene.py:201

↓ 1 callersFunctionrecurse

Sorts `v` recursively. If the slice had a predecessor in the original array, it is specified as `pred`. `limit` is the number of allowed imbalanced

src/unstable/rust_std_vendored.rs:829

↓ 1 callersFunctionrecurse

( mut v: &'a mut [T], is_less: &mut F, buf: *mut T, mut pred: Option<&'a T>, mut limit: u3

src/graveyard/ipn_stable_quicksort.rs:835

↓ 1 callersFunctionrecurse

Sorts `v` recursively. If the slice had a predecessor in the original array, it is specified as `pred`. `limit` is the number of allowed imbalanced

src/graveyard/rust_new_unstable_04_11_2022.rs:846

↓ 1 callersFunctionrelative_speedup

util/analyze_comp_count.py:43

↓ 1 callersFunctionrelative_speedup

(time_a, time_b)

util/graph_bench_result/produce_graphs.py:182

↓ 1 callersFunctionrelative_speedup

(time_a, time_b)

util/graph_bench_result/direct_versus.py:65

↓ 1 callersFunctionrelative_speedup

If time_a is faster than time_b -> % faster than time_b If time_b is faster than time_a -> % faster than time_a as negative number 100 == time_a 2x fa

util/rustc-sort-bench/src/evaluate.rs:336

↓ 1 callersFunctionrelative_speedup_to_adjusted

util/graph_bench_result/direct_versus.py:74

↓ 1 callersMethodremove

(&mut self, index: usize)

src/graveyard/ipn_stable_with_probe_common.rs:471

↓ 1 callersMethodreset_bounds

Reset this Array to point at a different interval of the same items starting at index |i|.

src/cpp/idisort/qsort_data.h:131

↓ 1 callersFunctionreverse_shift_i32_to_u32

sort_test_tools/src/tests.rs:157

↓ 1 callersFunctionrun_benchmarks

(test_name, bench_name_overwrite)

util/run_benchmarks.py:27

↓ 1 callersFunctionrun_benchmarks_variant

(test_name, variant)

util/run_benchmarks.py:85

↓ 1 callersFunctionshift_head

Shifts the first element to the right until it encounters a greater or equal element.

src/unstable/rust_std_vendored.rs:122

↓ 1 callersFunctionshift_head

Shifts the first element to the right until it encounters a greater or equal element.

src/graveyard/rust_new_unstable_04_11_2022.rs:126

↓ 1 callersFunctionshift_tail

Shifts the last element to the left until it encounters a smaller or equal element.

src/graveyard/mostly_merge_with_libcxx_sort_frontend.rs:302

↓ 1 callersFunctionshould_test_for_strong_exception_safety

sort_test_tools/src/tests.rs:219

↓ 1 callersFunctionshuffle_vec

(mut v: Vec<T>)

benches/bench.rs:21

↓ 1 callersFunctionsift_down

(v: &mut [T], mut node: usize, is_less: &mut F)

ipnsort/src/heapsort.rs:37

↓ 1 callersFunctionslice_merge_sort

Do a recursive depth-first merge while slice's length is greater than SMALL_SLICE_LEN*2. Below that length use a combination of insertion sort and mer

src/stable/rust_wpwoodjr.rs:353

↓ 1 callersFunctionsmall_aux_partition

( v: &mut [T], swap_ptr: *mut T, pivot: &T, is_less: &mut F, )

src/other/partition/hoare_crumsort.rs:37

↓ 1 callersFunctionsmall_partition_int_opt

See [`Partition::small_partition`]. Optimized for integers like types. Not suitable for large types, because it stores temporary copies in a stack bu

src/other/partition/hybrid_bitset_partition.rs:273

↓ 1 callersFunctionsmall_partition_int_opt

See [`Partition::small_partition`]. Optimized for integers like types. Not suitable for large types, because it stores temporary copies in a stack bu

src/other/partition/hoare_block_butterfly.rs:80

↓ 1 callersFunctionsmall_sort_fallback

(v: &mut [T], is_less: &mut F)

ipnsort/src/smallsort.rs:107

↓ 1 callersFunctionsmall_sort_general_with_scratch

( v: &mut [T], scratch: &mut [MaybeUninit<T>], is_less: &mut F, )

ipnsort/src/smallsort.rs:126

↓ 1 callersFunctionsort

src/graveyard/rust_ipn.rs:15

↓ 1 callersFunctionsort

(data: &mut [T])

src/other/rust_radsort.rs:21

↓ 1 callersMethodsort

(arr: &mut [T])

sort_test_tools/tests/main.rs:11

↓ 1 callersMethodsort

(_data: &mut [Self])

src/stable/rust_grailsort.rs:19

↓ 1 callersMethodsort

util/rustc-sort-bench/src/main.rs:18

↓ 1 callersFunctionsort10_optimal

(v: &mut [T], is_less: &mut F)

src/other/small_sort/sort10_unstable_cmp_swaps.rs:59

↓ 1 callersFunctionsort10_optimal

(v: &[T], dest_ptr: *mut T, is_less: &mut F)

src/other/small_sort/sort10_unstable_ptr_select.rs:27

↓ 1 callersFunctionsort10_optimal

(v: &[T], dest_ptr: *mut T, is_less: &mut F)

src/other/small_sort/sort10_unstable_experimental.rs:33

↓ 1 callersFunctionsort12_optimal

(v: &mut [T], is_less: &mut F)

src/graveyard/rust_new_unstable_04_11_2022.rs:1555

↓ 1 callersFunctionsort13_optimal

Never inline this function to avoid code bloat. It still optimizes nicely and has practically no performance impact.

ipnsort/src/smallsort.rs:375

↓ 1 callersFunctionsort2

Sort the first 2 elements of arr.

src/graveyard/mostly_merge_with_libcxx_sort_frontend.rs:180

↓ 1 callersFunctionsort20_optimal

(v: &mut [T], is_less: &mut F)

src/graveyard/rust_new_unstable_04_11_2022.rs:1688

↓ 1 callersFunctionsort3

Sort the first 3 elements of arr.

src/graveyard/mostly_merge_with_libcxx_sort_frontend.rs:191

↓ 1 callersFunctionsort32_stable

(v: &mut [T], is_less: &mut F)

src/graveyard/ipn_stable_with_probe_common.rs:1637

↓ 1 callersFunctionsort32_stable

(v: &mut [T], is_less: &mut F)

src/graveyard/rust_ipn.rs:1339

↓ 1 callersFunctionsort32_stable

(v: &mut [T], is_less: &mut F)

src/other/sort_evolution/stable/timsort_evo4.rs:853

↓ 1 callersFunctionsort4_optimal

(v: &mut [T], is_less: &mut F)

src/graveyard/rust_new_unstable_04_11_2022.rs:1497

↓ 1 callersFunctionsort4_optimal

(v: &[T], dest_ptr: *mut T, is_less: &mut F)

src/other/small_sort/sort4_unstable_ptr_select.rs:28

↓ 1 callersFunctionsort4_optimal

(v: &mut [T], is_less: &mut F)

src/other/small_sort/sort4_unstable_cmp_swap.rs:59

↓ 1 callersFunctionsort4_stable

(arr_ptr: *const T, dest_ptr: *mut T, is_less: &mut F)

src/other/small_sort/sort4_stable_orson.rs:10

↓ 1 callersFunctionsort8_optimal

(v: &mut [T], is_less: &mut F)

src/graveyard/rust_new_unstable_04_11_2022.rs:1519

↓ 1 callersFunctionsort9_optimal

Never inline this function to avoid code bloat. It still optimizes nicely and has practically no performance impact.

ipnsort/src/smallsort.rs:329

↓ 1 callersMethodsort_by

(arr: &mut [T], compare: F)

ipnsort/tests/main.rs:17

↓ 1 callersMethodsort_by

(_data: &mut [Self], _compare: F)

src/stable/rust_grailsort.rs:23

↓ 1 callersFunctionsort_network_4

(arr: &mut [T], is_less: &mut F)

src/other/small_sort/sort4_unstable_branchy.rs:6

↓ 1 callersFunctionsort_small

(v: &mut [T], is_less: &mut F)

src/graveyard/ipn_stable_quicksort.rs:962

↓ 1 callersFunctionsort_small_hot

(v: &mut [T], is_less: &mut F)

src/graveyard/rust_new_unstable_04_11_2022.rs:1032

↓ 1 callersFunctionsort_small_stable

(v: &mut [T], end: usize, is_less: &mut F)

src/graveyard/ipn_stable_quicksort.rs:1711

↓ 1 callersFunctionsort_small_with_pattern_analysis

(v: &mut [T], is_less: &mut F)

src/graveyard/ipn_stable_quicksort.rs:991

↓ 1 callersFunctionsplit_len

(len: usize, part_a_percent: f64)

benches/bench.rs:31

↓ 1 callersFunctionsplit_len

(len: usize, part_a_percent: f64)

util/rustc-sort-bench/src/patterns.rs:37

↓ 1 callersFunctionstable_partition

Takes the input slice `v` and re-arranges elements such that when the call returns normally all elements that compare true for `is_less(elem, pivot)`

src/other/partition/stable_2side_fill.rs:29

↓ 1 callersFunctionstable_sort_impl

(arr: &mut [T], is_less: &mut F)

src/graveyard/mostly_merge_with_libcxx_sort_frontend.rs:32

↓ 1 callersFunctionswap_between_blocks

( l_ptr: *mut T, r_ptr: *mut T, mut l_bitmap: BitsetStorageT, mut r_bitmap: BitsetStorageT, )

src/other/partition/graveyard/graveyard.rs:2524

↓ 1 callersFunctionswap_between_blocks

( l_swap_ptr_ptr: *const *mut T, r_swap_ptr_ptr: *const *mut T, count: usize, )

src/other/partition/graveyard/hoare_block_ptr.rs:75

← previous next →801–900 of 1,504, ranked by callers