### 3 releases (breaking)

new 0.2.0 | Dec 3, 2023 |
---|---|

0.1.0 | Jul 1, 2023 |

0.0.1 | Jun 11, 2023 |

#**1486** in Data structures

**22** downloads per month

**AGPL-3.0-or-later**

30KB

488 lines

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

is supported and should work with the default features.`no_std`

There are three main operations available on this data-structure:
insertion, removal and gap-queries. Each of which are

where `O (log(N) + K)`

`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

# Removal

# Gap-Query

###
`lib.rs`

:

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

is supported and should work with the default features.`no_std`

There are three main operations available on this data-structure:
insertion, removal and gap-queries. Each of which are

where `O (log(N) + K)`

`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

# Removal

# Gap-Query

#### Dependencies

~1.4–2MB

~42K SLoC