Struct RangeMap 

pub struct RangeMap<I, V> { /* private fields */ }

Maps ranges of indices to values for efficient reverse lookups.

Stores first_index values in a sorted Vec and uses binary search to find the value for any index. The value is derived from the position.

Includes a direct-mapped cache for O(1) floor lookups when there’s locality.

Implementations

impl<I: Ord + Copy + Default + Into<usize>, V: From<usize> + Copy + Default> RangeMap<I, V>

pub fn len(&self) -> usize

Number of ranges stored.

pub fn truncate(&mut self, new_len: usize)

Truncate to new_len ranges and clear the cache.

pub fn reserve(&mut self, additional: usize)

Reserve capacity for additional entries.

pub fn push(&mut self, first_index: I)

Push a new first_index. Value is implicitly the current length. Must be called in order (first_index must be >= all previous).

pub fn last_key(&self) -> Option<I>

Returns the last pushed first_index, if any.

pub fn get(&mut self, index: I) -> Option<V>

Floor: returns the value (position) of the largest first_index <= given index.

pub fn ceil(&self, index: I) -> Option<V>

Ceil: returns the value (position) of the smallest first_index >= given index.

pub fn get_shared(&self, index: I) -> Option<V>

Shared (immutable) floor lookup — binary search only, no cache update. Use when you only have &self (e.g. read-only clones in the query layer).

Trait Implementations

impl<I: Default + Copy, V: Default + Copy> Clone for RangeMap<I, V>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<I: Default + Copy, V: Default + Copy> Default for RangeMap<I, V>

fn default() -> Self

Returns the “default value” for a type.

impl<I: Default + Copy, V: Default + Copy> From<Vec<I>> for RangeMap<I, V>

fn from(first_indexes: Vec<I>) -> Self

Converts to this type from the input type.