discrete_range_map 0.4.3

This crate provides DiscreteRangeMap and DiscreteRangeSet, Data Structures for storing non-overlapping discrete intervals based off BTreeMap.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29

[dependencies.btree_monstrousity]
features = ["btree_drain_filter", "btree_cursors"]
version = "0.0.4"

[dependencies.either]
version = "1.8.1"

[dependencies.itertools]
version = "0.10.5"

[dependencies.serde]
features = ["derive"]
version = "1.0.148"
[dev-dependencies.pretty_assertions]
version = "1.3.0"

[package]
authors = ["James Forster <james.forsterer@gmail.com>"]
categories = ["data-structures"]
description = "This crate provides DiscreteRangeMap and DiscreteRangeSet, Data\nStructures for storing non-overlapping discrete intervals based off\nBTreeMap.\n"
documentation = "https://docs.rs/discrete_range_map"
edition = "2021"
homepage = "https://github.com/ripytide/discrete_range_map"
keywords = ["data-structures", "map", "data", "library"]
license = "AGPL-3.0-or-later"
name = "discrete_range_map"
readme = "README.md"
repository = "https://github.com/ripytide/discrete_range_map"
version = "0.4.3"