Trait IntersectUnchecked

pub trait IntersectUnchecked<Other: HList>: HList {
    type Output: HList;
}

Compute the intersection of two arbitrary HLists, with no sortedness requirements. Yields an HList of the common elements (in the order of the left list).

This trait does not check that its inputs are sorted; it simply runs the single-pass intersect algorithm on any HList.

Required Associated Types

type Output: HList

The resulting list of elements present in both Self and Other.

Implementors

impl<H, T: HList> IntersectUnchecked<HNil> for HCons<H, T>

type Output = HNil

impl<HA, TA: HList, HB, TB: HList, Ordering> IntersectUnchecked<HCons<HB, TB>> for HCons<HA, TA>

where HA: Cmp<HB, Output = Ordering>, HCons<HA, TA>: IntersectByOrder<HCons<HB, TB>, Ordering>,

type Output = <HCons<HA, TA> as IntersectByOrder<HCons<HB, TB>, Ordering>>::Output

impl<List: HList> IntersectUnchecked<List> for HNil

type Output = HNil