i_key_sort 0.2.0

A fast sorting algorithm combining bin and counting sort. Optimized for scenarios where a primary key can be extracted to index elements into buckets.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16

[package]
name = "i_key_sort"
version = "0.2.0"
authors = ["Nail Sharipov <nailxsharipov@gmail.com>"]
edition = "2021"
description = "A fast sorting algorithm combining bin and counting sort. Optimized for scenarios where a primary key can be extracted to index elements into buckets."
license = "MIT"
repository = "https://github.com/iShape-Rust/iKeySort"

[profile.release]
opt-level = 3
lto = true
codegen-units = 1

[dev-dependencies]
rand = { version = "0.8.5", features = [] }