Trait IntersectByOrder

pub trait IntersectByOrder<Rhs: HList, Ord>: HList {
    type Output: HList;
}

Internal dispatch by comparing the heads of two lists. Chooses one of three branches (Less, Equal, Greater) and recurses accordingly.

Required Associated Types

type Output: HList

The resulting intersected list after ordering dispatch.

Implementors

impl<HA, TA, HB, TB: HList> IntersectByOrder<HCons<HB, TB>, Equal> for HCons<HA, TA>

where TA: IntersectUnchecked<TB> + HList,

type Output = HCons<HA, <TA as IntersectUnchecked<TB>>::Output>

impl<HA, TA, HB, TB: HList> IntersectByOrder<HCons<HB, TB>, Less> for HCons<HA, TA>

where TA: IntersectUnchecked<HCons<HB, TB>> + HList,

type Output = <TA as IntersectUnchecked<HCons<HB, TB>>>::Output

impl<HA, TA: HList, HB, TB: HList> IntersectByOrder<HCons<HB, TB>, Greater> for HCons<HA, TA>

where HCons<HA, TA>: IntersectUnchecked<TB>,

type Output = <HCons<HA, TA> as IntersectUnchecked<TB>>::Output