[[bench]]
harness = false
name = "bench_set_rand"
[[bench]]
harness = false
name = "bench_set_seq"
[[bench]]
harness = false
name = "bench_set_from"
[dependencies.micromath]
version = "^2.0"
[dependencies.smallnum]
version = "^0.4"
[dependencies.tinyvec]
features = ["rustc_1_55"]
version = "^1.5"
[dev-dependencies.criterion]
version = "0.3"
[dev-dependencies.lazy_static]
version = "1"
[dev-dependencies.rand]
features = ["small_rng"]
version = "0.7"
[features]
alt_impl = []
fast_rebalance = []
low_mem_insert = []
[lib]
name = "scapegoat"
path = "src/lib.rs"
[package]
authors = ["Tiemoko Ballo"]
categories = ["algorithms", "data-structures", "no-std", "embedded"]
description = "Safe, fallible, embedded-friendly ordered set/map via a scapegoat tree. Validated against BTreeSet/BTreeMap."
documentation = "https://docs.rs/scapegoat"
edition = "2018"
homepage = "https://github.com/tnballo/scapegoat"
include = ["src/**/*.rs", "benches/**/*.rs", "build.rs", "README.md", "Cargo.toml", "LICENSE"]
keywords = ["stack", "set", "map", "no_std", "fallible"]
license = "MIT"
name = "scapegoat"
readme = "README.md"
repository = "https://github.com/tnballo/scapegoat"
version = "2.3.0"