[[bench]]
harness = false
name = "deduplicate"
path = "benches/deduplicate.rs"
[[bench]]
harness = false
name = "difference"
path = "benches/difference.rs"
[[bench]]
harness = false
name = "find_first_duplicate"
path = "benches/find_first_duplicate.rs"
[[bench]]
harness = false
name = "intersect"
path = "benches/intersect.rs"
[[bench]]
harness = false
name = "union"
path = "benches/union.rs"
[dev-dependencies.anyhow]
version = "1.0.100"
[dev-dependencies.criterion]
features = ["html_reports"]
version = "0.5"
[dev-dependencies.rand]
features = ["small_rng"]
version = "0.9.2"
[lib]
bench = false
name = "sosorted"
path = "src/lib.rs"
[package]
authors = ["Laurie Clark-Michalek <lclarkmichalek@gmail.com>"]
autobenches = false
autobins = false
autoexamples = false
autolib = false
autotests = false
build = false
description = "A set of methods to efficiently manipulated sorted arrays"
edition = "2021"
exclude = ["perf.*", "target", "Cargo.lock", ".sl"]
license = "MIT"
name = "sosorted"
readme = "README.md"
version = "0.2.0"