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

↓ 2 callersFunctiongrail_binary_search_right

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

src/stable/rust_grailsort.rs:190

↓ 2 callersFunctiongrail_build_in_place

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

src/stable/rust_grailsort.rs:590

↓ 2 callersFunctiongrail_combine_in_place

( set: &mut [T], keys: usize, start: usize, length: usize, subarray_len: usize, block_

src/stable/rust_grailsort.rs:1244

↓ 2 callersFunctiongrail_count_left_blocks

( set: &[T], offset: usize, block_count: usize, block_len: usize, cmp: &mut F, )

src/stable/rust_grailsort.rs:659

↓ 2 callersFunctiongrail_get_subarray

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

src/stable/rust_grailsort.rs:678

↓ 2 callersFunctiongrail_lazy_merge_blocks

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

src/stable/rust_grailsort.rs:1039

↓ 2 callersFunctiongrail_merge_backwards

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

src/stable/rust_grailsort.rs:391

↓ 2 callersFunctiongrail_merge_blocks

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

src/stable/rust_grailsort.rs:952

↓ 2 callersFunctiongrail_merge_blocks_out_of_place

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

src/stable/rust_grailsort.rs:861

↓ 2 callersFunctionheap_sort

src/cpp/idisort/heap_sort.h:21

↓ 2 callersFunctioni32_tup_from_u64

sort_test_tools/src/tests.rs:572

↓ 2 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/stable/rust_std_vendored.rs:246

↓ 2 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

ipnsort/src/smallsort.rs:443

↓ 2 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_quicksort.rs:1126

↓ 2 callersFunctioninsertion_sort

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

src/graveyard/mostly_merge_with_libcxx_sort_frontend.rs:351

↓ 2 callersFunctioninsertion_sort_shift_left

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

src/graveyard/rust_ipn.rs:1191

↓ 2 callersFunctioninsertion_sort_shift_left

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

src/other/selection/rust_ipnsort.rs:390

↓ 2 callersFunctioninsertion_sort_shift_left

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

src/other/selection/rust_std.rs:929

↓ 2 callersFunctioninstantiate_sort

util/binary-size-measurement/src/main.rs:6

↓ 2 callersFunctionlens_filtered

Returns {pattern: lenghts} dict filtered for sort_name.

util/graph_bench_result/direct_versus.py:204

↓ 2 callersFunctionmax_index

Helper function that returns the index of the maximum element in the slice using the given comparator function

src/other/selection/rust_ipnsort.rs:164

↓ 2 callersFunctionmax_index

Helper function that returns the index of the maximum element in the slice using the given comparator function

src/other/selection/rust_std.rs:168

↓ 2 callersFunctionmedian3

(a: &T, b: &T, c: &T, is_less: &mut F)

ipnsort/src/pivot.rs:71

↓ 2 callersFunctionmedian3

src/cpp/idisort/qsort_pivot.h:68

↓ 2 callersFunctionmedian3

(a: &T, b: &T, c: &T, is_less: &mut F)

src/other/selection/rust_ipnsort.rs:488

↓ 2 callersFunctionmedian_idx

returns the index pointing to the median of the 3 elements `v[a]`, `v[b]` and `v[c]`

src/other/selection/rust_ipnsort.rs:309

↓ 2 callersFunctionmedian_idx

returns the index pointing to the median of the 3 elements `v[a]`, `v[b]` and `v[c]`

src/other/selection/rust_std.rs:313

↓ 2 callersFunctionmedian_of_medians

Selection algorithm to select the k-th element from the slice in guaranteed O(n) time. This is essentially a quickselect that uses Tukey's Ninther for

src/other/selection/rust_ipnsort.rs:174

↓ 2 callersFunctionmedian_of_medians

Selection algorithm to select the k-th element from the slice in guaranteed O(n) time. This is essentially a quickselect that uses Tukey's Ninther for

src/other/selection/rust_std.rs:178

↓ 2 callersFunctionmerge

(v: &mut [T], mid: usize, buf_ptr: *mut T, buf_len: usize, is_less: &mut F)

src/graveyard/ipn_stable_with_probe_common.rs:839

↓ 2 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_evo3.rs:518

↓ 2 callersFunctionmerge_sort

This merge sort borrows some (but not all) ideas from TimSort, which is described in detail [here](https://github.com/python/cpython/blob/main/Objects

src/stable/rust_std_vendored.rs:108

↓ 2 callersFunctionmerge_sort

This is a stable two stage merge sort with pre-sorted prefix optimization. The two stages are: 1) Top-down recursive depth-first merge, which helps d

src/stable/rust_wpwoodjr.rs:304

↓ 2 callersFunctionmerge_sort

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

src/graveyard/mostly_merge_with_libcxx_sort_frontend.rs:377

↓ 2 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_evo3.rs:486

↓ 2 callersFunctionmin_index

Helper function that returns the index of the minimum element in the slice using the given comparator function

src/other/selection/rust_ipnsort.rs:154

↓ 2 callersFunctionmin_index

Helper function that returns the index of the minimum element in the slice using the given comparator function

src/other/selection/rust_std.rs:158

↓ 2 callersMethodnext

( &mut self, slice: &mut [T], swap: Option<&mut [T]>, pivot: T, )

src/other/partition/hoare_crumsort_rs.rs:37

↓ 2 callersMethodord_val

(&self, other: &Self)

src/unstable/rust_crumsort_rs.rs:30

↓ 2 callersFunctionp_per

Print percent justified

util/analyze_bench_result.py:58

↓ 2 callersFunctionparity_merge

Adapted from crumsort/quadsort.

src/graveyard/ipn_stable_quicksort.rs:1480

↓ 2 callersFunctionparity_merge2

(arr_ptr: *mut T, swap_ptr: *mut T, is_less: &mut F)

src/graveyard/graveyard.rs:318

↓ 2 callersFunctionparse_result

util/analyze_bench_result.py:13

↓ 2 callersMethodpartial_cmp

(&self, other: &Self)

benches/bench.rs:432

↓ 2 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)`

ipnsort/src/quicksort.rs:113

↓ 2 callersFunctionpartition

Partitions `v` into elements smaller than `v[pivot]`, followed by elements greater than or equal to `v[pivot]`. Returns a tuple of: 1. Number of ele

src/other/selection/rust_std.rs:616

↓ 2 callersFunctionpartition

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

src/other/partition/hoare_crumsort_rs.rs:197

↓ 2 callersFunctionpartition4_proxy

(arr_ptr: *mut T, comp_results: &mut [u8; 4], i: usize)

src/graveyard/graveyard.rs:1780

↓ 2 callersFunctionpartition_at_index

Reorder the slice such that the element at `index` is at its final sorted position.

src/other/selection/rust_ipnsort.rs:31

↓ 2 callersFunctionpartition_at_index

Reorder the slice such that the element at `index` is at its final sorted position.

src/other/selection/rust_std.rs:34

↓ 2 callersFunctionpartition_stable

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

src/graveyard/ipn_stable_quicksort.rs:555

↓ 2 callersFunctionpartition_up

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

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

↓ 2 callersFunctionpin_thread_to_core

benches/modules/util.rs:10

↓ 2 callersFunctionproduce_plot

util/graph_bench_result/produce_graphs.py:119

↓ 2 callersFunctionprovide_sorted_batch_default

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

src/graveyard/ipn_stable_with_probe_common.rs:611

↓ 2 callersFunctionprovide_sorted_batch_default

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

src/graveyard/rust_ipn.rs:537

↓ 2 callersMethodpush

(&mut self, val: TimSortRun)

src/graveyard/ipn_stable_with_probe_common.rs:447

↓ 2 callersFunctionquicksort

Sorts `v` using pattern-defeating quicksort, which is *O*(*n* \* log(*n*)) worst-case.

src/unstable/rust_std_vendored.rs:915

↓ 2 callersFunctionquicksort

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

src/graveyard/ipn_stable_quicksort.rs:1069

↓ 2 callersFunctionquicksort

Sorts `v` using pattern-defeating quicksort, which is *O*(*n* \* log(*n*)) worst-case.

src/graveyard/rust_new_unstable_04_11_2022.rs:1079

↓ 2 callersFunctionrandom

Generates `len` non-uniform distributed values in the full `u64` range.

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

↓ 2 callersFunctionrandom_zipf

(len: usize, exponent: f64)

sort_test_tools/src/patterns.rs:42

↓ 2 callersFunctionrelative_speedup_as_times_x

(relative_speedup: f64)

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

↓ 2 callersFunctionsemi_random_values

Generate values that are not tied logically to the condition values, to avoid compiler trickery.

util/generate_btb_flush.py:14

↓ 2 callersFunctionsetup_gap_value

(scene, rect_vals)

util/animation/lomcyc_partition/scene.py:276

↓ 2 callersFunctionshift_i32_to_u32

sort_test_tools/src/tests.rs:153

↓ 2 callersFunctionshift_tail

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

src/unstable/rust_std_vendored.rs:171

↓ 2 callersFunctionshift_tail

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

src/graveyard/rust_new_unstable_04_11_2022.rs:175

↓ 2 callersFunctionsmall_partition_default

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

src/other/partition/small_partition.rs:27

↓ 2 callersFunctionsmall_partition_move_opt

See [`Partition::small_partition`]. Optimized for minimal moves.

src/other/partition/hybrid_bitset_partition.rs:351

↓ 2 callersFunctionsmall_partition_move_opt

See [`Partition::small_partition`]. Optimized for minimal moves.

src/other/partition/hoare_block_butterfly.rs:234

↓ 2 callersFunctionsort20_optimal

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

src/graveyard/graveyard.rs:1550

↓ 2 callersFunctionsort4

Sort the first 4 elements of arr.

src/graveyard/mostly_merge_with_libcxx_sort_frontend.rs:219

↓ 2 callersFunctionsort4

(x1: &mut T, x2: &mut T, x3: &mut T, x4: &mut T, is_less: &mut F)

src/graveyard/graveyard.rs:32

↓ 2 callersFunctionsort8

Sort the first 8 elements of arr.

src/graveyard/graveyard.rs:381

↓ 2 callersFunctionsort8_stable

SAFETY: The caller MUST guarantee that `v_base` is valid for 8 reads and writes, `scratch_base` and `dst` MUST be valid for 8 writes. The result will

ipnsort/src/smallsort.rs:577

↓ 2 callersFunctionsort_by

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

ipnsort/src/lib.rs:103

↓ 2 callersFunctionsort_by_impl

src/cpp/c_logsort.cpp:45

↓ 2 callersFunctionsort_by_impl

src/cpp/c_crumsort.cpp:9

↓ 2 callersFunctionsort_by_impl

src/cpp/c_fluxsort.cpp:10

↓ 2 callersFunctionsort_impl

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

src/other/small_sort/sort4_unstable_ptr_select.rs:59

↓ 2 callersFunctionsort_impl

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

src/other/small_sort/sort4_unstable_branchy.rs:28

↓ 2 callersFunctionsort_impl

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

src/other/small_sort/sort10_unstable_cmp_swaps.rs:105

↓ 2 callersFunctionsort_impl

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

src/other/small_sort/sort10_unstable_ptr_select.rs:95

↓ 2 callersFunctionsort_impl

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

src/other/small_sort/sort4_stable_orson.rs:66

↓ 2 callersFunctionsort_impl

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

src/other/small_sort/sort10_unstable_experimental.rs:101

↓ 2 callersFunctionsort_impl

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

src/other/small_sort/sort4_unstable_cmp_swap.rs:81

↓ 2 callersMethodsort_name

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

↓ 2 callersFunctionsort_stable_by_impl

src/cpp/cpp_std_gcc4_3_sort.cpp:32

↓ 2 callersFunctionsort_unstable_by_impl

src/cpp/cpp_std_gcc4_3_sort.cpp:46

↓ 2 callersFunctionstable_sort

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

src/graveyard/ipn_stable_with_probe_common.rs:35

↓ 2 callersFunctionstable_sort

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

src/graveyard/rust_ipn.rs:35

↓ 2 callersFunctionstable_sort

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

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

↓ 2 callersFunctionstable_sort

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

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

↓ 2 callersFunctionstable_sort

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

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

↓ 2 callersFunctionstable_sort

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

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

↓ 2 callersFunctionstable_sort

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

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

↓ 2 callersFunctionswap_horizontal

(scene, rect_vals, left_offset, right_offset)

util/animation/lomcyc_partition/scene.py:108

↓ 2 callersFunctionunstable_sort

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

ipnsort/src/lib.rs:114

↓ 2 callersFunctionunstable_sort

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

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

← previous next →201–300 of 1,504, ranked by callers