Struct ArrayBackedIntervalTree

pub struct ArrayBackedIntervalTree<N: Ord + Clone + Copy, D> { /* private fields */ }

Implementations

impl<N: Ord + Clone + Copy, D: Clone> ArrayBackedIntervalTree<N, D>

pub fn new() -> Self

pub fn insert<I: Into<Interval<N>>>(&mut self, interval: I, data: D)

pub fn index(&mut self)

pub fn find<I: Into<Interval<N>>>(&self, interval: I) -> Vec<Entry<'_, N, D>>

Find overlapping intervals in the index. Returns a vector of entries, consisting of the interval and its associated data.

Arguments

• interval - The interval for which overlaps are to be found in the index. Can also be a Range.

Panics

Panics if this IITree instance has not been indexed yet.

pub fn find_into<'b, 'a: 'b, I: Into<Interval<N>>>( &'a self, interval: I, results: &'b mut Vec<Entry<'a, N, D>>, )

Find overlapping intervals in the index

Arguments

• interval - The interval for which overlaps are to be found in the index. Can also be a Range.
• results - A reusable buffer vector for storing the results.

Panics

Panics if this IITree instance has not been indexed yet.

Trait Implementations

impl<N: Clone + Ord + Clone + Copy, D: Clone> Clone for ArrayBackedIntervalTree<N, D>

fn clone(&self) -> ArrayBackedIntervalTree<N, D>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<N: Debug + Ord + Clone + Copy, D: Debug> Debug for ArrayBackedIntervalTree<N, D>

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

Formats the value using the given formatter.

impl<N: Ord + Clone + Copy, D> Default for ArrayBackedIntervalTree<N, D>

fn default() -> Self

Returns the “default value” for a type.

impl<'de, N, D> Deserialize<'de> for ArrayBackedIntervalTree<N, D>

where N: Deserialize<'de> + Ord + Clone + Copy, D: Deserialize<'de>,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<N, D, V> FromIterator<(V, D)> for ArrayBackedIntervalTree<N, D>

where V: Into<Interval<N>>, N: Ord + Clone + Copy, D: Clone,

fn from_iter<T: IntoIterator<Item = (V, D)>>(iter: T) -> Self

Creates a value from an iterator.

impl<N: Hash + Ord + Clone + Copy, D: Hash> Hash for ArrayBackedIntervalTree<N, D>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<N: PartialEq + Ord + Clone + Copy, D: PartialEq> PartialEq for ArrayBackedIntervalTree<N, D>

fn eq(&self, other: &ArrayBackedIntervalTree<N, D>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<N, D> Serialize for ArrayBackedIntervalTree<N, D>

where N: Serialize + Ord + Clone + Copy, D: Serialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<N: Eq + Ord + Clone + Copy, D: Eq> Eq for ArrayBackedIntervalTree<N, D>

impl<N: Ord + Clone + Copy, D> StructuralPartialEq for ArrayBackedIntervalTree<N, D>