[−][src]Type Definition agnes::label::LVCons
type LVCons<L, V, T> = Cons<Labeled<L, V>, T>;
Label-value cons-list
Trait Implementations
impl<E, L, V, T> Member<E> for LVCons<L, V, T> where
L: LabelEq<E>,
T: Member<E>,
<L as LabelEq<E>>::Eq: BitOr<<T as Member<E>>::IsMember>,
<<L as LabelEq<E>>::Eq as BitOr<<T as Member<E>>::IsMember>>::Output: Bit,
[src]
L: LabelEq<E>,
T: Member<E>,
<L as LabelEq<E>>::Eq: BitOr<<T as Member<E>>::IsMember>,
<<L as LabelEq<E>>::Eq as BitOr<<T as Member<E>>::IsMember>>::Output: Bit,
impl<L, V, T> IsLabelSet for LVCons<L, V, T> where
T: Member<L>,
<T as Member<L>>::IsMember: Not,
<<T as Member<L>>::IsMember as Not>::Output: BitAnd<<T as IsLabelSet>::IsSet>,
T: IsLabelSet,
[src]
T: Member<L>,
<T as Member<L>>::IsMember: Not,
<<T as Member<L>>::IsMember as Not>::Output: BitAnd<<T as IsLabelSet>::IsSet>,
T: IsLabelSet,
type IsSet = And<<<T as Member<L>>::IsMember as Not>::Output, <T as IsLabelSet>::IsSet>
True or False.
impl<LLabel, LValue, LTail> SetDiff<Nil> for LVCons<LLabel, LValue, LTail>
[src]
impl<LLabel, LValue, LTail, RLabel, RValue, RTail> SetDiff<Cons<Labeled<RLabel, RValue>, RTail>> for LVCons<LLabel, LValue, LTail> where
Self: SetDiffStep<LVCons<RLabel, RValue, RTail>, LVCons<RLabel, RValue, RTail>>,
[src]
Self: SetDiffStep<LVCons<RLabel, RValue, RTail>, LVCons<RLabel, RValue, RTail>>,
impl<LLabel, LValue, LTail, FullRightSet> SetDiffStep<Nil, FullRightSet> for LVCons<LLabel, LValue, LTail> where
LTail: SetDiffStep<FullRightSet, FullRightSet>,
[src]
LTail: SetDiffStep<FullRightSet, FullRightSet>,
type Set = LVCons<LLabel, LValue, <LTail as SetDiffStep<FullRightSet, FullRightSet>>::Set>
The set of labels that exist in Self
and not in RightSet
.
impl<LLabel, LValue, LTail, RLabel, RValue, RTail, FullRightSet> SetDiffStep<Cons<Labeled<RLabel, RValue>, RTail>, FullRightSet> for LVCons<LLabel, LValue, LTail> where
LLabel: LabelEq<RLabel>,
Self: SetDiffMatch<LVCons<RLabel, RValue, RTail>, FullRightSet, <LLabel as LabelEq<RLabel>>::Eq>,
[src]
LLabel: LabelEq<RLabel>,
Self: SetDiffMatch<LVCons<RLabel, RValue, RTail>, FullRightSet, <LLabel as LabelEq<RLabel>>::Eq>,
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]
LVCons<LLabel, LValue, LTail>: SetDiffStep<RTail, FullRightSet>,
type Set = <LVCons<LLabel, LValue, LTail> as SetDiffStep<RTail, FullRightSet>>::Set
The set of labels that exist in Self
and not in RightSet
.
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]
LTail: SetDiffStep<RTail, FullRightSet>,
type Set = <LTail as SetDiffStep<RTail, FullRightSet>>::Set
The set of labels that exist in Self
and not in RightSet
.
impl<TargetL, L, V, T> LookupNatByLabel<TargetL> for LVCons<L, V, T> where
TargetL: LabelEq<L>,
LVCons<L, V, T>: LookupNatByLabelMatch<TargetL, <TargetL as LabelEq<L>>::Eq>,
[src]
TargetL: LabelEq<L>,
LVCons<L, V, T>: LookupNatByLabelMatch<TargetL, <TargetL as LabelEq<L>>::Eq>,
type Nat = <LVCons<L, V, T> as LookupNatByLabelMatch<TargetL, <TargetL as LabelEq<L>>::Eq>>::Nat
The backing type-level natural number for L
.
fn nat(&self) -> usize
[src]
A run-time accessor for Nat
.
impl<TargetL, L, V, T> LookupNatByLabelMatch<TargetL, B1> for LVCons<L, V, T>
[src]
impl<TargetL, L, V, T> LookupNatByLabelMatch<TargetL, B0> for LVCons<L, V, T> where
T: LookupNatByLabel<TargetL>,
<T as LookupNatByLabel<TargetL>>::Nat: Add<B1>,
<<T as LookupNatByLabel<TargetL>>::Nat as Add<B1>>::Output: Unsigned,
[src]
T: LookupNatByLabel<TargetL>,
<T as LookupNatByLabel<TargetL>>::Nat: Add<B1>,
<<T as LookupNatByLabel<TargetL>>::Nat as Add<B1>>::Output: Unsigned,
type Nat = Add1<<T as LookupNatByLabel<TargetL>>::Nat>
Backing type-level natural number for TargetL
.
impl<LabelList, L, V, T> LabelSubset<LabelList> for LVCons<L, V, T> where
LabelList: Member<L>,
LVCons<L, V, T>: LabelSubsetPred<LabelList, <LabelList as Member<L>>::IsMember>,
[src]
LabelList: Member<L>,
LVCons<L, V, T>: LabelSubsetPred<LabelList, <LabelList as Member<L>>::IsMember>,
type Output = <LVCons<L, V, T> as LabelSubsetPred<LabelList, <LabelList as Member<L>>::IsMember>>::Output
Subset of Self
that are labeled with labels in LabelList
.
impl<Label, Value, Tail> AssocLabels for LVCons<Label, Value, Tail> where
Tail: AssocLabels,
[src]
Tail: AssocLabels,
type Labels = LabelCons<Label, Tail::Labels>
LabelCons-list of labels associated with the Self
cons-list.
impl<L, V, T> StrLabels for LVCons<L, V, T> where
L: LabelName,
T: StrLabels,
[src]
L: LabelName,
T: StrLabels,
fn labels<'a>() -> VecDeque<&'a str>
[src]
fn labels_vec<'a>() -> Vec<&'a str>
[src]
Returns the labels (as strings) for the labels associated with Self
, collected in a Vec
struct. Read more
impl<L, V, T> StrTypes for LVCons<L, V, T> where
L: LabelName,
T: StrTypes,
[src]
L: LabelName,
T: StrTypes,
impl<Label, Value, Tail> AssocFrameLookup for LVCons<Label, Value, Tail> where
Tail: AssocFrameLookup,
[src]
Tail: AssocFrameLookup,
type Output = LMCons<Label, FrameDetailMarkers<UTerm, Label>, <Tail as AssocFrameLookup>::Output>
The associated FrameLookupCons
.
impl<L, V, Tail> NRows for LVCons<L, V, Tail> where
V: Valued,
ValueOf<V>: NRows,
[src]
V: Valued,
ValueOf<V>: NRows,
impl<Label, Value, Tail> SimpleFrameFields for LVCons<Label, Value, Tail> where
Tail: SimpleFrameFields,
[src]
Tail: SimpleFrameFields,
type Fields = LMCons<Label, StoreFieldMarkers<Single, LCons<Label, Nil>>, <Tail as SimpleFrameFields>::Fields>
The computed FrameFields
FieldLookupCons cons-list.
impl<RFrameIndex, RFrame, RTail, FrameIndexOffset> UpdateFrameIndex<FrameIndexOffset> for LVCons<RFrameIndex, RFrame, RTail> where
RFrameIndex: Offset<FrameIndexOffset>,
RTail: UpdateFrameIndex<FrameIndexOffset>,
[src]
RFrameIndex: Offset<FrameIndexOffset>,
RTail: UpdateFrameIndex<FrameIndexOffset>,
type Output = LVCons<<RFrameIndex as Offset<FrameIndexOffset>>::Output, RFrame, <RTail as UpdateFrameIndex<FrameIndexOffset>>::Output>
ViewFrameCons
after updating frame index by FrameIndexOffset
.
fn update_frame_label(self) -> Self::Output
[src]
impl<FrameIndex, Label, Value, Tail> AsFrameLookup<FrameIndex> for LVCons<Label, Value, Tail> where
Tail: AsFrameLookup<FrameIndex>,
[src]
Tail: AsFrameLookup<FrameIndex>,
type Output = LMCons<Label, FrameDetailMarkers<FrameIndex, Label>, <Tail as AsFrameLookup<FrameIndex>>::Output>
The computed FrameLookupCons
.
impl<FrameIndex, Frame, Tail> UpdatePermutation for LVCons<FrameIndex, Frame, Tail> where
Frame: Valued,
ValueOf<Frame>: UpdatePermutation,
Tail: UpdatePermutation,
[src]
Frame: Valued,
ValueOf<Frame>: UpdatePermutation,
Tail: UpdatePermutation,
fn update_permutation(&mut self, order: &[usize])
[src]
impl<LabelList, L, V, T> SubsetClone<LabelList> for LVCons<L, V, T> where
LabelList: Member<L>,
Self: SubsetClonePred<LabelList, <LabelList as Member<L>>::IsMember>,
[src]
LabelList: Member<L>,
Self: SubsetClonePred<LabelList, <LabelList as Member<L>>::IsMember>,
type Output = <LVCons<L, V, T> as SubsetClonePred<LabelList, <LabelList as Member<L>>::IsMember>>::Output
Output of applying $req_fn
to values in this cons-list which match labels in LabelList
. Read more