Struct MatchCell 

pub struct MatchCell {
    pub value: Value,
    pub enable: Net,
    pub patterns: Vec<Vec<Const>>,
}

If enable is asserted, output is one-hot priority match of value against patterns. Otherwise it is zero.

Fields

value: Value

enable: Net

patterns: Vec<Vec<Const>>

Each pattern is a list of alternatives.

Notice that X in a match pattern has different semantics than usual — it signifies “match any bit”, and not “replace with whatever is easier to synthesize”. This is fine, since the patterns are constants.

Implementations

impl MatchCell

pub fn output_len(&self) -> usize

pub fn visit(&self, f: impl FnMut(Net))

pub fn visit_mut(&mut self, f: impl FnMut(&mut Net))

Trait Implementations

impl Clone for MatchCell

fn clone(&self) -> MatchCell

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for MatchCell

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

Formats the value using the given formatter.

impl Hash for MatchCell

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for MatchCell

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

impl StructuralPartialEq for MatchCell