Struct IntervalTree 

pub struct IntervalTree { /* private fields */ }

An interval tree for efficient clip lookup.

Build the tree from a list of clip intervals using IntervalTree::build, then query with query_point or query_range.

Implementations

impl IntervalTree

pub fn empty() -> Self

Create an empty interval tree.

pub fn build(intervals: Vec<ClipInterval>) -> Self

Build an interval tree from a list of intervals.

The intervals are sorted by start position and augmented with max-end values for efficient querying.

pub fn query_point(&self, point: i64) -> Vec<ClipInterval>

Query all intervals that contain a specific point.

pub fn query_range(&self, start: i64, end: i64) -> Vec<ClipInterval>

Query all intervals that overlap with a range.

pub fn nearest_edge(&self, position: i64) -> Option<(i64, ClipId, bool)>

Find the nearest clip edge (start or end) to a given position.

Returns (position, clip_id, is_start_edge).

pub fn len(&self) -> usize

Get the total number of intervals in the tree.

pub fn is_empty(&self) -> bool

Check if the tree is empty.

Trait Implementations

impl Debug for IntervalTree

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

Formats the value using the given formatter.