Struct frunk_core::hlist::HNil

pub struct HNil;

Represents the right-most end of a heterogeneous list

Used to begin one:

let h = h_cons(1, HNil);
let h = h.head;
assert_eq!(h, 1);

Trait Implementations

impl PartialEq for HNil

fn eq(&self, __arg_0: &HNil) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

impl Debug for HNil

fn fmt(&self, __arg_0: &mut Formatter) -> Result

Formats the value using the given formatter.

impl Eq for HNil

impl Clone for HNil

fn clone(&self) -> HNil

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Copy for HNil

impl PartialOrd for HNil

fn partial_cmp(&self, __arg_0: &HNil) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl Ord for HNil

fn cmp(&self, __arg_0: &HNil) -> Ordering

This method returns an Ordering between self and other.

impl HList for HNil

fn length(&self) -> u32

Returns the length of a given HList

fn prepend<H>(self, h: H) -> HCons<H, Self>

Prepends an item to the current HList

impl<RHS> Add<RHS> for HNil where RHS: HList

type Output = RHS

The resulting type after applying the + operator

fn add(self, rhs: RHS) -> RHS

The method for the + operator

impl IntoReverse for HNil

type Output = HNil

fn into_reverse(self) -> Self::Output

Reverses a given data structure.

impl<F> HMappable<F> for HNil

type Output = HNil

fn map(self, _: F) -> Self::Output

Maps over the current data structure using functions stored in another data structure.

impl<F, Init> HFoldRightable<F, Init> for HNil

type Output = Init

fn foldr(self, _: F, i: Init) -> Self::Output

foldr over a data structure

impl<F, Acc> HZipFoldLeftable<F, Acc> for HNil

type Output = Acc

fn foldl(self, _: F, acc: Acc) -> Self::Output

foldl over a data structure