Struct wgpu_core::track::range::RangedStates

pub(crate) struct RangedStates<I, T> {
    ranges: SmallVec<[(Range<I>, T); 1]>,
}

Structure that keeps track of a I -> T mapping, optimized for a case where keys of the same values are often grouped together linearly.

Fields

ranges: SmallVec<[(Range<I>, T); 1]>

List of ranges, each associated with a singe value. Ranges of keys have to be non-intersecting and ordered.

Implementations

impl<I: Copy + Ord, T: Copy + PartialEq> RangedStates<I, T>

pub fn from_range(range: Range<I>, value: T) -> Self

pub fn iter(&self) -> impl Iterator<Item = &(Range<I>, T)> + Clone

pub fn iter_mut(&mut self) -> impl Iterator<Item = &mut (Range<I>, T)>

pub fn coalesce(&mut self)

Merge the neighboring ranges together, where possible.

pub fn iter_filter<'a>( &'a self, range: &'a Range<I>, ) -> impl Iterator<Item = (Range<I>, &'a T)> + 'a

pub fn isolate(&mut self, index: &Range<I>, default: T) -> &mut [(Range<I>, T)]

Split the storage ranges in such a way that there is a linear subset of them occupying exactly index range, which is returned mutably.

Gaps in the ranges are filled with default value.

Trait Implementations

impl<I: Clone, T: Clone> Clone for RangedStates<I, T>

fn clone(&self) -> RangedStates<I, T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<I: Debug, T: Debug> Debug for RangedStates<I, T>

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

Formats the value using the given formatter.

impl<I: PartialEq, T: PartialEq> PartialEq for RangedStates<I, T>

fn eq(&self, other: &RangedStates<I, T>) -> 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<I, T> StructuralPartialEq for RangedStates<I, T>