Struct IntervalTree 

pub struct IntervalTree<T: Clone + Eq + Hash> { /* private fields */ }

B-Tree based implementation of the interval index.

Implementations

impl<T: Clone + Eq + Hash> IntervalTree<T>

pub fn new() -> Self

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn get_mut(&mut self, low: u32, high: u32) -> Option<&mut HashSet<T>>

Get a mutable reference to the values for an exact interval match. Required by the Entry API.

pub fn insert(&mut self, low: u32, high: u32, value: T)

Insert a value for the given interval [low, high]

pub fn query(&self, q_low: u32, q_high: u32) -> Vec<(u32, u32, HashSet<T>)>

pub fn remove(&mut self, low: u32, high: u32, value: &T) -> bool

pub fn entry(&mut self, low: u32, high: u32) -> BTreeEntry<'_, T>

pub fn bulk_build_points(&mut self, items: Vec<(u32, HashSet<T>)>)

Bulk build optimization for a collection of point intervals [x,x].

Trait Implementations

impl<T: Clone + Clone + Eq + Hash> Clone for IntervalTree<T>

fn clone(&self) -> IntervalTree<T>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Debug + Clone + Eq + Hash> Debug for IntervalTree<T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T: Clone + Eq + Hash> Default for IntervalTree<T>

fn default() -> Self

Returns the “default value” for a type.