Struct SpanMap 

pub struct SpanMap<K, V>
where
    K: Clone + Ord,
    V: Clone + Ord,
{ /* private fields */ }

A map that associates spans (ranges) with sets of values.

SpanMap maintains a mapping between spans and sets of values, where:

• Each span represents a continuous range with well-defined boundaries
• Multiple values can be associated with the same span
• Spans can overlap, resulting in points that contain multiple values
• Queries at any point return all values associated with spans containing that point

The implementation uses a B-tree based data structure for efficient operations.

Type Parameters

• K: The type of the keys defining span boundaries. Must implement Clone and Ord.
• V: The type of values stored in the sets. Must implement Clone and Ord.

Implementations

impl<K, V> SpanMap<K, V>

where K: Clone + Ord, V: Clone + Ord,

pub fn new() -> Self

Creates a new, empty SpanMap.

The new map is initialized with an unbounded span containing an empty set.

impl<K, V> SpanMap<K, V>

where K: Clone + Ord, V: Clone + Ord,

pub fn get(&self, key: &K) -> impl Iterator<Item = &V>

Returns an iterator over all values associated with spans containing the given key.

pub fn values<R>(&self, range: R) -> BTreeSet<&V>

where R: RangeBounds<K>,

Returns all unique values associated with spans that overlap the given range.

This method collects all values from sets that are associated with spans intersecting the input range. Values are deduplicated and returned in sorted order.

Examples

use span_map::SpanMap;

let mut map = SpanMap::new();
map.insert(0..10, "a");
map.insert(5..15, "b");
map.insert(12..20, "c");

let values: Vec<_> = map.values(5..12).into_iter().collect();
assert_eq!(values, vec![&"a", &"b"]);

pub fn insert<R>(&mut self, range: R, value: V)

where R: RangeBounds<K>,

Inserts a value into all sets associated with spans overlapping the given range.

Adjacent ranges with the same value are merged into a single range.

pub fn remove<R>(&mut self, range: R, value: V)

where R: RangeBounds<K>,

Removes a value from all sets associated with spans overlapping the given range.

Adjacent ranges with the same value are merged into a single range.

Trait Implementations

impl<K, V> Clone for SpanMap<K, V>

where K: Clone + Ord + Clone, V: Clone + Ord + Clone,

fn clone(&self) -> SpanMap<K, V>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K, V> Debug for SpanMap<K, V>

where K: Clone + Ord + Debug, V: Clone + Ord + Debug,

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

Formats the value using the given formatter.

impl<K, V> Default for SpanMap<K, V>

where K: Clone + Ord, V: Clone + Ord,

fn default() -> Self

Returns the “default value” for a type.

impl<K, V> PartialEq for SpanMap<K, V>

where K: Clone + Ord + PartialEq, V: Clone + Ord + PartialEq,

fn eq(&self, other: &SpanMap<K, V>) -> 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<K, V> Eq for SpanMap<K, V>

where K: Clone + Ord + Eq, V: Clone + Ord + Eq,

impl<K, V> StructuralPartialEq for SpanMap<K, V>

where K: Clone + Ord, V: Clone + Ord,