pub struct MatchCell {
pub value: Value,
pub enable: Net,
pub patterns: Vec<Vec<Const>>,
}
Expand description
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§
Trait Implementations§
impl Eq for MatchCell
impl StructuralPartialEq for MatchCell
Auto Trait Implementations§
impl Freeze for MatchCell
impl RefUnwindSafe for MatchCell
impl Send for MatchCell
impl Sync for MatchCell
impl Unpin for MatchCell
impl UnwindSafe for MatchCell
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.