Crate tilesort 

Tilesort - A sorting algorithm optimized for datasets with pre-sorted contiguous blocks.

This library provides efficient sorting for data consisting of non-overlapping, pre-sorted contiguous blocks called “tiles”.

Structs

IdentityKey

Identity key extractor - the element is its own key.

Traits

KeyExtractor

Trait for extracting sort keys from elements.

Functions

tilesort

Sort a slice using the tilesort algorithm.

tilesort_by_key

Sort a slice using a custom key extraction function.

tilesort_by_key_reverse

Sort a slice in descending order using a custom key extraction function.

tilesort_reverse

Sort a slice in descending order using the tilesort algorithm.

tilesorted

Return a sorted copy of a slice using the tilesort algorithm.

tilesorted_by_key

Return a sorted copy using a custom key extraction function.

tilesorted_by_key_reverse

Return a sorted copy in descending order using a custom key extraction function.

tilesorted_reverse

Return a sorted copy of a slice in descending order using the tilesort algorithm.