Struct Cons 

pub struct Cons<Item, Next: List> { /* private fields */ }

The concrete type constructor for our HList trait

Trait Implementations

impl<U, B, N, T> Consume<Absorb<UInt<U, B>>> for Cons<Absorb<N>, T>

where U: Unsigned, B: Bit, N: Unsigned + Sub<UInt<U, B>>, T: List, Cons<Absorb<Diff<N, UInt<U, B>>>, T>: Normalize,

type Output = <Cons<Absorb<<N as Sub<UInt<U, B>>>::Output>, T> as Normalize>::Output

The output of the consumption

impl<N, T: List> Consume<Absorb<UTerm>> for Cons<Absorb<N>, T>

where N: Unsigned,

type Output = Cons<Absorb<N>, T>

The output of the consumption

impl<U, B, N, T> Consume<Squeeze<UInt<U, B>>> for Cons<Squeeze<N>, T>

where U: Unsigned, B: Bit, N: Unsigned + Sub<UInt<U, B>>, T: List, Cons<Squeeze<Diff<N, UInt<U, B>>>, T>: Normalize,

type Output = <Cons<Squeeze<<N as Sub<UInt<U, B>>>::Output>, T> as Normalize>::Output

The output of the consumption

impl<N, T: List> Consume<Squeeze<UTerm>> for Cons<Squeeze<N>, T>

where N: Unsigned,

type Output = Cons<Squeeze<N>, T>

The output of the consumption

impl<Item: Debug, Next: Debug + List> Debug for Cons<Item, Next>

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

Formats the value using the given formatter.

impl<Item: IOWord, Next: List> List for Cons<Item, Next>

fn unit() -> Self

This is an inhabitant of the List type corresponding to the Self type

fn is_empty() -> bool

THis returns whether the list is empty

impl<U: Unsigned, B: Bit, M: Unsigned, T: List> Normalize for Cons<Absorb<UInt<U, B>>, Cons<Absorb<M>, T>>

where UInt<U, B>: Add<M>, Cons<Absorb<Sum<UInt<U, B>, M>>, T>: Normalize,

type Output = <Cons<Absorb<<UInt<U, B> as Add<M>>::Output>, T> as Normalize>::Output

The output of the normalization

impl<U: Unsigned, B: Bit, U2: Unsigned, B2: Bit, T: List> Normalize for Cons<Absorb<UInt<U, B>>, Cons<Squeeze<UInt<U2, B2>>, T>>

where Cons<Squeeze<UInt<U2, B2>>, T>: Normalize,

type Output = Cons<Absorb<UInt<U, B>>, <Cons<Squeeze<UInt<U2, B2>>, T> as Normalize>::Output>

The output of the normalization

impl<U: Unsigned, B: Bit, T: List> Normalize for Cons<Absorb<UInt<U, B>>, Cons<Squeeze<U0>, T>>

where Cons<Absorb<UInt<U, B>>, T>: Normalize,

type Output = <Cons<Absorb<UInt<U, B>>, T> as Normalize>::Output

The output of the normalization

impl<U: Unsigned, B: Bit> Normalize for Cons<Absorb<UInt<U, B>>, Nil>

type Output = Cons<Absorb<UInt<U, B>>, Nil>

The output of the normalization

impl<L: Normalize> Normalize for Cons<Absorb<U0>, L>

type Output = <L as Normalize>::Output

The output of the normalization

impl<U: Unsigned, B: Bit, U2: Unsigned, B2: Bit, T: List> Normalize for Cons<Squeeze<UInt<U, B>>, Cons<Absorb<UInt<U2, B2>>, T>>

where Cons<Absorb<UInt<U2, B2>>, T>: Normalize,

type Output = Cons<Squeeze<UInt<U, B>>, <Cons<Absorb<UInt<U2, B2>>, T> as Normalize>::Output>

The output of the normalization

impl<U: Unsigned, B: Bit, T: List> Normalize for Cons<Squeeze<UInt<U, B>>, Cons<Absorb<U0>, T>>

where Cons<Squeeze<UInt<U, B>>, T>: Normalize,

type Output = <Cons<Squeeze<UInt<U, B>>, T> as Normalize>::Output

The output of the normalization

impl<U: Unsigned, B: Bit, M: Unsigned, T: List> Normalize for Cons<Squeeze<UInt<U, B>>, Cons<Squeeze<M>, T>>

where UInt<U, B>: Add<M>, Cons<Squeeze<Sum<UInt<U, B>, M>>, T>: Normalize,

type Output = <Cons<Squeeze<<UInt<U, B> as Add<M>>::Output>, T> as Normalize>::Output

The output of the normalization

impl<U: Unsigned, B: Bit> Normalize for Cons<Squeeze<UInt<U, B>>, Nil>

type Output = Cons<Squeeze<UInt<U, B>>, Nil>

The output of the normalization

impl<L: Normalize> Normalize for Cons<Squeeze<U0>, L>

type Output = <L as Normalize>::Output

The output of the normalization

impl<Item: ToSpongeOp, T: List + ToIOPattern> ToIOPattern for Cons<Item, T>

fn to_iopattern() -> IOPattern

Converts the type-level pattern to its term-level representation