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 callersFunctionswap_elements_between_blocks

( l_ptr: *mut T, r_ptr: *mut T, mut l_offsets_ptr: *const u8, mut r_offsets_ptr: *const u8,

src/graveyard/ipn_stable_quicksort.rs:204

↓ 1 callersFunctionswap_elements_between_blocks

( l_ptr: *mut T, r_ptr: *mut T, mut l_offsets_ptr: *const u8, mut r_offsets_ptr: *const u8,

src/other/partition/graveyard/hoare_block_opt.rs:10

↓ 1 callersFunctionswap_if_less

(arr_ptr: *mut T, a: usize, b: usize, is_less: &mut F)

src/graveyard/ipn_stable_with_probe_common.rs:1540

↓ 1 callersFunctionswap_if_less

(arr_ptr: *mut T, a: usize, b: usize, is_less: &mut F)

src/graveyard/rust_ipn.rs:1242

↓ 1 callersFunctionswap_if_less

(arr_ptr: *mut T, a: usize, b: usize, is_less: &mut F)

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

↓ 1 callersFunctionswap_slices

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

src/stable/rust_wpwoodjr.rs:433

↓ 1 callersMethodto_u64

sort_test_tools/src/tests.rs:695

↓ 1 callersFunctionunpack_maybe_unit_slice

(buf: &mut [mem::MaybeUninit<T>])

src/graveyard/ipn_stable_with_probe_common.rs:100

↓ 1 callersFunctionunpack_maybe_unit_slice

(buf: &mut [mem::MaybeUninit<T>])

src/graveyard/rust_ipn.rs:100

↓ 1 callersFunctionunstable_sort

src/cpp/idisort/qsort_util.h:43

↓ 1 callersFunctionuse_bitmap_info

Takes the slice `v` and the `block_partition_result` which may contain one bitmap with unused comparison results, and modifies `v` to shrink the un-pa

src/other/partition/hybrid_bitset_partition.rs:472

↓ 1 callersFunctionuse_random_seed_each_time

Overwrites the default behavior so that each call to a random derived pattern yields new random values. By default `patterns::random(4)` will yield t

sort_test_tools/src/patterns.rs:282

↓ 1 callersFunctionyield_pairs

util/generate_swap_if.py:17

MethodArrayFixedSize

src/cpp/idisort/qsort_data.h:101

MethodArrayGenericSize

src/cpp/idisort/qsort_data.h:31

MethodCompareLambda

src/cpp/cpp_std_gcc4_3_sort.cpp:14

MethodFFIStringCpp

src/cpp/shared.h:42

FunctionMAKE_FUNC_NAME(sort_stable, f128_by)

src/cpp/cpp_std_gcc4_3_sort.cpp:150

FunctionMAKE_FUNC_NAME(sort_stable, f128_by)

src/cpp/cpp_std_sort.cpp:124

FunctionMAKE_FUNC_NAME(sort_stable, i32_by)

src/cpp/cpp_std_gcc4_3_sort.cpp:68

FunctionMAKE_FUNC_NAME(sort_stable, i32_by)

src/cpp/cpp_std_sort.cpp:43

FunctionMAKE_FUNC_NAME(sort_stable, u64_by)

src/cpp/cpp_std_gcc4_3_sort.cpp:94

FunctionMAKE_FUNC_NAME(sort_stable, u64_by)

src/cpp/cpp_std_sort.cpp:69

FunctionMAKE_FUNC_NAME(sort_stable, f128)

src/cpp/cpp_std_gcc4_3_sort.cpp:146

FunctionMAKE_FUNC_NAME(sort_stable, f128)

src/cpp/cpp_std_sort.cpp:120

FunctionMAKE_FUNC_NAME(sort_stable, ffi_string)

src/cpp/cpp_std_gcc4_3_sort.cpp:116

FunctionMAKE_FUNC_NAME(sort_stable, ffi_string)

src/cpp/cpp_std_sort.cpp:91

FunctionMAKE_FUNC_NAME(sort_stable, ffi_string_by)

src/cpp/cpp_std_gcc4_3_sort.cpp:120

FunctionMAKE_FUNC_NAME(sort_stable, ffi_string_by)

src/cpp/cpp_std_sort.cpp:96

FunctionMAKE_FUNC_NAME(sort_stable, i32)

src/cpp/cpp_std_gcc4_3_sort.cpp:64

FunctionMAKE_FUNC_NAME(sort_stable, i32)

src/cpp/cpp_std_sort.cpp:39

FunctionMAKE_FUNC_NAME(sort_stable, u64)

src/cpp/cpp_std_gcc4_3_sort.cpp:90

FunctionMAKE_FUNC_NAME(sort_stable, u64)

src/cpp/cpp_std_sort.cpp:65

FunctionMAKE_FUNC_NAME(sort_unstable, f128_by)

src/cpp/cpp_std_gcc4_3_sort.cpp:163

FunctionMAKE_FUNC_NAME(sort_unstable, f128_by)

src/cpp/cpp_std_sort.cpp:136

FunctionMAKE_FUNC_NAME(sort_unstable, i32_by)

src/cpp/cpp_std_gcc4_3_sort.cpp:80

FunctionMAKE_FUNC_NAME(sort_unstable, i32_by)

src/cpp/cpp_std_sort.cpp:55

FunctionMAKE_FUNC_NAME(sort_unstable, u64_by)

src/cpp/cpp_std_gcc4_3_sort.cpp:106

FunctionMAKE_FUNC_NAME(sort_unstable, u64_by)

src/cpp/cpp_std_sort.cpp:81

FunctionMAKE_FUNC_NAME(sort_unstable, f128)

src/cpp/cpp_std_gcc4_3_sort.cpp:159

FunctionMAKE_FUNC_NAME(sort_unstable, f128)

src/cpp/cpp_std_sort.cpp:132

FunctionMAKE_FUNC_NAME(sort_unstable, ffi_string)

src/cpp/cpp_std_gcc4_3_sort.cpp:130

FunctionMAKE_FUNC_NAME(sort_unstable, ffi_string)

src/cpp/cpp_std_sort.cpp:105

FunctionMAKE_FUNC_NAME(sort_unstable, ffi_string_by)

src/cpp/cpp_std_gcc4_3_sort.cpp:134

FunctionMAKE_FUNC_NAME(sort_unstable, ffi_string_by)

src/cpp/cpp_std_sort.cpp:109

FunctionMAKE_FUNC_NAME(sort_unstable, i32)

src/cpp/cpp_std_gcc4_3_sort.cpp:76

FunctionMAKE_FUNC_NAME(sort_unstable, i32)

src/cpp/cpp_std_sort.cpp:51

FunctionMAKE_FUNC_NAME(sort_unstable, u64)

src/cpp/cpp_std_gcc4_3_sort.cpp:102

FunctionMAKE_FUNC_NAME(sort_unstable, u64)

src/cpp/cpp_std_sort.cpp:77

FunctionStableSortI32

export StableSortI32

src/cpp/golang_std_ffi_lib.go:22

FunctionStableSortI32By

export StableSortI32By

src/cpp/golang_std_ffi_lib.go:29

FunctionStableSortU64

export StableSortU64

src/cpp/golang_std_ffi_lib.go:53

FunctionStableSortU64By

export StableSortU64By

src/cpp/golang_std_ffi_lib.go:60

FunctionUnstableSortI32

export UnstableSortI32

src/cpp/golang_std_ffi_lib.go:84

FunctionUnstableSortI32By

export UnstableSortI32By

src/cpp/golang_std_ffi_lib.go:89

FunctionUnstableSortU64

export UnstableSortU64

src/cpp/golang_std_ffi_lib.go:113

FunctionUnstableSortU64By

export UnstableSortU64By

src/cpp/golang_std_ffi_lib.go:118

(self, pattern, comp_count)

util/analyze_comp_count.py:7

(self, time, size)

util/analyze_bench_result.py:8

( self, mobject, fill_color: str = None, rate_func=there_and_back, **k

util/animation/lomcyc_partition/scene.py:69

(self, time, size)

util/graph_bench_result/produce_graphs.py:16

util/graph_bench_result/util.py:77

util/analyze_comp_count.py:11

util/graph_bench_result/produce_graphs.py:20

Functionall_equal

sort_test_tools/src/patterns.rs:119

Analyzes multiple measurement samples and returns variance and median duration.

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

Functionascending

sort_test_tools/src/patterns.rs:126

Functionbasic_impl

sort_test_tools/src/tests.rs:324

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

benches/modules/partition.rs:261

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

benches/modules/partition_point.rs:54

Functionbench_fn

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

benches/modules/util.rs:63

Functionbench_partition_impl

( test_len: usize, transform_name: &str, transform: &fn(Vec<i32>) -> Vec<T>, pattern_name: &st

benches/modules/partition.rs:20

Functionbinary_search_sort

What am I even doing

src/graveyard/graveyard.rs:963

Methodblock_partition

#[inline(never)] // TODO check that.

src/other/partition/hybrid_bitset_partition.rs:222

Functionblockquicksort_unstable_1k

src/cpp/cpp_blockquicksort.cpp:97

Functionblockquicksort_unstable_1k_by

src/cpp/cpp_blockquicksort.cpp:103

Functionblockquicksort_unstable_f128

src/cpp/cpp_blockquicksort.cpp:82

Functionblockquicksort_unstable_f128_by

src/cpp/cpp_blockquicksort.cpp:88

Functionblockquicksort_unstable_ffi_string

src/cpp/cpp_blockquicksort.cpp:65

Functionblockquicksort_unstable_ffi_string_by

src/cpp/cpp_blockquicksort.cpp:71

Functionblockquicksort_unstable_i32

src/cpp/cpp_blockquicksort.cpp:35

Functionblockquicksort_unstable_i32_by

src/cpp/cpp_blockquicksort.cpp:39

Functionblockquicksort_unstable_u64

src/cpp/cpp_blockquicksort.cpp:50

Functionblockquicksort_unstable_u64_by

src/cpp/cpp_blockquicksort.cpp:54

Functionbranchless_swap

(x: *mut T, y: *mut T, should_swap: bool)

src/other/partition/lomuto_branchless.rs:8

Functioncalc_comps_required

(v: &mut [T], mut cmp_fn: impl FnMut(&T, &T) -> Ordering)

sort_test_tools/src/tests.rs:207

Functioncell_i32_from_i32

sort_test_tools/src/tests.rs:199

Functioncheck_is_sorted

sort_test_tools/src/tests.rs:52

Functionchoose_slice_point

Given a slice `v` of `len`, where `mid` < `len`, find a value x that is mid <= x <= len. So that x is optimal for fixed sizes sorting-networks. `sub_

src/graveyard/rust_new_unstable_04_11_2022.rs:991

Functionchoose_unstable_small_sort

ipnsort/src/smallsort.rs:83

src/unstable/rust_crumsort_rs.rs:69

Functioncollapse

It's pretty but I'm not sure it is faster.

src/graveyard/graveyard.rs:765

Functioncollect_offsets_128_basic

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

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

Functioncollect_offsets_n

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

src/graveyard/graveyard.rs:2123

Functioncompare_sort

If `base_line_path` points to a file that exists, compares to base-line. Creates a base-line and stores it to `base_line_path` otherwise.

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

Methodconstruct

util/animation/lomcyc_partition/scene.py:272

Methodconstruct

util/animation/lomcyc_partition/scene.py:369

Methodconstruct

util/animation/lomcyc_partition/scene.py:425

Methodconstruct

util/animation/lomcyc_partition/scene.py:479

Methodcreate_target

util/animation/lomcyc_partition/scene.py:79

← previous next →901–1,000 of 1,504, ranked by callers