i_key_sort 0.10.2

Counting sort algorithm.
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
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55

# THIS FILE IS AUTOMATICALLY GENERATED BY CARGO
#
# When uploading crates to the registry Cargo will automatically
# "normalize" Cargo.toml files for maximal compatibility
# with all versions of Cargo and also rewrite `path` dependencies
# to registry (e.g., crates.io) dependencies.
#
# If you are reading this file be aware that the original Cargo.toml
# will likely look very different (and much more reasonable).
# See Cargo.toml.orig for the original contents.

[package]
edition = "2024"
name = "i_key_sort"
version = "0.10.2"
authors = ["Nail Sharipov <nailxsharipov@gmail.com>"]
build = false
autolib = false
autobins = false
autoexamples = false
autotests = false
autobenches = false
description = "Counting sort algorithm."
readme = "README.md"
categories = [
    "no-std",
    "algorithms",
]
license = "MIT"
repository = "https://github.com/iShape-Rust/iKeySort"

[features]
allow_multithreading = [
    "std",
    "dep:rayon",
]
default = []
std = []

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

[[test]]
name = "dynamic"
path = "tests/dynamic.rs"

[dependencies.rayon]
version = "^1.11"
optional = true

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