pub struct HCons<H, T>(/* private fields */);Trait Implementations§
Source§impl<HA, TA, HB, TB, Ordering> Intersect<HCons<HB, TB>> for HCons<HA, TA>where
HA: Cmp<HB, Output = Ordering>,
HCons<HA, TA>: IntersectByOrder<HCons<HB, TB>, Ordering>,
HCons<HB, TB>: SortedHList,
impl<HA, TA, HB, TB, Ordering> Intersect<HCons<HB, TB>> for HCons<HA, TA>where
HA: Cmp<HB, Output = Ordering>,
HCons<HA, TA>: IntersectByOrder<HCons<HB, TB>, Ordering>,
HCons<HB, TB>: SortedHList,
Source§impl<HA, TA, HB, TB: SortedHList> IntersectByOrder<HCons<HB, TB>, Equal> for HCons<HA, TA>where
Self: SortedHList,
HCons<HB, TB>: SortedHList,
TA: Intersect<TB>,
HCons<HA, <TA as Intersect<TB>>::Output>: SortedHList,
impl<HA, TA, HB, TB: SortedHList> IntersectByOrder<HCons<HB, TB>, Equal> for HCons<HA, TA>where
Self: SortedHList,
HCons<HB, TB>: SortedHList,
TA: Intersect<TB>,
HCons<HA, <TA as Intersect<TB>>::Output>: SortedHList,
Source§impl<HA, TA, HB, TB: SortedHList> IntersectByOrder<HCons<HB, TB>, Greater> for HCons<HA, TA>
impl<HA, TA, HB, TB: SortedHList> IntersectByOrder<HCons<HB, TB>, Greater> for HCons<HA, TA>
impl<H, T: HList> HList for HCons<H, T>
impl<H, T: HList> NonEmptyHList for HCons<H, T>
impl<H, HT, TT> SortedHList for HCons<H, HCons<HT, TT>>
impl<H> SortedHList for HCons<H, HNil>
Auto Trait Implementations§
impl<H, T> Freeze for HCons<H, T>
impl<H, T> RefUnwindSafe for HCons<H, T>where
H: RefUnwindSafe,
T: RefUnwindSafe,
impl<H, T> Send for HCons<H, T>
impl<H, T> Sync for HCons<H, T>
impl<H, T> Unpin for HCons<H, T>
impl<H, T> UnwindSafe for HCons<H, T>where
H: UnwindSafe,
T: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more