Struct RangeObjectMap

pub struct RangeObjectMap<T> {
    v: Vec<Elem<T>>,
}

Fields

v: Vec<Elem<T>>

Implementations

impl<T> RangeObjectMap<T>

pub fn new() -> Self

fn find_offset(&self, offset: Size) -> Result<usize, usize>

Finds the position of the allocation containing the given offset. If the offset is not in an existing allocation, then returns Err containing the position where such allocation should be inserted

pub fn access_type(&self, range: AllocRange) -> AccessType

Determines whether a given access on range overlaps with an existing allocation

pub fn insert_at_pos(&mut self, pos: usize, range: AllocRange, data: T)

Inserts an object and its occupied range at given position

pub fn remove_pos_range(&mut self, pos_range: Range<usize>)

pub fn remove_from_pos(&mut self, pos: usize)

pub fn iter(&self) -> impl Iterator<Item = &T>

Trait Implementations

impl<T: Clone> Clone for RangeObjectMap<T>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for RangeObjectMap<T>

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

Formats the value using the given formatter.

impl<T> Index<usize> for RangeObjectMap<T>

type Output = T

The returned type after indexing.

fn index(&self, pos: usize) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<T> IndexMut<usize> for RangeObjectMap<T>

fn index_mut(&mut self, pos: usize) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

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