[−][src]Trait agnes::label::SetDiffMatch

pub trait SetDiffMatch<RightSet, FullRightSet, Match> {
    type Set;
}

Helper trait used SetDiff to compute the set difference between two label sets. RightSet is the set-subtrahend remaining at this point of the process, FullRightSet is the original full set-subtrahend. Match denotes whether or not the heads of the two cons-lists (Self and RightSet) match.

Associated Types

type Set

The set of labels that exist in Self and not in RightSet.

Loading content...

Implementors

impl<LLabel, LValue, LTail, RLabel, RValue, RTail, FullRightSet> SetDiffMatch<Cons<Labeled<RLabel, RValue>, RTail>, FullRightSet, B0> for LVCons<LLabel, LValue, LTail> where
    LVCons<LLabel, LValue, LTail>: SetDiffStep<RTail, FullRightSet>, [src]

type Set = <LVCons<LLabel, LValue, LTail> as SetDiffStep<RTail, FullRightSet>>::Set

impl<LLabel, LValue, LTail, RLabel, RValue, RTail, FullRightSet> SetDiffMatch<Cons<Labeled<RLabel, RValue>, RTail>, FullRightSet, B1> for LVCons<LLabel, LValue, LTail> where
    LTail: SetDiffStep<RTail, FullRightSet>, [src]

type Set = <LTail as SetDiffStep<RTail, FullRightSet>>::Set

Loading content...