[[bench]]
harness = false
name = "bench-solve"
[[bin]]
name = "bex-shell"
path = "examples/shell/bex-shell.rs"
[[bin]]
name = "bdd-solve"
path = "examples/solve/bdd-solve.rs"
[[bin]]
name = "factor-p"
path = "examples/solve/factor-p.rs"
[dependencies.boxcar]
version = "0.1.0"
[dependencies.concurrent-queue]
version = "2.1.0"
[dependencies.dashmap]
version = "5.4.0"
[dependencies.fxhash]
version = "0.2.1"
[dependencies.log]
features = ["max_level_debug"]
version = "0.4"
[dependencies.num_cpus]
version = "1.0"
[dependencies.rand]
version = "0.8.5"
[dependencies.simplelog]
version = "0.5"
[dev-dependencies.bencher]
version = "0.1.5"
[features]
slowtests = []
[lib]
name = "bex"
path = "src/lib.rs"
[package]
authors = ["tangentstorm <michal.wallace@gmail.com>"]
categories = ["algorithms", "data-structures"]
description = "A rust library for working with boolean expressions (syntax trees, decision diagrams, algebraic normal form, etc.)"
documentation = "https://docs.rs/bex/"
edition = "2021"
keywords = ["bdd", "diagram", "anf"]
license = "MIT"
name = "bex"
readme = "README.md"
repository = "https://github.com/tangentstorm/bex"
version = "0.2.0"