Struct Row 

pub struct Row {
    pub atoms: BTreeSet<Effect>,
    pub tails: BTreeSet<RowVarId>,
}

An effect row: a set of atoms, plus row variables standing for the rest.

Fields

atoms: BTreeSet<Effect>

tails: BTreeSet<RowVarId>

Implementations

impl Row

pub fn empty() -> Row

pub fn of(atoms: impl IntoIterator<Item = Effect>) -> Row

pub fn var(v: RowVarId) -> Row

pub fn is_closed(&self) -> bool

pub fn is_pure(&self) -> bool

pub fn union(self, other: &Row) -> Row

The union — the operation inference performs once per call.

pub fn add(&mut self, e: Effect)

pub fn visible(&self) -> Vec<Effect>

The atoms, in a stable order, with ambient ones dropped — how a signature prints (§3.2).

Trait Implementations

impl Clone for Row

fn clone(&self) -> Row

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Row

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

Formats the value using the given formatter.

impl Default for Row

fn default() -> Row

Returns the “default value” for a type.

impl Display for Row

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

Formats the value using the given formatter.

impl PartialEq for Row

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

impl StructuralPartialEq for Row