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

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

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

⨍ Functions 1,504◇ Types & classes 407

↓ 1 callersFunctionextract_groups

(comp_data)

util/graph_bench_result/comp_count.py:27

↓ 1 callersFunctionextract_line

(ty, sort_name, pattern, values)

util/graph_bench_result/scaling.py:54

↓ 1 callersFunctionextract_line

(sort_name, test_len, prefix, values)

util/graph_bench_result/scaling_pattern.py:54

↓ 1 callersFunctionextract_line

(sort_name_a, sort_name_b, pattern, values)

util/graph_bench_result/direct_versus.py:78

↓ 1 callersFunctionfill_swap_ptr_block

( block_len: usize, base_ptr: *mut T, mut swap_ptr_block: *mut *mut T, is_swap_elem: &mut F, )

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

↓ 1 callersFunctionfill_swap_ptr_block_down

( block_len: usize, base_ptr: *mut T, mut swap_ptr_block: *mut *mut T, is_swap_elem: &mut F, )

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

↓ 1 callersFunctionfind_existing_run

Finds a run of sorted elements starting at the beginning of the slice. Returns the length of the run, and a bool that is false when the run is ascend

ipnsort/src/lib.rs:177

↓ 1 callersFunctionfind_streak

Finds a streak of presorted elements starting at the beginning of the slice. Returns the first value that is not part of said streak, and a bool denot

src/graveyard/ipn_stable_quicksort.rs:926

↓ 1 callersFunctionfind_streak

Finds a streak of presorted elements starting at the beginning of the slice. Returns the first value that is not part of said streak, and a bool denot

src/graveyard/ipn_stable_with_probe_common.rs:553

↓ 1 callersFunctionfind_streak

Finds a streak of presorted elements starting at the beginning of the slice. Returns the first value that is not part of said streak, and a bool denot

src/graveyard/rust_ipn.rs:479

↓ 1 callersFunctionfind_streak

Finds a streak of presorted elements starting at the beginning of the slice. Returns the first value that is not part of said streak, and a bool denot

src/other/sort_evolution/stable/timsort_evo1.rs:145

↓ 1 callersFunctionfind_streak

Finds a streak of presorted elements starting at the beginning of the slice. Returns the first value that is not part of said streak, and a bool denot

src/other/sort_evolution/stable/timsort_evo2.rs:150

↓ 1 callersFunctionfind_streak

Finds a streak of presorted elements starting at the beginning of the slice. Returns the first value that is not part of said streak, and a bool denot

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

↓ 1 callersFunctionfind_streak

Finds a streak of presorted elements starting at the beginning of the slice. Returns the first value that is not part of said streak, and a bool denot

src/other/sort_evolution/stable/timsort_evo0.rs:145

↓ 1 callersFunctionfind_streak

Finds a streak of presorted elements starting at the beginning of the slice. Returns the first value that is not part of said streak, and a bool denot

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

↓ 1 callersFunctionfind_time_scale

(max_time_ns)

util/graph_bench_result/single_size.py:26

↓ 1 callersMethodfinish

(&self)

sort_test_tools/src/patterns.rs:383

↓ 1 callersFunctionformat_time

(time_val)

util/graph_bench_result/single_size.py:42

↓ 1 callersFunctionfulcrum_partition_inner

(slice: &mut [T], swap: &mut [T], pivot: T)

src/other/partition/hoare_crumsort_rs.rs:93

↓ 1 callersFunctiongenerate_flush_btb_fn

()

util/generate_btb_flush.py:57

↓ 1 callersFunctiongenerate_flush_btb_sub_fn

()

util/generate_btb_flush.py:37

↓ 1 callersFunctiongenerate_new_cell_type

(name)

util/generate_compile_bench.py:25

↓ 1 callersFunctiongenerate_new_int_type

(name)

util/generate_compile_bench.py:15

↓ 1 callersFunctiongenerate_new_string_type

(name)

util/generate_compile_bench.py:21

↓ 1 callersFunctiongenerate_test_fn

(type_defs)

util/generate_compile_bench.py:33

↓ 1 callersMethodget_or_replace

(&mut self, layout: alloc::Layout)

src/other/partition/mod.rs:68

↓ 1 callersFunctiongrail_build_blocks

( set: &mut [T], buffer: &mut Option<&mut [T]>, start: usize, length: usize, buffer_len: u

src/stable/rust_grailsort.rs:510

↓ 1 callersFunctiongrail_build_out_of_place

( set: &mut [T], buffer: &mut [T], mut start: usize, length: usize, buffer_len: usize,

src/stable/rust_grailsort.rs:539

↓ 1 callersFunctiongrail_collect_keys

( set: &mut [T], start: usize, length: usize, ideal_keys: usize, cmp: &mut F, )

src/stable/rust_grailsort.rs:210

↓ 1 callersFunctiongrail_combine_blocks

( set: &mut [T], buffer: &mut Option<&mut [T]>, keys: usize, start: usize, mut length: usi

src/stable/rust_grailsort.rs:1099

↓ 1 callersFunctiongrail_combine_out_of_place

( set: &mut [T], buffer: &mut [T], keys: usize, start: usize, length: usize, subarray_

src/stable/rust_grailsort.rs:1162

↓ 1 callersFunctiongrail_in_place_buffer_reset

( set: &mut [T], start: usize, reset_len: usize, buffer_len: usize, )

src/stable/rust_grailsort.rs:458

↓ 1 callersFunctiongrail_in_place_buffer_rewind

( set: &mut [T], start: usize, mut left_overs: usize, mut buffer: usize, )

src/stable/rust_grailsort.rs:484

↓ 1 callersFunctiongrail_lazy_stable_sort

( set: &mut [T], start: usize, length: usize, cmp: &mut F, )

src/stable/rust_grailsort.rs:1416

↓ 1 callersFunctiongrail_out_of_place_buffer_reset

( set: &mut [T], start: usize, reset_len: usize, buffer_len: usize, )

src/stable/rust_grailsort.rs:471

↓ 1 callersFunctiongrail_out_of_place_buffer_rewind

( set: &mut [T], start: usize, mut left_overs: usize, mut buffer: usize, )

src/stable/rust_grailsort.rs:497

↓ 1 callersFunctiongrail_pairwise_swaps

( set: &mut [T], start: usize, length: usize, cmp: &mut F, )

src/stable/rust_grailsort.rs:260

↓ 1 callersFunctiongrail_pairwise_writes

( set: &mut [T], start: usize, length: usize, cmp: &mut F, )

src/stable/rust_grailsort.rs:288

↓ 1 callersFunctiongrail_smart_lazy_merge

( set: &mut [T], mut start: usize, left_len: &mut usize, left_origin: &mut Subarray, mut r

src/stable/rust_grailsort.rs:795

↓ 1 callersFunctiongrail_smart_merge

( set: &mut [T], start: usize, left_len: &mut usize, left_origin: &mut Subarray, right_len

src/stable/rust_grailsort.rs:743

↓ 1 callersFunctiongrail_smart_merge_out_of_place

( set: &mut [T], start: usize, left_len: &mut usize, left_origin: &mut Subarray, right_len

src/stable/rust_grailsort.rs:691

↓ 1 callersFunctiongrail_sort

(set: &mut [T], len: usize)

src/stable/rust_grailsort.rs:95

↓ 1 callersFunctiongrail_sort_by

(set: &mut [T], len: usize, cmp: F)

src/stable/rust_grailsort.rs:99

↓ 1 callersFunctiongraph_pivot_data

(text_a)

util/analyze_pivot_data.py:107

↓ 1 callersFunctionhalway_point

(a, b)

util/animation/lomcyc_partition/scene.py:92

↓ 1 callersFunctionheapsort

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

ipnsort/src/heapsort.rs:10

↓ 1 callersFunctionheapsort

Sorts `v` using heapsort, which guarantees *O*(*n* \* log(*n*)) worst-case.

src/unstable/rust_std_vendored.rs:279

↓ 1 callersFunctionheapsort

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

src/graveyard/ipn_stable_quicksort.rs:160

↓ 1 callersFunctionheapsort

Sorts `v` using heapsort, which guarantees *O*(*n* \* log(*n*)) worst-case.

src/graveyard/rust_new_unstable_04_11_2022.rs:283

↓ 1 callersFunctionheapsort

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

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

↓ 1 callersFunctioni32_tup_as_u64

For cpp_sorts that only support u64 we can pack the two i32 inside a u64.

sort_test_tools/src/tests.rs:565

↓ 1 callersFunctionilog2

src/cpp/idisort/quick_sort.h:166

↓ 1 callersFunctioninit_evolution_tools

()

util/graph_bench_result/comp_count.py:66

↓ 1 callersFunctioninit_tools

()

util/analyze_pivot_data.py:21

↓ 1 callersFunctioninit_tools

()

util/graph_bench_result/scaling.py:29

↓ 1 callersFunctioninit_tools

()

util/graph_bench_result/scaling_pattern.py:29

↓ 1 callersFunctioninit_tools

()

util/graph_bench_result/direct_versus.py:35

↓ 1 callersFunctioninit_tools_detailed

()

util/graph_bench_result/produce_graphs.py:55

↓ 1 callersFunctioninit_tools_overview

()

util/graph_bench_result/produce_graphs.py:72

↓ 1 callersFunctioninsert_head

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

src/graveyard/mostly_merge_with_libcxx_sort_frontend.rs:535

↓ 1 callersFunctioninsert_head

Inserts `v[0]` into pre-sorted sequence `v[1..]` so that whole `v[..]` becomes sorted. This is the integral subroutine of insertion sort.

src/graveyard/ipn_stable_quicksort.rs:1182

↓ 1 callersFunctioninsert_head

Inserts `v[0]` into pre-sorted sequence `v[1..]` so that whole `v[..]` becomes sorted. This is the integral subroutine of insertion sort.

src/graveyard/rust_new_unstable_04_11_2022.rs:1230

↓ 1 callersFunctioninsert_tail

Inserts `v[v.len() - 1]` into pre-sorted sequence `v[..v.len() - 1]` so that whole `v[..]` becomes sorted.

src/graveyard/ipn_stable_with_probe_common.rs:1212

↓ 1 callersFunctioninsert_tail

Inserts `v[v.len() - 1]` into pre-sorted sequence `v[..v.len() - 1]` so that whole `v[..]` becomes sorted.

src/graveyard/rust_new_unstable_04_11_2022.rs:1116

↓ 1 callersFunctioninsert_tail

Inserts `v[v.len() - 1]` into pre-sorted sequence `v[..v.len() - 1]` so that whole `v[..]` becomes sorted.

src/graveyard/rust_ipn.rs:1137

↓ 1 callersFunctioninsert_tail

Sorts range [begin, tail] assuming [begin, tail) is already sorted. # Safety begin < tail and p must be valid and initialized for all begin <= p <= t

src/other/selection/rust_ipnsort.rs:348

↓ 1 callersFunctioninsert_tail

Inserts `v[v.len() - 1]` into pre-sorted sequence `v[..v.len() - 1]` so that whole `v[..]` becomes sorted.

src/other/selection/rust_std.rs:871

↓ 1 callersFunctioninsert_tail

Inserts `v[v.len() - 1]` into pre-sorted sequence `v[..v.len() - 1]` so that whole `v[..]` becomes sorted.

src/other/sort_evolution/stable/timsort_evo2.rs:322

↓ 1 callersFunctioninsert_tail

Inserts `v[v.len() - 1]` into pre-sorted sequence `v[..v.len() - 1]` so that whole `v[..]` becomes sorted.

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

↓ 1 callersFunctioninsert_tail

Inserts `v[v.len() - 1]` into pre-sorted sequence `v[..v.len() - 1]` so that whole `v[..]` becomes sorted.

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

↓ 1 callersFunctioninsertion_sort

Sorts a slice using insertion sort, which is *O*(*n*^2) worst-case.

src/unstable/rust_std_vendored.rs:269

↓ 1 callersFunctioninsertion_sort

Sorts a slice using insertion sort, which is *O*(*n*^2) worst-case.

src/graveyard/rust_new_unstable_04_11_2022.rs:273

↓ 1 callersFunctioninsertion_sort_remaining

Sort the remaining elements after offset in arr.

src/graveyard/mostly_merge_with_libcxx_sort_frontend.rs:246

↓ 1 callersFunctioninsertion_sort_shift_left

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

src/graveyard/rust_new_unstable_04_11_2022.rs:1175

↓ 1 callersFunctioninsertion_sort_shift_left

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

src/other/sort_evolution/stable/timsort_evo2.rs:394

↓ 1 callersFunctioninsertion_sort_shift_left

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

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

↓ 1 callersFunctioninsertion_sort_shift_left

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

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

↓ 1 callersFunctioninsertion_sort_shift_right

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

src/graveyard/ipn_stable_quicksort.rs:1268

↓ 1 callersFunctioninstantiate_Cell_0

(data_ptr: *mut u8, len: usize)

util/compile_time_impact/src/main.rs:3661

↓ 1 callersFunctioninstantiate_Cell_1

(data_ptr: *mut u8, len: usize)

util/compile_time_impact/src/main.rs:3676

↓ 1 callersFunctioninstantiate_Cell_10

(data_ptr: *mut u8, len: usize)

util/compile_time_impact/src/main.rs:3811

↓ 1 callersFunctioninstantiate_Cell_11

(data_ptr: *mut u8, len: usize)

util/compile_time_impact/src/main.rs:3826

↓ 1 callersFunctioninstantiate_Cell_12

(data_ptr: *mut u8, len: usize)

util/compile_time_impact/src/main.rs:3841

↓ 1 callersFunctioninstantiate_Cell_2

(data_ptr: *mut u8, len: usize)

util/compile_time_impact/src/main.rs:3691

↓ 1 callersFunctioninstantiate_Cell_3

(data_ptr: *mut u8, len: usize)

util/compile_time_impact/src/main.rs:3706

↓ 1 callersFunctioninstantiate_Cell_4

(data_ptr: *mut u8, len: usize)

util/compile_time_impact/src/main.rs:3721

↓ 1 callersFunctioninstantiate_Cell_5

(data_ptr: *mut u8, len: usize)

util/compile_time_impact/src/main.rs:3736

↓ 1 callersFunctioninstantiate_Cell_6

(data_ptr: *mut u8, len: usize)

util/compile_time_impact/src/main.rs:3751

↓ 1 callersFunctioninstantiate_Cell_7

(data_ptr: *mut u8, len: usize)

util/compile_time_impact/src/main.rs:3766

↓ 1 callersFunctioninstantiate_Cell_8

(data_ptr: *mut u8, len: usize)

util/compile_time_impact/src/main.rs:3781

↓ 1 callersFunctioninstantiate_Cell_9

(data_ptr: *mut u8, len: usize)

util/compile_time_impact/src/main.rs:3796

↓ 1 callersFunctioninstantiate_String_0

(data_ptr: *mut u8, len: usize)

util/compile_time_impact/src/main.rs:1936

↓ 1 callersFunctioninstantiate_String_1

(data_ptr: *mut u8, len: usize)

util/compile_time_impact/src/main.rs:1951

↓ 1 callersFunctioninstantiate_String_10

(data_ptr: *mut u8, len: usize)

util/compile_time_impact/src/main.rs:2086

↓ 1 callersFunctioninstantiate_String_100

(data_ptr: *mut u8, len: usize)

util/compile_time_impact/src/main.rs:3436

↓ 1 callersFunctioninstantiate_String_101

(data_ptr: *mut u8, len: usize)

util/compile_time_impact/src/main.rs:3451

↓ 1 callersFunctioninstantiate_String_102

(data_ptr: *mut u8, len: usize)

util/compile_time_impact/src/main.rs:3466

↓ 1 callersFunctioninstantiate_String_103

(data_ptr: *mut u8, len: usize)

util/compile_time_impact/src/main.rs:3481

↓ 1 callersFunctioninstantiate_String_104

(data_ptr: *mut u8, len: usize)

util/compile_time_impact/src/main.rs:3496

↓ 1 callersFunctioninstantiate_String_105

(data_ptr: *mut u8, len: usize)

util/compile_time_impact/src/main.rs:3511

← previous next →401–500 of 1,504, ranked by callers