treemath 0.2.1

Arithmetics for perfect binary trees
Documentation
[[bench]]
harness = false
name = "all"
path = "benches/all.rs"

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

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

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

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

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

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

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

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

[dev-dependencies.criterion]
package = "codspeed-criterion-compat"
version = "2.7"

[dev-dependencies.itertools]
version = "0.14"

[dev-dependencies.rand]
version = "0.9"

[features]
bench = []

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

[package]
authors = ["Beltram Maldant"]
autobenches = false
autobins = false
autoexamples = false
autolib = false
autotests = false
build = false
description = "Arithmetics for perfect binary trees"
documentation = "https://docs.rs/treemath"
edition = "2024"
homepage = "https://github.com/beltram/treemath"
keywords = ["tree"]
license = "Apache-2.0"
name = "treemath"
readme = "README.md"
repository = "https://github.com/beltram/treemath"
resolver = "3"
version = "0.2.1"