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

↓ 4 callersFunctiondecrement_and_get

(ptr: &mut *mut T)

src/graveyard/rust_ipn.rs:734

↓ 4 callersFunctionget_and_increment

(ptr: &mut *mut T)

src/graveyard/rust_ipn.rs:726

↓ 4 callersFunctionget_cpu_info

util/graph_bench_result/cpu_info.py:35

↓ 4 callersFunctionget_or_init_seed_type_and_value

sort_test_tools/src/patterns.rs:306

↓ 4 callersMethodget_val

sort_test_tools/src/tests.rs:122

↓ 4 callersFunctiongrail_block_select_sort

( set: &mut [T], keys: usize, start: usize, mut median_key: usize, block_count: usize,

src/stable/rust_grailsort.rs:316

↓ 4 callersFunctiongrail_merge_forwards

( set: &mut [T], start: usize, left_len: usize, right_len: usize, buffer_offset: isize,

src/stable/rust_grailsort.rs:361

↓ 4 callersFunctiongrail_out_of_place_merge

( set: &mut [T], start: usize, left_len: usize, right_len: usize, buffer_offset: isize,

src/stable/rust_grailsort.rs:424

↓ 4 callersFunctioninput_iter

util/animation/lomcyc_partition/scene.py:56

↓ 4 callersFunctioninsert_end

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

src/stable/rust_wpwoodjr.rs:105

↓ 4 callersFunctionis_copy

src/graveyard/rust_ipn.rs:804

↓ 4 callersFunctionmedian3

Calculates the median of 3 elements. SAFETY: a, b, c must be valid initialized elements.

benches/modules/partition.rs:232

↓ 4 callersFunctionmerge_down

( mut ptr_left: *mut T, mut ptr_right: *mut T, mut ptr_swap: *mut T, is_less:

src/graveyard/graveyard.rs:260

↓ 4 callersFunctionmerge_up

( mut ptr_left: *mut T, mut ptr_right: *mut T, mut ptr_swap: *mut T, is_less:

src/graveyard/graveyard.rs:238

↓ 4 callersFunctionpartition_animation

(scene, rect_anim_fn)

util/animation/lomcyc_partition/scene.py:200

↓ 4 callersFunctionquick_sort

src/cpp/idisort/quick_sort.h:171

↓ 4 callersFunctionshould_run_benchmark

benches/modules/util.rs:47

↓ 4 callersFunctionsort3_idx

( v: &mut [T], a: &mut usize, b: &mut usize, c: &mut usize, is_less: &mut F, )

src/graveyard/graveyard.rs:1711

↓ 4 callersFunctionsort4_stable

SAFETY: The caller MUST guarantee that `v_base` is valid for 4 reads and `dst` is valid for 4 writes. The result will be stored in `dst[0..4]`.

ipnsort/src/smallsort.rs:517

↓ 4 callersFunctionsort8_stable

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

src/graveyard/ipn_stable_with_probe_common.rs:1583

↓ 4 callersFunctionsort8_stable

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

src/graveyard/rust_ipn.rs:1285

↓ 4 callersFunctionsort8_stable

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

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

↓ 3 callersFunctionadd_tools_to_plot

util/graph_bench_result/produce_graphs.py:89

↓ 3 callersFunctionanalyze_block

( block: &[T], pivot: &T, mut offsets_ptr: *mut u8, is_less: &mut F, )

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

↓ 3 callersMethodas_nanos

(&self, cpu_frequency_ghz: f64)

util/rustc-sort-bench/src/measure.rs:112

↓ 3 callersFunctionbench

( c: &mut Criterion, test_len: usize, transform_name: &str, transform: &fn(Vec<i32>) -> Vec<T>

benches/modules/sort.rs:83

↓ 3 callersFunctionbench_impl

( c: &mut Criterion, test_len: usize, transform_name: &str, transform: &fn(Vec<i32>) -> Vec<T>

benches/modules/partition_point.rs:12

↓ 3 callersFunctionbi_directional_merge_even

Merge v assuming the len is even and v[..len / 2] and v[len / 2..] are sorted. Original idea for bi-directional merging by Igor van den Hoven (quadso

src/graveyard/ipn_stable_with_probe_common.rs:990

↓ 3 callersFunctionbi_directional_merge_even

Merge v assuming the len is even and v[..len / 2] and v[len / 2..] are sorted. Original idea for bi-directional merging by Igor van den Hoven (quadso

src/graveyard/rust_ipn.rs:915

↓ 3 callersFunctionbidirectional_merge

Merge v assuming v[..len / 2] and v[len / 2..] are sorted. Original idea for bi-directional merging by Igor van den Hoven (quadsort), adapted to only

ipnsort/src/smallsort.rs:674

↓ 3 callersMethodcmp

(&self, other: &Self)

sort_test_tools/src/ffi_types.rs:73

↓ 3 callersFunctioncurved_line

(start, end, y_offset)

util/animation/lomcyc_partition/scene.py:97

↓ 3 callersFunctiondecrement_and_get

(ptr: &mut *mut T)

src/stable/rust_wpwoodjr.rs:275

↓ 3 callersFunctiondecrement_and_get

(ptr: &mut *mut T)

src/graveyard/mostly_merge_with_libcxx_sort_frontend.rs:704

↓ 3 callersFunctiondecrement_and_get

(ptr: &mut *mut T)

src/graveyard/ipn_stable_quicksort.rs:1392

↓ 3 callersFunctiondecrement_and_get

(ptr: &mut *mut T)

src/graveyard/ipn_stable_with_probe_common.rs:808

↓ 3 callersFunctiondecrement_and_get

(ptr: &mut *mut T)

src/graveyard/rust_new_unstable_04_11_2022.rs:1389

↓ 3 callersFunctiondecrement_and_get

(ptr: &mut *mut T)

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

↓ 3 callersFunctiondecrement_and_get

(ptr: &mut *mut T)

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

↓ 3 callersFunctiondecrement_and_get

(ptr: &mut *mut T)

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

↓ 3 callersFunctiondecrement_and_get

(ptr: &mut *mut T)

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

↓ 3 callersFunctioneval_sort_network

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

src/graveyard/graveyard.rs:2252

↓ 3 callersFunctionget_and_increment

(ptr: &mut *mut T)

src/stable/rust_wpwoodjr.rs:268

↓ 3 callersFunctionget_and_increment

(ptr: &mut *mut T)

src/graveyard/mostly_merge_with_libcxx_sort_frontend.rs:698

↓ 3 callersFunctionget_and_increment

(ptr: &mut *mut T)

src/graveyard/ipn_stable_quicksort.rs:1386

↓ 3 callersFunctionget_and_increment

(ptr: &mut *mut T)

src/graveyard/ipn_stable_with_probe_common.rs:800

↓ 3 callersFunctionget_and_increment

(ptr: &mut *mut T)

src/graveyard/rust_new_unstable_04_11_2022.rs:1383

↓ 3 callersFunctionget_and_increment

(ptr: &mut *mut T)

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

↓ 3 callersFunctionget_and_increment

(ptr: &mut *mut T)

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

↓ 3 callersFunctionget_and_increment

(ptr: &mut *mut T)

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

↓ 3 callersFunctionget_and_increment

(ptr: &mut *mut T)

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

↓ 3 callersFunctiongrail_binary_search_left

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

src/stable/rust_grailsort.rs:170

↓ 3 callersFunctioninsertion_sort_shift_left

Sort `v` assuming `v[..offset]` is already sorted.

ipnsort/src/smallsort.rs:485

↓ 3 callersFunctioninsertion_sort_shift_left

Sort `v` assuming `v[..offset]` is already sorted.

src/graveyard/ipn_stable_with_probe_common.rs:1266

↓ 3 callersFunctioninternal_array_copy

( set: &mut [T], src_position: usize, dest_position: usize, length: usize, )

src/stable/rust_grailsort.rs:940

↓ 3 callersMethodmake_array

Make an Array starting at index |i| and length |s|.

src/cpp/idisort/qsort_data.h:125

↓ 3 callersFunctionmerge_down

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

src/graveyard/ipn_stable_with_probe_common.rs:950

↓ 3 callersFunctionmerge_down

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

src/graveyard/rust_ipn.rs:875

↓ 3 callersFunctionmerge_down

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

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

↓ 3 callersFunctionmerge_up

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

src/graveyard/ipn_stable_with_probe_common.rs:914

↓ 3 callersFunctionmerge_up

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

src/graveyard/rust_ipn.rs:839

↓ 3 callersFunctionmerge_up

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

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

↓ 3 callersMethodpadding

util/animation/lomcyc_partition/scene.py:154

↓ 3 callersFunctionparity_merge

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

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

↓ 3 callersFunctionparse_bench_results

Parse a list of benchmark result files, returning a unified auto-spliced representation, in the groups format.

util/graph_bench_result/util.py:11

↓ 3 callersFunctionparse_result

util/graph_bench_result/produce_graphs.py:24

↓ 3 callersFunctionpartition

src/cpp/idisort/quick_sort.h:79

↓ 3 callersFunctionpartition

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/selection/rust_ipnsort.rs:520

↓ 3 callersFunctionprovide_sorted_batch

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

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

↓ 3 callersFunctionrandom_init_seed

sort_test_tools/src/patterns.rs:291

↓ 3 callersFunctionsort16_optimal

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

src/graveyard/rust_new_unstable_04_11_2022.rs:1611

↓ 3 callersFunctionsort8_stable

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

src/graveyard/ipn_stable_quicksort.rs:1656

↓ 3 callersFunctiontype_instantiations

util/generate_compile_bench.py:29

↓ 2 callersFunctionanalyze

(name_a, name_b)

util/analyze_comp_count.py:86

↓ 2 callersMethodas_i64

sort_test_tools/src/ffi_types.rs:120

↓ 2 callersMethodas_str

sort_test_tools/src/ffi_types.rs:29

↓ 2 callersFunctionaux_alloc_size

src/cpp/singeli_singelisort.cpp:10

↓ 2 callersFunctionbucketize_comp_data

util/analyze_comp_count.py:15

↓ 2 callersFunctionbuild_implementation_meta_info

Returns a dict with color and symbol information pinned to a specific implementation. This is used to visually identify the different im

util/graph_bench_result/util.py:203

↓ 2 callersFunctionbuild_pattern_meta_info

Returns a dict with color and symbol information pinned to a specific pattern. This is used to visually identify the different patterns.

util/graph_bench_result/util.py:278

↓ 2 callersFunctioncalc_a_percent_larger_than_b

util/analyze_bench_result.py:37

↓ 2 callersFunctioncalc_elem_per_us

util/analyze_bench_result.py:49

↓ 2 callersFunctioncalc_part

(list_full, list_partial)

util/analyze_bench_result.py:42

↓ 2 callersFunctioncheck_full_regression

(name: &str, speedup: f64, threshold: f64)

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

↓ 2 callersFunctionclear_lowest_bit

(x: BitsetStorageT)

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

↓ 2 callersFunctioncollect_offsets

(v: &[T], offsets_base_ptr: *mut u8, check: &mut F)

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

↓ 2 callersFunctioncompress_i32

(values: &[i32], compression_range: f64)

benches/bench.rs:275

↓ 2 callersFunctioncount_consistent_changes

(speedups: &[(usize, f64)], threshold: f64)

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

↓ 2 callersFunctioncurrent_time_stamp

util/rustc-sort-bench/src/measure.rs:166

↓ 2 callersFunctionextend_i32_to_u64

benches/bench.rs:294

↓ 2 callersFunctionextract_groups

util/analyze_bench_result.py:18

↓ 2 callersFunctionextract_groups

util/graph_bench_result/produce_graphs.py:29

↓ 2 callersFunctionextract_groups

(bench_result_iter, splice_filter_fn)

util/graph_bench_result/util.py:160

↓ 2 callersFunctionextract_property

util/graph_bench_result/scaling_pattern.py:55

↓ 2 callersFunctionfill_bitset

( block_len: usize, base_ptr: *const T, is_swap_elem: &mut impl FnMut(&T) -> bool, )

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

↓ 2 callersFunctionfill_block

( base_ptr: *const T, blocks_ptrs: *mut *mut BlockEntry, is_out_of_order: &mut F, )

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

↓ 2 callersFunctionfinish_down

( ptr_left: *mut T, ptr_right: *mut T, ptr_swap: *mut T, is_less: &mut F,

src/graveyard/graveyard.rs:300

↓ 2 callersFunctionfinish_up

( ptr_left: *mut T, ptr_right: *mut T, ptr_swap: *mut T, is_less: &mut F,

src/graveyard/graveyard.rs:282

↓ 2 callersFunctiongen_partition_mask

(block_ptr: *const T, is_out_of_order: &mut F)

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

↓ 2 callersFunctionget_or_alloc_tls_scratch

Returns a guaranteed non-null pointer to an allocation suitable for `layout`. As long as this function is called consecutively with the same `layout`

src/other/partition/mod.rs:54

← previous next →101–200 of 1,504, ranked by callers