Struct Bijection 

pub struct Bijection<A: Eq + Hash + Clone, B: Eq + Hash + Clone> { /* private fields */ }

A bijective map between two sets (one-to-one and onto).

Useful for tracking variable renaming during alpha-equivalence checks.

Implementations

impl<A: Eq + Hash + Clone, B: Eq + Hash + Clone> Bijection<A, B>

pub fn new() -> Self

Create an empty bijection.

pub fn insert(&mut self, a: A, b: B) -> bool

Insert a pair (a, b). Returns false if either side is already bound.

pub fn forward(&self, a: &A) -> Option<&B>

Look up the image of a.

pub fn backward(&self, b: &B) -> Option<&A>

Look up the preimage of b.

pub fn len(&self) -> usize

Number of pairs.

pub fn is_empty(&self) -> bool

Check whether the bijection is empty.

pub fn remove(&mut self, a: &A) -> Option<B>

Remove a pair by its left element. Returns the removed right element if present.

Trait Implementations

impl<A: Clone + Eq + Hash + Clone, B: Clone + Eq + Hash + Clone> Clone for Bijection<A, B>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<A: Debug + Eq + Hash + Clone, B: Debug + Eq + Hash + Clone> Debug for Bijection<A, B>

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

Formats the value using the given formatter.

impl<A: Default + Eq + Hash + Clone, B: Default + Eq + Hash + Clone> Default for Bijection<A, B>

fn default() -> Bijection<A, B>

Returns the “default value” for a type.