Struct IntervalTreeBuilder 

pub struct IntervalTreeBuilder<T, V> { /* private fields */ }

Builder for constructing an IntervalTree.

Example

use simd_intervaltree::IntervalTree;

let tree = IntervalTree::builder()
    .insert(0..10, "first")
    .insert(5..15, "second")
    .build();

Implementations

impl<T, V> IntervalTreeBuilder<T, V>

pub fn new() -> Self

Creates a new empty builder.

pub fn with_capacity(capacity: usize) -> Self

Creates a new builder with the specified capacity.

pub fn insert<R: Into<Interval<T>>>(self, range: R, value: V) -> Self

Inserts an interval with its associated value.

pub fn len(&self) -> usize

Returns the number of intervals added.

pub fn is_empty(&self) -> bool

Returns true if no intervals have been added.

impl<T: Ord + Copy, V> IntervalTreeBuilder<T, V>

pub fn build(self) -> IntervalTree<T, V>

Builds the interval tree.

Data is laid out contiguously per node for SIMD-friendly scanning. Each node’s intervals are sorted by start (ascending) in the main arrays, with a separate index array for by-end (descending) ordering.

Trait Implementations

impl<T: Clone, V: Clone> Clone for IntervalTreeBuilder<T, V>

fn clone(&self) -> IntervalTreeBuilder<T, V>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug, V: Debug> Debug for IntervalTreeBuilder<T, V>

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

Formats the value using the given formatter.

impl<T, V> Default for IntervalTreeBuilder<T, V>

fn default() -> Self

Returns the “default value” for a type.