nonoverlapping_interval_tree 0.1.3

Map data structure keyed on (non-overlapping) ranges that allows lookup of a point within a range. Can be no_std (with use of alloc crate).
Documentation 
[dependencies]

[features]
default = ["std"]
std = []

[package]
authors = ["Daniel Bittman <danielbittman1@gmail.com>"]
categories = ["data-structures", "no-std"]
description = "Map data structure keyed on (non-overlapping) ranges that allows lookup of a point within a range. Can be no_std (with use of alloc crate)."
documentation = "https://docs.rs/nonoverlapping_interval_tree"
edition = "2021"
homepage = "https://github.com/dbittman/non-overlapping-interval-tree.git"
keywords = ["map", "no_std", "range", "interval", "tree"]
license = "MIT"
name = "nonoverlapping_interval_tree"
readme = "README.md"
repository = "https://github.com/dbittman/non-overlapping-interval-tree.git"
resolver = "2"
version = "0.1.3"