Module algorithms

Expand description

Respository of some indexing-implemented algorithms so we can dissect them and their codegen.

Structs§

binary_search
binary_search_by: f is a closure that is passed x from the slice and should return the result of x compared with something.
copy
heapify
insertion_sort2_indexes: Sort two containers in lock step, based on the first
insertion_sort_indexes
insertion_sort_ranges
insertion_sort_rust: Copied from rust / libcollections/slice.rs, using raw pointers
lower_bound
lower_bound_raw_ptr: Raw pointer version, for comparison From cppreference
merge_internal_indices: Merge internal: Merge inside data while using buffer as a swap space
merge_internal_ranges: Merge internal: Merge inside data while using buffer as a swap space
quicksort_bounds: quicksort implemented using regular bounds checked indexing
quicksort_range: Simple quicksort implemented using Range,