i_key_sort 0.6.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
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32

[dev-dependencies.rand]
version = "~0.9"

[features]
bin_key = []
default = ["sort", "bin_key"]
sort = []

[lib]
name = "i_key_sort"
path = "src/lib.rs"

[package]
authors = ["Nail Sharipov <nailxsharipov@gmail.com>"]
autobenches = false
autobins = false
autoexamples = false
autolib = false
autotests = false
build = false
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."
edition = "2024"
license = "MIT"
name = "i_key_sort"
readme = "README.md"
repository = "https://github.com/iShape-Rust/iKeySort"
version = "0.6.0"

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