Skip to content

A Rust map data structure that manages values keyed with ranges.

License

Notifications You must be signed in to change notification settings

dbittman/non-overlapping-interval-tree

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

18 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Non-overlapping Interval Tree

Simple library for a map data structure that contains elements keyed on ranges, whose keys cannot overlap. Lookup queries can lookup a specific point in a range, and get back the value for that range.

Docs: docs.rs

This library supports no_std (but requires core and the alloc crate). To enable no_std, disable default features.

About

A Rust map data structure that manages values keyed with ranges.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages