Struct miri::range_map::RangeMap

source ·
pub struct RangeMap<T> {
    v: Vec<Elem<T>>,
}

Fields§

§v: Vec<Elem<T>>

Implementations§

source§

impl<T> RangeMap<T>

source

pub fn new(size: Size, init: T) -> RangeMap<T>

Creates a new RangeMap for the given size, and with the given initial value used for the entire range.

source

fn find_offset(&self, offset: u64) -> usize

Finds the index containing the given offset.

source

pub fn iter( &self, offset: Size, len: Size, ) -> impl Iterator<Item = (Range<u64>, &T)>

Provides read-only iteration over everything in the given range. This does not split items if they overlap with the edges. Do not use this to mutate through interior mutability.

The iterator also provides the range of the given element. How exactly the ranges are split can differ even for otherwise identical maps, so user-visible behavior should never depend on the exact range.

source

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

Provides mutable iteration over all elements. The iterator also provides the range of the given element. How exactly the ranges are split can differ even for otherwise identical maps, so user-visible behavior should never depend on the exact range.

source

pub fn iter_all(&self) -> impl Iterator<Item = (Range<u64>, &T)>

Provides iteration over all elements. The iterator also provides the range of the given element. How exactly the ranges are split can differ even for otherwise identical maps, so user-visible behavior should never depend on the exact range.

source

fn split_index(&mut self, index: usize, split_offset: u64) -> bool
where T: Clone,

source

pub fn iter_mut( &mut self, offset: Size, len: Size, ) -> impl Iterator<Item = (Range<u64>, &mut T)>
where T: Clone + PartialEq,

Provides mutable iteration over everything in the given range. As a side-effect, this will split entries in the map that are only partially hit by the given range, to make sure that when they are mutated, the effect is constrained to the given range. Moreover, this will opportunistically merge neighbouring equal blocks.

The iterator also provides the range of the given element. How exactly the ranges are split (both prior to and resulting from the execution of this function) can differ even for otherwise identical maps, so user-visible behavior should never depend on the exact range.

source

pub fn merge_adjacent_thorough(&mut self)
where T: PartialEq,

Remove all adjacent duplicates

Trait Implementations§

source§

impl<T: Clone> Clone for RangeMap<T>

source§

fn clone(&self) -> RangeMap<T>

Returns a copy of the value. Read more
1.0.0 · source§

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

Performs copy-assignment from source. Read more
source§

impl<T: Debug> Debug for RangeMap<T>

source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<T> Freeze for RangeMap<T>

§

impl<T> RefUnwindSafe for RangeMap<T>
where T: RefUnwindSafe,

§

impl<T> Send for RangeMap<T>
where T: Send,

§

impl<T> Sync for RangeMap<T>
where T: Sync,

§

impl<T> Unpin for RangeMap<T>
where T: Unpin,

§

impl<T> UnwindSafe for RangeMap<T>
where T: UnwindSafe,

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> Same for T

§

type Output = T

Should always be Self
source§

impl<T> ToOwned for T
where T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V

Layout§

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 24 bytes