2022-11-22 07:12:24 +00:00
|
|
|
[package]
|
2022-11-27 01:24:42 +00:00
|
|
|
name = "range_bounds_map"
|
|
|
|
|
version = "0.0.1"
|
2022-12-01 16:53:13 +00:00
|
|
|
authors = ["James Forster"]
|
2022-11-22 07:12:24 +00:00
|
|
|
edition = "2021"
|
2022-12-01 16:53:13 +00:00
|
|
|
description = """
|
|
|
|
|
This crate provides `RangeBoundsMap` and `RangeBoundsSet`.
|
2022-11-22 07:12:24 +00:00
|
|
|
|
2022-12-01 16:53:13 +00:00
|
|
|
`RangeBoundsMap` is similar to `BTreeMap` except `RangeBoundsMap`
|
|
|
|
|
uses any type that implements the `RangeBounds` trait as keys, while
|
|
|
|
|
maintaining two invariants:
|
|
|
|
|
- No two keys may overlap
|
|
|
|
|
- A keys' `start_bound()` <= its `end_bound()`
|
|
|
|
|
|
|
|
|
|
`RangeBoundsSet` is like `RangeBoundsMap` except it
|
|
|
|
|
uses `()` as values, as `BTreeSet` does for `BTreeMap`
|
|
|
|
|
"""
|
|
|
|
|
documentation = "https://docs.rs/range_bounds_map"
|
|
|
|
|
readme = "README.md"
|
|
|
|
|
homepage = "https://github.com/ripytide/range_bounds_map"
|
|
|
|
|
repository = "https://github.com/ripytide/range_bounds_map"
|
|
|
|
|
license = "GPL-3.0-or-later"
|
|
|
|
|
keywords = ["data-structures", "map", "data", "library"]
|
|
|
|
|
categories = ["data-structures"]
|
2022-11-22 07:12:24 +00:00
|
|
|
|
|
|
|
|
[dependencies]
|
2022-11-23 19:01:36 +00:00
|
|
|
either = "1.8.0"
|
2022-12-02 18:38:17 +00:00
|
|
|
serde = {version = "1.0.148", features = ["derive"]}
|
2022-12-03 20:24:29 +00:00
|
|
|
itertools = "0.10.5"
|
2022-12-06 20:30:52 +00:00
|
|
|
labels = {path = "../robot_sweet_shop/labels"}
|
|
|
|
|
pretty_assertions = "1.3.0"
|
2022-11-28 20:42:22 +00:00
|
|
|
|
|
|
|
|
[dev-dependencies]
|
|
|
|
|
ordered-float = "3.4.0"
|
