Struct stam::RelationMap

pub struct RelationMap<A, B> { /* private fields */ }

This models relations or ‘edges’ in graph terminology, between handles. It acts as a reverse index is used for various purposes.

Implementations

impl<A, B> RelationMap<A, B>where A: Handle, B: Handle,

pub fn new() -> Self

pub fn insert(&mut self, x: A, y: B)

Insert a relation into the map

pub fn remove(&mut self, x: A, y: B)

Remove a relation from the map

pub fn get(&self, x: A) -> Option<&Vec<B>>

pub fn totalcount(&self) -> usize

pub fn count(&self, x: A) -> usize

Trait Implementations

impl<A: Clone, B: Clone> Clone for RelationMap<A, B>

fn clone(&self) -> RelationMap<A, B>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<A: Debug, B: Debug> Debug for RelationMap<A, B>

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

Formats the value using the given formatter.

impl<A, B> Default for RelationMap<A, B>where A: Handle, B: Handle,

fn default() -> Self

Returns the “default value” for a type.

impl<A, B> Extend<(A, B)> for RelationMap<A, B>where A: Handle, B: Handle,

fn extend<T>(&mut self, iter: T)where T: IntoIterator<Item = (A, B)>,

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.