learned-partition-sort 0.1.0

A high-performance distribution-based sorting algorithm that learns data patterns to achieve O(N) complexity
Documentation
# 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 = "2021"
name = "learned-partition-sort"
version = "0.1.0"
authors = ["Keeth <keeth@users.noreply.github.com>"]
build = false
autolib = false
autobins = false
autoexamples = false
autotests = false
autobenches = false
description = "A high-performance distribution-based sorting algorithm that learns data patterns to achieve O(N) complexity"
readme = "README.md"
keywords = [
    "sorting",
    "algorithm",
    "performance",
    "parallel",
]
categories = [
    "algorithms",
    "data-structures",
]
license = "MIT"
repository = "https://github.com/keeth/learned-partition-sort"

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

[[example]]
name = "basic"
path = "examples/basic.rs"

[[bench]]
name = "sort_benchmark"
path = "benches/sort_benchmark.rs"
harness = false

[dependencies.rand]
version = "0.8"

[dependencies.rayon]
version = "1.10"

[dev-dependencies.criterion]
version = "0.5"
features = ["html_reports"]

[profile.bench]
lto = true
codegen-units = 1

[profile.release]
lto = true
codegen-units = 1
panic = "abort"