Struct RangeMap 

pub struct RangeMap { /* private fields */ }

An index structure that maps memory addresses to allocation indices.

Built once from a list of allocations, then queried many times during pointer scanning.

Implementations

impl RangeMap

pub fn new(allocations: &[ActiveAllocation]) -> Self

Build a RangeMap from a list of active allocations.

Arguments

• allocations - Slice of allocations to index. Each allocation’s index in this slice becomes its alloc_id.

pub fn find_containing(&self, ptr: usize) -> Option<usize>

Find the allocation ID that contains the given pointer.

Returns Some(alloc_id) if ptr falls within [start, end) of some allocation, or None if no allocation contains it.

Complexity

O(log n) via binary search.

pub fn find_exact_start(&self, ptr: usize) -> Option<usize>

Find the allocation ID where the pointer equals the start address.

Returns Some(alloc_id) if ptr == alloc.start for some allocation.

pub fn len(&self) -> usize

Get the number of indexed allocations.

pub fn is_empty(&self) -> bool

Check if the range map is empty.

Trait Implementations

impl Debug for RangeMap

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

Formats the value using the given formatter.

impl Default for RangeMap

fn default() -> RangeMap

Returns the “default value” for a type.