Struct Heap 

pub struct Heap { /* private fields */ }

A finite heap: a partial map from addresses to values.

Implementations

impl Heap

pub fn empty() -> Self

Create an empty heap.

pub fn read(&self, addr: u64) -> Option<u64>

Read a value from the heap. Returns None if unallocated.

pub fn write(&mut self, addr: u64, val: u64)

Write a value to the heap.

pub fn dealloc(&mut self, addr: u64)

Deallocate an address.

pub fn is_disjoint(&self, other: &Self) -> bool

Check whether two heaps are disjoint (non-overlapping domains).

pub fn disjoint_union(&self, other: &Self) -> Self

Form the disjoint union of two heaps (panics if they overlap).

pub fn domain(&self) -> HashSet<u64>

Return the domain (set of allocated addresses).

pub fn size(&self) -> usize

Return the number of allocated cells.

Trait Implementations

impl Clone for Heap

fn clone(&self) -> Heap

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Heap

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

Formats the value using the given formatter.

impl PartialEq for Heap

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

impl StructuralPartialEq for Heap