Struct LookupBus

pub struct LookupBus {
    pub index: BusIndex,
}

A Lookup bus is used to establish that one multiset of values (the queries) are subset of another multiset of values (the keys).

Soundness requires that the total number of queries sent over the bus per message is at most the field characteristic.

Fields

index: BusIndex

Implementations

impl LookupBus

pub const fn new(index: BusIndex) -> Self

pub fn lookup_key<AB, E>( &self, builder: &mut AB, query: impl IntoIterator<Item = E>, enabled: impl Into<AB::Expr>, )

where AB: InteractionBuilder, E: Into<AB::Expr>,

Performs a lookup on the given bus.

This method asserts that key is present in the lookup table. The parameter enabled must be constrained to be boolean, and the lookup constraint is imposed provided enabled is one.

Caller must constrain that enabled is boolean.

pub fn add_key_with_lookups<AB, E>( &self, builder: &mut AB, key: impl IntoIterator<Item = E>, num_lookups: impl Into<AB::Expr>, )

where AB: InteractionBuilder, E: Into<AB::Expr>,

Adds a key to the lookup table.

The num_lookups parameter should equal the number of enabled lookups performed.

Trait Implementations

impl Clone for LookupBus

fn clone(&self) -> LookupBus

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for LookupBus

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

Formats the value using the given formatter.

impl PartialEq for LookupBus

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

impl Eq for LookupBus

impl StructuralPartialEq for LookupBus