Skip to content
This repository has been archived by the owner on Feb 11, 2024. It is now read-only.

A crate that provides a gap-query optimized interval-tree data-structure.

License

Notifications You must be signed in to change notification settings

ripytide/gap_query_interval_tree

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

26 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

This crate has been absorbed into the nodit crate

Please switch to using the Gqdit type in the nodit crate as this crate will no longer be receiving updates.

Old README

A crate that provides a gap-query optimized interval-tree data-structure.

no_std is supported and should work with the default features.

There are three main operations available on this data-structure: insertion, removal and gap-queries. Each of which are O(log(N) + K) where N is the total number of intervals in the tree and K is the number of intervals required to be processed.

Here are visualizations of the three operations:

Insertion

insertion

Removal

removal

Gap-Query

gap-query