Struct tlist::TCons

pub struct TCons<H, T: TList>(_);

A non-empty TList whose first element is H and whose tail is the TList T.

Trait Implementations

impl<H: Clone, T: Clone + TList> Clone for TCons<H, T>

fn clone(&self) -> TCons<H, T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<H: Debug, T: Debug + TList> Debug for TCons<H, T>

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

Formats the value using the given formatter.

impl<H: Default, T: Default + TList> Default for TCons<H, T>

fn default() -> TCons<H, T>

Returns the “default value” for a type.

impl<H: Hash, T: Hash + TList> Hash for TCons<H, T>

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<H, T: TList> NonEmpty for TCons<H, T>

type First = H

Implementation of First.

type Rest = T

Implementation of Rest.

type Last = <T as TListImpl>::Last<H>

Implementation of Last.

type Inits = <T as TListImpl>::Inits<H>

Implementation of Inits.

impl<H: Ord, T: Ord + TList> Ord for TCons<H, T>

fn cmp(&self, other: &TCons<H, T>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Selfwhere Self: Sized + PartialOrd<Self>,

Restrict a value to a certain interval.

impl<H: PartialEq, T: PartialEq + TList> PartialEq<TCons<H, T>> for TCons<H, T>

fn eq(&self, other: &TCons<H, T>) -> 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 !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<H: PartialOrd, T: PartialOrd + TList> PartialOrd<TCons<H, T>> for TCons<H, T>

fn partial_cmp(&self, other: &TCons<H, T>) -> 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<H, T: TList> TList for TCons<H, T>

type Concat<Rhs: TList> = TCons<H, <T as TList>::Concat<Rhs>>

Implementation of Concat.

type Reverse = <<T as TList>::Reverse as TList>::Concat<TCons<H, TNil>>

Implementation of Reverse.

type IsEmpty = B0

Available on crate feature typenum only.

Implementation of IsEmpty.

type Len = <<T as TList>::Len as UnsignedExt>::Succ

Available on crate feature typenum only.

Implementation of Len.

const IS_EMPTY: bool = false

True iff the list is empty, false otherwise.

const LEN: usize = _

The amount of elements in the list.

impl<F, FS, GS: TList> EitherPrefix<TCons<F, GS>> for TCons<F, FS>where FS: EitherPrefix<GS> + TList,

impl<F, GS: TList> EitherPrefix<TCons<F, GS>> for TNil

impl<F, FS: TList> EitherPrefix<TNil> for TCons<F, FS>

impl<H: Eq, T: Eq + TList> Eq for TCons<H, T>

impl<H, Ls, Rs: TList> Prefix<TCons<H, Rs>> for TCons<H, Ls>where Ls: Prefix<Rs> + TList,

impl<H, T: TList> StructuralEq for TCons<H, T>

impl<H, T: TList> StructuralPartialEq for TCons<H, T>