HList 0.4.1.0 → 0.4.2.0
raw patch · 6 files changed
+40/−18 lines, 6 filesdep ~base-orphansPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependency ranges changed: base-orphans
API changes (from Hackage documentation)
- Data.HList.Data: instance (Data b, x ~ (t, c (b -> r)), y ~ c r) => ApplyAB (GunfoldK c) x y
- Data.HList.Data: instance (Data d, (c (d -> b), d) ~ x, c b ~ y) => ApplyAB (GfoldlK c) x y
- Data.HList.Data: instance (Data x, Data (HList xs), TypeablePolyK (x : xs), Typeable (HList (x : xs))) => Data (HList (x : xs))
- Data.HList.Data: instance (DataHListFlatCxt na g a) => Data (HListFlat a)
- Data.HList.Data: instance (DataRecordCxt a) => Data (Record a)
- Data.HList.Data: instance (RecordLabelsStr xs, ShowLabel x) => RecordLabelsStr (Tagged x t : xs)
- Data.HList.Data: instance (RecordLabelsStr2 xs, ShowLabel x) => RecordLabelsStr2 (x : xs)
- Data.HList.Data: instance (TypeRepsList (HList xs), Typeable x) => TypeRepsList (HList (x : xs))
- Data.HList.Data: instance (TypeablePolyK xs, Typeable (HList xs), Data (HList xs)) => Data (TIP xs)
- Data.HList.Data: instance (TypeablePolyK xs, Typeable (Variant xs), Data (Variant xs)) => Data (TIC xs)
- Data.HList.Data: instance RecordLabelsStr '[]
- Data.HList.Data: instance RecordLabelsStr2 '[]
- Data.HList.Data: instance TypeRepsList (HList '[])
- Data.HList.Data: instance TypeRepsList (HList xs) => TypeRepsList (Record xs)
- Data.HList.Data: instance Typeable 'HSucc
- Data.HList.Data: instance Typeable 'HZero
- Data.HList.Data: instance Typeable '[]
- Data.HList.Data: instance Typeable (':)
- Data.HList.Data: instance Typeable (HList '[]) => Data (HList '[])
- Data.HList.Data: instance Typeable HList
- Data.HList.Data: instance Typeable HListFlat
- Data.HList.Data: instance Typeable Record
- Data.HList.Data: instance Typeable TIC
- Data.HList.Data: instance Typeable TIP
- Data.HList.Data: instance Typeable Variant
- Data.HList.FakePrelude: instance (ApplyAB f (x, y) z, mz ~ m z, mxy ~ (m x, m y), Applicative m) => ApplyAB (LiftA2 f) mxy mz
- Data.HList.FakePrelude: instance (ApplyAB f a b, ApplyAB g b c) => ApplyAB (HComp g f) a c
- Data.HList.FakePrelude: instance (FunCxt cxt a, FunApp getb a ~ b) => ApplyAB (Fun cxt getb) a b
- Data.HList.FakePrelude: instance (FunCxt cxt b, FunApp geta b ~ a) => ApplyAB (Fun' cxt geta) a b
- Data.HList.FakePrelude: instance (HAllTaggedLV xs, x ~ Tagged t v) => HAllTaggedLV (x : xs)
- Data.HList.FakePrelude: instance (HEq x y b, HCast1 b x y) => HCast x y
- Data.HList.FakePrelude: instance (HNats2Integrals ns, HNat2Integral n) => HNats2Integrals (n : ns)
- Data.HList.FakePrelude: instance (Monad m, ApplyAB f x fx, fx ~ m (), pair ~ (x, m ()), ApplyAB f x (m ())) => ApplyAB (HSeq f) pair fx
- Data.HList.FakePrelude: instance (SameLabels x y, SameLabels xs ys) => SameLabels (x : xs) (y : ys)
- Data.HList.FakePrelude: instance (SameLength' x y, SameLength' y x) => SameLength x y
- Data.HList.FakePrelude: instance (SameLength' xs ys, es2 ~ (y : ys)) => SameLength' (x : xs) es2
- Data.HList.FakePrelude: instance (String ~ string, Read a) => ApplyAB HRead string a
- Data.HList.FakePrelude: instance (String ~ string, Show a) => ApplyAB HShow a string
- Data.HList.FakePrelude: instance (f1 ~ (a -> b -> c), f2 ~ (b -> a -> c)) => ApplyAB HFlip f1 f2
- Data.HList.FakePrelude: instance (io ~ IO (), Show x) => ApplyAB HPrint x io
- Data.HList.FakePrelude: instance (x ~ t a, y ~ t b, Functor t, ApplyAB f a b) => ApplyAB (HFmap f) x y
- Data.HList.FakePrelude: instance (x' ~ x, y' ~ y) => ApplyAB (x' -> y') x y
- Data.HList.FakePrelude: instance (xf ~ (x -> f), ArityRev f n) => ArityRev xf ('HSucc n)
- Data.HList.FakePrelude: instance (y ~ y', fg ~ (x -> y, y' -> z), r ~ (x -> z)) => ApplyAB Comp fg r
- Data.HList.FakePrelude: instance ArityRev f 'HZero
- Data.HList.FakePrelude: instance HAllTaggedLV '[]
- Data.HList.FakePrelude: instance HCast1 'False x y
- Data.HList.FakePrelude: instance HCond 'False x y y
- Data.HList.FakePrelude: instance HCond 'True x y x
- Data.HList.FakePrelude: instance HNats2Integrals '[]
- Data.HList.FakePrelude: instance HNotFD 'False 'True
- Data.HList.FakePrelude: instance HNotFD 'True 'False
- Data.HList.FakePrelude: instance KnownNat (HNat2Nat n) => HNat2Integral n
- Data.HList.FakePrelude: instance Label t ~ Label t' => SameLabels (Label t) (Label t')
- Data.HList.FakePrelude: instance Label t ~ Label t' => SameLabels (Label t) (Tagged t' a)
- Data.HList.FakePrelude: instance Label t ~ Label t' => SameLabels (Label t) t'
- Data.HList.FakePrelude: instance SameLabels '[] '[]
- Data.HList.FakePrelude: instance SameLabels '[] (x : xs)
- Data.HList.FakePrelude: instance SameLabels (Label t) s => SameLabels (Tagged t a) s
- Data.HList.FakePrelude: instance SameLabels (Label t) s => SameLabels t s
- Data.HList.FakePrelude: instance SameLabels (x : xs) '[]
- Data.HList.FakePrelude: instance Show HNothing
- Data.HList.FakePrelude: instance Show x => Show (HJust x)
- Data.HList.FakePrelude: instance Tagged t x ~ tx => ApplyAB HUntag tx x
- Data.HList.FakePrelude: instance es2 ~ '[] => SameLength' '[] es2
- Data.HList.FakePrelude: instance hJustA ~ HJust a => ApplyAB (HJust t) a hJustA
- Data.HList.FakePrelude: instance x ~ y => HCast1 'True x y
- Data.HList.HArray: instance (ch ~ Proxy (HBoolEQ sel (KMember n ns)), Apply (ch, FHUProj sel ns) (HList (e : l), Proxy n)) => Apply (FHUProj sel ns) (HList (e : l), Proxy n)
- Data.HList.HArray: instance Apply (FHUProj sel ns) (HList '[], n)
- Data.HList.HArray: instance Apply (FHUProj sel ns) (HList l, Proxy ('HSucc n)) => Apply (Proxy 'False, FHUProj sel ns) (HList (e : l), Proxy n)
- Data.HList.HArray: instance Apply (Proxy 'True, FHUProj sel ns) (HList (e : l), Proxy n)
- Data.HList.HArray: instance Fail (FieldNotFound (Proxy n, e1)) => HUpdateAtHNat n e1 '[]
- Data.HList.HArray: instance HDeleteAtHNat 'HZero (e : l)
- Data.HList.HArray: instance HDeleteAtHNat n l => HDeleteAtHNat ('HSucc n) (e : l)
- Data.HList.HArray: instance HLookupByHNat 'HZero (e : l)
- Data.HList.HArray: instance HLookupByHNat n l => Apply (FHLookupByHNat l) (Proxy n)
- Data.HList.HArray: instance HLookupByHNat n l => HLookupByHNat ('HSucc n) (e : l)
- Data.HList.HArray: instance HUpdateAtHNat 'HZero e1 (e : l)
- Data.HList.HArray: instance HUpdateAtHNat n e1 l => HUpdateAtHNat ('HSucc n) e1 (e : l)
- Data.HList.HCurry: instance HCurry' 'HZero b '[] b
- Data.HList.HCurry: instance HCurry' n b xs r => HCurry' ('HSucc n) (x -> b) (x : xs) r
- Data.HList.HList: instance ((x, y) ~ z, HZipList xs ys zs) => HZipList (x : xs) (y : ys) (z : zs)
- Data.HList.HList: instance (Apply p s, HUnfoldFD p (ApplyR p s) z) => HUnfoldFD p (HJust (e, s)) (e : z)
- Data.HList.HList: instance (ApplyAB f (e, r) r', HFoldr f v l r) => HFoldr f v (e : l) r'
- Data.HList.HList: instance (ApplyAB f (e, r) r', HFoldr1 f (e' : l) r) => HFoldr1 f (e : e' : l) r'
- Data.HList.HList: instance (ApplyAB f (x, r) s, HScanr f z xs (r : rs), srrs ~ (s : r : rs)) => HScanr f z (x : xs) srrs
- Data.HList.HList: instance (ApplyAB f e e', HMapAux HList f l l', SameLength l l') => HMapAux HList f (e : l) (e' : l')
- Data.HList.HList: instance (ApplyAB f z fz, HReplicateF n f z r') => HReplicateF ('HSucc n) f z (fz : r')
- Data.HList.HList: instance (ApplyAB f z z', HIterate n f z' r', z ~ z_) => HIterate ('HSucc n) f z (z_ : r')
- Data.HList.HList: instance (Bounded x, Bounded (HList xs)) => Bounded (HList (x : xs))
- Data.HList.HList: instance (Eq x, Eq (HList xs)) => Eq (HList (x : xs))
- Data.HList.HList: instance (HConcatFD as bs, HAppendFD a bs cs) => HConcatFD (HList a : as) cs
- Data.HList.HList: instance (HEq e e' b, HTMember e l b', HOr b b' ~ b'') => HTMember e (e' : l) b''
- Data.HList.HList: instance (HEq e1 e b, HMember' b e1 l br) => HMember e1 (e : l) br
- Data.HList.HList: instance (HEq e1 e b, HMemberM1 b e1 (e : l) res) => HMemberM e1 (e : l) res
- Data.HList.HList: instance (HEq e1 e2 b, HFind2 b e1 l n) => HFind1 e1 (e2 : l) n
- Data.HList.HList: instance (HEqBy f x y b, HSpanEqBy2 b f x y ys i o) => HSpanEqBy1 f x (y : ys) i o
- Data.HList.HList: instance (HEqBy f x1 x b, HPartitionEq1 b f x1 x xs xi xo) => HPartitionEq f x1 (x : xs) xi xo
- Data.HList.HList: instance (HInits1 xs ys, HMapCxt HList (FHCons2 x) ys ys', HMapCons x ys ~ ys', HMapTail ys' ~ ys) => HInits1 (x : xs) (HList '[x] : ys')
- Data.HList.HList: instance (HLengthEq xs n, sn ~ 'HSucc n) => HLengthEq2 (x : xs) sn
- Data.HList.HList: instance (HLengthEq xs n, xxs ~ (x : xs)) => HLengthEq1 xxs ('HSucc n)
- Data.HList.HList: instance (HMapCxt HList f a b, as ~ HList a, bs ~ HList b) => ApplyAB (HMapL f) as bs
- Data.HList.HList: instance (HMapCxt r f a b, as ~ r a, bs ~ r b) => ApplyAB (HMap f) as bs
- Data.HList.HList: instance (HMemberM e1 l r, HMemberM2 r e1 (e : l) res) => HMemberM1 'False e1 (e : l) res
- Data.HList.HList: instance (HProxies a, HMapCxt HList ConstMempty (AddProxy a) a, HZip HList a a aa, HMapCxt HList UncurryMappend aa a) => Monoid (HList a)
- Data.HList.HList: instance (HProxies l, Read e, HSequence ReadP (ReadP e : readP_l) (e : l), HMapCxt HList ReadElement (AddProxy l) readP_l) => Read (HList (e : l))
- Data.HList.HList: instance (HReplicateFD n e es, e ~ e') => HReplicateFD ('HSucc n) e (e' : es)
- Data.HList.HList: instance (HRevApp xs '[] sx, HRevApp sx '[] xs) => HReverse xs sx
- Data.HList.HList: instance (HSpanEqBy f a as fst snd, HGroupBy f snd gs) => HGroupBy f (a : as) (HList (a : fst) : gs)
- Data.HList.HList: instance (HSpanEqBy1 f x y fst snd, HAppendListR fst snd ~ y) => HSpanEqBy f x y fst snd
- Data.HList.HList: instance (HSplitAt1 '[] n xsys xs ys, HAppendList1 xs ys xsys, HLengthEq xs n) => HSplitAt n xsys xs ys
- Data.HList.HList: instance (HTMember h l1 b, HTIntersectBool b h t l1 l2) => HTIntersect (h : t) l1 l2
- Data.HList.HList: instance (Ix x, Ix (HList xs)) => Ix (HList (x : xs))
- Data.HList.HList: instance (Ord x, Ord (HList xs)) => Ord (HList (x : xs))
- Data.HList.HList: instance (SameLength a b, HMapAux r f a b) => HMapCxt r f a b
- Data.HList.HList: instance (SameLength' (HReplicateR n ()) xs, HLengthEq1 xs n, HLengthEq2 xs n) => HLengthEq xs n
- Data.HList.HList: instance (SameLengths '[x, y, xy], HZipList x y xy) => HUnzip HList x y xy
- Data.HList.HList: instance (SameLengths '[x, y, xy], HZipList x y xy) => HZip HList x y xy
- Data.HList.HList: instance (Show e, Show (HList l)) => Show (HList (e : l))
- Data.HList.HList: instance (aa ~ (a, a), Monoid a) => ApplyAB UncurryMappend aa a
- Data.HList.HList: instance (hxs ~ HList xs, hxxs ~ HList (x : xs)) => ApplyAB (FHCons2 x) hxs hxxs
- Data.HList.HList: instance (l ~ [e'], ApplyAB f e e', el ~ (e, l)) => ApplyAB (Mapcar f) el l
- Data.HList.HList: instance (m1 ~ m, Applicative m, HSequence m as bs) => HSequence m (m1 a : as) (a : bs)
- Data.HList.HList: instance (x ~ (e, HList l), y ~ HList (e : l)) => ApplyAB FHCons x y
- Data.HList.HList: instance (x ~ Proxy y, Monoid y) => ApplyAB ConstMempty x y
- Data.HList.HList: instance (x' ~ x, HStripPrefix xs xsys ys) => HStripPrefix (x' : xs) (x : xsys) ys
- Data.HList.HList: instance (y ~ ReadP x, Read x) => ApplyAB ReadElement (Proxy x) y
- Data.HList.HList: instance (zx ~ (z, x), ApplyAB f zx z', HFoldl f z' xs r) => HFoldl f z (x : xs) r
- Data.HList.HList: instance Applicative m => HSequence m '[] '[]
- Data.HList.HList: instance ApplyAB f e e' => ApplyAB (MapCar f) (e, HList l) (HList (e' : l))
- Data.HList.HList: instance Bounded (HList '[])
- Data.HList.HList: instance Eq (HList '[])
- Data.HList.HList: instance Fail (FieldNotFound e1) => HFind1 e1 '[] 'HZero
- Data.HList.HList: instance FromHJust '[]
- Data.HList.HList: instance FromHJust l => FromHJust (HJust e : l)
- Data.HList.HList: instance FromHJust l => FromHJust (HNothing : l)
- Data.HList.HList: instance HAppendFD '[] b b
- Data.HList.HList: instance HAppendFD as bs cs => HAppendFD (a : as) bs (a : cs)
- Data.HList.HList: instance HAppendList '[] l2
- Data.HList.HList: instance HAppendList l l' => HAppendList (x : l) l'
- Data.HList.HList: instance HAppendList l1 l2 => HAppend (HList l1) (HList l2)
- Data.HList.HList: instance HAppendList1 '[] ys ys
- Data.HList.HList: instance HAppendList1 xs ys zs => HAppendList1 (x : xs) ys (x : zs)
- Data.HList.HList: instance HBuild' (a : l) r => HBuild' l (a -> r)
- Data.HList.HList: instance HConcatFD '[] '[]
- Data.HList.HList: instance HExtend e (HList l)
- Data.HList.HList: instance HFind1 e l n => HFind e l n
- Data.HList.HList: instance HFind1 e l n => HFind2 'False e l ('HSucc n)
- Data.HList.HList: instance HFind2 'True e l 'HZero
- Data.HList.HList: instance HGroupBy f '[] '[]
- Data.HList.HList: instance HInit '[x]
- Data.HList.HList: instance HInit (b : c) => HInit (a : b : c)
- Data.HList.HList: instance HInits1 '[] '[HList '[]]
- Data.HList.HList: instance HInits1 a b => HInits a (HList '[] : b)
- Data.HList.HList: instance HIterate 'HZero f z '[]
- Data.HList.HList: instance HList2List '[e] e
- Data.HList.HList: instance HList2List (e' : l) e => HList2List (e : e' : l) e
- Data.HList.HList: instance HMapAux HList f '[] '[]
- Data.HList.HList: instance HMember e1 '[] 'False
- Data.HList.HList: instance HMember e1 l br => HMember' 'False e1 l br
- Data.HList.HList: instance HMember' 'True e1 l 'True
- Data.HList.HList: instance HMemberM e1 '[] 'Nothing
- Data.HList.HList: instance HMemberM1 'True e1 (e : l) ('Just l)
- Data.HList.HList: instance HMemberM2 'Nothing e1 l 'Nothing
- Data.HList.HList: instance HMemberM2 ('Just l1) e1 (e : l) ('Just (e : l1))
- Data.HList.HList: instance HPartitionEq f x1 '[] '[] '[]
- Data.HList.HList: instance HPartitionEq f x1 xs xi xo => HPartitionEq1 'False f x1 x xs xi (x : xo)
- Data.HList.HList: instance HPartitionEq f x1 xs xi xo => HPartitionEq1 'True f x1 x xs (x : xi) xo
- Data.HList.HList: instance HProxiesFD '[] '[]
- Data.HList.HList: instance HProxiesFD xs pxs => HProxiesFD (x : xs) (Proxy x : pxs)
- Data.HList.HList: instance HReplicateF 'HZero f z '[]
- Data.HList.HList: instance HReplicateFD 'HZero e '[]
- Data.HList.HList: instance HRevApp '[] l2 l2
- Data.HList.HList: instance HRevApp accum '[] xs => HSplitAt1 accum 'HZero ys xs ys
- Data.HList.HList: instance HRevApp l (x : l') z => HRevApp (x : l) l' z
- Data.HList.HList: instance HReverse l l' => HBuild' l (HList l')
- Data.HList.HList: instance HSpanEqBy1 f x '[] '[] '[]
- Data.HList.HList: instance HSpanEqBy1 f x zs i o => HSpanEqBy2 'True f x y zs (y : i) o
- Data.HList.HList: instance HSpanEqBy2 'False f x y ys '[] (y : ys)
- Data.HList.HList: instance HSplit '[]
- Data.HList.HList: instance HSplit l => HSplit ((e, Proxy 'False) : l)
- Data.HList.HList: instance HSplit l => HSplit ((e, Proxy 'True) : l)
- Data.HList.HList: instance HSplit l => HSplit (Tagged 'False e : l)
- Data.HList.HList: instance HSplit l => HSplit (Tagged 'True e : l)
- Data.HList.HList: instance HSplitAt1 (b : accum) n bs xs ys => HSplitAt1 accum ('HSucc n) (b : bs) xs ys
- Data.HList.HList: instance HStripPrefix '[] ys ys
- Data.HList.HList: instance HTIntersect '[] l '[]
- Data.HList.HList: instance HTIntersect t l1 l2 => HTIntersectBool 'False h t l1 l2
- Data.HList.HList: instance HTIntersect t l1 l2 => HTIntersectBool 'True h t l1 (h : l2)
- Data.HList.HList: instance HTMember e '[] 'False
- Data.HList.HList: instance HTails '[] '[HList '[]]
- Data.HList.HList: instance HTails xs ys => HTails (x : xs) (HList (x : xs) : ys)
- Data.HList.HList: instance HTuple '[] ()
- Data.HList.HList: instance HTuple '[a, b, c, d, e, f] (a, b, c, d, e, f)
- Data.HList.HList: instance HTuple '[a, b, c, d, e] (a, b, c, d, e)
- Data.HList.HList: instance HTuple '[a, b, c, d] (a, b, c, d)
- Data.HList.HList: instance HTuple '[a, b, c] (a, b, c)
- Data.HList.HList: instance HTuple '[a, b] (a, b)
- Data.HList.HList: instance HUnfoldFD p HNothing '[]
- Data.HList.HList: instance HZipList '[] '[] '[]
- Data.HList.HList: instance Ix (HList '[])
- Data.HList.HList: instance Ord (HList '[])
- Data.HList.HList: instance Read (HList '[])
- Data.HList.HList: instance Show (HList '[])
- Data.HList.HList: instance ToHJust '[]
- Data.HList.HList: instance ToHJust l => ToHJust (e : l)
- Data.HList.HList: instance e' ~ e => ApplyAB HRmTag (e, t) e'
- Data.HList.HList: instance et ~ (e, t) => ApplyAB (HAddTag t) e et
- Data.HList.HList: instance hJustA ~ HJust a => ApplyAB HFromJust hJustA a
- Data.HList.HList: instance lz ~ '[z] => HScanr f z '[] lz
- Data.HList.HList: instance v ~ v' => HFoldr f v '[] v'
- Data.HList.HList: instance v ~ v' => HFoldr1 f '[v] v'
- Data.HList.HList: instance xxs ~ '[] => HLengthEq1 xxs 'HZero
- Data.HList.HList: instance z ~ z' => HFoldl f z '[] z'
- Data.HList.HList: instance zero ~ 'HZero => HLengthEq2 '[] zero
- Data.HList.HListPrelude: instance HExtend (Label x) (Proxy '[])
- Data.HList.HOccurs: instance (HEq e e1 b, HOccursNot' b e l) => HOccursNot e (e1 : l)
- Data.HList.HOccurs: instance (HEq e1 e b, HOccurrence' b e1 (e : l) l') => HOccurrence e1 (e : l) l'
- Data.HList.HOccurs: instance (HOccurrence e (x : y) l', HOccurs' e l') => HOccurs e (HList (x : y))
- Data.HList.HOccurs: instance (HOccurrence e l l', HOccursMany' e l') => HOccursMany e l
- Data.HList.HOccurs: instance (HOccurs e l, HProject l (HList l')) => HProject l (HList (e : l'))
- Data.HList.HOccurs: instance (e ~ e1, HOccursMany e l) => HOccursMany' e (e1 : l)
- Data.HList.HOccurs: instance (e ~ e1, HOccursNot e l) => HOccurs' e (e : l)
- Data.HList.HOccurs: instance Fail (TypeFound e) => HOccursNot' 'True e l
- Data.HList.HOccurs: instance Fail (TypeNotFound e) => HOccurs' e '[]
- Data.HList.HOccurs: instance HOccurrence e1 '[] '[]
- Data.HList.HOccurs: instance HOccurrence e1 l l' => HOccurrence' 'False e1 (e : l) l'
- Data.HList.HOccurs: instance HOccurrence' 'True e1 (e : l) (e : l)
- Data.HList.HOccurs: instance HOccursMany' e '[]
- Data.HList.HOccurs: instance HOccursNot e '[]
- Data.HList.HOccurs: instance HOccursNot e l => HOccursNot' 'False e l
- Data.HList.HOccurs: instance HOccursOpt' e '[]
- Data.HList.HOccurs: instance HProject (HList l) (HList '[])
- Data.HList.HOccurs: instance e ~ e1 => HOccursOpt' e (e1 : l)
- Data.HList.HSort: instance (Fail '("Duplicated element", y, "using le", le, "in", ys0), HEqByFn le) => HAscList1 le 'False (y : ys) ys0
- Data.HList.HSort: instance (HAscList1 le b (y : ys) ps0, HEqBy le x y b) => HAscList0 le (x : y : ys) ps0
- Data.HList.HSort: instance (HEq (CmpSymbol x y) 'GT nb, HNot nb ~ b) => HEqBy HLeFn x y b
- Data.HList.HSort: instance (HEqBy HLeFn n m b, ns ~ ns') => HEqBy HLeFn (Lbl n ns desc) (Lbl m ns' desc') b
- Data.HList.HSort: instance (HEqBy le x y b, HMerge1 b (x : xs) (y : ys) (l : ls) hhs, HMerge le ls hhs srt) => HMerge le (x : xs) (y : ys) (l : srt)
- Data.HList.HSort: instance (HEqBy le x y b1, HIsAscList le (y : ys) b2, HAnd b1 b2 ~ b3) => HIsAscList le (x : y : ys) b3
- Data.HList.HSort: instance (HEqBy le y x b1, HNot b1 ~ b2) => HEqBy (HNeq le) x y b2
- Data.HList.HSort: instance (HMerge le xs' ys' sorted, HMSortBy le ys ys', HMSortBy le xs xs', HLengthEq (a : b : c : cs) n2, HDiv2 n2 ~ n, HSplitAt n (a : b : c : cs) xs ys) => HMSortBy le (a : b : c : cs) sorted
- Data.HList.HSort: instance (HPartitionEq le a (b : bs) bGeq bLt, HQSortBy le bLt sortedLt, HQSortBy le bGeq sortedGeq, HAppendListR sortedLt (a : sortedGeq) ~ sorted, HAppendList sortedLt (a : sortedGeq)) => HQSortBy le (a : b : bs) sorted
- Data.HList.HSort: instance (HSort2 b x y ab, HEqBy le x y b) => HMSortBy le '[x, y] ab
- Data.HList.HSort: instance (HSortBy lt ps ps', HAscList lt ps') => HSetBy lt ps
- Data.HList.HSort: instance (HSortBy lt ps ps', HIsAscList lt ps' b) => HIsSetBy lt ps b
- Data.HList.HSort: instance (SameLength a b, HIsAscList le a ok, HSortBy1 ok le a b) => HSortBy le a b
- Data.HList.HSort: instance (x <=? y) ~ b => HEqBy HLeFn x y b
- Data.HList.HSort: instance HAscList0 le ps ps => HAscList le ps
- Data.HList.HSort: instance HAscList0 le ys ys0 => HAscList1 le 'True ys ys0
- Data.HList.HSort: instance HEqBy HLeFn x y b => HEqBy HLeFn (Label x) (Label y) b
- Data.HList.HSort: instance HEqBy HLeFn x y b => HEqBy HLeFn (Proxy x) (Proxy y) b
- Data.HList.HSort: instance HEqBy HLeFn x y b => HEqBy HLeFn (Tagged x v) (Tagged y w) b
- Data.HList.HSort: instance HEqBy f y x b => HEqBy (HDown f) x y b
- Data.HList.HSort: instance HEqByFn HLeFn
- Data.HList.HSort: instance HEqByFn a => HEqByFn (HDown a)
- Data.HList.HSort: instance HEqByFn a => HEqByFn (HNeq a)
- Data.HList.HSort: instance HEqByFn le => HAscList0 le '[] ps0
- Data.HList.HSort: instance HEqByFn le => HAscList0 le '[x] ps0
- Data.HList.HSort: instance HEqByFn le => HIsAscList le '[] 'True
- Data.HList.HSort: instance HEqByFn le => HIsAscList le '[x] 'True
- Data.HList.HSort: instance HEqByFn le => HMSortBy le '[] '[]
- Data.HList.HSort: instance HEqByFn le => HMSortBy le '[x] '[x]
- Data.HList.HSort: instance HIsSetBy (HNeq HLeFn) ps b => HIsSet ps b
- Data.HList.HSort: instance HLe x y ~ b => HEqBy HLeFn x y b
- Data.HList.HSort: instance HMerge le '[] '[] '[]
- Data.HList.HSort: instance HMerge le '[] (x : xs) (x : xs)
- Data.HList.HSort: instance HMerge le (x : xs) '[] (x : xs)
- Data.HList.HSort: instance HQSortBy le '[] '[]
- Data.HList.HSort: instance HQSortBy le '[x] '[x]
- Data.HList.HSort: instance HQSortBy le a b => HSortBy1 'False le a b
- Data.HList.HSort: instance HSetBy (HNeq HLeFn) ps => HSet ps
- Data.HList.HSort: instance HSort2 'False x y '[y, x]
- Data.HList.HSort: instance HSort2 'True x y '[x, y]
- Data.HList.HSort: instance HSortBy1 'True le a a
- Data.HList.HTypeIndexed: instance (HDeleteAtHNat n l, HType2HNat e l n, l' ~ HDeleteAtHNatR n l) => HDeleteAtLabel HList e l l'
- Data.HList.HTypeIndexed: instance (HEq e1 e b, HDeleteManyCase b e1 e l l1) => HDeleteMany e1 (HList (e : l)) (HList l1)
- Data.HList.HTypeIndexed: instance (HEq e1 e b, HType2HNatCase b e1 l n) => HType2HNat e1 (e : l) n
- Data.HList.HTypeIndexed: instance (HType2HNat e l n, HTypes2HNats es l ns) => HTypes2HNats (e : es) l (n : ns)
- Data.HList.HTypeIndexed: instance HDeleteMany e (HList '[]) (HList '[])
- Data.HList.HTypeIndexed: instance HDeleteMany e (HList l) (HList l1) => HDeleteManyCase 'True e e l l1
- Data.HList.HTypeIndexed: instance HDeleteMany e1 (HList l) (HList l1) => HDeleteManyCase 'False e1 e l (e : l1)
- Data.HList.HTypeIndexed: instance HOccursNot e l => HType2HNatCase 'True e l 'HZero
- Data.HList.HTypeIndexed: instance HType2HNat e l n => HType2HNatCase 'False e l ('HSucc n)
- Data.HList.HTypeIndexed: instance HTypes2HNats '[] l '[]
- Data.HList.HZip: instance (HList (x : y) ~ z, HZip3 xs ys zs) => HZip3 (x : xs) (HList y : ys) (z : zs)
- Data.HList.HZip: instance (HZip3 a b c, x ~ (HList a, HList b), y ~ HList c) => ApplyAB HZipF x y
- Data.HList.HZip: instance (z ~ (x, y), HUnZip zs) => HUnZip (z : zs)
- Data.HList.HZip: instance HUnZip '[]
- Data.HList.HZip: instance HZip3 '[] '[] '[]
- Data.HList.Keyword: instance '[] ~ nil => ReflectFK' 'False f nil
- Data.HList.Keyword: instance (Fail (ErrReqdArgNotFound kw), nff ~ ErrReqdArgNotFound kw) => KWMerge' kw '[] atail arg_values arg_def f nff
- Data.HList.Keyword: instance (Fail (ErrUnexpectedKW e), r ~ '[]) => HDelete e '[] r
- Data.HList.Keyword: instance (HAppendListR tail '[kw, v] ~ l', HAppendList tail '[kw, v], KWApply f l' r) => KWApply' 'False f (kw : v : tail) r
- Data.HList.Keyword: instance (HDelete e tail tail', e'tail ~ (e' : tail')) => HDelete' 'False e (e' : tail) e'tail
- Data.HList.Keyword: instance (HDelete kw arg_types arg_types', KW f (Arg arg_types' (kw : a : arg_values)) arg_def r) => KWAcc (Arg arg_types arg_values) kw a f arg_def r
- Data.HList.Keyword: instance (HEq e e' flag, HDelete' flag e (e' : tail) l') => HDelete e (e' : tail) l'
- Data.HList.Keyword: instance (HEq kw kw' flag, KWApply' flag (kw -> a -> f') (kw' : a' : tail) r) => KWApply (kw -> a -> f') (kw' : a' : tail) r
- Data.HList.Keyword: instance (HEq kw kw' flag, KWMerge'' flag kw (kw' : etc) atail arg_values arg_def f r) => KWMerge' kw (kw' : etc) atail arg_values arg_def f r
- Data.HList.Keyword: instance (IsKeyFN f flag, ReflectFK' flag f kws) => ReflectFK f kws
- Data.HList.Keyword: instance (IsKeyFN r rflag, KW' rflag f arg_desc arg_def r) => KW f arg_desc arg_def r
- Data.HList.Keyword: instance (KW' rflag fn akws arg_def r, akws ~ Arg kws '[], ReflectFK' flag fn kws, IsKeyFN r rflag, IsKeyFN fn flag) => Kw fn arg_def r
- Data.HList.Keyword: instance (KWAcc arg_desc kw a f arg_def r, (kw -> a -> r) ~ kwar) => KW' 'True f arg_desc arg_def kwar
- Data.HList.Keyword: instance (kkws ~ (kw : kws), ReflectFK rest kws) => ReflectFK' 'True (kw -> a -> rest) kkws
- Data.HList.Keyword: instance (v' ~ v, KWApply f' tail r) => KWApply' 'True (kw -> v -> f') (kw : v' : tail) r
- Data.HList.Keyword: instance (x ~ Tagged l v, y ~ HList '[Label l, v]) => ApplyAB TaggedToKW x y
- Data.HList.Keyword: instance IsKeyFN (Label s -> a -> b) 'True
- Data.HList.Keyword: instance KWApply f arg_values r => KWMerge '[] arg_values arg_def f r
- Data.HList.Keyword: instance KWMerge arg_needed arg_values arg_def f r => KW' 'False f (Arg arg_needed arg_values) arg_def r
- Data.HList.Keyword: instance KWMerge atail (kw : v : arg_values) arg_def f r => KWMerge'' 'True kw (kw : v : tail) atail arg_values arg_def f r
- Data.HList.Keyword: instance KWMerge' kw arg_def atail arg_values arg_def f r => KWMerge (kw : atail) arg_values arg_def f r
- Data.HList.Keyword: instance KWMerge' kw tail atail arg_values arg_def f r => KWMerge'' 'False kw (kw' : v' : tail) atail arg_values arg_def f r
- Data.HList.Keyword: instance Show (HList vals) => Show (Arg tys vals)
- Data.HList.Keyword: instance r ~ (c -> b) => IsKeyFN (K s c -> r) 'True
- Data.HList.Keyword: instance r ~ r' => KWApply r '[] r'
- Data.HList.Keyword: instance tail' ~ tail => HDelete' 'True e (e : tail) tail'
- Data.HList.Label3: instance HExtend (Label (Lbl n ns desc)) (Proxy (Lbl n' ns' desc' : xs))
- Data.HList.Label3: instance HExtend (Label (Lbl n ns desc)) (Proxy (x : xs))
- Data.HList.Label3: instance HExtend (Label y) (Proxy (x : xs))
- Data.HList.Label3: instance Label t ~ Label (Lbl ix ns n) => SameLabels (Label t) (Lbl ix ns n)
- Data.HList.Label3: instance Show desc => Show (Label (Lbl x ns desc))
- Data.HList.Label3: instance Show desc => ShowLabel (Lbl x ns desc)
- Data.HList.Label3: instance Typeable Lbl
- Data.HList.Label5: instance [overlap ok] Typeable x => ShowLabel x
- Data.HList.Label6: instance HExtend (Label y) (Proxy (x : xs))
- Data.HList.Label6: instance KnownNat x => ShowLabel x
- Data.HList.Label6: instance KnownSymbol x => ShowLabel x
- Data.HList.Labelable: instance (ExtendsVariant b t, ProjectVariant s a, ProjectExtendVariant s t, HLeftUnion b s bs, HRLabelSet bs, HRearrange (LabelsOf t) bs t) => Projected Variant s t a b
- Data.HList.Labelable: instance (H2ProjectByLabels (LabelsOf a) s a_ _s_minus_a, HRLabelSet a_, HRLabelSet a, HRearrange (LabelsOf a) a_ a, HLeftUnion b s bs, HRLabelSet bs, HRearrange (LabelsOf t) bs t, HRLabelSet t) => Projected Record s t a b
- Data.HList.Labelable: instance (HPrism x s t a b, to ~ (->)) => Labelable x Variant s t a b
- Data.HList.Labelable: instance (LabelableTIPCxt x s t a b) => Labelable x TIP s t a b
- Data.HList.Labelable: instance (LabeledCxt1 s t a b) => Labelable x LabeledR s t a b
- Data.HList.Labelable: instance (TICPrism s t a b, x ~ a, a ~ b, s ~ t, SameLength s t) => Labelable x TIC s t a b
- Data.HList.Labelable: instance (to ~ LabeledTo x, ToSym (to p q) x) => HExtend (to p q) (Proxy '[])
- Data.HList.Labelable: instance (to ~ LabeledTo x, ToSym (to p q) x) => HExtend (to p q) (Proxy (Lbl n ns desc : xs))
- Data.HList.Labelable: instance (to ~ LabeledTo x, ToSym (to p q) x) => HExtend (to p q) (Proxy (x : xs))
- Data.HList.Labelable: instance HLens x Record s t a b => Labelable x Record s t a b
- Data.HList.Labelable: instance LabeledTo x (p a (f b)) (p (LabeledR s) (f (LabeledR t))) ~ v1 v2 v3 => ToSym (v1 v2 v3) x
- Data.HList.Labelable: instance Show (LabeledTo x a b)
- Data.HList.Labelable: instance ToSym (label x) x
- Data.HList.Record: instance (H2ProjectByLabels '[l] r rin rout, HRearrange4 l ls rin rout r', l ~ Label ll) => HRearrange3 (l : ls) r r'
- Data.HList.Record: instance (HDeleteLabels (LabelsOf l) r r', HAppend (Record l) (Record r'), HAppendR (Record l) (Record r') ~ Record lr) => HLeftUnion l r lr
- Data.HList.Record: instance (HEqK l l' b, HUpdateAtLabel1 b l v (Tagged l' e : xs) xs') => HUpdateAtLabel2 l v (Tagged l' e : xs) xs'
- Data.HList.Record: instance (HEqK l l1 b, HasField' b l (Tagged l1 v1 : r) v) => HasField l (Record (Tagged l1 v1 : r)) v
- Data.HList.Record: instance (HEqK l1 l2 leq, HLabelSet' l1 l2 leq r) => HLabelSet (l1 : l2 : r)
- Data.HList.Record: instance (HLabelSet (LabelsOf ps), HAllTaggedLV ps) => HRLabelSet ps
- Data.HList.Record: instance (HLabelSet (l2 : r), HLabelSet (l1 : r)) => HLabelSet' l1 l2 'False r
- Data.HList.Record: instance (HLensCxt r x s t a b) => HLens r x s t a b
- Data.HList.Record: instance (HMapCxt HList ReadComponent (AddProxy rs) bs, ApplyAB ReadComponent (Proxy r) readP_r, HProxies rs, HSequence ReadP (readP_r : bs) (r : rs)) => Read (Record (r : rs))
- Data.HList.Record: instance (HMapCxt Record f x y, rx ~ Record x, ry ~ Record y) => ApplyAB (HMapR f) rx ry
- Data.HList.Record: instance (HMember (Label l) ks b, HCond b (Record r2) (Record (Tagged l v : r2)) (Record r3), HDeleteLabels ks r1 r2) => HDeleteLabels ks (Tagged l v : r1) r3
- Data.HList.Record: instance (HMemberLabel l r1 b, UnionSymRec' b r1 (Tagged l v) r2' ru) => UnionSymRec r1 (Tagged l v : r2') ru
- Data.HList.Record: instance (HMemberM (Label l) (LabelsOf xs) b, HasFieldM1 b l (r xs) v) => HasFieldM l (r xs) v
- Data.HList.Record: instance (HMemberM (Label l1) (l : ls) b, H2ProjectByLabels' b (l : ls) (Tagged l1 v1 : r1) rin rout) => H2ProjectByLabels (l : ls) (Tagged l1 v1 : r1) rin rout
- Data.HList.Record: instance (HRLabelSet (HAppendListR r1 r2), HAppend (HList r1) (HList r2)) => HAppend (Record r1) (Record r2)
- Data.HList.Record: instance (HRearrange3 ls r r', LabelsOf r' ~ ls, SameLength ls r, SameLength r r') => HRearrange ls r r'
- Data.HList.Record: instance (HRearrange3 ls rout r', r'' ~ (Tagged l v : r'), ll ~ Label l) => HRearrange4 ll ls '[Tagged l v] rout r''
- Data.HList.Record: instance (HRevAppR l '[] ~ lRev, HExtendRs lRev (Proxy '[]) ~ Proxy l1, l' ~ l1) => HBuild' l (Proxy l')
- Data.HList.Record: instance (HReverse l lRev, HMapTaggedFn lRev l') => HBuild' l (Record l')
- Data.HList.Record: instance (HUpdateAtLabel2 l v r r', HasField l (Record r') v) => HUpdateAtLabel Record l v r r'
- Data.HList.Record: instance (HZipRecord x y xy, SameLengths '[x, y, xy]) => HUnzip Record x y xy
- Data.HList.Record: instance (HZipRecord x y xy, SameLengths '[x, y, xy]) => HZip Record x y xy
- Data.HList.Record: instance (Read v, ShowLabel l, x ~ Tagged l v, ReadP x ~ y) => ApplyAB ReadComponent (Proxy x) y
- Data.HList.Record: instance (RecordValuesR lvs ~ vs, SameLabels ls lvs, LabelsOf lvs ~ ls, SameLengths '[ls, vs, lvs], HAllTaggedLV lvs) => HUnzip Proxy ls vs lvs
- Data.HList.Record: instance (ShowLabel l, Show v, ShowComponents r) => ShowComponents (Tagged l v : r)
- Data.HList.Record: instance (UnionSymRec r1 r2' ru, HExtend f2 (Record ru), Record f2ru ~ HExtendR f2 (Record ru)) => UnionSymRec' 'False r1 f2 r2' f2ru
- Data.HList.Record: instance (UnionSymRec r1 r2' ru, HTPupdateAtLabel Record l2 v2 ru, f2 ~ Tagged l2 v2) => UnionSymRec' 'True r1 f2 r2' ru
- Data.HList.Record: instance (la ~ LabelsOf a, lt ~ LabelsOf t, HRearrange la s a, HRearrange lt b t, HLabelSet la, HLabelSet lt) => Rearranged Record s t a b
- Data.HList.Record: instance Bounded (HList r) => Bounded (Record r)
- Data.HList.Record: instance Eq (HList r) => Eq (Record r)
- Data.HList.Record: instance Fail (DuplicatedLabel l1) => HLabelSet' l1 l2 'True r
- Data.HList.Record: instance Fail (ExtraField l) => HRearrange3 '[] (Tagged l v : a) '[]
- Data.HList.Record: instance Fail (FieldNotFound l) => HRearrange4 l ls '[] rout '[]
- Data.HList.Record: instance Fail (FieldNotFound l) => HUpdateAtLabel2 l v '[] '[]
- Data.HList.Record: instance Fail (FieldNotFound l) => HasField l (Record '[]) (FieldNotFound l)
- Data.HList.Record: instance H2ProjectByLabels '[Label l] v t1 v' => HDeleteAtLabel Record l v v'
- Data.HList.Record: instance H2ProjectByLabels '[] r '[] r
- Data.HList.Record: instance H2ProjectByLabels (LabelsOf r2) r1 r2 rout => SubType (Record r1) (Record r2)
- Data.HList.Record: instance H2ProjectByLabels (l : ls) '[] '[] '[]
- Data.HList.Record: instance H2ProjectByLabels ls r rin rout => H2ProjectByLabels' 'Nothing ls (f : r) rin (f : rout)
- Data.HList.Record: instance H2ProjectByLabels ls1 r rin rout => H2ProjectByLabels' ('Just ls1) ls (f : r) (f : rin) rout
- Data.HList.Record: instance HDeleteLabels ks '[] '[]
- Data.HList.Record: instance HLabelSet '[]
- Data.HList.Record: instance HLabelSet '[x]
- Data.HList.Record: instance HMapAux HList (HFmap f) x y => HMapAux Record f x y
- Data.HList.Record: instance HRLabelSet (t : r) => HExtend t (Record r)
- Data.HList.Record: instance HRearrange3 '[] '[] '[]
- Data.HList.Record: instance HUnzip Proxy ls vs lvs => HZip Proxy ls vs lvs
- Data.HList.Record: instance HUpdateAtLabel1 'True l v (Tagged l e : xs) (Tagged l v : xs)
- Data.HList.Record: instance HUpdateAtLabel2 l v xs xs' => HUpdateAtLabel1 'False l v (x : xs) (x : xs')
- Data.HList.Record: instance HZipRecord '[] '[] '[]
- Data.HList.Record: instance HZipRecord as bs abss => HZipRecord (Tagged x a : as) (Tagged x b : bs) (Tagged x (a, b) : abss)
- Data.HList.Record: instance HasField l (Record r) v => HasField' 'False l (fld : r) v
- Data.HList.Record: instance HasField l r v => HasFieldM1 ('Just b) l r ('Just v)
- Data.HList.Record: instance HasField' 'True l (Tagged l v : r) v
- Data.HList.Record: instance HasFieldM1 'Nothing l r 'Nothing
- Data.HList.Record: instance Ix (HList r) => Ix (Record r)
- Data.HList.Record: instance Monoid (HList r) => Monoid (Record r)
- Data.HList.Record: instance Ord (HList r) => Ord (Record r)
- Data.HList.Record: instance RecordValues '[]
- Data.HList.Record: instance RecordValues r => RecordValues (Tagged l v : r)
- Data.HList.Record: instance Relabeled Record
- Data.HList.Record: instance ShowComponents '[]
- Data.HList.Record: instance ShowComponents r => Show (Record r)
- Data.HList.Record: instance r1 ~ r1' => UnionSymRec r1 '[] r1'
- Data.HList.Record: instance tx ~ Tagged t x => ApplyAB TaggedFn x tx
- Data.HList.RecordPuns: instance Show Tree
- Data.HList.RecordU: instance (ApplyAB f (GetElemTy x) (GetElemTy y), IArray UArray (GetElemTy y), IArray UArray (GetElemTy x)) => HMapAux RecordU f x y
- Data.HList.RecordU: instance (HFind l r n, HFindMany ls r ns) => HFindMany (l : ls) r (n : ns)
- Data.HList.RecordU: instance (HFindLabel l r n, HLookupByHNatUS n u (Tagged l v), HasField l (Record r) v, RecordUSCxt r u) => HasField l (RecordUS r) v
- Data.HList.RecordU: instance (HGroupBy EqTagValue x g, HMapUnboxF g u) => RecordUSCxt x u
- Data.HList.RecordU: instance (HLeftUnion lv x lvx, HRLabelSet x, HLabelSet (LabelsOf x), HRearrange (LabelsOf x) lvx x) => HUpdateMany lv (Record x)
- Data.HList.RecordU: instance (HMapCxt HList TaggedFn (RecordValuesR x) x, IArray UArray (GetElemTy x), HList2List (RecordValuesR x) (GetElemTy x)) => RecordUToRecord x
- Data.HList.RecordU: instance (HNat2Integral n, HLookupByHNatR n u ~ le, le ~ Tagged l e, IArray UArray e, e ~ GetElemTy u) => HLookupByHNatUS1 ('Left t) n u us le
- Data.HList.RecordU: instance (HPartitionEq EqTagValue x (x : xs) xi xo, SortForRecordUS xo xo', sorted ~ HAppendListR xi xo', HAppendList xi xo') => SortForRecordUS (x : xs) sorted
- Data.HList.RecordU: instance (IArray UArray v, v ~ GetElemTy ls, HFindLabel l ls n, HNat2Integral n) => HasField l (RecordU ls) v
- Data.HList.RecordU: instance (RecordUSCxt x u, Show (HList u)) => Show (RecordUS x)
- Data.HList.RecordU: instance (RecordValues lv, HList2List (RecordValuesR lv) v, HFindMany (LabelsOf lv) (LabelsOf r) ixs, IArray UArray v, v ~ GetElemTy r, HNats2Integrals ixs) => HUpdateMany lv (RecordU r)
- Data.HList.RecordU: instance (RecordValues x, HList2List (RecordValuesR x) (GetElemTy x), HNat2Integral n, HLengthEq x n, IArray UArray (GetElemTy x)) => RecordToRecordU x
- Data.HList.RecordU: instance (hx ~ HList x, ux ~ RecordU x, RecordToRecordU x) => ApplyAB UnboxF hx ux
- Data.HList.RecordU: instance (r ~ HSubtract (HLength u) n, RecordU u ~ ru, HLookupByHNatUS1 r n u us e) => HLookupByHNatUS n (ru : us) e
- Data.HList.RecordU: instance (r ~ r', v ~ GetElemTy r, HFindLabel l r n, HNat2Integral n, IArray UArray v, HasField l (Record r') v) => HUpdateAtLabel RecordU l v r r'
- Data.HList.RecordU: instance (s ~ t, a ~ b, IArray UArray a, a ~ GetElemTy s, HLensCxt x RecordU s t a b) => Labelable x RecordU s t a b
- Data.HList.RecordU: instance (t1v ~ Tagged t1 v, t2v ~ Tagged t2 v, ElemTyEq (tv2 : rest)) => ElemTyEq (tv1 : tv2 : rest)
- Data.HList.RecordU: instance (txv ~ Tagged x v, tyw ~ Tagged y w, HEq v w b) => HEqBy EqTagValue txv tyw b
- Data.HList.RecordU: instance (ux ~ RecordU x, hx ~ HList x, RecordUToRecord x) => ApplyAB BoxF ux hx
- Data.HList.RecordU: instance ElemTyEq '[]
- Data.HList.RecordU: instance Eq (UArray Int (GetElemTy l)) => Eq (RecordU l)
- Data.HList.RecordU: instance HEqByFn EqTagValue
- Data.HList.RecordU: instance HFindMany '[] r '[]
- Data.HList.RecordU: instance HLookupByHNatUS t us e => HLookupByHNatUS1 ('Right t) n u us e
- Data.HList.RecordU: instance HMapUnboxF '[] '[]
- Data.HList.RecordU: instance HMapUnboxF xs us => HMapUnboxF (HList x : xs) (RecordU x : us)
- Data.HList.RecordU: instance Ord (UArray Int (GetElemTy l)) => Ord (RecordU l)
- Data.HList.RecordU: instance Read (UArray Int (GetElemTy l)) => Read (RecordU l)
- Data.HList.RecordU: instance Show (UArray Int (GetElemTy l)) => Show (RecordU l)
- Data.HList.RecordU: instance SortForRecordUS '[] '[]
- Data.HList.RecordU: instance t1v ~ Tagged t v => ElemTyEq (t1v : rest)
- Data.HList.TIC: instance (HasField o (TIC l) mo, mo ~ Maybe o) => HOccurs mo (TIC l)
- Data.HList.TIC: instance (MkVariant b b t, HasField a (Variant s) (Maybe a), SameLength s t, HFindLabel b t n, HFindLabel a s n, HUpdateAtHNatR n (Tagged b b) s ~ t, HUpdateAtHNatR n (Tagged a a) t ~ s) => TICPrism s t a b
- Data.HList.TIC: instance (ReadVariant l, HAllTaggedEq l, HRLabelSet l) => Read (TIC l)
- Data.HList.TIC: instance (me ~ Maybe e, HOccursNot (Tagged e e) l) => HExtend me (TIC l)
- Data.HList.TIC: instance Bounded (Variant l) => Bounded (TIC l)
- Data.HList.TIC: instance Enum (Variant l) => Enum (TIC l)
- Data.HList.TIC: instance Eq (Variant l) => Eq (TIC l)
- Data.HList.TIC: instance HMapAux Variant f xs ys => HMapAux TIC f xs ys
- Data.HList.TIC: instance HasField o (Variant l) (Maybe o) => HasField o (TIC l) (Maybe o)
- Data.HList.TIC: instance Ix (Variant l) => Ix (TIC l)
- Data.HList.TIC: instance Monoid (Variant l) => Monoid (TIC l)
- Data.HList.TIC: instance Ord (Variant l) => Ord (TIC l)
- Data.HList.TIC: instance ShowVariant l => Show (TIC l)
- Data.HList.TIC: instance TypeIndexed Record TIP
- Data.HList.TIC: instance TypeIndexed Variant TIC
- Data.HList.TIP: instance (Fail '(TypeNotFound op, "in TIP", db), Monad m) => TransTIPM1 'False 'HZero m op db
- Data.HList.TIP: instance (HAllTaggedEq l, HRLabelSet l) => HTypeIndexed l
- Data.HList.TIP: instance (HAllTaggedEq l, tee ~ Tagged e e') => HAllTaggedEq (tee : l)
- Data.HList.TIP: instance (HAppend (HList l) (HList l'), HTypeIndexed (HAppendListR l l')) => HAppend (TIP l) (TIP l')
- Data.HList.TIP: instance (HDeleteAtLabel Record e v v', HTypeIndexed v') => HDeleteAtLabel TIP e v v'
- Data.HList.TIP: instance (HMember (Tagged arg arg) db b, TransTIP2 b arg op db) => TransTIP1 'False ('HSucc n) (arg -> op) db
- Data.HList.TIP: instance (HMember (Tagged op op) db b, Arity op n, TransTIP1 b n op db) => TransTIP op db
- Data.HList.TIP: instance (HOccurs arg (TIP db), TransTIP op db) => TransTIP2 'True arg op db
- Data.HList.TIP: instance (HOccurs arg (TIP db), TransTIPM m op db) => TransTIPM2 'True m arg op db
- Data.HList.TIP: instance (HOccurs e (TIP l1), SubType (TIP l1) (TIP l2)) => SubType (TIP l1) (TIP (e : l2))
- Data.HList.TIP: instance (HRLabelSet (Tagged e e : l), HTypeIndexed l) => HExtend e (TIP l)
- Data.HList.TIP: instance (HTPupdateAtLabel TIP op op db) => TransTIP1 'True n op db
- Data.HList.TIP: instance (HUpdateAtLabel Record e' e r r', HTypeIndexed r', e ~ e') => HUpdateAtLabel TIP e' e r r'
- Data.HList.TIP: instance (HZipList (UntagR x) (UntagR y) (UntagR xy), UntagTag x, UntagTag y, UntagTag xy, HTypeIndexed x, HTypeIndexed y, SameLengths '[x, y, xy]) => HUnzip TIP x y xy
- Data.HList.TIP: instance (HZipList (UntagR x) (UntagR y) (UntagR xy), UntagTag x, UntagTag y, UntagTag xy, SameLengths '[x, y, xy], HTypeIndexed x, HTypeIndexed y, HUnzip TIP x y xy) => HZip TIP x y xy
- Data.HList.TIP: instance (Monad m, HMember (Tagged arg arg) db b, TransTIPM2 b m arg op db) => TransTIPM1 'False ('HSucc n) m (arg -> op) db
- Data.HList.TIP: instance (Monad m, HMember (Tagged op op) db b, Arity (m' op) n, TransTIPM1 b n m (m' op) db) => TransTIPM m (m' op) db
- Data.HList.TIP: instance (Monad m, m ~ m', HTPupdateAtLabel TIP op op db) => TransTIPM1 'True n m (m' op) db
- Data.HList.TIP: instance (TagUntagFD xs ys, txx ~ Tagged x x) => TagUntagFD (x : xs) (txx : ys)
- Data.HList.TIP: instance (e ~ e', HasField e (Record l) e') => HasField e (TIP l) e'
- Data.HList.TIP: instance Bounded (HList r) => Bounded (TIP r)
- Data.HList.TIP: instance Eq (HList a) => Eq (TIP a)
- Data.HList.TIP: instance Fail '(TypeNotFound arg, "in TIP", db) => TransTIP2 'False arg op db
- Data.HList.TIP: instance Fail '(TypeNotFound notfun, "in TIP", db) => TransTIP1 'False 'HZero notfun db
- Data.HList.TIP: instance Fail '(TypeNotFound op, "in TIP", db) => TransTIPM2 'False m arg op db
- Data.HList.TIP: instance HAllTaggedEq '[]
- Data.HList.TIP: instance HMapOut (HComp HShow HUntag) l String => Show (TIP l)
- Data.HList.TIP: instance HasField e (Record (x : y : l)) e => HOccurs e (TIP (x : y : l))
- Data.HList.TIP: instance Ix (HList r) => Ix (TIP r)
- Data.HList.TIP: instance Monoid (HList a) => Monoid (TIP a)
- Data.HList.TIP: instance Ord (HList r) => Ord (TIP r)
- Data.HList.TIP: instance SubType (TIP l) (TIP '[])
- Data.HList.TIP: instance TagUntagFD '[] '[]
- Data.HList.TIP: instance tee ~ Tagged e e => HOccurs e (TIP '[tee])
- Data.HList.TIP: unTIP :: TIP -> HList l
- Data.HList.TypeEqO: instance [overlap ok] 'False ~ b => HEq x y b
- Data.HList.TypeEqO: instance [overlap ok] 'False ~ b => TupleType x b
- Data.HList.TypeEqO: instance [overlap ok] 'False ~ flag => IsKeyFN t flag
- Data.HList.TypeEqO: instance [overlap ok] (Arity f n) => ArityFwd (x -> f) ('HSucc n)
- Data.HList.TypeEqO: instance [overlap ok] HEq x x 'True
- Data.HList.TypeEqO: instance [overlap ok] HNat2Integral n => Show (Proxy n)
- Data.HList.TypeEqO: instance [overlap ok] Show (Proxy 'False)
- Data.HList.TypeEqO: instance [overlap ok] Show (Proxy 'True)
- Data.HList.TypeEqO: instance [overlap ok] TupleType () 'True
- Data.HList.TypeEqO: instance [overlap ok] TupleType (x, y) 'True
- Data.HList.TypeEqO: instance [overlap ok] TupleType (x, y, z) 'True
- Data.HList.TypeEqO: instance [overlap ok] hZero ~ 'HZero => ArityFwd f hZero
- Data.HList.Variant: instance (ApplyAB f te te', HMapCxt Variant f (l : ls) (l' : ls')) => HMapAux Variant f (te : l : ls) (te' : l' : ls')
- Data.HList.Variant: instance (Bounded x, Bounded z, HRevAppR (Tagged s x : xs) '[] ~ (Tagged t z : sx), MkVariant t z (Tagged s x : xs)) => Bounded (Variant (Tagged s x : xs))
- Data.HList.Variant: instance (Enum x, Bounded x, Enum (Variant (y : z))) => Enum (Variant (Tagged s x : y : z))
- Data.HList.Variant: instance (Eq (Variant xs), Eq x) => Eq (Variant (x : xs))
- Data.HList.Variant: instance (HAllEqVal' (Tagged () e : v), Unvariant v e) => Unvariant' v e
- Data.HList.Variant: instance (HAllEqVal' (ta : xs), a' ~ a, ta ~ Tagged t a, ta' ~ Tagged t' a') => HAllEqVal' (ta' : ta : xs)
- Data.HList.Variant: instance (HAllTaggedLV x, Unvariant '[le] e, MkVariant l e x, le ~ Tagged l e) => ExtendsVariant '[le] x
- Data.HList.Variant: instance (HEq a a' b, HAllEqVal (Tagged t a' : xs) b2, HAnd b b2 ~ b3) => HAllEqVal (Tagged s a : Tagged t a' : xs) b3
- Data.HList.Variant: instance (HFindLabel x vs n, HNat2Integral n, HasField x (Variant vs) (Maybe v)) => MkVariant x v vs
- Data.HList.Variant: instance (HUnzip Variant (x2 : xs) (y2 : ys) (xy2 : xys), tx ~ Tagged t x, ty ~ Tagged t y, txy ~ Tagged t (x, y)) => HUnzip Variant (tx : x2 : xs) (ty : y2 : ys) (txy : xy2 : xys)
- Data.HList.Variant: instance (HUpdateVariantAtLabelCxt l e v v' n _e) => HUpdateAtLabel Variant l e v v'
- Data.HList.Variant: instance (HasField x (Record vs) a, HFindLabel x vs n, HNat2Integral n) => HasField x (Variant vs) (Maybe a)
- Data.HList.Variant: instance (MkVariant l e v, Data e) => GunfoldVariant '[Tagged l e] v
- Data.HList.Variant: instance (MkVariant l e v, Data e, GunfoldVariant (b : bs) v) => GunfoldVariant (Tagged l e : b : bs) v
- Data.HList.Variant: instance (MkVariant l e y, le ~ Tagged l e, ExtendsVariant (b : bs) y) => ExtendsVariant (le : b : bs) y
- Data.HList.Variant: instance (MkVariant l v y, lv ~ Tagged l v) => ProjectExtendVariant' ('Just t) lv y
- Data.HList.Variant: instance (MkVariant x b t, HasField x (Variant s) (Maybe a), SameLength s t, SameLabels s t, H2ProjectByLabels '[Label x] s si so, H2ProjectByLabels '[Label x] t ti to, so ~ to, HUpdateAtLabel Variant x b s t, HUpdateAtLabel Variant x a t s) => HPrism x s t a b
- Data.HList.Variant: instance (Monoid x, Monoid (Variant (a : b))) => Monoid (Variant (Tagged t x : a : b))
- Data.HList.Variant: instance (Ord x, Ord (Variant xs)) => Ord (Variant (x : xs))
- Data.HList.Variant: instance (ProjectVariant x yin, ProjectVariant x yout, H2ProjectByLabels (LabelsOf yin) x xi xo, HRearrange (LabelsOf yin) xi yin, HRearrange (LabelsOf yout) xo yout, HLeftUnion xi xo xixo, HRearrange (LabelsOf x) xixo x, HAllTaggedLV x, HAllTaggedLV yin, HAllTaggedLV yout) => SplitVariant x yin yout
- Data.HList.Variant: instance (ProjectVariant x ys, HasField t (Variant x) (Maybe y), HOccursNot (Label t) (LabelsOf ys), ty ~ Tagged t y) => ProjectVariant x (ty : ys)
- Data.HList.Variant: instance (SameLength s a, ExtendsVariant s a, SameLength b t, ExtendsVariant b t) => Rearranged Variant s t a b
- Data.HList.Variant: instance (ShowLabel l, Read v, ReadVariant vs, HOccursNot (Label l) (LabelsOf vs)) => ReadVariant (Tagged l v : vs)
- Data.HList.Variant: instance (ShowLabel l, Show v, ShowVariant (w : ws)) => ShowVariant (Tagged l v : w : ws)
- Data.HList.Variant: instance (ShowLabel l, Show v, lv ~ Tagged l v) => ShowVariant '[lv]
- Data.HList.Variant: instance (ShowLabel l, VariantConstrs xs) => VariantConstrs (Tagged l e : xs)
- Data.HList.Variant: instance (Typeable (Variant v), GfoldlVariant v v, GunfoldVariant v v, VariantConstrs v) => Data (Variant v)
- Data.HList.Variant: instance (Unvariant '[Tagged t x] x, Monoid x) => Monoid (Variant '[Tagged t x])
- Data.HList.Variant: instance (Unvariant '[a] v, a ~ Tagged l v, Data v, MkVariant l v b) => GfoldlVariant '[a] b
- Data.HList.Variant: instance (Unvariant '[txy] txy, tx ~ Tagged t x, ty ~ Tagged t y, txy ~ Tagged t (x, y)) => HUnzip Variant '[tx] '[ty] '[txy]
- Data.HList.Variant: instance (Unvariant1 b v e, HAllEqVal v b, HAllEqVal (Tagged () e : v) b) => Unvariant v e
- Data.HList.Variant: instance (VariantToHMaybied v r, HReplicateF nr ConstTaggedNothing () r, tx ~ Tagged t x, tmx ~ Tagged t (Maybe x)) => VariantToHMaybied (tx : v) (tmx : r)
- Data.HList.Variant: instance (a ~ Tagged l v, MkVariant l v r, Data v, GfoldlVariant (b : c) r) => GfoldlVariant (a : b : c) r
- Data.HList.Variant: instance (ee ~ (e, e), Eq e, bool ~ Bool) => ApplyAB UncurryEq ee bool
- Data.HList.Variant: instance (le ~ Tagged l (Maybe e), HOccursNot (Label l) (LabelsOf v)) => HExtend le (Variant v)
- Data.HList.Variant: instance (lv ~ Tagged l v, HMemberM lv y inY, ProjectExtendVariant' inY lv y, ProjectExtendVariant xs y) => ProjectExtendVariant (lv : xs) y
- Data.HList.Variant: instance (lv ~ Tagged l v, lv' ~ Tagged l v', HMemberM (Label l) (LabelsOf fs) b, HasFieldM l (Record fs) f, DemoteMaybe (v -> v) f ~ (v -> v'), MkVariant l v' (lv' : rs), ZipVR fs vs rs) => ZipVR fs (lv : vs) (lv' : rs)
- Data.HList.Variant: instance (mx ~ Maybe x, my ~ Maybe y, HCast y x) => ApplyAB HCastF mx my
- Data.HList.Variant: instance (tx ~ Tagged t x, ty ~ Tagged t y, txy ~ Tagged t (x, y), ZipVariant xs ys zs, MkVariant t (x, y) (txy : zs)) => ZipVariant (tx : xs) (ty : ys) (txy : zs)
- Data.HList.Variant: instance (vx ~ Variant x, vy ~ Variant y, HMapAux Variant (HFmap f) x y, SameLength x y) => ApplyAB (HMapV f) vx vy
- Data.HList.Variant: instance (x ~ (Tagged t (Maybe e), [Variant v]), y ~ [Variant (Tagged t e : v)], MkVariant t e (Tagged t e : v)) => ApplyAB HMaybiedToVariantFs x y
- Data.HList.Variant: instance ApplyAB f te te' => HMapAux Variant f '[te] '[te']
- Data.HList.Variant: instance Enum x => Enum (Variant '[Tagged s x])
- Data.HList.Variant: instance Eq (Variant '[])
- Data.HList.Variant: instance Fail "Unvariant applied to empty variant" => Unvariant1 b '[] (Proxy "Unvariant applied to empty variant")
- Data.HList.Variant: instance Fail (UnvariantTypeMismatch (v : vs)) => Unvariant1 'False (v : vs) (UnvariantTypeMismatch (v : vs))
- Data.HList.Variant: instance HAllEqVal '[] 'True
- Data.HList.Variant: instance HAllEqVal '[x] 'True
- Data.HList.Variant: instance HAllEqVal' '[]
- Data.HList.Variant: instance HAllEqVal' '[x]
- Data.HList.Variant: instance HAllTaggedLV y => ProjectExtendVariant '[] y
- Data.HList.Variant: instance Ord (Variant '[])
- Data.HList.Variant: instance ProjectExtendVariant' 'Nothing lv y
- Data.HList.Variant: instance ProjectVariant x '[]
- Data.HList.Variant: instance ReadVariant '[]
- Data.HList.Variant: instance ReadVariant v => Read (Variant v)
- Data.HList.Variant: instance Relabeled Variant
- Data.HList.Variant: instance ShowVariant vs => Show (Variant vs)
- Data.HList.Variant: instance VariantConstrs '[]
- Data.HList.Variant: instance VariantToHMaybied '[] '[]
- Data.HList.Variant: instance ZipVR fs '[] '[]
- Data.HList.Variant: instance ZipVariant '[] '[] '[]
- Data.HList.Variant: instance v ~ Tagged t1 e => Unvariant1 'True (v : vs) e
- Data.HList.Variant: instance y ~ Tagged t (Maybe e) => ApplyAB ConstTaggedNothing x y
+ Data.HList.Data: instance (Data.Data.Data b, x ~ (t, c (b -> r)), y ~ c r) => Data.HList.FakePrelude.ApplyAB (Data.HList.Data.GunfoldK c) x y
+ Data.HList.Data: instance (Data.Data.Data d, (c (d -> b), d) ~ x, c b ~ y) => Data.HList.FakePrelude.ApplyAB (Data.HList.Data.GfoldlK c) x y
+ Data.HList.Data: instance (Data.Data.Data x, Data.Data.Data (Data.HList.HList.HList xs), Data.HList.FakePrelude.TypeablePolyK (x : xs), Data.Typeable.Internal.Typeable (Data.HList.HList.HList (x : xs))) => Data.Data.Data (Data.HList.HList.HList (x : xs))
+ Data.HList.Data: instance (Data.HList.Data.TypeRepsList (Data.HList.HList.HList xs), Data.Typeable.Internal.Typeable x) => Data.HList.Data.TypeRepsList (Data.HList.HList.HList (x : xs))
+ Data.HList.Data: instance (Data.HList.FakePrelude.TypeablePolyK xs, Data.Typeable.Internal.Typeable (Data.HList.HList.HList xs), Data.Data.Data (Data.HList.HList.HList xs)) => Data.Data.Data (Data.HList.TIP.TIP xs)
+ Data.HList.Data: instance (Data.HList.FakePrelude.TypeablePolyK xs, Data.Typeable.Internal.Typeable (Data.HList.Variant.Variant xs), Data.Data.Data (Data.HList.Variant.Variant xs)) => Data.Data.Data (Data.HList.TIC.TIC xs)
+ Data.HList.Data: instance Data.HList.Data.DataHListFlatCxt na g a => Data.Data.Data (Data.HList.Data.HListFlat a)
+ Data.HList.Data: instance Data.HList.Data.DataRecordCxt a => Data.Data.Data (Data.HList.Record.Record a)
+ Data.HList.Data: instance Data.HList.Data.RecordLabelsStr '[]
+ Data.HList.Data: instance Data.HList.Data.RecordLabelsStr2 '[]
+ Data.HList.Data: instance Data.HList.Data.TypeRepsList (Data.HList.HList.HList '[])
+ Data.HList.Data: instance Data.HList.Data.TypeRepsList (Data.HList.HList.HList xs) => Data.HList.Data.TypeRepsList (Data.HList.Record.Record xs)
+ Data.HList.Data: instance Data.Typeable.Internal.Typeable (Data.HList.HList.HList '[]) => Data.Data.Data (Data.HList.HList.HList '[])
+ Data.HList.Data: instance forall (k :: BOX) (x :: k) (xs :: [k]). (Data.HList.Data.RecordLabelsStr2 xs, Data.HList.FakePrelude.ShowLabel x) => Data.HList.Data.RecordLabelsStr2 (x : xs)
+ Data.HList.Data: instance forall (k :: BOX) (x :: k) t (xs :: [*]). (Data.HList.Data.RecordLabelsStr xs, Data.HList.FakePrelude.ShowLabel x) => Data.HList.Data.RecordLabelsStr (Data.Tagged.Tagged x t : xs)
+ Data.HList.FakePrelude: instance (Data.HList.FakePrelude.ApplyAB f (x, y) z, mz ~ m z, mxy ~ (m x, m y), GHC.Base.Applicative m) => Data.HList.FakePrelude.ApplyAB (Data.HList.FakePrelude.LiftA2 f) mxy mz
+ Data.HList.FakePrelude: instance (Data.HList.FakePrelude.ApplyAB f a b, Data.HList.FakePrelude.ApplyAB g b c) => Data.HList.FakePrelude.ApplyAB (Data.HList.FakePrelude.HComp g f) a c
+ Data.HList.FakePrelude: instance (Data.HList.FakePrelude.HEq x y b, Data.HList.FakePrelude.HCast1 b x y) => Data.HList.FakePrelude.HCast x y
+ Data.HList.FakePrelude: instance (Data.HList.FakePrelude.HNats2Integrals ns, Data.HList.FakePrelude.HNat2Integral n) => Data.HList.FakePrelude.HNats2Integrals (n : ns)
+ Data.HList.FakePrelude: instance (GHC.Base.Monad m, Data.HList.FakePrelude.ApplyAB f x fx, fx ~ m (), pair ~ (x, m ()), Data.HList.FakePrelude.ApplyAB f x (m ())) => Data.HList.FakePrelude.ApplyAB (Data.HList.FakePrelude.HSeq f) pair fx
+ Data.HList.FakePrelude: instance (GHC.Base.String ~ string, GHC.Read.Read a) => Data.HList.FakePrelude.ApplyAB Data.HList.FakePrelude.HRead string a
+ Data.HList.FakePrelude: instance (GHC.Base.String ~ string, GHC.Show.Show a) => Data.HList.FakePrelude.ApplyAB Data.HList.FakePrelude.HShow a string
+ Data.HList.FakePrelude: instance (f1 ~ (a -> b -> c), f2 ~ (b -> a -> c)) => Data.HList.FakePrelude.ApplyAB Data.HList.FakePrelude.HFlip f1 f2
+ Data.HList.FakePrelude: instance (hJustA ~ Data.HList.FakePrelude.HJust a) => Data.HList.FakePrelude.ApplyAB (Data.HList.FakePrelude.HJust t) a hJustA
+ Data.HList.FakePrelude: instance (io ~ GHC.Types.IO (), GHC.Show.Show x) => Data.HList.FakePrelude.ApplyAB Data.HList.FakePrelude.HPrint x io
+ Data.HList.FakePrelude: instance (x ~ t a, y ~ t b, GHC.Base.Functor t, Data.HList.FakePrelude.ApplyAB f a b) => Data.HList.FakePrelude.ApplyAB (Data.HList.FakePrelude.HFmap f) x y
+ Data.HList.FakePrelude: instance (x ~ y) => Data.HList.FakePrelude.HCast1 'GHC.Types.True x y
+ Data.HList.FakePrelude: instance (x' ~ x, y' ~ y) => Data.HList.FakePrelude.ApplyAB (x' -> y') x y
+ Data.HList.FakePrelude: instance (xf ~ (x -> f), Data.HList.FakePrelude.ArityRev f n) => Data.HList.FakePrelude.ArityRev xf ('Data.HList.FakePrelude.HSucc n)
+ Data.HList.FakePrelude: instance (y ~ y', fg ~ (x -> y, y' -> z), r ~ (x -> z)) => Data.HList.FakePrelude.ApplyAB Data.HList.FakePrelude.Comp fg r
+ Data.HList.FakePrelude: instance Data.HList.FakePrelude.ArityRev f 'Data.HList.FakePrelude.HZero
+ Data.HList.FakePrelude: instance Data.HList.FakePrelude.HAllTaggedLV '[]
+ Data.HList.FakePrelude: instance Data.HList.FakePrelude.HCast1 'GHC.Types.False x y
+ Data.HList.FakePrelude: instance Data.HList.FakePrelude.HCond 'GHC.Types.False x y y
+ Data.HList.FakePrelude: instance Data.HList.FakePrelude.HCond 'GHC.Types.True x y x
+ Data.HList.FakePrelude: instance Data.HList.FakePrelude.HNats2Integrals '[]
+ Data.HList.FakePrelude: instance Data.HList.FakePrelude.HNotFD 'GHC.Types.False 'GHC.Types.True
+ Data.HList.FakePrelude: instance Data.HList.FakePrelude.HNotFD 'GHC.Types.True 'GHC.Types.False
+ Data.HList.FakePrelude: instance Data.HList.FakePrelude.SameLabels '[] '[]
+ Data.HList.FakePrelude: instance GHC.Show.Show Data.HList.FakePrelude.HNothing
+ Data.HList.FakePrelude: instance GHC.Show.Show x => GHC.Show.Show (Data.HList.FakePrelude.HJust x)
+ Data.HList.FakePrelude: instance GHC.TypeLits.KnownNat (Data.HList.FakePrelude.HNat2Nat n) => Data.HList.FakePrelude.HNat2Integral n
+ Data.HList.FakePrelude: instance forall (k :: BOX) (k1 :: BOX) (cxt :: k) (geta :: k1) a b. (Data.HList.FakePrelude.FunCxt cxt b, Data.HList.FakePrelude.FunApp geta b ~ a) => Data.HList.FakePrelude.ApplyAB (Data.HList.FakePrelude.Fun' cxt geta) a b
+ Data.HList.FakePrelude: instance forall (k :: BOX) (k1 :: BOX) (cxt :: k) (getb :: k1) a b. (Data.HList.FakePrelude.FunCxt cxt a, Data.HList.FakePrelude.FunApp getb a ~ b) => Data.HList.FakePrelude.ApplyAB (Data.HList.FakePrelude.Fun cxt getb) a b
+ Data.HList.FakePrelude: instance forall (k :: BOX) (k1 :: BOX) (es2 :: [k1]). (es2 ~ '[]) => Data.HList.FakePrelude.SameLength' '[] es2
+ Data.HList.FakePrelude: instance forall (k :: BOX) (k1 :: BOX) (t :: k) (t' :: k1) a. (Data.HList.FakePrelude.Label t ~ Data.HList.FakePrelude.Label t') => Data.HList.FakePrelude.SameLabels (Data.HList.FakePrelude.Label t) (Data.Tagged.Tagged t' a)
+ Data.HList.FakePrelude: instance forall (k :: BOX) (k1 :: BOX) (t :: k) (t' :: k1). (Data.HList.FakePrelude.Label t ~ Data.HList.FakePrelude.Label t') => Data.HList.FakePrelude.SameLabels (Data.HList.FakePrelude.Label t) (Data.HList.FakePrelude.Label t')
+ Data.HList.FakePrelude: instance forall (k :: BOX) (k1 :: BOX) (t :: k1) a (s :: k). Data.HList.FakePrelude.SameLabels (Data.HList.FakePrelude.Label t) s => Data.HList.FakePrelude.SameLabels (Data.Tagged.Tagged t a) s
+ Data.HList.FakePrelude: instance forall (k :: BOX) (k1 :: BOX) (x :: [k]) (y :: [k1]). (Data.HList.FakePrelude.SameLength' x y, Data.HList.FakePrelude.SameLength' y x) => Data.HList.FakePrelude.SameLength x y
+ Data.HList.FakePrelude: instance forall (k :: BOX) (k1 :: BOX) (x :: k) (xs :: [k]) (es2 :: [k1]) (ys :: [k1]) (y :: k1). (Data.HList.FakePrelude.SameLength' xs ys, es2 ~ (y : ys)) => Data.HList.FakePrelude.SameLength' (x : xs) es2
+ Data.HList.FakePrelude: instance forall (k :: BOX) (k1 :: BOX) (x :: k) (xs :: [k]) (y :: k1) (ys :: [k1]). (Data.HList.FakePrelude.SameLabels x y, Data.HList.FakePrelude.SameLabels xs ys) => Data.HList.FakePrelude.SameLabels (x : xs) (y : ys)
+ Data.HList.FakePrelude: instance forall (k :: BOX) (k1 :: BOX) (x :: k) (xs :: [k]). Data.HList.FakePrelude.SameLabels (x : xs) '[]
+ Data.HList.FakePrelude: instance forall (k :: BOX) (k1 :: BOX) (x :: k1) (xs :: [k1]). Data.HList.FakePrelude.SameLabels '[] (x : xs)
+ Data.HList.FakePrelude: instance forall (k :: BOX) (t :: GHC.TypeLits.Symbol) (s :: k). Data.HList.FakePrelude.SameLabels (Data.HList.FakePrelude.Label t) s => Data.HList.FakePrelude.SameLabels t s
+ Data.HList.FakePrelude: instance forall (k :: BOX) (t :: k) (t' :: GHC.TypeLits.Symbol). (Data.HList.FakePrelude.Label t ~ Data.HList.FakePrelude.Label t') => Data.HList.FakePrelude.SameLabels (Data.HList.FakePrelude.Label t) t'
+ Data.HList.FakePrelude: instance forall (k :: BOX) tx x (t :: k). (Data.Tagged.Tagged t x ~ tx) => Data.HList.FakePrelude.ApplyAB Data.HList.FakePrelude.HUntag tx x
+ Data.HList.FakePrelude: instance forall (k :: BOX) x (xs :: [*]) (t :: k) v. (Data.HList.FakePrelude.HAllTaggedLV xs, x ~ Data.Tagged.Tagged t v) => Data.HList.FakePrelude.HAllTaggedLV (x : xs)
+ Data.HList.HArray: instance (ch ~ Data.Proxy.Proxy (Data.HList.FakePrelude.HBoolEQ sel (Data.HList.HArray.KMember n ns)), Data.HList.FakePrelude.Apply (ch, Data.HList.HArray.FHUProj sel ns) (Data.HList.HList.HList (e : l), Data.Proxy.Proxy n)) => Data.HList.FakePrelude.Apply (Data.HList.HArray.FHUProj sel ns) (Data.HList.HList.HList (e : l), Data.Proxy.Proxy n)
+ Data.HList.HArray: instance Data.HList.FakePrelude.Apply (Data.HList.HArray.FHUProj sel ns) (Data.HList.HList.HList '[], n)
+ Data.HList.HArray: instance Data.HList.FakePrelude.Apply (Data.HList.HArray.FHUProj sel ns) (Data.HList.HList.HList l, Data.Proxy.Proxy ('Data.HList.FakePrelude.HSucc n)) => Data.HList.FakePrelude.Apply (Data.Proxy.Proxy 'GHC.Types.False, Data.HList.HArray.FHUProj sel ns) (Data.HList.HList.HList (e : l), Data.Proxy.Proxy n)
+ Data.HList.HArray: instance Data.HList.FakePrelude.Apply (Data.Proxy.Proxy 'GHC.Types.True, Data.HList.HArray.FHUProj sel ns) (Data.HList.HList.HList (e : l), Data.Proxy.Proxy n)
+ Data.HList.HArray: instance Data.HList.FakePrelude.Fail (Data.HList.FakePrelude.FieldNotFound (Data.Proxy.Proxy n, e1)) => Data.HList.HArray.HUpdateAtHNat n e1 '[]
+ Data.HList.HArray: instance Data.HList.HArray.HDeleteAtHNat 'Data.HList.FakePrelude.HZero (e : l)
+ Data.HList.HArray: instance Data.HList.HArray.HDeleteAtHNat n l => Data.HList.HArray.HDeleteAtHNat ('Data.HList.FakePrelude.HSucc n) (e : l)
+ Data.HList.HArray: instance Data.HList.HArray.HLookupByHNat 'Data.HList.FakePrelude.HZero (e : l)
+ Data.HList.HArray: instance Data.HList.HArray.HLookupByHNat n l => Data.HList.FakePrelude.Apply (Data.HList.HArray.FHLookupByHNat l) (Data.Proxy.Proxy n)
+ Data.HList.HArray: instance Data.HList.HArray.HLookupByHNat n l => Data.HList.HArray.HLookupByHNat ('Data.HList.FakePrelude.HSucc n) (e : l)
+ Data.HList.HArray: instance Data.HList.HArray.HUpdateAtHNat 'Data.HList.FakePrelude.HZero e1 (e : l)
+ Data.HList.HArray: instance Data.HList.HArray.HUpdateAtHNat n e1 l => Data.HList.HArray.HUpdateAtHNat ('Data.HList.FakePrelude.HSucc n) e1 (e : l)
+ Data.HList.HCurry: instance Data.HList.HCurry.HCurry' 'Data.HList.FakePrelude.HZero b '[] b
+ Data.HList.HCurry: instance Data.HList.HCurry.HCurry' n b xs r => Data.HList.HCurry.HCurry' ('Data.HList.FakePrelude.HSucc n) (x -> b) (x : xs) r
+ Data.HList.HList: instance ((x, y) ~ z, Data.HList.HList.HZipList xs ys zs) => Data.HList.HList.HZipList (x : xs) (y : ys) (z : zs)
+ Data.HList.HList: instance (Data.HList.FakePrelude.Apply p s, Data.HList.HList.HUnfoldFD p (Data.HList.FakePrelude.ApplyR p s) z) => Data.HList.HList.HUnfoldFD p (Data.HList.FakePrelude.HJust (e, s)) (e : z)
+ Data.HList.HList: instance (Data.HList.FakePrelude.ApplyAB f (e, r) r', Data.HList.HList.HFoldr f v l r) => Data.HList.HList.HFoldr f v (e : l) r'
+ Data.HList.HList: instance (Data.HList.FakePrelude.ApplyAB f (e, r) r', Data.HList.HList.HFoldr1 f (e' : l) r) => Data.HList.HList.HFoldr1 f (e : e' : l) r'
+ Data.HList.HList: instance (Data.HList.FakePrelude.ApplyAB f (x, r) s, Data.HList.HList.HScanr f z xs (r : rs), srrs ~ (s : r : rs)) => Data.HList.HList.HScanr f z (x : xs) srrs
+ Data.HList.HList: instance (Data.HList.FakePrelude.ApplyAB f e e', Data.HList.HList.HMapAux Data.HList.HList.HList f l l', Data.HList.FakePrelude.SameLength l l') => Data.HList.HList.HMapAux Data.HList.HList.HList f (e : l) (e' : l')
+ Data.HList.HList: instance (Data.HList.FakePrelude.ApplyAB f z fz, Data.HList.HList.HReplicateF n f z r') => Data.HList.HList.HReplicateF ('Data.HList.FakePrelude.HSucc n) f z (fz : r')
+ Data.HList.HList: instance (Data.HList.FakePrelude.ApplyAB f z z', Data.HList.HList.HIterate n f z' r', z ~ z_) => Data.HList.HList.HIterate ('Data.HList.FakePrelude.HSucc n) f z (z_ : r')
+ Data.HList.HList: instance (Data.HList.FakePrelude.HEq e e' b, Data.HList.HList.HTMember e l b', Data.HList.FakePrelude.HOr b b' ~ b'') => Data.HList.HList.HTMember e (e' : l) b''
+ Data.HList.HList: instance (Data.HList.FakePrelude.SameLength a b, Data.HList.HList.HMapAux r f a b) => Data.HList.HList.HMapCxt r f a b
+ Data.HList.HList: instance (Data.HList.FakePrelude.SameLength' (Data.HList.HList.HReplicateR n ()) xs, Data.HList.HList.HLengthEq1 xs n, Data.HList.HList.HLengthEq2 xs n) => Data.HList.HList.HLengthEq xs n
+ Data.HList.HList: instance (Data.HList.FakePrelude.SameLengths '[x, y, xy], Data.HList.HList.HZipList x y xy) => Data.HList.HListPrelude.HUnzip Data.HList.HList.HList x y xy
+ Data.HList.HList: instance (Data.HList.FakePrelude.SameLengths '[x, y, xy], Data.HList.HList.HZipList x y xy) => Data.HList.HListPrelude.HZip Data.HList.HList.HList x y xy
+ Data.HList.HList: instance (Data.HList.HList.HConcatFD as bs, Data.HList.HList.HAppendFD a bs cs) => Data.HList.HList.HConcatFD (Data.HList.HList.HList a : as) cs
+ Data.HList.HList: instance (Data.HList.HList.HInits1 xs ys, Data.HList.HList.HMapCxt Data.HList.HList.HList (Data.HList.HList.FHCons2 x) ys ys', Data.HList.HList.HMapCons x ys ~ ys', Data.HList.HList.HMapTail ys' ~ ys) => Data.HList.HList.HInits1 (x : xs) (Data.HList.HList.HList '[x] : ys')
+ Data.HList.HList: instance (Data.HList.HList.HLengthEq xs n, sn ~ 'Data.HList.FakePrelude.HSucc n) => Data.HList.HList.HLengthEq2 (x : xs) sn
+ Data.HList.HList: instance (Data.HList.HList.HLengthEq xs n, xxs ~ (x : xs)) => Data.HList.HList.HLengthEq1 xxs ('Data.HList.FakePrelude.HSucc n)
+ Data.HList.HList: instance (Data.HList.HList.HMapCxt Data.HList.HList.HList f a b, as ~ Data.HList.HList.HList a, bs ~ Data.HList.HList.HList b) => Data.HList.FakePrelude.ApplyAB (Data.HList.HList.HMapL f) as bs
+ Data.HList.HList: instance (Data.HList.HList.HMapCxt r f a b, as ~ r a, bs ~ r b) => Data.HList.FakePrelude.ApplyAB (Data.HList.HList.HMap f) as bs
+ Data.HList.HList: instance (Data.HList.HList.HProxies a, Data.HList.HList.HMapCxt Data.HList.HList.HList Data.HList.HList.ConstMempty (Data.HList.HList.AddProxy a) a, Data.HList.HListPrelude.HZip Data.HList.HList.HList a a aa, Data.HList.HList.HMapCxt Data.HList.HList.HList Data.HList.HList.UncurryMappend aa a) => GHC.Base.Monoid (Data.HList.HList.HList a)
+ Data.HList.HList: instance (Data.HList.HList.HProxies l, GHC.Read.Read e, Data.HList.HList.HSequence Text.ParserCombinators.ReadP.ReadP (Text.ParserCombinators.ReadP.ReadP e : readP_l) (e : l), Data.HList.HList.HMapCxt Data.HList.HList.HList Data.HList.HList.ReadElement (Data.HList.HList.AddProxy l) readP_l) => GHC.Read.Read (Data.HList.HList.HList (e : l))
+ Data.HList.HList: instance (Data.HList.HList.HReplicateFD n e es, e ~ e') => Data.HList.HList.HReplicateFD ('Data.HList.FakePrelude.HSucc n) e (e' : es)
+ Data.HList.HList: instance (Data.HList.HList.HRevApp xs '[] sx, Data.HList.HList.HRevApp sx '[] xs) => Data.HList.HList.HReverse xs sx
+ Data.HList.HList: instance (Data.HList.HList.HSplitAt1 '[] n xsys xs ys, Data.HList.HList.HAppendList1 xs ys xsys, Data.HList.HList.HLengthEq xs n) => Data.HList.HList.HSplitAt n xsys xs ys
+ Data.HList.HList: instance (Data.HList.HList.HTMember h l1 b, Data.HList.HList.HTIntersectBool b h t l1 l2) => Data.HList.HList.HTIntersect (h : t) l1 l2
+ Data.HList.HList: instance (GHC.Arr.Ix x, GHC.Arr.Ix (Data.HList.HList.HList xs)) => GHC.Arr.Ix (Data.HList.HList.HList (x : xs))
+ Data.HList.HList: instance (GHC.Classes.Eq x, GHC.Classes.Eq (Data.HList.HList.HList xs)) => GHC.Classes.Eq (Data.HList.HList.HList (x : xs))
+ Data.HList.HList: instance (GHC.Classes.Ord x, GHC.Classes.Ord (Data.HList.HList.HList xs)) => GHC.Classes.Ord (Data.HList.HList.HList (x : xs))
+ Data.HList.HList: instance (GHC.Enum.Bounded x, GHC.Enum.Bounded (Data.HList.HList.HList xs)) => GHC.Enum.Bounded (Data.HList.HList.HList (x : xs))
+ Data.HList.HList: instance (GHC.Show.Show e, GHC.Show.Show (Data.HList.HList.HList l)) => GHC.Show.Show (Data.HList.HList.HList (e : l))
+ Data.HList.HList: instance (aa ~ (a, a), GHC.Base.Monoid a) => Data.HList.FakePrelude.ApplyAB Data.HList.HList.UncurryMappend aa a
+ Data.HList.HList: instance (e' ~ e) => Data.HList.FakePrelude.ApplyAB Data.HList.HList.HRmTag (e, t) e'
+ Data.HList.HList: instance (et ~ (e, t)) => Data.HList.FakePrelude.ApplyAB (Data.HList.HList.HAddTag t) e et
+ Data.HList.HList: instance (hJustA ~ Data.HList.FakePrelude.HJust a) => Data.HList.FakePrelude.ApplyAB Data.HList.HList.HFromJust hJustA a
+ Data.HList.HList: instance (hxs ~ Data.HList.HList.HList xs, hxxs ~ Data.HList.HList.HList (x : xs)) => Data.HList.FakePrelude.ApplyAB (Data.HList.HList.FHCons2 x) hxs hxxs
+ Data.HList.HList: instance (l ~ [e'], Data.HList.FakePrelude.ApplyAB f e e', el ~ (e, l)) => Data.HList.FakePrelude.ApplyAB (Data.HList.HList.Mapcar f) el l
+ Data.HList.HList: instance (lz ~ '[z]) => Data.HList.HList.HScanr f z '[] lz
+ Data.HList.HList: instance (m1 ~ m, GHC.Base.Applicative m, Data.HList.HList.HSequence m as bs) => Data.HList.HList.HSequence m (m1 a : as) (a : bs)
+ Data.HList.HList: instance (v ~ v') => Data.HList.HList.HFoldr f v '[] v'
+ Data.HList.HList: instance (v ~ v') => Data.HList.HList.HFoldr1 f '[v] v'
+ Data.HList.HList: instance (x ~ (e, Data.HList.HList.HList l), y ~ Data.HList.HList.HList (e : l)) => Data.HList.FakePrelude.ApplyAB Data.HList.HList.FHCons x y
+ Data.HList.HList: instance (x ~ Data.Proxy.Proxy y, GHC.Base.Monoid y) => Data.HList.FakePrelude.ApplyAB Data.HList.HList.ConstMempty x y
+ Data.HList.HList: instance (xxs ~ '[]) => Data.HList.HList.HLengthEq1 xxs 'Data.HList.FakePrelude.HZero
+ Data.HList.HList: instance (y ~ Text.ParserCombinators.ReadP.ReadP x, GHC.Read.Read x) => Data.HList.FakePrelude.ApplyAB Data.HList.HList.ReadElement (Data.Proxy.Proxy x) y
+ Data.HList.HList: instance (z ~ z') => Data.HList.HList.HFoldl f z '[] z'
+ Data.HList.HList: instance (zero ~ 'Data.HList.FakePrelude.HZero) => Data.HList.HList.HLengthEq2 '[] zero
+ Data.HList.HList: instance (zx ~ (z, x), Data.HList.FakePrelude.ApplyAB f zx z', Data.HList.HList.HFoldl f z' xs r) => Data.HList.HList.HFoldl f z (x : xs) r
+ Data.HList.HList: instance Data.HList.FakePrelude.ApplyAB f e e' => Data.HList.FakePrelude.ApplyAB (Data.HList.HList.MapCar f) (e, Data.HList.HList.HList l) (Data.HList.HList.HList (e' : l))
+ Data.HList.HList: instance Data.HList.HList.FromHJust '[]
+ Data.HList.HList: instance Data.HList.HList.FromHJust l => Data.HList.HList.FromHJust (Data.HList.FakePrelude.HJust e : l)
+ Data.HList.HList: instance Data.HList.HList.FromHJust l => Data.HList.HList.FromHJust (Data.HList.FakePrelude.HNothing : l)
+ Data.HList.HList: instance Data.HList.HList.HAppendFD '[] b b
+ Data.HList.HList: instance Data.HList.HList.HAppendFD as bs cs => Data.HList.HList.HAppendFD (a : as) bs (a : cs)
+ Data.HList.HList: instance Data.HList.HList.HAppendList '[] l2
+ Data.HList.HList: instance Data.HList.HList.HAppendList l l' => Data.HList.HList.HAppendList (x : l) l'
+ Data.HList.HList: instance Data.HList.HList.HAppendList l1 l2 => Data.HList.HListPrelude.HAppend (Data.HList.HList.HList l1) (Data.HList.HList.HList l2)
+ Data.HList.HList: instance Data.HList.HList.HBuild' (a : l) r => Data.HList.HList.HBuild' l (a -> r)
+ Data.HList.HList: instance Data.HList.HList.HConcatFD '[] '[]
+ Data.HList.HList: instance Data.HList.HList.HInit '[x]
+ Data.HList.HList: instance Data.HList.HList.HInit (b : c) => Data.HList.HList.HInit (a : b : c)
+ Data.HList.HList: instance Data.HList.HList.HInits1 '[] '[Data.HList.HList.HList '[]]
+ Data.HList.HList: instance Data.HList.HList.HInits1 a b => Data.HList.HList.HInits a (Data.HList.HList.HList '[] : b)
+ Data.HList.HList: instance Data.HList.HList.HIterate 'Data.HList.FakePrelude.HZero f z '[]
+ Data.HList.HList: instance Data.HList.HList.HList2List '[e] e
+ Data.HList.HList: instance Data.HList.HList.HList2List (e' : l) e => Data.HList.HList.HList2List (e : e' : l) e
+ Data.HList.HList: instance Data.HList.HList.HMapAux Data.HList.HList.HList f '[] '[]
+ Data.HList.HList: instance Data.HList.HList.HProxiesFD '[] '[]
+ Data.HList.HList: instance Data.HList.HList.HProxiesFD xs pxs => Data.HList.HList.HProxiesFD (x : xs) (Data.Proxy.Proxy x : pxs)
+ Data.HList.HList: instance Data.HList.HList.HReplicateF 'Data.HList.FakePrelude.HZero f z '[]
+ Data.HList.HList: instance Data.HList.HList.HReplicateFD 'Data.HList.FakePrelude.HZero e '[]
+ Data.HList.HList: instance Data.HList.HList.HRevApp '[] l2 l2
+ Data.HList.HList: instance Data.HList.HList.HRevApp accum '[] xs => Data.HList.HList.HSplitAt1 accum 'Data.HList.FakePrelude.HZero ys xs ys
+ Data.HList.HList: instance Data.HList.HList.HRevApp l (x : l') z => Data.HList.HList.HRevApp (x : l) l' z
+ Data.HList.HList: instance Data.HList.HList.HReverse l l' => Data.HList.HList.HBuild' l (Data.HList.HList.HList l')
+ Data.HList.HList: instance Data.HList.HList.HSplit '[]
+ Data.HList.HList: instance Data.HList.HList.HSplit l => Data.HList.HList.HSplit ((e, Data.Proxy.Proxy 'GHC.Types.False) : l)
+ Data.HList.HList: instance Data.HList.HList.HSplit l => Data.HList.HList.HSplit ((e, Data.Proxy.Proxy 'GHC.Types.True) : l)
+ Data.HList.HList: instance Data.HList.HList.HSplit l => Data.HList.HList.HSplit (Data.Tagged.Tagged 'GHC.Types.False e : l)
+ Data.HList.HList: instance Data.HList.HList.HSplit l => Data.HList.HList.HSplit (Data.Tagged.Tagged 'GHC.Types.True e : l)
+ Data.HList.HList: instance Data.HList.HList.HSplitAt1 (b : accum) n bs xs ys => Data.HList.HList.HSplitAt1 accum ('Data.HList.FakePrelude.HSucc n) (b : bs) xs ys
+ Data.HList.HList: instance Data.HList.HList.HTIntersect '[] l '[]
+ Data.HList.HList: instance Data.HList.HList.HTIntersect t l1 l2 => Data.HList.HList.HTIntersectBool 'GHC.Types.False h t l1 l2
+ Data.HList.HList: instance Data.HList.HList.HTIntersect t l1 l2 => Data.HList.HList.HTIntersectBool 'GHC.Types.True h t l1 (h : l2)
+ Data.HList.HList: instance Data.HList.HList.HTails '[] '[Data.HList.HList.HList '[]]
+ Data.HList.HList: instance Data.HList.HList.HTails xs ys => Data.HList.HList.HTails (x : xs) (Data.HList.HList.HList (x : xs) : ys)
+ Data.HList.HList: instance Data.HList.HList.HTuple '[] ()
+ Data.HList.HList: instance Data.HList.HList.HTuple '[a, b, c, d, e, f] (a, b, c, d, e, f)
+ Data.HList.HList: instance Data.HList.HList.HTuple '[a, b, c, d, e] (a, b, c, d, e)
+ Data.HList.HList: instance Data.HList.HList.HTuple '[a, b, c, d] (a, b, c, d)
+ Data.HList.HList: instance Data.HList.HList.HTuple '[a, b, c] (a, b, c)
+ Data.HList.HList: instance Data.HList.HList.HTuple '[a, b] (a, b)
+ Data.HList.HList: instance Data.HList.HList.HUnfoldFD p Data.HList.FakePrelude.HNothing '[]
+ Data.HList.HList: instance Data.HList.HList.HZipList '[] '[] '[]
+ Data.HList.HList: instance Data.HList.HList.ToHJust '[]
+ Data.HList.HList: instance Data.HList.HList.ToHJust l => Data.HList.HList.ToHJust (e : l)
+ Data.HList.HList: instance Data.HList.HListPrelude.HExtend e (Data.HList.HList.HList l)
+ Data.HList.HList: instance GHC.Arr.Ix (Data.HList.HList.HList '[])
+ Data.HList.HList: instance GHC.Base.Applicative m => Data.HList.HList.HSequence m '[] '[]
+ Data.HList.HList: instance GHC.Classes.Eq (Data.HList.HList.HList '[])
+ Data.HList.HList: instance GHC.Classes.Ord (Data.HList.HList.HList '[])
+ Data.HList.HList: instance GHC.Enum.Bounded (Data.HList.HList.HList '[])
+ Data.HList.HList: instance GHC.Read.Read (Data.HList.HList.HList '[])
+ Data.HList.HList: instance GHC.Show.Show (Data.HList.HList.HList '[])
+ Data.HList.HList: instance forall (k :: BOX) (e :: k) (l :: [k]) (n :: Data.HList.FakePrelude.HNat). Data.HList.HList.HFind1 e l n => Data.HList.HList.HFind e l n
+ Data.HList.HList: instance forall (k :: BOX) (e :: k) (l :: [k]) (n :: Data.HList.FakePrelude.HNat). Data.HList.HList.HFind1 e l n => Data.HList.HList.HFind2 'GHC.Types.False e l ('Data.HList.FakePrelude.HSucc n)
+ Data.HList.HList: instance forall (k :: BOX) (e :: k) (l :: [k]). Data.HList.HList.HFind2 'GHC.Types.True e l 'Data.HList.FakePrelude.HZero
+ Data.HList.HList: instance forall (k :: BOX) (e :: k). Data.HList.HList.HTMember e '[] 'GHC.Types.False
+ Data.HList.HList: instance forall (k :: BOX) (e1 :: k) (e :: k) (l :: [k]) (br :: GHC.Types.Bool) (b :: GHC.Types.Bool). (Data.HList.FakePrelude.HEq e1 e b, Data.HList.HList.HMember' b e1 l br) => Data.HList.HList.HMember e1 (e : l) br
+ Data.HList.HList: instance forall (k :: BOX) (e1 :: k) (e :: k) (l :: [k]) (res :: GHC.Base.Maybe [k]) (b :: GHC.Types.Bool). (Data.HList.FakePrelude.HEq e1 e b, Data.HList.HList.HMemberM1 b e1 (e : l) res) => Data.HList.HList.HMemberM e1 (e : l) res
+ Data.HList.HList: instance forall (k :: BOX) (e1 :: k) (e :: k) (l :: [k]) (res :: GHC.Base.Maybe [k]) (r :: GHC.Base.Maybe [k]). (Data.HList.HList.HMemberM e1 l r, Data.HList.HList.HMemberM2 r e1 (e : l) res) => Data.HList.HList.HMemberM1 'GHC.Types.False e1 (e : l) res
+ Data.HList.HList: instance forall (k :: BOX) (e1 :: k) (e :: k) (l :: [k]). Data.HList.HList.HMemberM1 'GHC.Types.True e1 (e : l) ('GHC.Base.Just l)
+ Data.HList.HList: instance forall (k :: BOX) (e1 :: k) (e2 :: k) (l :: [k]) (n :: Data.HList.FakePrelude.HNat) (b :: GHC.Types.Bool). (Data.HList.FakePrelude.HEq e1 e2 b, Data.HList.HList.HFind2 b e1 l n) => Data.HList.HList.HFind1 e1 (e2 : l) n
+ Data.HList.HList: instance forall (k :: BOX) (e1 :: k) (l :: [k]) (br :: GHC.Types.Bool). Data.HList.HList.HMember e1 l br => Data.HList.HList.HMember' 'GHC.Types.False e1 l br
+ Data.HList.HList: instance forall (k :: BOX) (e1 :: k) (l :: [k]). Data.HList.HList.HMember' 'GHC.Types.True e1 l 'GHC.Types.True
+ Data.HList.HList: instance forall (k :: BOX) (e1 :: k) (l :: [k]). Data.HList.HList.HMemberM2 'GHC.Base.Nothing e1 l 'GHC.Base.Nothing
+ Data.HList.HList: instance forall (k :: BOX) (e1 :: k). Data.HList.FakePrelude.Fail (Data.HList.FakePrelude.FieldNotFound e1) => Data.HList.HList.HFind1 e1 '[] 'Data.HList.FakePrelude.HZero
+ Data.HList.HList: instance forall (k :: BOX) (e1 :: k). Data.HList.HList.HMember e1 '[] 'GHC.Types.False
+ Data.HList.HList: instance forall (k :: BOX) (e1 :: k). Data.HList.HList.HMemberM e1 '[] 'GHC.Base.Nothing
+ Data.HList.HList: instance forall (k :: BOX) (f :: k) a (as :: [*]) (fst :: [*]) (gs :: [*]) (snd :: [*]). (Data.HList.HList.HSpanEqBy f a as fst snd, Data.HList.HList.HGroupBy f snd gs) => Data.HList.HList.HGroupBy f (a : as) (Data.HList.HList.HList (a : fst) : gs)
+ Data.HList.HList: instance forall (k :: BOX) (f :: k) x (y :: [*]) (fst :: [*]) (snd :: [*]). (Data.HList.HList.HSpanEqBy1 f x y fst snd, Data.HList.HList.HAppendListR fst snd ~ y) => Data.HList.HList.HSpanEqBy f x y fst snd
+ Data.HList.HList: instance forall (k :: BOX) (f :: k) x y (ys :: [*]) (i :: [*]) (o :: [*]) (b :: GHC.Types.Bool). (Data.HList.FakePrelude.HEqBy f x y b, Data.HList.HList.HSpanEqBy2 b f x y ys i o) => Data.HList.HList.HSpanEqBy1 f x (y : ys) i o
+ Data.HList.HList: instance forall (k :: BOX) (f :: k) x y (ys :: [*]). Data.HList.HList.HSpanEqBy2 'GHC.Types.False f x y ys '[] (y : ys)
+ Data.HList.HList: instance forall (k :: BOX) (f :: k) x y (zs :: [*]) (i :: [*]) (o :: [*]). Data.HList.HList.HSpanEqBy1 f x zs i o => Data.HList.HList.HSpanEqBy2 'GHC.Types.True f x y zs (y : i) o
+ Data.HList.HList: instance forall (k :: BOX) (f :: k) x. Data.HList.HList.HSpanEqBy1 f x '[] '[] '[]
+ Data.HList.HList: instance forall (k :: BOX) (f :: k) x1 x (xs :: [*]) (xi :: [*]) (xo :: [*]) (b :: GHC.Types.Bool). (Data.HList.FakePrelude.HEqBy f x1 x b, Data.HList.HList.HPartitionEq1 b f x1 x xs xi xo) => Data.HList.HList.HPartitionEq f x1 (x : xs) xi xo
+ Data.HList.HList: instance forall (k :: BOX) (f :: k). Data.HList.HList.HGroupBy f '[] '[]
+ Data.HList.HList: instance forall (k :: BOX) (k1 :: BOX) (f :: k) (x1 :: k1) x (xs :: [*]) (xi :: [*]) (xo :: [*]). Data.HList.HList.HPartitionEq f x1 xs xi xo => Data.HList.HList.HPartitionEq1 'GHC.Types.False f x1 x xs xi (x : xo)
+ Data.HList.HList: instance forall (k :: BOX) (k1 :: BOX) (f :: k) (x1 :: k1) x (xs :: [*]) (xi :: [*]) (xo :: [*]). Data.HList.HList.HPartitionEq f x1 xs xi xo => Data.HList.HList.HPartitionEq1 'GHC.Types.True f x1 x xs (x : xi) xo
+ Data.HList.HList: instance forall (k :: BOX) (k1 :: BOX) (f :: k) (x1 :: k1). Data.HList.HList.HPartitionEq f x1 '[] '[] '[]
+ Data.HList.HList: instance forall (k :: BOX) (k1 :: BOX) (x' :: k1) (xs :: [k1]) (x :: k1) (xsys :: [k1]) (ys :: k). (x' ~ x, Data.HList.HList.HStripPrefix xs xsys ys) => Data.HList.HList.HStripPrefix (x' : xs) (x : xsys) ys
+ Data.HList.HList: instance forall (k :: BOX) (k1 :: BOX) (ys :: k). Data.HList.HList.HStripPrefix '[] ys ys
+ Data.HList.HList: instance forall (k :: BOX) (l1 :: [k]) (e1 :: k) (e :: k) (l :: [k]). Data.HList.HList.HMemberM2 ('GHC.Base.Just l1) e1 (e : l) ('GHC.Base.Just (e : l1))
+ Data.HList.HList: instance forall (k :: BOX) (x :: k) (xs :: [k]) (ys :: [k]) (zs :: [k]). Data.HList.HList.HAppendList1 xs ys zs => Data.HList.HList.HAppendList1 (x : xs) ys (x : zs)
+ Data.HList.HList: instance forall (k :: BOX) (ys :: [k]). Data.HList.HList.HAppendList1 '[] ys ys
+ Data.HList.HListPrelude: instance forall (k :: BOX) (x :: k). Data.HList.HListPrelude.HExtend (Data.HList.FakePrelude.Label x) (Data.Proxy.Proxy '[])
+ Data.HList.HOccurs: instance (Data.HList.FakePrelude.HEq e e1 b, Data.HList.HOccurs.HOccursNot' b e l) => Data.HList.HListPrelude.HOccursNot e (e1 : l)
+ Data.HList.HOccurs: instance (Data.HList.FakePrelude.HEq e1 e b, Data.HList.HOccurs.HOccurrence' b e1 (e : l) l') => Data.HList.HOccurs.HOccurrence e1 (e : l) l'
+ Data.HList.HOccurs: instance (Data.HList.HListPrelude.HOccurs e l, Data.HList.HListPrelude.HProject l (Data.HList.HList.HList l')) => Data.HList.HListPrelude.HProject l (Data.HList.HList.HList (e : l'))
+ Data.HList.HOccurs: instance (Data.HList.HOccurs.HOccurrence e (x : y) l', Data.HList.HOccurs.HOccurs' e l') => Data.HList.HListPrelude.HOccurs e (Data.HList.HList.HList (x : y))
+ Data.HList.HOccurs: instance (Data.HList.HOccurs.HOccurrence e l l', Data.HList.HOccurs.HOccursMany' e l') => Data.HList.HOccurs.HOccursMany e l
+ Data.HList.HOccurs: instance (e ~ e1) => Data.HList.HOccurs.HOccursOpt' e (e1 : l)
+ Data.HList.HOccurs: instance (e ~ e1, Data.HList.HListPrelude.HOccursNot e l) => Data.HList.HOccurs.HOccurs' e (e : l)
+ Data.HList.HOccurs: instance (e ~ e1, Data.HList.HOccurs.HOccursMany e l) => Data.HList.HOccurs.HOccursMany' e (e1 : l)
+ Data.HList.HOccurs: instance Data.HList.FakePrelude.Fail (Data.HList.HOccurs.TypeNotFound e) => Data.HList.HOccurs.HOccurs' e '[]
+ Data.HList.HOccurs: instance Data.HList.HListPrelude.HOccursNot e '[]
+ Data.HList.HOccurs: instance Data.HList.HListPrelude.HOccursNot e l => Data.HList.HOccurs.HOccursNot' 'GHC.Types.False e l
+ Data.HList.HOccurs: instance Data.HList.HListPrelude.HProject (Data.HList.HList.HList l) (Data.HList.HList.HList '[])
+ Data.HList.HOccurs: instance Data.HList.HOccurs.HOccurrence e1 '[] '[]
+ Data.HList.HOccurs: instance Data.HList.HOccurs.HOccurrence e1 l l' => Data.HList.HOccurs.HOccurrence' 'GHC.Types.False e1 (e : l) l'
+ Data.HList.HOccurs: instance Data.HList.HOccurs.HOccurrence' 'GHC.Types.True e1 (e : l) (e : l)
+ Data.HList.HOccurs: instance Data.HList.HOccurs.HOccursMany' e '[]
+ Data.HList.HOccurs: instance Data.HList.HOccurs.HOccursOpt' e '[]
+ Data.HList.HOccurs: instance forall (k :: BOX) (e :: k) (l :: [*]). Data.HList.FakePrelude.Fail (Data.HList.HOccurs.TypeFound e) => Data.HList.HOccurs.HOccursNot' 'GHC.Types.True e l
+ Data.HList.HSort: instance ((x GHC.TypeLits.<=? y) ~ b) => Data.HList.FakePrelude.HEqBy Data.HList.HSort.HLeFn x y b
+ Data.HList.HSort: instance (Data.HList.FakePrelude.HEq (GHC.TypeLits.CmpSymbol x y) 'GHC.Types.GT nb, Data.HList.FakePrelude.HNot nb ~ b) => Data.HList.FakePrelude.HEqBy Data.HList.HSort.HLeFn x y b
+ Data.HList.HSort: instance (Data.HList.FakePrelude.HEqBy Data.HList.HSort.HLeFn n m b, ns ~ ns') => Data.HList.FakePrelude.HEqBy Data.HList.HSort.HLeFn (Data.HList.Label3.Lbl n ns desc) (Data.HList.Label3.Lbl m ns' desc') b
+ Data.HList.HSort: instance (Data.HList.FakePrelude.HLe x y ~ b) => Data.HList.FakePrelude.HEqBy Data.HList.HSort.HLeFn x y b
+ Data.HList.HSort: instance Data.HList.FakePrelude.HEqByFn Data.HList.HSort.HLeFn
+ Data.HList.HSort: instance Data.HList.HSort.HIsSetBy (Data.HList.HSort.HNeq Data.HList.HSort.HLeFn) ps b => Data.HList.HSort.HIsSet ps b
+ Data.HList.HSort: instance Data.HList.HSort.HSetBy (Data.HList.HSort.HNeq Data.HList.HSort.HLeFn) ps => Data.HList.HSort.HSet ps
+ Data.HList.HSort: instance Data.HList.HSort.HSort2 'GHC.Types.False x y '[y, x]
+ Data.HList.HSort: instance Data.HList.HSort.HSort2 'GHC.Types.True x y '[x, y]
+ Data.HList.HSort: instance forall (k :: BOX) (a :: k). Data.HList.FakePrelude.HEqByFn a => Data.HList.FakePrelude.HEqByFn (Data.HList.HSort.HDown a)
+ Data.HList.HSort: instance forall (k :: BOX) (a :: k). Data.HList.FakePrelude.HEqByFn a => Data.HList.FakePrelude.HEqByFn (Data.HList.HSort.HNeq a)
+ Data.HList.HSort: instance forall (k :: BOX) (k1 :: BOX) (f :: k1) (x :: k) (y :: k) (b :: GHC.Types.Bool). Data.HList.FakePrelude.HEqBy f y x b => Data.HList.FakePrelude.HEqBy (Data.HList.HSort.HDown f) x y b
+ Data.HList.HSort: instance forall (k :: BOX) (k1 :: BOX) (le :: k1) (x :: k) (y :: k) (b2 :: GHC.Types.Bool) (b1 :: GHC.Types.Bool). (Data.HList.FakePrelude.HEqBy le y x b1, Data.HList.FakePrelude.HNot b1 ~ b2) => Data.HList.FakePrelude.HEqBy (Data.HList.HSort.HNeq le) x y b2
+ Data.HList.HSort: instance forall (k :: BOX) (le :: k) (a :: [*]) (b :: [*]) (ok :: GHC.Types.Bool). (Data.HList.FakePrelude.SameLength a b, Data.HList.HSort.HIsAscList le a ok, Data.HList.HSort.HSortBy1 ok le a b) => Data.HList.HSort.HSortBy le a b
+ Data.HList.HSort: instance forall (k :: BOX) (le :: k) (a :: [*]) (b :: [*]). Data.HList.HSort.HQSortBy le a b => Data.HList.HSort.HSortBy1 'GHC.Types.False le a b
+ Data.HList.HSort: instance forall (k :: BOX) (le :: k) (a :: [*]). Data.HList.HSort.HSortBy1 'GHC.Types.True le a a
+ Data.HList.HSort: instance forall (k :: BOX) (le :: k) (ps :: [*]). Data.HList.HSort.HAscList0 le ps ps => Data.HList.HSort.HAscList le ps
+ Data.HList.HSort: instance forall (k :: BOX) (le :: k) (ps0 :: [*]). Data.HList.FakePrelude.HEqByFn le => Data.HList.HSort.HAscList0 le '[] ps0
+ Data.HList.HSort: instance forall (k :: BOX) (le :: k) (ys :: [*]) (ys0 :: [*]). Data.HList.HSort.HAscList0 le ys ys0 => Data.HList.HSort.HAscList1 le 'GHC.Types.True ys ys0
+ Data.HList.HSort: instance forall (k :: BOX) (le :: k) a b (bs :: [*]) (sorted :: [*]) (bGeq :: [*]) (bLt :: [*]) (sortedLt :: [*]) (sortedGeq :: [*]). (Data.HList.HList.HPartitionEq le a (b : bs) bGeq bLt, Data.HList.HSort.HQSortBy le bLt sortedLt, Data.HList.HSort.HQSortBy le bGeq sortedGeq, Data.HList.HList.HAppendListR sortedLt (a : sortedGeq) ~ sorted, Data.HList.HList.HAppendList sortedLt (a : sortedGeq)) => Data.HList.HSort.HQSortBy le (a : b : bs) sorted
+ Data.HList.HSort: instance forall (k :: BOX) (le :: k) a b c (cs :: [*]) (sorted :: [*]) (xs' :: [*]) (ys' :: [*]) (ys :: [*]) (xs :: [*]) (n2 :: Data.HList.FakePrelude.HNat) (n :: Data.HList.FakePrelude.HNat). (Data.HList.HSort.HMerge le xs' ys' sorted, Data.HList.HSort.HMSortBy le ys ys', Data.HList.HSort.HMSortBy le xs xs', Data.HList.HList.HLengthEq (a : b : c : cs) n2, Data.HList.FakePrelude.HDiv2 n2 ~ n, Data.HList.HList.HSplitAt n (a : b : c : cs) xs ys) => Data.HList.HSort.HMSortBy le (a : b : c : cs) sorted
+ Data.HList.HSort: instance forall (k :: BOX) (le :: k) x (ps0 :: [*]). Data.HList.FakePrelude.HEqByFn le => Data.HList.HSort.HAscList0 le '[x] ps0
+ Data.HList.HSort: instance forall (k :: BOX) (le :: k) x (xs :: [*]) y (ys :: [*]) l (srt :: [*]) (b :: GHC.Types.Bool) (ls :: [*]) (hhs :: [*]). (Data.HList.FakePrelude.HEqBy le x y b, Data.HList.HSort.HMerge1 b (x : xs) (y : ys) (l : ls) hhs, Data.HList.HSort.HMerge le ls hhs srt) => Data.HList.HSort.HMerge le (x : xs) (y : ys) (l : srt)
+ Data.HList.HSort: instance forall (k :: BOX) (le :: k) x (xs :: [*]). Data.HList.HSort.HMerge le '[] (x : xs) (x : xs)
+ Data.HList.HSort: instance forall (k :: BOX) (le :: k) x (xs :: [*]). Data.HList.HSort.HMerge le (x : xs) '[] (x : xs)
+ Data.HList.HSort: instance forall (k :: BOX) (le :: k) x y (ab :: [*]) (b :: GHC.Types.Bool). (Data.HList.HSort.HSort2 b x y ab, Data.HList.FakePrelude.HEqBy le x y b) => Data.HList.HSort.HMSortBy le '[x, y] ab
+ Data.HList.HSort: instance forall (k :: BOX) (le :: k) x y (ys :: [*]) (b3 :: GHC.Types.Bool) (b1 :: GHC.Types.Bool) (b2 :: GHC.Types.Bool). (Data.HList.FakePrelude.HEqBy le x y b1, Data.HList.HSort.HIsAscList le (y : ys) b2, Data.HList.FakePrelude.HAnd b1 b2 ~ b3) => Data.HList.HSort.HIsAscList le (x : y : ys) b3
+ Data.HList.HSort: instance forall (k :: BOX) (le :: k) x y (ys :: [*]) (ps0 :: [*]) (b :: GHC.Types.Bool). (Data.HList.HSort.HAscList1 le b (y : ys) ps0, Data.HList.FakePrelude.HEqBy le x y b) => Data.HList.HSort.HAscList0 le (x : y : ys) ps0
+ Data.HList.HSort: instance forall (k :: BOX) (le :: k) x. Data.HList.FakePrelude.HEqByFn le => Data.HList.HSort.HIsAscList le '[x] 'GHC.Types.True
+ Data.HList.HSort: instance forall (k :: BOX) (le :: k) x. Data.HList.FakePrelude.HEqByFn le => Data.HList.HSort.HMSortBy le '[x] '[x]
+ Data.HList.HSort: instance forall (k :: BOX) (le :: k) x. Data.HList.HSort.HQSortBy le '[x] '[x]
+ Data.HList.HSort: instance forall (k :: BOX) (le :: k) y (ys :: [*]) (ys0 :: [*]). (Data.HList.FakePrelude.Fail '("Duplicated element", y, "using le", le, "in", ys0), Data.HList.FakePrelude.HEqByFn le) => Data.HList.HSort.HAscList1 le 'GHC.Types.False (y : ys) ys0
+ Data.HList.HSort: instance forall (k :: BOX) (le :: k). Data.HList.FakePrelude.HEqByFn le => Data.HList.HSort.HIsAscList le '[] 'GHC.Types.True
+ Data.HList.HSort: instance forall (k :: BOX) (le :: k). Data.HList.FakePrelude.HEqByFn le => Data.HList.HSort.HMSortBy le '[] '[]
+ Data.HList.HSort: instance forall (k :: BOX) (le :: k). Data.HList.HSort.HMerge le '[] '[] '[]
+ Data.HList.HSort: instance forall (k :: BOX) (le :: k). Data.HList.HSort.HQSortBy le '[] '[]
+ Data.HList.HSort: instance forall (k :: BOX) (lt :: k) (ps :: [*]) (b :: GHC.Types.Bool) (ps' :: [*]). (Data.HList.HSort.HSortBy lt ps ps', Data.HList.HSort.HIsAscList lt ps' b) => Data.HList.HSort.HIsSetBy lt ps b
+ Data.HList.HSort: instance forall (k :: BOX) (lt :: k) (ps :: [*]) (ps' :: [*]). (Data.HList.HSort.HSortBy lt ps ps', Data.HList.HSort.HAscList lt ps') => Data.HList.HSort.HSetBy lt ps
+ Data.HList.HSort: instance forall (k :: BOX) (x :: k) (y :: k) (b :: GHC.Types.Bool). Data.HList.FakePrelude.HEqBy Data.HList.HSort.HLeFn x y b => Data.HList.FakePrelude.HEqBy Data.HList.HSort.HLeFn (Data.HList.FakePrelude.Label x) (Data.HList.FakePrelude.Label y) b
+ Data.HList.HSort: instance forall (k :: BOX) (x :: k) (y :: k) (b :: GHC.Types.Bool). Data.HList.FakePrelude.HEqBy Data.HList.HSort.HLeFn x y b => Data.HList.FakePrelude.HEqBy Data.HList.HSort.HLeFn (Data.Proxy.Proxy x) (Data.Proxy.Proxy y) b
+ Data.HList.HSort: instance forall (k :: BOX) (x :: k) v (y :: k) w (b :: GHC.Types.Bool). Data.HList.FakePrelude.HEqBy Data.HList.HSort.HLeFn x y b => Data.HList.FakePrelude.HEqBy Data.HList.HSort.HLeFn (Data.Tagged.Tagged x v) (Data.Tagged.Tagged y w) b
+ Data.HList.HTypeIndexed: instance (Data.HList.FakePrelude.HEq e1 e b, Data.HList.HTypeIndexed.HDeleteManyCase b e1 e l l1) => Data.HList.HListPrelude.HDeleteMany e1 (Data.HList.HList.HList (e : l)) (Data.HList.HList.HList l1)
+ Data.HList.HTypeIndexed: instance (Data.HList.FakePrelude.HEq e1 e b, Data.HList.HTypeIndexed.HType2HNatCase b e1 l n) => Data.HList.HListPrelude.HType2HNat e1 (e : l) n
+ Data.HList.HTypeIndexed: instance (Data.HList.HArray.HDeleteAtHNat n l, Data.HList.HListPrelude.HType2HNat e l n, l' ~ Data.HList.HArray.HDeleteAtHNatR n l) => Data.HList.HListPrelude.HDeleteAtLabel Data.HList.HList.HList e l l'
+ Data.HList.HTypeIndexed: instance (Data.HList.HListPrelude.HType2HNat e l n, Data.HList.HListPrelude.HTypes2HNats es l ns) => Data.HList.HListPrelude.HTypes2HNats (e : es) l (n : ns)
+ Data.HList.HTypeIndexed: instance Data.HList.HListPrelude.HDeleteMany e (Data.HList.HList.HList l) (Data.HList.HList.HList l1) => Data.HList.HTypeIndexed.HDeleteManyCase 'GHC.Types.True e e l l1
+ Data.HList.HTypeIndexed: instance Data.HList.HListPrelude.HOccursNot e l => Data.HList.HTypeIndexed.HType2HNatCase 'GHC.Types.True e l 'Data.HList.FakePrelude.HZero
+ Data.HList.HTypeIndexed: instance Data.HList.HListPrelude.HType2HNat e l n => Data.HList.HTypeIndexed.HType2HNatCase 'GHC.Types.False e l ('Data.HList.FakePrelude.HSucc n)
+ Data.HList.HTypeIndexed: instance Data.HList.HListPrelude.HTypes2HNats '[] l '[]
+ Data.HList.HTypeIndexed: instance forall (k :: BOX) (e :: k). Data.HList.HListPrelude.HDeleteMany e (Data.HList.HList.HList '[]) (Data.HList.HList.HList '[])
+ Data.HList.HTypeIndexed: instance forall (k :: BOX) (e1 :: k) e (l :: [*]) (l1 :: [*]). Data.HList.HListPrelude.HDeleteMany e1 (Data.HList.HList.HList l) (Data.HList.HList.HList l1) => Data.HList.HTypeIndexed.HDeleteManyCase 'GHC.Types.False e1 e l (e : l1)
+ Data.HList.HZip: instance (Data.HList.HList.HList (x : y) ~ z, Data.HList.HZip.HZip3 xs ys zs) => Data.HList.HZip.HZip3 (x : xs) (Data.HList.HList.HList y : ys) (z : zs)
+ Data.HList.HZip: instance (Data.HList.HZip.HZip3 a b c, x ~ (Data.HList.HList.HList a, Data.HList.HList.HList b), y ~ Data.HList.HList.HList c) => Data.HList.FakePrelude.ApplyAB Data.HList.HZip.HZipF x y
+ Data.HList.HZip: instance (z ~ (x, y), Data.HList.HZip.HUnZip zs) => Data.HList.HZip.HUnZip (z : zs)
+ Data.HList.HZip: instance Data.HList.HZip.HUnZip '[]
+ Data.HList.HZip: instance Data.HList.HZip.HZip3 '[] '[] '[]
+ Data.HList.Keyword: instance (Data.HList.FakePrelude.HEq kw kw' flag, Data.HList.Keyword.KWApply' flag (kw -> a -> f') (kw' : a' : tail) r) => Data.HList.Keyword.KWApply (kw -> a -> f') (kw' : a' : tail) r
+ Data.HList.Keyword: instance (Data.HList.HList.HAppendListR tail '[kw, v] ~ l', Data.HList.HList.HAppendList tail '[kw, v], Data.HList.Keyword.KWApply f l' r) => Data.HList.Keyword.KWApply' 'GHC.Types.False f (kw : v : tail) r
+ Data.HList.Keyword: instance (Data.HList.Keyword.KW' rflag fn akws arg_def r, akws ~ Data.HList.Keyword.Arg kws '[], Data.HList.Keyword.ReflectFK' flag fn kws, Data.HList.TypeEqO.IsKeyFN r rflag, Data.HList.TypeEqO.IsKeyFN fn flag) => Data.HList.Keyword.Kw fn arg_def r
+ Data.HList.Keyword: instance (Data.HList.Keyword.KWAcc arg_desc kw a f arg_def r, (kw -> a -> r) ~ kwar) => Data.HList.Keyword.KW' 'GHC.Types.True f arg_desc arg_def kwar
+ Data.HList.Keyword: instance (Data.HList.TypeEqO.IsKeyFN f flag, Data.HList.Keyword.ReflectFK' flag f kws) => Data.HList.Keyword.ReflectFK f kws
+ Data.HList.Keyword: instance (Data.HList.TypeEqO.IsKeyFN r rflag, Data.HList.Keyword.KW' rflag f arg_desc arg_def r) => Data.HList.Keyword.KW f arg_desc arg_def r
+ Data.HList.Keyword: instance (kkws ~ (kw : kws), Data.HList.Keyword.ReflectFK rest kws) => Data.HList.Keyword.ReflectFK' 'GHC.Types.True (kw -> a -> rest) kkws
+ Data.HList.Keyword: instance (r ~ r') => Data.HList.Keyword.KWApply r '[] r'
+ Data.HList.Keyword: instance (v' ~ v, Data.HList.Keyword.KWApply f' tail r) => Data.HList.Keyword.KWApply' 'GHC.Types.True (kw -> v -> f') (kw : v' : tail) r
+ Data.HList.Keyword: instance Data.HList.Keyword.KWApply f arg_values r => Data.HList.Keyword.KWMerge '[] arg_values arg_def f r
+ Data.HList.Keyword: instance Data.HList.Keyword.KWMerge' kw arg_def atail arg_values arg_def f r => Data.HList.Keyword.KWMerge (kw : atail) arg_values arg_def f r
+ Data.HList.Keyword: instance Data.HList.TypeEqO.IsKeyFN (Data.HList.FakePrelude.Label s -> a -> b) 'GHC.Types.True
+ Data.HList.Keyword: instance forall (k :: BOX) (arg_types :: [k]) (arg_values :: [*]) kw a f (arg_def :: [*]) r (arg_types' :: [k]). (Data.HList.Keyword.HDelete kw arg_types arg_types', Data.HList.Keyword.KW f (Data.HList.Keyword.Arg arg_types' (kw : a : arg_values)) arg_def r) => Data.HList.Keyword.KWAcc (Data.HList.Keyword.Arg arg_types arg_values) kw a f arg_def r
+ Data.HList.Keyword: instance forall (k :: BOX) (e :: k) (e' :: k) (tail :: [k]) (l' :: [k]) (flag :: GHC.Types.Bool). (Data.HList.FakePrelude.HEq e e' flag, Data.HList.Keyword.HDelete' flag e (e' : tail) l') => Data.HList.Keyword.HDelete e (e' : tail) l'
+ Data.HList.Keyword: instance forall (k :: BOX) (e :: k) (tail :: [k]) (tail' :: [k]). (tail' ~ tail) => Data.HList.Keyword.HDelete' 'GHC.Types.True e (e : tail) tail'
+ Data.HList.Keyword: instance forall (k :: BOX) (k1 :: BOX) (e :: k) (e' :: k1) (tail :: [k1]) (e'tail :: [k1]) (tail' :: [k1]). (Data.HList.Keyword.HDelete e tail tail', e'tail ~ (e' : tail')) => Data.HList.Keyword.HDelete' 'GHC.Types.False e (e' : tail) e'tail
+ Data.HList.Keyword: instance forall (k :: BOX) (k1 :: BOX) (e :: k1) (r :: [k]). (Data.HList.FakePrelude.Fail (Data.HList.Keyword.ErrUnexpectedKW e), r ~ '[]) => Data.HList.Keyword.HDelete e '[] r
+ Data.HList.Keyword: instance forall (k :: BOX) (k1 :: BOX) (f :: k1) (nil :: [k]). ('[] ~ nil) => Data.HList.Keyword.ReflectFK' 'GHC.Types.False f nil
+ Data.HList.Keyword: instance forall (k :: BOX) (s :: k) c r b. (r ~ (c -> b)) => Data.HList.TypeEqO.IsKeyFN (Data.HList.Keyword.K s c -> r) 'GHC.Types.True
+ Data.HList.Keyword: instance forall (k :: BOX) (tys :: k) (vals :: [*]). GHC.Show.Show (Data.HList.HList.HList vals) => GHC.Show.Show (Data.HList.Keyword.Arg tys vals)
+ Data.HList.Keyword: instance forall (k :: BOX) f (arg_needed :: k) (arg_values :: [*]) (arg_def :: [*]) r. Data.HList.Keyword.KWMerge arg_needed arg_values arg_def f r => Data.HList.Keyword.KW' 'GHC.Types.False f (Data.HList.Keyword.Arg arg_needed arg_values) arg_def r
+ Data.HList.Keyword: instance forall (k :: BOX) kw (atail :: k) (arg_values :: [*]) (arg_def :: [*]) f nff. (Data.HList.FakePrelude.Fail (Data.HList.Keyword.ErrReqdArgNotFound kw), nff ~ Data.HList.Keyword.ErrReqdArgNotFound kw) => Data.HList.Keyword.KWMerge' kw '[] atail arg_values arg_def f nff
+ Data.HList.Keyword: instance forall (k :: BOX) kw kw' (etc :: [*]) (atail :: k) (arg_values :: [*]) (arg_def :: [*]) f r (flag :: GHC.Types.Bool). (Data.HList.FakePrelude.HEq kw kw' flag, Data.HList.Keyword.KWMerge'' flag kw (kw' : etc) atail arg_values arg_def f r) => Data.HList.Keyword.KWMerge' kw (kw' : etc) atail arg_values arg_def f r
+ Data.HList.Keyword: instance forall (k :: BOX) kw kw' v' (tail :: [*]) (atail :: k) (arg_values :: [*]) (arg_def :: [*]) f r. Data.HList.Keyword.KWMerge' kw tail atail arg_values arg_def f r => Data.HList.Keyword.KWMerge'' 'GHC.Types.False kw (kw' : v' : tail) atail arg_values arg_def f r
+ Data.HList.Keyword: instance forall (k :: BOX) kw v (tail :: [*]) (atail :: k) (arg_values :: [*]) (arg_def :: [*]) f r. Data.HList.Keyword.KWMerge atail (kw : v : arg_values) arg_def f r => Data.HList.Keyword.KWMerge'' 'GHC.Types.True kw (kw : v : tail) atail arg_values arg_def f r
+ Data.HList.Keyword: instance forall (k :: BOX) x y (l :: k) v. (x ~ Data.Tagged.Tagged l v, y ~ Data.HList.HList.HList '[Data.HList.FakePrelude.Label l, v]) => Data.HList.FakePrelude.ApplyAB Data.HList.Keyword.TaggedToKW x y
+ Data.HList.Label3: instance Data.HList.HListPrelude.HExtend (Data.HList.FakePrelude.Label (Data.HList.Label3.Lbl n ns desc)) (Data.Proxy.Proxy (Data.HList.Label3.Lbl n' ns' desc' : xs))
+ Data.HList.Label3: instance Data.HList.HListPrelude.HExtend (Data.HList.FakePrelude.Label (Data.HList.Label3.Lbl n ns desc)) (Data.Proxy.Proxy (x : xs))
+ Data.HList.Label3: instance Data.HList.HListPrelude.HExtend (Data.HList.FakePrelude.Label y) (Data.Proxy.Proxy (x : xs))
+ Data.HList.Label3: instance GHC.Show.Show desc => Data.HList.FakePrelude.ShowLabel (Data.HList.Label3.Lbl x ns desc)
+ Data.HList.Label3: instance GHC.Show.Show desc => GHC.Show.Show (Data.HList.FakePrelude.Label (Data.HList.Label3.Lbl x ns desc))
+ Data.HList.Label3: instance forall (k :: BOX) (t :: k) (ix :: Data.HList.FakePrelude.HNat) ns n. (Data.HList.FakePrelude.Label t ~ Data.HList.FakePrelude.Label (Data.HList.Label3.Lbl ix ns n)) => Data.HList.FakePrelude.SameLabels (Data.HList.FakePrelude.Label t) (Data.HList.Label3.Lbl ix ns n)
+ Data.HList.Label5: instance Data.Typeable.Internal.Typeable x => Data.HList.FakePrelude.ShowLabel x
+ Data.HList.Label6: instance Data.HList.HListPrelude.HExtend (Data.HList.FakePrelude.Label y) (Data.Proxy.Proxy (x : xs))
+ Data.HList.Label6: instance GHC.TypeLits.KnownNat x => Data.HList.FakePrelude.ShowLabel x
+ Data.HList.Label6: instance GHC.TypeLits.KnownSymbol x => Data.HList.FakePrelude.ShowLabel x
+ Data.HList.Labelable: instance (Data.HList.Record.H2ProjectByLabels (Data.HList.Record.LabelsOf a) s a_ _s_minus_a, Data.HList.Record.HRLabelSet a_, Data.HList.Record.HRLabelSet a, Data.HList.Record.HRearrange (Data.HList.Record.LabelsOf a) a_ a, Data.HList.Record.HLeftUnion b s bs, Data.HList.Record.HRLabelSet bs, Data.HList.Record.HRearrange (Data.HList.Record.LabelsOf t) bs t, Data.HList.Record.HRLabelSet t) => Data.HList.Labelable.Projected Data.HList.Record.Record s t a b
+ Data.HList.Labelable: instance (Data.HList.TIC.TICPrism s t a b, x ~ a, a ~ b, s ~ t, Data.HList.FakePrelude.SameLength s t) => Data.HList.Labelable.Labelable x Data.HList.TIC.TIC s t a b
+ Data.HList.Labelable: instance (Data.HList.Variant.ExtendsVariant b t, Data.HList.Variant.ProjectVariant s a, Data.HList.Variant.ProjectExtendVariant s t, Data.HList.Record.HLeftUnion b s bs, Data.HList.Record.HRLabelSet bs, Data.HList.Record.HRearrange (Data.HList.Record.LabelsOf t) bs t) => Data.HList.Labelable.Projected Data.HList.Variant.Variant s t a b
+ Data.HList.Labelable: instance (to ~ Data.HList.Labelable.LabeledTo x, Data.HList.Labelable.ToSym (to p q) x) => Data.HList.HListPrelude.HExtend (to p q) (Data.Proxy.Proxy '[])
+ Data.HList.Labelable: instance (to ~ Data.HList.Labelable.LabeledTo x, Data.HList.Labelable.ToSym (to p q) x) => Data.HList.HListPrelude.HExtend (to p q) (Data.Proxy.Proxy (Data.HList.Label3.Lbl n ns desc : xs))
+ Data.HList.Labelable: instance (to ~ Data.HList.Labelable.LabeledTo x, Data.HList.Labelable.ToSym (to p q) x) => Data.HList.HListPrelude.HExtend (to p q) (Data.Proxy.Proxy (x : xs))
+ Data.HList.Labelable: instance Data.HList.Labelable.LabelableTIPCxt x s t a b => Data.HList.Labelable.Labelable x Data.HList.TIP.TIP s t a b
+ Data.HList.Labelable: instance Data.HList.Labelable.ToSym (label x) x
+ Data.HList.Labelable: instance forall (k :: BOX) (k1 :: BOX) (k2 :: BOX) (v1 :: k1 -> k2 -> *) (v2 :: k1) (v3 :: k2) (x :: GHC.TypeLits.Symbol) (p :: * -> k -> *) a (f :: * -> k) b (s :: [*]) (t :: [*]). (Data.HList.Labelable.LabeledTo x (p a (f b)) (p (Data.HList.Labelable.LabeledR s) (f (Data.HList.Labelable.LabeledR t))) ~ v1 v2 v3) => Data.HList.Labelable.ToSym (v1 v2 v3) x
+ Data.HList.Labelable: instance forall (k :: BOX) (x :: k) (s :: [*]) (t :: [*]) a b (to :: * -> * -> *). (Data.HList.Variant.HPrism x s t a b, to ~ (->)) => Data.HList.Labelable.Labelable x Data.HList.Variant.Variant s t a b
+ Data.HList.Labelable: instance forall (k :: BOX) (x :: k) (s :: [*]) (t :: [*]) a b. Data.HList.Labelable.LabeledCxt1 s t a b => Data.HList.Labelable.Labelable x Data.HList.Labelable.LabeledR s t a b
+ Data.HList.Labelable: instance forall (k :: BOX) (x :: k) (s :: [*]) (t :: [*]) a b. Data.HList.Record.HLens x Data.HList.Record.Record s t a b => Data.HList.Labelable.Labelable x Data.HList.Record.Record s t a b
+ Data.HList.Labelable: instance forall (k :: BOX) (x :: k) a b. GHC.Show.Show (Data.HList.Labelable.LabeledTo x a b)
+ Data.HList.Record: instance (Data.HList.HList.HMapCxt Data.HList.HList.HList Data.HList.Record.ReadComponent (Data.HList.HList.AddProxy rs) bs, Data.HList.FakePrelude.ApplyAB Data.HList.Record.ReadComponent (Data.Proxy.Proxy r) readP_r, Data.HList.HList.HProxies rs, Data.HList.HList.HSequence Text.ParserCombinators.ReadP.ReadP (readP_r : bs) (r : rs)) => GHC.Read.Read (Data.HList.Record.Record (r : rs))
+ Data.HList.Record: instance (Data.HList.HList.HMapCxt Data.HList.Record.Record f x y, rx ~ Data.HList.Record.Record x, ry ~ Data.HList.Record.Record y) => Data.HList.FakePrelude.ApplyAB (Data.HList.Record.HMapR f) rx ry
+ Data.HList.Record: instance (Data.HList.HList.HReverse l lRev, Data.HList.Record.HMapTaggedFn lRev l') => Data.HList.HList.HBuild' l (Data.HList.Record.Record l')
+ Data.HList.Record: instance (Data.HList.Record.HDeleteLabels (Data.HList.Record.LabelsOf l) r r', Data.HList.HListPrelude.HAppend (Data.HList.Record.Record l) (Data.HList.Record.Record r'), Data.HList.HListPrelude.HAppendR (Data.HList.Record.Record l) (Data.HList.Record.Record r') ~ Data.HList.Record.Record lr) => Data.HList.Record.HLeftUnion l r lr
+ Data.HList.Record: instance (Data.HList.Record.HLabelSet (Data.HList.Record.LabelsOf ps), Data.HList.FakePrelude.HAllTaggedLV ps) => Data.HList.Record.HRLabelSet ps
+ Data.HList.Record: instance (Data.HList.Record.HRLabelSet (Data.HList.HList.HAppendListR r1 r2), Data.HList.HListPrelude.HAppend (Data.HList.HList.HList r1) (Data.HList.HList.HList r2)) => Data.HList.HListPrelude.HAppend (Data.HList.Record.Record r1) (Data.HList.Record.Record r2)
+ Data.HList.Record: instance (Data.HList.Record.HRearrange3 ls r r', Data.HList.Record.LabelsOf r' ~ ls, Data.HList.FakePrelude.SameLength ls r, Data.HList.FakePrelude.SameLength r r') => Data.HList.Record.HRearrange ls r r'
+ Data.HList.Record: instance (Data.HList.Record.HZipRecord x y xy, Data.HList.FakePrelude.SameLengths '[x, y, xy]) => Data.HList.HListPrelude.HUnzip Data.HList.Record.Record x y xy
+ Data.HList.Record: instance (Data.HList.Record.HZipRecord x y xy, Data.HList.FakePrelude.SameLengths '[x, y, xy]) => Data.HList.HListPrelude.HZip Data.HList.Record.Record x y xy
+ Data.HList.Record: instance (Data.HList.Record.RecordValuesR lvs ~ vs, Data.HList.FakePrelude.SameLabels ls lvs, Data.HList.Record.LabelsOf lvs ~ ls, Data.HList.FakePrelude.SameLengths '[ls, vs, lvs], Data.HList.FakePrelude.HAllTaggedLV lvs) => Data.HList.HListPrelude.HUnzip Data.Proxy.Proxy ls vs lvs
+ Data.HList.Record: instance (Data.HList.Record.UnionSymRec r1 r2' ru, Data.HList.HListPrelude.HExtend f2 (Data.HList.Record.Record ru), Data.HList.Record.Record f2ru ~ Data.HList.HListPrelude.HExtendR f2 (Data.HList.Record.Record ru)) => Data.HList.Record.UnionSymRec' 'GHC.Types.False r1 f2 r2' f2ru
+ Data.HList.Record: instance (la ~ Data.HList.Record.LabelsOf a, lt ~ Data.HList.Record.LabelsOf t, Data.HList.Record.HRearrange la s a, Data.HList.Record.HRearrange lt b t, Data.HList.Record.HLabelSet la, Data.HList.Record.HLabelSet lt) => Data.HList.Record.Rearranged Data.HList.Record.Record s t a b
+ Data.HList.Record: instance (r1 ~ r1') => Data.HList.Record.UnionSymRec r1 '[] r1'
+ Data.HList.Record: instance Data.HList.FakePrelude.Fail (Data.HList.FakePrelude.FieldNotFound l) => Data.HList.Record.HRearrange4 l ls '[] rout '[]
+ Data.HList.Record: instance Data.HList.HList.HMapAux Data.HList.HList.HList (Data.HList.FakePrelude.HFmap f) x y => Data.HList.HList.HMapAux Data.HList.Record.Record f x y
+ Data.HList.Record: instance Data.HList.HListPrelude.HUnzip Data.Proxy.Proxy ls vs lvs => Data.HList.HListPrelude.HZip Data.Proxy.Proxy ls vs lvs
+ Data.HList.Record: instance Data.HList.Record.H2ProjectByLabels '[] r '[] r
+ Data.HList.Record: instance Data.HList.Record.H2ProjectByLabels (Data.HList.Record.LabelsOf r2) r1 r2 rout => Data.HList.HListPrelude.SubType (Data.HList.Record.Record r1) (Data.HList.Record.Record r2)
+ Data.HList.Record: instance Data.HList.Record.H2ProjectByLabels (l : ls) '[] '[] '[]
+ Data.HList.Record: instance Data.HList.Record.H2ProjectByLabels ls r rin rout => Data.HList.Record.H2ProjectByLabels' 'GHC.Base.Nothing ls (f : r) rin (f : rout)
+ Data.HList.Record: instance Data.HList.Record.H2ProjectByLabels ls1 r rin rout => Data.HList.Record.H2ProjectByLabels' ('GHC.Base.Just ls1) ls (f : r) (f : rin) rout
+ Data.HList.Record: instance Data.HList.Record.HDeleteLabels ks '[] '[]
+ Data.HList.Record: instance Data.HList.Record.HLabelSet '[]
+ Data.HList.Record: instance Data.HList.Record.HRLabelSet (t : r) => Data.HList.HListPrelude.HExtend t (Data.HList.Record.Record r)
+ Data.HList.Record: instance Data.HList.Record.HRearrange3 '[] '[] '[]
+ Data.HList.Record: instance Data.HList.Record.HZipRecord '[] '[] '[]
+ Data.HList.Record: instance Data.HList.Record.RecordValues '[]
+ Data.HList.Record: instance Data.HList.Record.Relabeled Data.HList.Record.Record
+ Data.HList.Record: instance Data.HList.Record.ShowComponents '[]
+ Data.HList.Record: instance Data.HList.Record.ShowComponents r => GHC.Show.Show (Data.HList.Record.Record r)
+ Data.HList.Record: instance GHC.Arr.Ix (Data.HList.HList.HList r) => GHC.Arr.Ix (Data.HList.Record.Record r)
+ Data.HList.Record: instance GHC.Base.Monoid (Data.HList.HList.HList r) => GHC.Base.Monoid (Data.HList.Record.Record r)
+ Data.HList.Record: instance GHC.Classes.Eq (Data.HList.HList.HList r) => GHC.Classes.Eq (Data.HList.Record.Record r)
+ Data.HList.Record: instance GHC.Classes.Ord (Data.HList.HList.HList r) => GHC.Classes.Ord (Data.HList.Record.Record r)
+ Data.HList.Record: instance GHC.Enum.Bounded (Data.HList.HList.HList r) => GHC.Enum.Bounded (Data.HList.Record.Record r)
+ Data.HList.Record: instance forall (k :: BOX) (b :: [*]) (l :: k) r v. Data.HList.Record.HasField l r v => Data.HList.Record.HasFieldM1 ('GHC.Base.Just b) l r ('GHC.Base.Just v)
+ Data.HList.Record: instance forall (k :: BOX) (k1 :: BOX) (k2 :: BOX) (l1 :: k) (l2 :: k1) (r :: k2). Data.HList.FakePrelude.Fail (Data.HList.Record.DuplicatedLabel l1) => Data.HList.Record.HLabelSet' l1 l2 'GHC.Types.True r
+ Data.HList.Record: instance forall (k :: BOX) (k1 :: BOX) (l :: k) (l1 :: k1) v1 (r :: [*]) v (b :: GHC.Types.Bool). (Data.HList.FakePrelude.HEqK l l1 b, Data.HList.Record.HasField' b l (Data.Tagged.Tagged l1 v1 : r) v) => Data.HList.Record.HasField l (Data.HList.Record.Record (Data.Tagged.Tagged l1 v1 : r)) v
+ Data.HList.Record: instance forall (k :: BOX) (k1 :: BOX) (l :: k) v (l' :: k1) e (xs :: [*]) (xs' :: [*]) (b :: GHC.Types.Bool). (Data.HList.FakePrelude.HEqK l l' b, Data.HList.Record.HUpdateAtLabel1 b l v (Data.Tagged.Tagged l' e : xs) xs') => Data.HList.Record.HUpdateAtLabel2 l v (Data.Tagged.Tagged l' e : xs) xs'
+ Data.HList.Record: instance forall (k :: BOX) (ks :: [*]) (l :: k) v (r1 :: [*]) (r3 :: [*]) (b :: GHC.Types.Bool) (r2 :: [*]). (Data.HList.HList.HMember (Data.HList.FakePrelude.Label l) ks b, Data.HList.FakePrelude.HCond b (Data.HList.Record.Record r2) (Data.HList.Record.Record (Data.Tagged.Tagged l v : r2)) (Data.HList.Record.Record r3), Data.HList.Record.HDeleteLabels ks r1 r2) => Data.HList.Record.HDeleteLabels ks (Data.Tagged.Tagged l v : r1) r3
+ Data.HList.Record: instance forall (k :: BOX) (l :: [*]) (l' :: k) (lRev :: [*]) (l1 :: k). (Data.HList.HList.HRevAppR l '[] ~ lRev, Data.HList.Record.HExtendRs lRev (Data.Proxy.Proxy '[]) ~ Data.Proxy.Proxy l1, l' ~ l1) => Data.HList.HList.HBuild' l (Data.Proxy.Proxy l')
+ Data.HList.Record: instance forall (k :: BOX) (l :: k) (r :: [*] -> *) (xs :: [*]) (v :: GHC.Base.Maybe *) (b :: GHC.Base.Maybe [*]). (Data.HList.HList.HMemberM (Data.HList.FakePrelude.Label l) (Data.HList.Record.LabelsOf xs) b, Data.HList.Record.HasFieldM1 b l (r xs) v) => Data.HList.Record.HasFieldM l (r xs) v
+ Data.HList.Record: instance forall (k :: BOX) (l :: k) (v :: [*]) (v' :: [*]) (t1 :: [*]). Data.HList.Record.H2ProjectByLabels '[Data.HList.FakePrelude.Label l] v t1 v' => Data.HList.HListPrelude.HDeleteAtLabel Data.HList.Record.Record l v v'
+ Data.HList.Record: instance forall (k :: BOX) (l :: k) fld (r :: [*]) v. Data.HList.Record.HasField l (Data.HList.Record.Record r) v => Data.HList.Record.HasField' 'GHC.Types.False l (fld : r) v
+ Data.HList.Record: instance forall (k :: BOX) (l :: k) r. Data.HList.Record.HasFieldM1 'GHC.Base.Nothing l r 'GHC.Base.Nothing
+ Data.HList.Record: instance forall (k :: BOX) (l :: k) v (a :: [*]). Data.HList.FakePrelude.Fail (Data.HList.FakePrelude.ExtraField l) => Data.HList.Record.HRearrange3 '[] (Data.Tagged.Tagged l v : a) '[]
+ Data.HList.Record: instance forall (k :: BOX) (l :: k) v (r :: [*]) (r' :: [*]). (Data.HList.Record.HUpdateAtLabel2 l v r r', Data.HList.Record.HasField l (Data.HList.Record.Record r') v) => Data.HList.Record.HUpdateAtLabel Data.HList.Record.Record l v r r'
+ Data.HList.Record: instance forall (k :: BOX) (l :: k) v (r :: [*]). (Data.HList.FakePrelude.ShowLabel l, GHC.Show.Show v, Data.HList.Record.ShowComponents r) => Data.HList.Record.ShowComponents (Data.Tagged.Tagged l v : r)
+ Data.HList.Record: instance forall (k :: BOX) (l :: k) v (r :: [*]). Data.HList.Record.HasField' 'GHC.Types.True l (Data.Tagged.Tagged l v : r) v
+ Data.HList.Record: instance forall (k :: BOX) (l :: k) v (r :: [*]). Data.HList.Record.RecordValues r => Data.HList.Record.RecordValues (Data.Tagged.Tagged l v : r)
+ Data.HList.Record: instance forall (k :: BOX) (l :: k) v e (xs :: [*]). Data.HList.Record.HUpdateAtLabel1 'GHC.Types.True l v (Data.Tagged.Tagged l e : xs) (Data.Tagged.Tagged l v : xs)
+ Data.HList.Record: instance forall (k :: BOX) (l :: k) v x (xs :: [*]) (xs' :: [*]). Data.HList.Record.HUpdateAtLabel2 l v xs xs' => Data.HList.Record.HUpdateAtLabel1 'GHC.Types.False l v (x : xs) (x : xs')
+ Data.HList.Record: instance forall (k :: BOX) (l :: k) v. Data.HList.FakePrelude.Fail (Data.HList.FakePrelude.FieldNotFound l) => Data.HList.Record.HUpdateAtLabel2 l v '[] '[]
+ Data.HList.Record: instance forall (k :: BOX) (l :: k). Data.HList.FakePrelude.Fail (Data.HList.FakePrelude.FieldNotFound l) => Data.HList.Record.HasField l (Data.HList.Record.Record '[]) (Data.HList.FakePrelude.FieldNotFound l)
+ Data.HList.Record: instance forall (k :: BOX) (l1 :: k) (l2 :: k) (r :: [k]) (leq :: GHC.Types.Bool). (Data.HList.FakePrelude.HEqK l1 l2 leq, Data.HList.Record.HLabelSet' l1 l2 leq r) => Data.HList.Record.HLabelSet (l1 : l2 : r)
+ Data.HList.Record: instance forall (k :: BOX) (l1 :: k) (l2 :: k) (r :: [k]). (Data.HList.Record.HLabelSet (l2 : r), Data.HList.Record.HLabelSet (l1 : r)) => Data.HList.Record.HLabelSet' l1 l2 'GHC.Types.False r
+ Data.HList.Record: instance forall (k :: BOX) (r :: k) (x :: [*] -> *) (s :: [*]) (t :: [*]) a b. Data.HList.Record.HLensCxt r x s t a b => Data.HList.Record.HLens r x s t a b
+ Data.HList.Record: instance forall (k :: BOX) (r1 :: [*]) (l :: k) v (r2' :: [*]) (ru :: [*]) (b :: GHC.Types.Bool). (Data.HList.Record.HMemberLabel l r1 b, Data.HList.Record.UnionSymRec' b r1 (Data.Tagged.Tagged l v) r2' ru) => Data.HList.Record.UnionSymRec r1 (Data.Tagged.Tagged l v : r2') ru
+ Data.HList.Record: instance forall (k :: BOX) (r1 :: [*]) f2 (r2' :: [*]) (ru :: [*]) (l2 :: k) v2. (Data.HList.Record.UnionSymRec r1 r2' ru, Data.HList.Record.HTPupdateAtLabel Data.HList.Record.Record l2 v2 ru, f2 ~ Data.Tagged.Tagged l2 v2) => Data.HList.Record.UnionSymRec' 'GHC.Types.True r1 f2 r2' ru
+ Data.HList.Record: instance forall (k :: BOX) (x :: k) a (as :: [*]) b (bs :: [*]) (abss :: [*]). Data.HList.Record.HZipRecord as bs abss => Data.HList.Record.HZipRecord (Data.Tagged.Tagged x a : as) (Data.Tagged.Tagged x b : bs) (Data.Tagged.Tagged x (a, b) : abss)
+ Data.HList.Record: instance forall (k :: BOX) (x :: k). Data.HList.Record.HLabelSet '[x]
+ Data.HList.Record: instance forall (k :: BOX) l (ls :: [*]) (l1 :: k) v1 (r1 :: [*]) (rin :: [*]) (rout :: [*]) (b :: GHC.Base.Maybe [*]). (Data.HList.HList.HMemberM (Data.HList.FakePrelude.Label l1) (l : ls) b, Data.HList.Record.H2ProjectByLabels' b (l : ls) (Data.Tagged.Tagged l1 v1 : r1) rin rout) => Data.HList.Record.H2ProjectByLabels (l : ls) (Data.Tagged.Tagged l1 v1 : r1) rin rout
+ Data.HList.Record: instance forall (k :: BOX) l (ls :: [*]) (r :: [*]) (r' :: [*]) (rin :: [*]) (rout :: [*]) (ll :: k). (Data.HList.Record.H2ProjectByLabels '[l] r rin rout, Data.HList.Record.HRearrange4 l ls rin rout r', l ~ Data.HList.FakePrelude.Label ll) => Data.HList.Record.HRearrange3 (l : ls) r r'
+ Data.HList.Record: instance forall (k :: BOX) ll (ls :: [*]) (l :: k) v (rout :: [*]) (r'' :: [*]) (r' :: [*]). (Data.HList.Record.HRearrange3 ls rout r', r'' ~ (Data.Tagged.Tagged l v : r'), ll ~ Data.HList.FakePrelude.Label l) => Data.HList.Record.HRearrange4 ll ls '[Data.Tagged.Tagged l v] rout r''
+ Data.HList.Record: instance forall (k :: BOX) x tx (t :: k). (tx ~ Data.Tagged.Tagged t x) => Data.HList.FakePrelude.ApplyAB Data.HList.Record.TaggedFn x tx
+ Data.HList.Record: instance forall (k :: BOX) x y v (l :: k). (GHC.Read.Read v, Data.HList.FakePrelude.ShowLabel l, x ~ Data.Tagged.Tagged l v, Text.ParserCombinators.ReadP.ReadP x ~ y) => Data.HList.FakePrelude.ApplyAB Data.HList.Record.ReadComponent (Data.Proxy.Proxy x) y
+ Data.HList.RecordPuns: instance GHC.Show.Show Data.HList.RecordPuns.Tree
+ Data.HList.RecordU: instance (Data.HList.FakePrelude.ApplyAB f (Data.HList.RecordU.GetElemTy x) (Data.HList.RecordU.GetElemTy y), Data.Array.Base.IArray Data.Array.Base.UArray (Data.HList.RecordU.GetElemTy y), Data.Array.Base.IArray Data.Array.Base.UArray (Data.HList.RecordU.GetElemTy x)) => Data.HList.HList.HMapAux Data.HList.RecordU.RecordU f x y
+ Data.HList.RecordU: instance (Data.HList.HList.HGroupBy Data.HList.RecordU.EqTagValue x g, Data.HList.RecordU.HMapUnboxF g u) => Data.HList.RecordU.RecordUSCxt x u
+ Data.HList.RecordU: instance (Data.HList.HList.HMapCxt Data.HList.HList.HList Data.HList.Record.TaggedFn (Data.HList.Record.RecordValuesR x) x, Data.Array.Base.IArray Data.Array.Base.UArray (Data.HList.RecordU.GetElemTy x), Data.HList.HList.HList2List (Data.HList.Record.RecordValuesR x) (Data.HList.RecordU.GetElemTy x)) => Data.HList.RecordU.RecordUToRecord x
+ Data.HList.RecordU: instance (Data.HList.HList.HPartitionEq Data.HList.RecordU.EqTagValue x (x : xs) xi xo, Data.HList.RecordU.SortForRecordUS xo xo', sorted ~ Data.HList.HList.HAppendListR xi xo', Data.HList.HList.HAppendList xi xo') => Data.HList.RecordU.SortForRecordUS (x : xs) sorted
+ Data.HList.RecordU: instance (Data.HList.Record.HLeftUnion lv x lvx, Data.HList.Record.HRLabelSet x, Data.HList.Record.HLabelSet (Data.HList.Record.LabelsOf x), Data.HList.Record.HRearrange (Data.HList.Record.LabelsOf x) lvx x) => Data.HList.RecordU.HUpdateMany lv (Data.HList.Record.Record x)
+ Data.HList.RecordU: instance (Data.HList.Record.RecordValues lv, Data.HList.HList.HList2List (Data.HList.Record.RecordValuesR lv) v, Data.HList.RecordU.HFindMany (Data.HList.Record.LabelsOf lv) (Data.HList.Record.LabelsOf r) ixs, Data.Array.Base.IArray Data.Array.Base.UArray v, v ~ Data.HList.RecordU.GetElemTy r, Data.HList.FakePrelude.HNats2Integrals ixs) => Data.HList.RecordU.HUpdateMany lv (Data.HList.RecordU.RecordU r)
+ Data.HList.RecordU: instance (Data.HList.Record.RecordValues x, Data.HList.HList.HList2List (Data.HList.Record.RecordValuesR x) (Data.HList.RecordU.GetElemTy x), Data.HList.FakePrelude.HNat2Integral n, Data.HList.HList.HLengthEq x n, Data.Array.Base.IArray Data.Array.Base.UArray (Data.HList.RecordU.GetElemTy x)) => Data.HList.RecordU.RecordToRecordU x
+ Data.HList.RecordU: instance (Data.HList.RecordU.RecordUSCxt x u, GHC.Show.Show (Data.HList.HList.HList u)) => GHC.Show.Show (Data.HList.RecordU.RecordUS x)
+ Data.HList.RecordU: instance (hx ~ Data.HList.HList.HList x, ux ~ Data.HList.RecordU.RecordU x, Data.HList.RecordU.RecordToRecordU x) => Data.HList.FakePrelude.ApplyAB Data.HList.RecordU.UnboxF hx ux
+ Data.HList.RecordU: instance (r ~ Data.HList.RecordU.HSubtract (Data.HList.HList.HLength u) n, Data.HList.RecordU.RecordU u ~ ru, Data.HList.RecordU.HLookupByHNatUS1 r n u us e) => Data.HList.RecordU.HLookupByHNatUS n (ru : us) e
+ Data.HList.RecordU: instance (ux ~ Data.HList.RecordU.RecordU x, hx ~ Data.HList.HList.HList x, Data.HList.RecordU.RecordUToRecord x) => Data.HList.FakePrelude.ApplyAB Data.HList.RecordU.BoxF ux hx
+ Data.HList.RecordU: instance Data.HList.FakePrelude.HEqByFn Data.HList.RecordU.EqTagValue
+ Data.HList.RecordU: instance Data.HList.RecordU.ElemTyEq '[]
+ Data.HList.RecordU: instance Data.HList.RecordU.HLookupByHNatUS t us e => Data.HList.RecordU.HLookupByHNatUS1 ('Data.Either.Right t) n u us e
+ Data.HList.RecordU: instance Data.HList.RecordU.HMapUnboxF '[] '[]
+ Data.HList.RecordU: instance Data.HList.RecordU.HMapUnboxF xs us => Data.HList.RecordU.HMapUnboxF (Data.HList.HList.HList x : xs) (Data.HList.RecordU.RecordU x : us)
+ Data.HList.RecordU: instance Data.HList.RecordU.SortForRecordUS '[] '[]
+ Data.HList.RecordU: instance GHC.Classes.Eq (Data.Array.Base.UArray GHC.Types.Int (Data.HList.RecordU.GetElemTy l)) => GHC.Classes.Eq (Data.HList.RecordU.RecordU l)
+ Data.HList.RecordU: instance GHC.Classes.Ord (Data.Array.Base.UArray GHC.Types.Int (Data.HList.RecordU.GetElemTy l)) => GHC.Classes.Ord (Data.HList.RecordU.RecordU l)
+ Data.HList.RecordU: instance GHC.Read.Read (Data.Array.Base.UArray GHC.Types.Int (Data.HList.RecordU.GetElemTy l)) => GHC.Read.Read (Data.HList.RecordU.RecordU l)
+ Data.HList.RecordU: instance GHC.Show.Show (Data.Array.Base.UArray GHC.Types.Int (Data.HList.RecordU.GetElemTy l)) => GHC.Show.Show (Data.HList.RecordU.RecordU l)
+ Data.HList.RecordU: instance forall (k :: BOX) (k1 :: BOX) tv1 tv2 (rest :: [*]) t1v (t1 :: k) v t2v (t2 :: k1). (t1v ~ Data.Tagged.Tagged t1 v, t2v ~ Data.Tagged.Tagged t2 v, Data.HList.RecordU.ElemTyEq (tv2 : rest)) => Data.HList.RecordU.ElemTyEq (tv1 : tv2 : rest)
+ Data.HList.RecordU: instance forall (k :: BOX) (k1 :: BOX) txv tyw (b :: GHC.Types.Bool) (x :: k) v (y :: k1) w. (txv ~ Data.Tagged.Tagged x v, tyw ~ Data.Tagged.Tagged y w, Data.HList.FakePrelude.HEq v w b) => Data.HList.FakePrelude.HEqBy Data.HList.RecordU.EqTagValue txv tyw b
+ Data.HList.RecordU: instance forall (k :: BOX) (l :: k) (ls :: [*]) v (n :: Data.HList.FakePrelude.HNat). (Data.Array.Base.IArray Data.Array.Base.UArray v, v ~ Data.HList.RecordU.GetElemTy ls, Data.HList.Record.HFindLabel l ls n, Data.HList.FakePrelude.HNat2Integral n) => Data.HList.Record.HasField l (Data.HList.RecordU.RecordU ls) v
+ Data.HList.RecordU: instance forall (k :: BOX) (l :: k) (ls :: [k]) (r :: [k]) (n :: Data.HList.FakePrelude.HNat) (ns :: [Data.HList.FakePrelude.HNat]). (Data.HList.HList.HFind l r n, Data.HList.RecordU.HFindMany ls r ns) => Data.HList.RecordU.HFindMany (l : ls) r (n : ns)
+ Data.HList.RecordU: instance forall (k :: BOX) (l :: k) (r :: [*]) v (n :: Data.HList.FakePrelude.HNat) (u :: [*]). (Data.HList.Record.HFindLabel l r n, Data.HList.RecordU.HLookupByHNatUS n u (Data.Tagged.Tagged l v), Data.HList.Record.HasField l (Data.HList.Record.Record r) v, Data.HList.RecordU.RecordUSCxt r u) => Data.HList.Record.HasField l (Data.HList.RecordU.RecordUS r) v
+ Data.HList.RecordU: instance forall (k :: BOX) (l :: k) v (r :: [*]) (r' :: [*]) (n :: Data.HList.FakePrelude.HNat). (r ~ r', v ~ Data.HList.RecordU.GetElemTy r, Data.HList.Record.HFindLabel l r n, Data.HList.FakePrelude.HNat2Integral n, Data.Array.Base.IArray Data.Array.Base.UArray v, Data.HList.Record.HasField l (Data.HList.Record.Record r') v) => Data.HList.Record.HUpdateAtLabel Data.HList.RecordU.RecordU l v r r'
+ Data.HList.RecordU: instance forall (k :: BOX) (r :: [k]). Data.HList.RecordU.HFindMany '[] r '[]
+ Data.HList.RecordU: instance forall (k :: BOX) (t :: Data.HList.FakePrelude.HNat) (n :: Data.HList.FakePrelude.HNat) (u :: [*]) (us :: [*]) le (l :: k) e. (Data.HList.FakePrelude.HNat2Integral n, Data.HList.HArray.HLookupByHNatR n u ~ le, le ~ Data.Tagged.Tagged l e, Data.Array.Base.IArray Data.Array.Base.UArray e, e ~ Data.HList.RecordU.GetElemTy u) => Data.HList.RecordU.HLookupByHNatUS1 ('Data.Either.Left t) n u us le
+ Data.HList.RecordU: instance forall (k :: BOX) (x :: k) (s :: [*]) (t :: [*]) a b. (s ~ t, a ~ b, Data.Array.Base.IArray Data.Array.Base.UArray a, a ~ Data.HList.RecordU.GetElemTy s, Data.HList.Record.HLensCxt x Data.HList.RecordU.RecordU s t a b) => Data.HList.Labelable.Labelable x Data.HList.RecordU.RecordU s t a b
+ Data.HList.RecordU: instance forall (k :: BOX) t1v (rest :: [*]) (t :: k) v. (t1v ~ Data.Tagged.Tagged t v) => Data.HList.RecordU.ElemTyEq (t1v : rest)
+ Data.HList.TIC: instance (Data.HList.Record.HasField o (Data.HList.TIC.TIC l) mo, mo ~ GHC.Base.Maybe o) => Data.HList.HListPrelude.HOccurs mo (Data.HList.TIC.TIC l)
+ Data.HList.TIC: instance (Data.HList.Variant.MkVariant b b t, Data.HList.Record.HasField a (Data.HList.Variant.Variant s) (GHC.Base.Maybe a), Data.HList.FakePrelude.SameLength s t, Data.HList.Record.HFindLabel b t n, Data.HList.Record.HFindLabel a s n, Data.HList.HArray.HUpdateAtHNatR n (Data.Tagged.Tagged b b) s ~ t, Data.HList.HArray.HUpdateAtHNatR n (Data.Tagged.Tagged a a) t ~ s) => Data.HList.TIC.TICPrism s t a b
+ Data.HList.TIC: instance (Data.HList.Variant.ReadVariant l, Data.HList.TIP.HAllTaggedEq l, Data.HList.Record.HRLabelSet l) => GHC.Read.Read (Data.HList.TIC.TIC l)
+ Data.HList.TIC: instance (me ~ GHC.Base.Maybe e, Data.HList.HListPrelude.HOccursNot (Data.Tagged.Tagged e e) l) => Data.HList.HListPrelude.HExtend me (Data.HList.TIC.TIC l)
+ Data.HList.TIC: instance Data.HList.HList.HMapAux Data.HList.Variant.Variant f xs ys => Data.HList.HList.HMapAux Data.HList.TIC.TIC f xs ys
+ Data.HList.TIC: instance Data.HList.Record.HasField o (Data.HList.Variant.Variant l) (GHC.Base.Maybe o) => Data.HList.Record.HasField o (Data.HList.TIC.TIC l) (GHC.Base.Maybe o)
+ Data.HList.TIC: instance Data.HList.TIC.TypeIndexed Data.HList.Record.Record Data.HList.TIP.TIP
+ Data.HList.TIC: instance Data.HList.TIC.TypeIndexed Data.HList.Variant.Variant Data.HList.TIC.TIC
+ Data.HList.TIC: instance Data.HList.Variant.ShowVariant l => GHC.Show.Show (Data.HList.TIC.TIC l)
+ Data.HList.TIC: instance GHC.Arr.Ix (Data.HList.Variant.Variant l) => GHC.Arr.Ix (Data.HList.TIC.TIC l)
+ Data.HList.TIC: instance GHC.Base.Monoid (Data.HList.Variant.Variant l) => GHC.Base.Monoid (Data.HList.TIC.TIC l)
+ Data.HList.TIC: instance GHC.Classes.Eq (Data.HList.Variant.Variant l) => GHC.Classes.Eq (Data.HList.TIC.TIC l)
+ Data.HList.TIC: instance GHC.Classes.Ord (Data.HList.Variant.Variant l) => GHC.Classes.Ord (Data.HList.TIC.TIC l)
+ Data.HList.TIC: instance GHC.Enum.Bounded (Data.HList.Variant.Variant l) => GHC.Enum.Bounded (Data.HList.TIC.TIC l)
+ Data.HList.TIC: instance GHC.Enum.Enum (Data.HList.Variant.Variant l) => GHC.Enum.Enum (Data.HList.TIC.TIC l)
+ Data.HList.TIP: [unTIP] :: TIP -> HList l
+ Data.HList.TIP: instance (Data.HList.FakePrelude.Fail '(Data.HList.HOccurs.TypeNotFound op, "in TIP", db), GHC.Base.Monad m) => Data.HList.TIP.TransTIPM1 'GHC.Types.False 'Data.HList.FakePrelude.HZero m op db
+ Data.HList.TIP: instance (Data.HList.HList.HMember (Data.Tagged.Tagged arg arg) db b, Data.HList.TIP.TransTIP2 b arg op db) => Data.HList.TIP.TransTIP1 'GHC.Types.False ('Data.HList.FakePrelude.HSucc n) (arg -> op) db
+ Data.HList.TIP: instance (Data.HList.HList.HMember (Data.Tagged.Tagged op op) db b, Data.HList.FakePrelude.Arity op n, Data.HList.TIP.TransTIP1 b n op db) => Data.HList.TIP.TransTIP op db
+ Data.HList.TIP: instance (Data.HList.HList.HZipList (Data.HList.TIP.UntagR x) (Data.HList.TIP.UntagR y) (Data.HList.TIP.UntagR xy), Data.HList.TIP.UntagTag x, Data.HList.TIP.UntagTag y, Data.HList.TIP.UntagTag xy, Data.HList.FakePrelude.SameLengths '[x, y, xy], Data.HList.TIP.HTypeIndexed x, Data.HList.TIP.HTypeIndexed y, Data.HList.HListPrelude.HUnzip Data.HList.TIP.TIP x y xy) => Data.HList.HListPrelude.HZip Data.HList.TIP.TIP x y xy
+ Data.HList.TIP: instance (Data.HList.HList.HZipList (Data.HList.TIP.UntagR x) (Data.HList.TIP.UntagR y) (Data.HList.TIP.UntagR xy), Data.HList.TIP.UntagTag x, Data.HList.TIP.UntagTag y, Data.HList.TIP.UntagTag xy, Data.HList.TIP.HTypeIndexed x, Data.HList.TIP.HTypeIndexed y, Data.HList.FakePrelude.SameLengths '[x, y, xy]) => Data.HList.HListPrelude.HUnzip Data.HList.TIP.TIP x y xy
+ Data.HList.TIP: instance (Data.HList.HListPrelude.HAppend (Data.HList.HList.HList l) (Data.HList.HList.HList l'), Data.HList.TIP.HTypeIndexed (Data.HList.HList.HAppendListR l l')) => Data.HList.HListPrelude.HAppend (Data.HList.TIP.TIP l) (Data.HList.TIP.TIP l')
+ Data.HList.TIP: instance (Data.HList.HListPrelude.HOccurs arg (Data.HList.TIP.TIP db), Data.HList.TIP.TransTIP op db) => Data.HList.TIP.TransTIP2 'GHC.Types.True arg op db
+ Data.HList.TIP: instance (Data.HList.HListPrelude.HOccurs arg (Data.HList.TIP.TIP db), Data.HList.TIP.TransTIPM m op db) => Data.HList.TIP.TransTIPM2 'GHC.Types.True m arg op db
+ Data.HList.TIP: instance (Data.HList.HListPrelude.HOccurs e (Data.HList.TIP.TIP l1), Data.HList.HListPrelude.SubType (Data.HList.TIP.TIP l1) (Data.HList.TIP.TIP l2)) => Data.HList.HListPrelude.SubType (Data.HList.TIP.TIP l1) (Data.HList.TIP.TIP (e : l2))
+ Data.HList.TIP: instance (Data.HList.Record.HRLabelSet (Data.Tagged.Tagged e e : l), Data.HList.TIP.HTypeIndexed l) => Data.HList.HListPrelude.HExtend e (Data.HList.TIP.TIP l)
+ Data.HList.TIP: instance (Data.HList.Record.HUpdateAtLabel Data.HList.Record.Record e' e r r', Data.HList.TIP.HTypeIndexed r', e ~ e') => Data.HList.Record.HUpdateAtLabel Data.HList.TIP.TIP e' e r r'
+ Data.HList.TIP: instance (Data.HList.TIP.HAllTaggedEq l, Data.HList.Record.HRLabelSet l) => Data.HList.TIP.HTypeIndexed l
+ Data.HList.TIP: instance (Data.HList.TIP.TagUntagFD xs ys, txx ~ Data.Tagged.Tagged x x) => Data.HList.TIP.TagUntagFD (x : xs) (txx : ys)
+ Data.HList.TIP: instance (GHC.Base.Monad m, Data.HList.HList.HMember (Data.Tagged.Tagged arg arg) db b, Data.HList.TIP.TransTIPM2 b m arg op db) => Data.HList.TIP.TransTIPM1 'GHC.Types.False ('Data.HList.FakePrelude.HSucc n) m (arg -> op) db
+ Data.HList.TIP: instance (GHC.Base.Monad m, Data.HList.HList.HMember (Data.Tagged.Tagged op op) db b, Data.HList.FakePrelude.Arity (m' op) n, Data.HList.TIP.TransTIPM1 b n m (m' op) db) => Data.HList.TIP.TransTIPM m (m' op) db
+ Data.HList.TIP: instance (GHC.Base.Monad m, m ~ m', Data.HList.Record.HTPupdateAtLabel Data.HList.TIP.TIP op op db) => Data.HList.TIP.TransTIPM1 'GHC.Types.True n m (m' op) db
+ Data.HList.TIP: instance (e ~ e', Data.HList.Record.HasField e (Data.HList.Record.Record l) e') => Data.HList.Record.HasField e (Data.HList.TIP.TIP l) e'
+ Data.HList.TIP: instance (tee ~ Data.Tagged.Tagged e e) => Data.HList.HListPrelude.HOccurs e (Data.HList.TIP.TIP '[tee])
+ Data.HList.TIP: instance Data.HList.FakePrelude.Fail '(Data.HList.HOccurs.TypeNotFound arg, "in TIP", db) => Data.HList.TIP.TransTIP2 'GHC.Types.False arg op db
+ Data.HList.TIP: instance Data.HList.FakePrelude.Fail '(Data.HList.HOccurs.TypeNotFound notfun, "in TIP", db) => Data.HList.TIP.TransTIP1 'GHC.Types.False 'Data.HList.FakePrelude.HZero notfun db
+ Data.HList.TIP: instance Data.HList.FakePrelude.Fail '(Data.HList.HOccurs.TypeNotFound op, "in TIP", db) => Data.HList.TIP.TransTIPM2 'GHC.Types.False m arg op db
+ Data.HList.TIP: instance Data.HList.HList.HMapOut (Data.HList.FakePrelude.HComp Data.HList.FakePrelude.HShow Data.HList.FakePrelude.HUntag) l GHC.Base.String => GHC.Show.Show (Data.HList.TIP.TIP l)
+ Data.HList.TIP: instance Data.HList.HListPrelude.SubType (Data.HList.TIP.TIP l) (Data.HList.TIP.TIP '[])
+ Data.HList.TIP: instance Data.HList.Record.HTPupdateAtLabel Data.HList.TIP.TIP op op db => Data.HList.TIP.TransTIP1 'GHC.Types.True n op db
+ Data.HList.TIP: instance Data.HList.Record.HasField e (Data.HList.Record.Record (x : y : l)) e => Data.HList.HListPrelude.HOccurs e (Data.HList.TIP.TIP (x : y : l))
+ Data.HList.TIP: instance Data.HList.TIP.HAllTaggedEq '[]
+ Data.HList.TIP: instance Data.HList.TIP.TagUntagFD '[] '[]
+ Data.HList.TIP: instance GHC.Arr.Ix (Data.HList.HList.HList r) => GHC.Arr.Ix (Data.HList.TIP.TIP r)
+ Data.HList.TIP: instance GHC.Base.Monoid (Data.HList.HList.HList a) => GHC.Base.Monoid (Data.HList.TIP.TIP a)
+ Data.HList.TIP: instance GHC.Classes.Eq (Data.HList.HList.HList a) => GHC.Classes.Eq (Data.HList.TIP.TIP a)
+ Data.HList.TIP: instance GHC.Classes.Ord (Data.HList.HList.HList r) => GHC.Classes.Ord (Data.HList.TIP.TIP r)
+ Data.HList.TIP: instance GHC.Enum.Bounded (Data.HList.HList.HList r) => GHC.Enum.Bounded (Data.HList.TIP.TIP r)
+ Data.HList.TIP: instance forall (k :: BOX) (e :: k) (v :: [*]) (v' :: [*]). (Data.HList.HListPrelude.HDeleteAtLabel Data.HList.Record.Record e v v', Data.HList.TIP.HTypeIndexed v') => Data.HList.HListPrelude.HDeleteAtLabel Data.HList.TIP.TIP e v v'
+ Data.HList.TIP: instance forall (k :: BOX) tee (l :: [*]) (e :: k) e'. (Data.HList.TIP.HAllTaggedEq l, tee ~ Data.Tagged.Tagged e e') => Data.HList.TIP.HAllTaggedEq (tee : l)
+ Data.HList.TypeEqO: instance ('GHC.Types.False ~ b) => Data.HList.TypeEqO.TupleType x b
+ Data.HList.TypeEqO: instance ('GHC.Types.False ~ flag) => Data.HList.TypeEqO.IsKeyFN t flag
+ Data.HList.TypeEqO: instance (hZero ~ 'Data.HList.FakePrelude.HZero) => Data.HList.FakePrelude.ArityFwd f hZero
+ Data.HList.TypeEqO: instance Data.HList.FakePrelude.Arity f n => Data.HList.FakePrelude.ArityFwd (x -> f) ('Data.HList.FakePrelude.HSucc n)
+ Data.HList.TypeEqO: instance Data.HList.FakePrelude.HNat2Integral n => GHC.Show.Show (Data.Proxy.Proxy n)
+ Data.HList.TypeEqO: instance Data.HList.TypeEqO.TupleType () 'GHC.Types.True
+ Data.HList.TypeEqO: instance Data.HList.TypeEqO.TupleType (x, y) 'GHC.Types.True
+ Data.HList.TypeEqO: instance Data.HList.TypeEqO.TupleType (x, y, z) 'GHC.Types.True
+ Data.HList.TypeEqO: instance GHC.Show.Show (Data.Proxy.Proxy 'GHC.Types.False)
+ Data.HList.TypeEqO: instance GHC.Show.Show (Data.Proxy.Proxy 'GHC.Types.True)
+ Data.HList.TypeEqO: instance forall (k :: BOX) (x :: k) (y :: k) (b :: GHC.Types.Bool). ('GHC.Types.False ~ b) => Data.HList.FakePrelude.HEq x y b
+ Data.HList.TypeEqO: instance forall (k :: BOX) (x :: k). Data.HList.FakePrelude.HEq x x 'GHC.Types.True
+ Data.HList.Variant: instance (Data.HList.FakePrelude.ApplyAB f te te', Data.HList.HList.HMapCxt Data.HList.Variant.Variant f (l : ls) (l' : ls')) => Data.HList.HList.HMapAux Data.HList.Variant.Variant f (te : l : ls) (te' : l' : ls')
+ Data.HList.Variant: instance (Data.HList.FakePrelude.SameLength s a, Data.HList.Variant.ExtendsVariant s a, Data.HList.FakePrelude.SameLength b t, Data.HList.Variant.ExtendsVariant b t) => Data.HList.Record.Rearranged Data.HList.Variant.Variant s t a b
+ Data.HList.Variant: instance (Data.HList.Variant.HAllEqVal' (Data.Tagged.Tagged () e : v), Data.HList.Variant.Unvariant v e) => Data.HList.Variant.Unvariant' v e
+ Data.HList.Variant: instance (Data.HList.Variant.ProjectVariant x yin, Data.HList.Variant.ProjectVariant x yout, Data.HList.Record.H2ProjectByLabels (Data.HList.Record.LabelsOf yin) x xi xo, Data.HList.Record.HRearrange (Data.HList.Record.LabelsOf yin) xi yin, Data.HList.Record.HRearrange (Data.HList.Record.LabelsOf yout) xo yout, Data.HList.Record.HLeftUnion xi xo xixo, Data.HList.Record.HRearrange (Data.HList.Record.LabelsOf x) xixo x, Data.HList.FakePrelude.HAllTaggedLV x, Data.HList.FakePrelude.HAllTaggedLV yin, Data.HList.FakePrelude.HAllTaggedLV yout) => Data.HList.Variant.SplitVariant x yin yout
+ Data.HList.Variant: instance (Data.HList.Variant.Unvariant1 b v e, Data.HList.Variant.HAllEqVal v b, Data.HList.Variant.HAllEqVal (Data.Tagged.Tagged () e : v) b) => Data.HList.Variant.Unvariant v e
+ Data.HList.Variant: instance (Data.Typeable.Internal.Typeable (Data.HList.Variant.Variant v), Data.HList.Variant.GfoldlVariant v v, Data.HList.Variant.GunfoldVariant v v, Data.HList.Variant.VariantConstrs v) => Data.Data.Data (Data.HList.Variant.Variant v)
+ Data.HList.Variant: instance (GHC.Classes.Eq (Data.HList.Variant.Variant xs), GHC.Classes.Eq x) => GHC.Classes.Eq (Data.HList.Variant.Variant (x : xs))
+ Data.HList.Variant: instance (GHC.Classes.Ord x, GHC.Classes.Ord (Data.HList.Variant.Variant xs)) => GHC.Classes.Ord (Data.HList.Variant.Variant (x : xs))
+ Data.HList.Variant: instance (ee ~ (e, e), GHC.Classes.Eq e, bool ~ GHC.Types.Bool) => Data.HList.FakePrelude.ApplyAB Data.HList.Variant.UncurryEq ee bool
+ Data.HList.Variant: instance (mx ~ GHC.Base.Maybe x, my ~ GHC.Base.Maybe y, Data.HList.FakePrelude.HCast y x) => Data.HList.FakePrelude.ApplyAB Data.HList.Variant.HCastF mx my
+ Data.HList.Variant: instance (vx ~ Data.HList.Variant.Variant x, vy ~ Data.HList.Variant.Variant y, Data.HList.HList.HMapAux Data.HList.Variant.Variant (Data.HList.FakePrelude.HFmap f) x y, Data.HList.FakePrelude.SameLength x y) => Data.HList.FakePrelude.ApplyAB (Data.HList.Variant.HMapV f) vx vy
+ Data.HList.Variant: instance Data.HList.FakePrelude.ApplyAB f te te' => Data.HList.HList.HMapAux Data.HList.Variant.Variant f '[te] '[te']
+ Data.HList.Variant: instance Data.HList.FakePrelude.Fail (Data.HList.Variant.UnvariantTypeMismatch (v : vs)) => Data.HList.Variant.Unvariant1 'GHC.Types.False (v : vs) (Data.HList.Variant.UnvariantTypeMismatch (v : vs))
+ Data.HList.Variant: instance Data.HList.FakePrelude.HAllTaggedLV y => Data.HList.Variant.ProjectExtendVariant '[] y
+ Data.HList.Variant: instance Data.HList.Record.Relabeled Data.HList.Variant.Variant
+ Data.HList.Variant: instance Data.HList.Variant.HAllEqVal '[] 'GHC.Types.True
+ Data.HList.Variant: instance Data.HList.Variant.HAllEqVal '[x] 'GHC.Types.True
+ Data.HList.Variant: instance Data.HList.Variant.HAllEqVal' '[]
+ Data.HList.Variant: instance Data.HList.Variant.HAllEqVal' '[x]
+ Data.HList.Variant: instance Data.HList.Variant.ProjectExtendVariant' 'GHC.Base.Nothing lv y
+ Data.HList.Variant: instance Data.HList.Variant.ProjectVariant x '[]
+ Data.HList.Variant: instance Data.HList.Variant.ReadVariant '[]
+ Data.HList.Variant: instance Data.HList.Variant.ReadVariant v => GHC.Read.Read (Data.HList.Variant.Variant v)
+ Data.HList.Variant: instance Data.HList.Variant.ShowVariant vs => GHC.Show.Show (Data.HList.Variant.Variant vs)
+ Data.HList.Variant: instance Data.HList.Variant.VariantConstrs '[]
+ Data.HList.Variant: instance Data.HList.Variant.VariantToHMaybied '[] '[]
+ Data.HList.Variant: instance Data.HList.Variant.ZipVR fs '[] '[]
+ Data.HList.Variant: instance Data.HList.Variant.ZipVariant '[] '[] '[]
+ Data.HList.Variant: instance GHC.Classes.Eq (Data.HList.Variant.Variant '[])
+ Data.HList.Variant: instance GHC.Classes.Ord (Data.HList.Variant.Variant '[])
+ Data.HList.Variant: instance forall (k :: BOX) (b :: k). Data.HList.FakePrelude.Fail "Unvariant applied to empty variant" => Data.HList.Variant.Unvariant1 b '[] (Data.Proxy.Proxy "Unvariant applied to empty variant")
+ Data.HList.Variant: instance forall (k :: BOX) (fs :: [*]) lv (vs :: [*]) lv' (rs :: [*]) (l :: k) v v' (b :: GHC.Base.Maybe [*]) (f :: GHC.Base.Maybe *). (lv ~ Data.Tagged.Tagged l v, lv' ~ Data.Tagged.Tagged l v', Data.HList.HList.HMemberM (Data.HList.FakePrelude.Label l) (Data.HList.Record.LabelsOf fs) b, Data.HList.Record.HasFieldM l (Data.HList.Record.Record fs) f, Data.HList.Record.DemoteMaybe (v -> v) f ~ (v -> v'), Data.HList.Variant.MkVariant l v' (lv' : rs), Data.HList.Variant.ZipVR fs vs rs) => Data.HList.Variant.ZipVR fs (lv : vs) (lv' : rs)
+ Data.HList.Variant: instance forall (k :: BOX) (k1 :: BOX) (s :: k) a (t :: k1) a' (xs :: [*]) (b3 :: GHC.Types.Bool) (b :: GHC.Types.Bool) (b2 :: GHC.Types.Bool). (Data.HList.FakePrelude.HEq a a' b, Data.HList.Variant.HAllEqVal (Data.Tagged.Tagged t a' : xs) b2, Data.HList.FakePrelude.HAnd b b2 ~ b3) => Data.HList.Variant.HAllEqVal (Data.Tagged.Tagged s a : Data.Tagged.Tagged t a' : xs) b3
+ Data.HList.Variant: instance forall (k :: BOX) (k1 :: BOX) (s :: k1) x (xs :: [*]) z (t :: k) (sx :: [*]). (GHC.Enum.Bounded x, GHC.Enum.Bounded z, Data.HList.HList.HRevAppR (Data.Tagged.Tagged s x : xs) '[] ~ (Data.Tagged.Tagged t z : sx), Data.HList.Variant.MkVariant t z (Data.Tagged.Tagged s x : xs)) => GHC.Enum.Bounded (Data.HList.Variant.Variant (Data.Tagged.Tagged s x : xs))
+ Data.HList.Variant: instance forall (k :: BOX) (k1 :: BOX) ta' ta (xs :: [*]) a' a (t :: k) (t' :: k1). (Data.HList.Variant.HAllEqVal' (ta : xs), a' ~ a, ta ~ Data.Tagged.Tagged t a, ta' ~ Data.Tagged.Tagged t' a') => Data.HList.Variant.HAllEqVal' (ta' : ta : xs)
+ Data.HList.Variant: instance forall (k :: BOX) (l :: k) e (v :: [*]) (v' :: [*]) (n :: Data.HList.FakePrelude.HNat) _e. Data.HList.Variant.HUpdateVariantAtLabelCxt l e v v' n _e => Data.HList.Record.HUpdateAtLabel Data.HList.Variant.Variant l e v v'
+ Data.HList.Variant: instance forall (k :: BOX) (l :: k) e (v :: [*]). (Data.HList.Variant.MkVariant l e v, Data.Data.Data e) => Data.HList.Variant.GunfoldVariant '[Data.Tagged.Tagged l e] v
+ Data.HList.Variant: instance forall (k :: BOX) (l :: k) e (xs :: [*]). (Data.HList.FakePrelude.ShowLabel l, Data.HList.Variant.VariantConstrs xs) => Data.HList.Variant.VariantConstrs (Data.Tagged.Tagged l e : xs)
+ Data.HList.Variant: instance forall (k :: BOX) (l :: k) e b (bs :: [*]) (v :: [*]). (Data.HList.Variant.MkVariant l e v, Data.Data.Data e, Data.HList.Variant.GunfoldVariant (b : bs) v) => Data.HList.Variant.GunfoldVariant (Data.Tagged.Tagged l e : b : bs) v
+ Data.HList.Variant: instance forall (k :: BOX) (l :: k) v (vs :: [*]). (Data.HList.FakePrelude.ShowLabel l, GHC.Read.Read v, Data.HList.Variant.ReadVariant vs, Data.HList.HListPrelude.HOccursNot (Data.HList.FakePrelude.Label l) (Data.HList.Record.LabelsOf vs)) => Data.HList.Variant.ReadVariant (Data.Tagged.Tagged l v : vs)
+ Data.HList.Variant: instance forall (k :: BOX) (l :: k) v w (ws :: [*]). (Data.HList.FakePrelude.ShowLabel l, GHC.Show.Show v, Data.HList.Variant.ShowVariant (w : ws)) => Data.HList.Variant.ShowVariant (Data.Tagged.Tagged l v : w : ws)
+ Data.HList.Variant: instance forall (k :: BOX) (s :: k) x y (z :: [*]). (GHC.Enum.Enum x, GHC.Enum.Bounded x, GHC.Enum.Enum (Data.HList.Variant.Variant (y : z))) => GHC.Enum.Enum (Data.HList.Variant.Variant (Data.Tagged.Tagged s x : y : z))
+ Data.HList.Variant: instance forall (k :: BOX) (s :: k) x. GHC.Enum.Enum x => GHC.Enum.Enum (Data.HList.Variant.Variant '[Data.Tagged.Tagged s x])
+ Data.HList.Variant: instance forall (k :: BOX) (t :: [*]) lv (y :: [*]) (l :: k) v. (Data.HList.Variant.MkVariant l v y, lv ~ Data.Tagged.Tagged l v) => Data.HList.Variant.ProjectExtendVariant' ('GHC.Base.Just t) lv y
+ Data.HList.Variant: instance forall (k :: BOX) (t :: k) x a (b :: [*]). (GHC.Base.Monoid x, GHC.Base.Monoid (Data.HList.Variant.Variant (a : b))) => GHC.Base.Monoid (Data.HList.Variant.Variant (Data.Tagged.Tagged t x : a : b))
+ Data.HList.Variant: instance forall (k :: BOX) (t :: k) x. (Data.HList.Variant.Unvariant '[Data.Tagged.Tagged t x] x, GHC.Base.Monoid x) => GHC.Base.Monoid (Data.HList.Variant.Variant '[Data.Tagged.Tagged t x])
+ Data.HList.Variant: instance forall (k :: BOX) (x :: [*]) ty (ys :: [*]) (t :: k) y. (Data.HList.Variant.ProjectVariant x ys, Data.HList.Record.HasField t (Data.HList.Variant.Variant x) (GHC.Base.Maybe y), Data.HList.HListPrelude.HOccursNot (Data.HList.FakePrelude.Label t) (Data.HList.Record.LabelsOf ys), ty ~ Data.Tagged.Tagged t y) => Data.HList.Variant.ProjectVariant x (ty : ys)
+ Data.HList.Variant: instance forall (k :: BOX) (x :: k) (s :: [*]) (t :: [*]) a b (si :: [*]) (so :: [*]) (ti :: [*]) (to :: [*]). (Data.HList.Variant.MkVariant x b t, Data.HList.Record.HasField x (Data.HList.Variant.Variant s) (GHC.Base.Maybe a), Data.HList.FakePrelude.SameLength s t, Data.HList.FakePrelude.SameLabels s t, Data.HList.Record.H2ProjectByLabels '[Data.HList.FakePrelude.Label x] s si so, Data.HList.Record.H2ProjectByLabels '[Data.HList.FakePrelude.Label x] t ti to, so ~ to, Data.HList.Record.HUpdateAtLabel Data.HList.Variant.Variant x b s t, Data.HList.Record.HUpdateAtLabel Data.HList.Variant.Variant x a t s) => Data.HList.Variant.HPrism x s t a b
+ Data.HList.Variant: instance forall (k :: BOX) (x :: k) (vs :: [*]) a (n :: Data.HList.FakePrelude.HNat). (Data.HList.Record.HasField x (Data.HList.Record.Record vs) a, Data.HList.Record.HFindLabel x vs n, Data.HList.FakePrelude.HNat2Integral n) => Data.HList.Record.HasField x (Data.HList.Variant.Variant vs) (GHC.Base.Maybe a)
+ Data.HList.Variant: instance forall (k :: BOX) (x :: k) v (vs :: [*]) (n :: Data.HList.FakePrelude.HNat). (Data.HList.Record.HFindLabel x vs n, Data.HList.FakePrelude.HNat2Integral n, Data.HList.Record.HasField x (Data.HList.Variant.Variant vs) (GHC.Base.Maybe v)) => Data.HList.Variant.MkVariant x v vs
+ Data.HList.Variant: instance forall (k :: BOX) a (b :: [*]) v (l :: k). (Data.HList.Variant.Unvariant '[a] v, a ~ Data.Tagged.Tagged l v, Data.Data.Data v, Data.HList.Variant.MkVariant l v b) => Data.HList.Variant.GfoldlVariant '[a] b
+ Data.HList.Variant: instance forall (k :: BOX) a b (c :: [*]) (r :: [*]) (l :: k) v. (a ~ Data.Tagged.Tagged l v, Data.HList.Variant.MkVariant l v r, Data.Data.Data v, Data.HList.Variant.GfoldlVariant (b : c) r) => Data.HList.Variant.GfoldlVariant (a : b : c) r
+ Data.HList.Variant: instance forall (k :: BOX) le (v :: [*]) (l :: k) e. (le ~ Data.Tagged.Tagged l (GHC.Base.Maybe e), Data.HList.HListPrelude.HOccursNot (Data.HList.FakePrelude.Label l) (Data.HList.Record.LabelsOf v)) => Data.HList.HListPrelude.HExtend le (Data.HList.Variant.Variant v)
+ Data.HList.Variant: instance forall (k :: BOX) le (x :: [*]) e (l :: k). (Data.HList.FakePrelude.HAllTaggedLV x, Data.HList.Variant.Unvariant '[le] e, Data.HList.Variant.MkVariant l e x, le ~ Data.Tagged.Tagged l e) => Data.HList.Variant.ExtendsVariant '[le] x
+ Data.HList.Variant: instance forall (k :: BOX) le b (bs :: [*]) (y :: [*]) (l :: k) e. (Data.HList.Variant.MkVariant l e y, le ~ Data.Tagged.Tagged l e, Data.HList.Variant.ExtendsVariant (b : bs) y) => Data.HList.Variant.ExtendsVariant (le : b : bs) y
+ Data.HList.Variant: instance forall (k :: BOX) lv (l :: k) v. (Data.HList.FakePrelude.ShowLabel l, GHC.Show.Show v, lv ~ Data.Tagged.Tagged l v) => Data.HList.Variant.ShowVariant '[lv]
+ Data.HList.Variant: instance forall (k :: BOX) lv (xs :: [*]) (y :: [*]) (l :: k) v (inY :: GHC.Base.Maybe [*]). (lv ~ Data.Tagged.Tagged l v, Data.HList.HList.HMemberM lv y inY, Data.HList.Variant.ProjectExtendVariant' inY lv y, Data.HList.Variant.ProjectExtendVariant xs y) => Data.HList.Variant.ProjectExtendVariant (lv : xs) y
+ Data.HList.Variant: instance forall (k :: BOX) tx (v :: [*]) tmx (r :: [*]) (nr :: Data.HList.FakePrelude.HNat) (t :: k) x. (Data.HList.Variant.VariantToHMaybied v r, Data.HList.HList.HReplicateF nr Data.HList.Variant.ConstTaggedNothing () r, tx ~ Data.Tagged.Tagged t x, tmx ~ Data.Tagged.Tagged t (GHC.Base.Maybe x)) => Data.HList.Variant.VariantToHMaybied (tx : v) (tmx : r)
+ Data.HList.Variant: instance forall (k :: BOX) tx (xs :: [*]) ty (ys :: [*]) txy (zs :: [*]) (t :: k) x y. (tx ~ Data.Tagged.Tagged t x, ty ~ Data.Tagged.Tagged t y, txy ~ Data.Tagged.Tagged t (x, y), Data.HList.Variant.ZipVariant xs ys zs, Data.HList.Variant.MkVariant t (x, y) (txy : zs)) => Data.HList.Variant.ZipVariant (tx : xs) (ty : ys) (txy : zs)
+ Data.HList.Variant: instance forall (k :: BOX) tx ty txy (t :: k) x y. (Data.HList.Variant.Unvariant '[txy] txy, tx ~ Data.Tagged.Tagged t x, ty ~ Data.Tagged.Tagged t y, txy ~ Data.Tagged.Tagged t (x, y)) => Data.HList.HListPrelude.HUnzip Data.HList.Variant.Variant '[tx] '[ty] '[txy]
+ Data.HList.Variant: instance forall (k :: BOX) tx x2 (xs :: [*]) ty y2 (ys :: [*]) txy xy2 (xys :: [*]) (t :: k) x y. (Data.HList.HListPrelude.HUnzip Data.HList.Variant.Variant (x2 : xs) (y2 : ys) (xy2 : xys), tx ~ Data.Tagged.Tagged t x, ty ~ Data.Tagged.Tagged t y, txy ~ Data.Tagged.Tagged t (x, y)) => Data.HList.HListPrelude.HUnzip Data.HList.Variant.Variant (tx : x2 : xs) (ty : y2 : ys) (txy : xy2 : xys)
+ Data.HList.Variant: instance forall (k :: BOX) v (vs :: [*]) e (t1 :: k). (v ~ Data.Tagged.Tagged t1 e) => Data.HList.Variant.Unvariant1 'GHC.Types.True (v : vs) e
+ Data.HList.Variant: instance forall (k :: BOX) x y (t :: k) e (v :: [*]). (x ~ (Data.Tagged.Tagged t (GHC.Base.Maybe e), [Data.HList.Variant.Variant v]), y ~ [Data.HList.Variant.Variant (Data.Tagged.Tagged t e : v)], Data.HList.Variant.MkVariant t e (Data.Tagged.Tagged t e : v)) => Data.HList.FakePrelude.ApplyAB Data.HList.Variant.HMaybiedToVariantFs x y
+ Data.HList.Variant: instance forall (k :: BOX) x y (t :: k) e. (y ~ Data.Tagged.Tagged t (GHC.Base.Maybe e)) => Data.HList.FakePrelude.ApplyAB Data.HList.Variant.ConstTaggedNothing x y
- Data.HList: concrete :: MonadFix m => (a -> m a) -> a -> m a
+ Data.HList: concrete :: (MonadFix m) => (a -> m a) -> a -> m a
- Data.HList.CommonMain: emptyTIP :: TIP []
+ Data.HList.CommonMain: emptyTIP :: TIP '[]
- Data.HList.CommonMain: hCompose :: (HCurry' n2 f2 xs1 r, HCurry' n1 f1 xs x, HCurry' n f xsys r, HSplitAt1 ([] *) n1 xsys xs xs1, HAppendList1 * xs xs1 xsys, ArityFwd f2 n2, ArityFwd f1 n1, ArityRev f2 n2, ArityRev f1 n1) => (x -> f2) -> f1 -> f
+ Data.HList.CommonMain: hCompose :: (ArityRev f1 n1, ArityRev f2 n2, ArityFwd f1 n1, ArityFwd f2 n2, HAppendList1 * xs xs1 xsys, HSplitAt1 ([] *) n1 xsys xs xs1, HCurry' n f xsys r, HCurry' n1 f1 xs x, HCurry' n2 f2 xs1 r) => (x -> f2) -> f1 -> f
- Data.HList.CommonMain: hCurry :: (HCurry' n f xs r, ArityFwd f n, ArityRev f n) => (HList xs -> r) -> f
+ Data.HList.CommonMain: hCurry :: (ArityRev f n, ArityFwd f n, HCurry' n f xs r) => (HList xs -> r) -> f
- Data.HList.CommonMain: hMapV :: (HMapAux Variant (HFmap f) x y, SameLength' * * y x, SameLength' * * x y) => f -> Variant x -> Variant y
+ Data.HList.CommonMain: hMapV :: (SameLength' * * x y, SameLength' * * y x, HMapAux Variant (HFmap f) x y) => f -> Variant x -> Variant y
- Data.HList.CommonMain: hMaybied :: (VariantToHMaybied v1 x, VariantToHMaybied v r, HFoldr HMaybiedToVariantFs [Variant ([] *)] x [Variant v1], HMapAux HList (HFmap HCastF) x r, SameLength' * * x r, SameLength' * * r x, Choice p, Applicative f) => p (Variant v1) (f (Variant v)) -> p (Record x) (f (Record r))
+ Data.HList.CommonMain: hMaybied :: (Applicative f, Choice p, SameLength' * * r x, SameLength' * * x r, HMapAux HList (HFmap HCastF) x r, HFoldr HMaybiedToVariantFs [Variant ([] *)] x [Variant v1], VariantToHMaybied v r, VariantToHMaybied v1 x) => p (Variant v1) (f (Variant v)) -> p (Record x) (f (Record r))
- Data.HList.CommonMain: hMaybied' :: (VariantToHMaybied v x, HFoldr HMaybiedToVariantFs [Variant ([] *)] x [Variant v], HMapAux HList (HFmap HCastF) x x, SameLength' * * x x, Choice p, Applicative f) => p (Variant v) (f (Variant v)) -> p (Record x) (f (Record x))
+ Data.HList.CommonMain: hMaybied' :: (Applicative f, Choice p, SameLength' * * x x, HMapAux HList (HFmap HCastF) x x, HFoldr HMaybiedToVariantFs [Variant ([] *)] x [Variant v], VariantToHMaybied v x) => p (Variant v) (f (Variant v)) -> p (Record x) (f (Record x))
- Data.HList.CommonMain: hMaybiedToVariants :: (HFoldr HMaybiedToVariantFs [Variant []] r [Variant v], VariantToHMaybied v r) => Record r -> [Variant v]
+ Data.HList.CommonMain: hMaybiedToVariants :: (HFoldr HMaybiedToVariantFs [Variant '[]] r [Variant v], VariantToHMaybied v r) => Record r -> [Variant v]
- Data.HList.CommonMain: hUncurry :: (HCurry' n f xs r, ArityFwd f n, ArityRev f n) => f -> HList xs -> r
+ Data.HList.CommonMain: hUncurry :: (ArityRev f n, ArityFwd f n, HCurry' n f xs r) => f -> HList xs -> r
- Data.HList.CommonMain: mkTIC :: (HAllTaggedEq l, HLabelSet [*] (LabelsOf l), HasField * i (Record l) i, HFind1 * i (UnLabel * i (LabelsOf l)) n, HAllTaggedLV l, KnownNat (HNat2Nat n)) => i -> TIC l
+ Data.HList.CommonMain: mkTIC :: (KnownNat (HNat2Nat n), HAllTaggedLV l, HFind1 * i (UnLabel * i (LabelsOf l)) n, HasField * i (Record l) i, HLabelSet [*] (LabelsOf l), HAllTaggedEq l) => i -> TIC l
- Data.HList.CommonMain: ticVariant :: (Profunctor p, Functor f) => p (Variant t) (f (Variant l)) -> p (TIC t) (f (TIC l))
+ Data.HList.CommonMain: ticVariant :: (Functor f, Profunctor p) => p (Variant t) (f (Variant l)) -> p (TIC t) (f (TIC l))
- Data.HList.CommonMain: ticVariant' :: (Profunctor p, Functor f) => p (Variant t) (f (Variant t)) -> p (TIC t) (f (TIC t))
+ Data.HList.CommonMain: ticVariant' :: (Functor f, Profunctor p) => p (Variant t) (f (Variant t)) -> p (TIC t) (f (TIC t))
- Data.HList.CommonMain: tipHList :: (TagUntagFD a1 l, TagUntagFD a ta, Profunctor p, Functor f) => p (HList a) (f (HList a1)) -> p (TIP ta) (f (TIP l))
+ Data.HList.CommonMain: tipHList :: (Functor f, Profunctor p, TagUntagFD a ta, TagUntagFD a1 l) => p (HList a) (f (HList a1)) -> p (TIP ta) (f (TIP l))
- Data.HList.CommonMain: tipHList' :: (TagUntagFD a ta, Profunctor p, Functor f) => p (HList a) (f (HList a)) -> p (TIP ta) (f (TIP ta))
+ Data.HList.CommonMain: tipHList' :: (Functor f, Profunctor p, TagUntagFD a ta) => p (HList a) (f (HList a)) -> p (TIP ta) (f (TIP ta))
- Data.HList.CommonMain: tipRecord :: (Profunctor p, Functor f) => p (Record r) (f (Record l)) -> p (TIP r) (f (TIP l))
+ Data.HList.CommonMain: tipRecord :: (Functor f, Profunctor p) => p (Record r) (f (Record l)) -> p (TIP r) (f (TIP l))
- Data.HList.CommonMain: tipRecord' :: (Profunctor p, Functor f) => p (Record r) (f (Record r)) -> p (TIP r) (f (TIP r))
+ Data.HList.CommonMain: tipRecord' :: (Functor f, Profunctor p) => p (Record r) (f (Record r)) -> p (TIP r) (f (TIP r))
- Data.HList.CommonMain: tipyLens :: (HAllTaggedEq t, HAllTaggedEq s, HLabelSet [*] (LabelsOf t), HLabelSet [*] (LabelsOf s), HasField * b (Record t) b, HasField * b (Record s) b, HUpdateAtLabel2 * b b t s, HUpdateAtLabel2 * b b s t, SameLength' * * t s, SameLength' * * s t, SameLabels [*] [*] s t, HAllTaggedLV t, HAllTaggedLV s, Functor f) => (b -> f b) -> TIP s -> f (TIP t)
+ Data.HList.CommonMain: tipyLens :: (Functor f, HAllTaggedLV s, HAllTaggedLV t, SameLabels [*] [*] s t, SameLength' * * s t, SameLength' * * t s, HUpdateAtLabel2 * a a s t, HUpdateAtLabel2 * a a t s, HasField * a (Record s) a, HasField * a (Record t) a, HLabelSet [*] (LabelsOf t), HLabelSet [*] (LabelsOf s), HAllTaggedEq s, HAllTaggedEq t) => (a -> f a) -> TIP s -> f (TIP t)
- Data.HList.CommonMain: tipyLens' :: (HAllTaggedEq t, HLabelSet [*] (LabelsOf t), HasField * b (Record t) b, HUpdateAtLabel2 * b b t t, SameLength' * * t t, SameLabels [*] [*] t t, HAllTaggedLV t, Functor f) => (b -> f b) -> TIP t -> f (TIP t)
+ Data.HList.CommonMain: tipyLens' :: (Functor f, HAllTaggedLV a, SameLabels [*] [*] a a, SameLength' * * a a, HUpdateAtLabel2 * b b a a, HasField * b (Record a) b, HLabelSet [*] (LabelsOf a), HAllTaggedEq a) => (b -> f b) -> TIP a -> f (TIP a)
- Data.HList.CommonMain: tipyProject :: (HAllTaggedEq l, HLabelSet [*] (LabelsOf l), H2ProjectByLabels ls r l b, HAllTaggedLV l) => proxy ls -> TIP r -> TIP l
+ Data.HList.CommonMain: tipyProject :: (HAllTaggedLV l, H2ProjectByLabels ls t l b, HLabelSet [*] (LabelsOf l), HAllTaggedEq l) => proxy ls -> TIP t -> TIP l
- Data.HList.CommonMain: tipyProject2 :: (HAllTaggedEq l1, HAllTaggedEq l, HLabelSet [*] (LabelsOf l), HLabelSet [*] (LabelsOf l1), H2ProjectByLabels ls r l l1, HAllTaggedLV l1, HAllTaggedLV l) => proxy ls -> TIP r -> (TIP l, TIP l1)
+ Data.HList.CommonMain: tipyProject2 :: (HAllTaggedLV l, HAllTaggedLV l1, H2ProjectByLabels ls r l l1, HLabelSet [*] (LabelsOf l), HLabelSet [*] (LabelsOf l1), HAllTaggedEq l, HAllTaggedEq l1) => proxy ls -> TIP r -> (TIP l, TIP l1)
- Data.HList.CommonMain: tipyTuple :: (HOccurs l1 (r v1), HOccurs l1 (r v), HOccurs l (r v2), HOccurs l (r v), HDeleteAtLabel * r l1 v1 v', HDeleteAtLabel * r l1 v v2, HDeleteAtLabel * r l v2 v'1, HDeleteAtLabel * r l v v1) => r v -> (l, l1)
+ Data.HList.CommonMain: tipyTuple :: (HDeleteAtLabel * r a v v1, HDeleteAtLabel * r a v2 v'1, HDeleteAtLabel * r b v v2, HDeleteAtLabel * r b v1 v', HOccurs a (r v), HOccurs a (r v2), HOccurs b (r v), HOccurs b (r v1)) => r v -> (a, b)
- Data.HList.CommonMain: tipyTuple3 :: (HOccurs l2 (r v5), HOccurs l2 (r v2), HOccurs l2 (r v), HOccurs l1 (r v4), HOccurs l1 (r v1), HOccurs l1 (r v), HOccurs l (r v6), HOccurs l (r v3), HOccurs l (r v), HDeleteAtLabel * r l2 v5 v6, HDeleteAtLabel * r l2 v2 v', HDeleteAtLabel * r l2 v v3, HDeleteAtLabel * r l1 v4 v'1, HDeleteAtLabel * r l1 v1 v2, HDeleteAtLabel * r l1 v v5, HDeleteAtLabel * r l v6 v'2, HDeleteAtLabel * r l v3 v4, HDeleteAtLabel * r l v v1) => r v -> (l, l1, l2)
+ Data.HList.CommonMain: tipyTuple3 :: (HDeleteAtLabel * r a v v1, HDeleteAtLabel * r a v3 v4, HDeleteAtLabel * r a v6 v'2, HDeleteAtLabel * r b v v5, HDeleteAtLabel * r b v1 v2, HDeleteAtLabel * r b v4 v'1, HDeleteAtLabel * r c v v3, HDeleteAtLabel * r c v2 v', HDeleteAtLabel * r c v5 v6, HOccurs a (r v), HOccurs a (r v3), HOccurs a (r v6), HOccurs b (r v), HOccurs b (r v1), HOccurs b (r v4), HOccurs c (r v), HOccurs c (r v2), HOccurs c (r v5)) => r v -> (a, b, c)
- Data.HList.CommonMain: tipyTuple4 :: (HOccurs l3 (r v11), HOccurs l3 (r v7), HOccurs l3 (r v3), HOccurs l3 (r v), HOccurs l2 (r v10), HOccurs l2 (r v6), HOccurs l2 (r v2), HOccurs l2 (r v), HOccurs l1 (r v9), HOccurs l1 (r v5), HOccurs l1 (r v1), HOccurs l1 (r v), HOccurs l (r v12), HOccurs l (r v8), HOccurs l (r v4), HOccurs l (r v), HDeleteAtLabel * r l3 v11 v12, HDeleteAtLabel * r l3 v7 v8, HDeleteAtLabel * r l3 v3 v', HDeleteAtLabel * r l3 v v4, HDeleteAtLabel * r l2 v10 v11, HDeleteAtLabel * r l2 v6 v'1, HDeleteAtLabel * r l2 v2 v3, HDeleteAtLabel * r l2 v v7, HDeleteAtLabel * r l1 v9 v'2, HDeleteAtLabel * r l1 v5 v6, HDeleteAtLabel * r l1 v1 v2, HDeleteAtLabel * r l1 v v10, HDeleteAtLabel * r l v12 v'3, HDeleteAtLabel * r l v8 v9, HDeleteAtLabel * r l v4 v5, HDeleteAtLabel * r l v v1) => r v -> (l, l1, l2, l3)
+ Data.HList.CommonMain: tipyTuple4 :: (HDeleteAtLabel * r a v v1, HDeleteAtLabel * r a v4 v5, HDeleteAtLabel * r a v8 v9, HDeleteAtLabel * r a v12 v'3, HDeleteAtLabel * r b v v10, HDeleteAtLabel * r b v1 v2, HDeleteAtLabel * r b v5 v6, HDeleteAtLabel * r b v9 v'2, HDeleteAtLabel * r c v v7, HDeleteAtLabel * r c v2 v3, HDeleteAtLabel * r c v6 v'1, HDeleteAtLabel * r c v10 v11, HDeleteAtLabel * r d v v4, HDeleteAtLabel * r d v3 v', HDeleteAtLabel * r d v7 v8, HDeleteAtLabel * r d v11 v12, HOccurs a (r v), HOccurs a (r v4), HOccurs a (r v8), HOccurs a (r v12), HOccurs b (r v), HOccurs b (r v1), HOccurs b (r v5), HOccurs b (r v9), HOccurs c (r v), HOccurs c (r v2), HOccurs c (r v6), HOccurs c (r v10), HOccurs d (r v), HOccurs d (r v3), HOccurs d (r v7), HOccurs d (r v11)) => r v -> (a, b, c, d)
- Data.HList.CommonMain: tipyTuple5 :: (HOccurs l4 (r v19), HOccurs l4 (r v14), HOccurs l4 (r v9), HOccurs l4 (r v4), HOccurs l4 (r v), HOccurs l3 (r v18), HOccurs l3 (r v13), HOccurs l3 (r v8), HOccurs l3 (r v3), HOccurs l3 (r v), HOccurs l2 (r v17), HOccurs l2 (r v12), HOccurs l2 (r v7), HOccurs l2 (r v2), HOccurs l2 (r v), HOccurs l1 (r v16), HOccurs l1 (r v11), HOccurs l1 (r v6), HOccurs l1 (r v1), HOccurs l1 (r v), HOccurs l (r v20), HOccurs l (r v15), HOccurs l (r v10), HOccurs l (r v5), HOccurs l (r v), HDeleteAtLabel * r l4 v19 v20, HDeleteAtLabel * r l4 v14 v15, HDeleteAtLabel * r l4 v9 v10, HDeleteAtLabel * r l4 v4 v', HDeleteAtLabel * r l4 v v5, HDeleteAtLabel * r l3 v18 v19, HDeleteAtLabel * r l3 v13 v14, HDeleteAtLabel * r l3 v8 v'1, HDeleteAtLabel * r l3 v3 v4, HDeleteAtLabel * r l3 v v9, HDeleteAtLabel * r l2 v17 v18, HDeleteAtLabel * r l2 v12 v'2, HDeleteAtLabel * r l2 v7 v8, HDeleteAtLabel * r l2 v2 v3, HDeleteAtLabel * r l2 v v13, HDeleteAtLabel * r l1 v16 v'3, HDeleteAtLabel * r l1 v11 v12, HDeleteAtLabel * r l1 v6 v7, HDeleteAtLabel * r l1 v1 v2, HDeleteAtLabel * r l1 v v17, HDeleteAtLabel * r l v20 v'4, HDeleteAtLabel * r l v15 v16, HDeleteAtLabel * r l v10 v11, HDeleteAtLabel * r l v5 v6, HDeleteAtLabel * r l v v1) => r v -> (l, l1, l2, l3, l4)
+ Data.HList.CommonMain: tipyTuple5 :: (HDeleteAtLabel * r a v v1, HDeleteAtLabel * r a v5 v6, HDeleteAtLabel * r a v10 v11, HDeleteAtLabel * r a v15 v16, HDeleteAtLabel * r a v20 v'4, HDeleteAtLabel * r b v v17, HDeleteAtLabel * r b v1 v2, HDeleteAtLabel * r b v6 v7, HDeleteAtLabel * r b v11 v12, HDeleteAtLabel * r b v16 v'3, HDeleteAtLabel * r c v v13, HDeleteAtLabel * r c v2 v3, HDeleteAtLabel * r c v7 v8, HDeleteAtLabel * r c v12 v'2, HDeleteAtLabel * r c v17 v18, HDeleteAtLabel * r d v v9, HDeleteAtLabel * r d v3 v4, HDeleteAtLabel * r d v8 v'1, HDeleteAtLabel * r d v13 v14, HDeleteAtLabel * r d v18 v19, HDeleteAtLabel * r e v v5, HDeleteAtLabel * r e v4 v', HDeleteAtLabel * r e v9 v10, HDeleteAtLabel * r e v14 v15, HDeleteAtLabel * r e v19 v20, HOccurs a (r v), HOccurs a (r v5), HOccurs a (r v10), HOccurs a (r v15), HOccurs a (r v20), HOccurs b (r v), HOccurs b (r v1), HOccurs b (r v6), HOccurs b (r v11), HOccurs b (r v16), HOccurs c (r v), HOccurs c (r v2), HOccurs c (r v7), HOccurs c (r v12), HOccurs c (r v17), HOccurs d (r v), HOccurs d (r v3), HOccurs d (r v8), HOccurs d (r v13), HOccurs d (r v18), HOccurs e (r v), HOccurs e (r v4), HOccurs e (r v9), HOccurs e (r v14), HOccurs e (r v19)) => r v -> (a, b, c, d, e)
- Data.HList.CommonMain: tipyUpdate :: (HUpdateAtLabel * record v v r r, SameLength' * * r r) => v -> record r -> record r
+ Data.HList.CommonMain: tipyUpdate :: (SameLength' * * r r, HUpdateAtLabel * record v v r r) => v -> record r -> record r
- Data.HList.CommonMain: typeIndexed' :: (TypeIndexed r tr, TagUntagFD (RecordValuesR s) (TagR (RecordValuesR s)), HLabelSet [*] (LabelsOf s), RecordValues s, HMapAux HList TaggedFn (RecordValuesR s) s, SameLength' * * (RecordValuesR s) (RecordValuesR s), SameLength' * * s s, SameLabels [*] [*] s s, HAllTaggedLV s, Profunctor p, Coercible [*] (TagR (RecordValuesR s)) s, Functor f) => p (tr (TagR (RecordValuesR s))) (f (tr (TagR (RecordValuesR s)))) -> p (r s) (f (r s))
+ Data.HList.CommonMain: typeIndexed' :: (Functor f, Profunctor p, HAllTaggedLV s, SameLabels [*] [*] s s, SameLength' * * s s, SameLength' * * (RecordValuesR s) (RecordValuesR s), HMapAux HList TaggedFn (RecordValuesR s) s, RecordValues s, HLabelSet [*] (LabelsOf s), TagUntagFD (RecordValuesR s) (TagR (RecordValuesR s)), TypeIndexed r tr, Coercible [*] (TagR (RecordValuesR s)) s) => p (tr (TagR (RecordValuesR s))) (f (tr (TagR (RecordValuesR s)))) -> p (r s) (f (r s))
- Data.HList.CommonMain: unboxed' :: (RecordValues x, HMapAux HList TaggedFn (RecordValuesR x) x, HList2List (RecordValuesR x) (GetElemTy x), HLengthEq1 HNat x n, HLengthEq2 HNat x n, SameLength' * * (HReplicateR * n ()) x, Profunctor p, IArray UArray (GetElemTy x), KnownNat (HNat2Nat n), Functor f) => p (RecordU x) (f (RecordU x)) -> p (Record x) (f (Record x))
+ Data.HList.CommonMain: unboxed' :: (Functor f, KnownNat (HNat2Nat n), IArray UArray (GetElemTy x), Profunctor p, SameLength' * * (HReplicateR * n ()) x, HLengthEq2 HNat x n, HLengthEq1 HNat x n, HList2List (RecordValuesR x) (GetElemTy x), HMapAux HList TaggedFn (RecordValuesR x) x, RecordValues x) => p (RecordU x) (f (RecordU x)) -> p (Record x) (f (Record x))
- Data.HList.CommonMain: unboxedS :: (HMapUnboxF g1 u1, HMapUnboxF g u, HConcatFD g1 x1, HMapAux HList UnboxF g u, HMapAux HList BoxF u1 g1, HGroupBy * EqTagValue x1 g1, HGroupBy * EqTagValue x g, SameLength' * * g1 u1, SameLength' * * g u, SameLength' * * u1 g1, SameLength' * * u g, Profunctor p, Functor f) => p (RecordUS x) (f (RecordUS x1)) -> p (Record x) (f (Record x1))
+ Data.HList.CommonMain: unboxedS :: (Functor f, Profunctor p, SameLength' * * u g, SameLength' * * u1 g1, SameLength' * * g u, SameLength' * * g1 u1, HGroupBy * EqTagValue x g, HGroupBy * EqTagValue x1 g1, HMapAux HList BoxF u1 g1, HMapAux HList UnboxF g u, HConcatFD g1 x1, HMapUnboxF g u, HMapUnboxF g1 u1) => p (RecordUS x) (f (RecordUS x1)) -> p (Record x) (f (Record x1))
- Data.HList.CommonMain: unboxedS' :: (HMapUnboxF g u, HConcatFD g x, HMapAux HList UnboxF g u, HMapAux HList BoxF u g, HGroupBy * EqTagValue x g, SameLength' * * g u, SameLength' * * u g, Profunctor p, Functor f) => p (RecordUS x) (f (RecordUS x)) -> p (Record x) (f (Record x))
+ Data.HList.CommonMain: unboxedS' :: (Functor f, Profunctor p, SameLength' * * u g, SameLength' * * g u, HGroupBy * EqTagValue x g, HMapAux HList BoxF u g, HMapAux HList UnboxF g u, HConcatFD g x, HMapUnboxF g u) => p (RecordUS x) (f (RecordUS x)) -> p (Record x) (f (Record x))
- Data.HList.CommonMain: unvarianted' :: (HAllEqVal ((:) * (Tagged * () b) s) b1, HAllEqVal s b1, HAllEqVal' ((:) * (Tagged * () b) s), Unvariant1 Bool b1 s b, SameLength' * * s s, SameLabels [*] [*] s s, Functor f) => (b -> f b) -> Variant s -> f (Variant s)
+ Data.HList.CommonMain: unvarianted' :: (Functor f, SameLabels [*] [*] s s, SameLength' * * s s, Unvariant1 Bool b s a, HAllEqVal' ((:) * (Tagged * () a) s), HAllEqVal s b, HAllEqVal ((:) * (Tagged * () a) s) b) => (a -> f a) -> Variant s -> f (Variant s)
- Data.HList.Data: type DataHListFlatCxt na g a = (HBuild' [] g, Typeable (HListFlat a), TypeablePolyK a, HFoldl (GfoldlK C) (C g) a (C (HList a)), HFoldr (GunfoldK C) (C g) (HReplicateR na ()) (C (HList a)), HLengthEq a na, HReplicate na ())
+ Data.HList.Data: type DataHListFlatCxt na g a = (HBuild' '[] g, Typeable (HListFlat a), TypeablePolyK a, HFoldl (GfoldlK C) (C g) a (C (HList a)), HFoldr (GunfoldK C) (C g) (HReplicateR na ()) (C (HList a)), HLengthEq a na, HReplicate na ())
- Data.HList.HArray: hProjectAwayByHNats :: (HUnfoldFD (FHUProj False ns) (ApplyR (FHUProj False ns) (t, Proxy HNat HZero)) z, Apply (FHUProj False ns) (t, Proxy HNat HZero)) => Proxy [HNat] ns -> t -> HList z
+ Data.HList.HArray: hProjectAwayByHNats :: (Apply (FHUProj False ns) (t, Proxy HNat HZero), HUnfoldFD (FHUProj False ns) (ApplyR (FHUProj False ns) (t, Proxy HNat HZero)) z) => Proxy [HNat] ns -> t -> HList z
- Data.HList.HArray: hProjectByHNats :: (HUnfoldFD (FHUProj True ns) (ApplyR (FHUProj True ns) (t, Proxy HNat HZero)) z, Apply (FHUProj True ns) (t, Proxy HNat HZero)) => Proxy [HNat] ns -> t -> HList z
+ Data.HList.HArray: hProjectByHNats :: (Apply (FHUProj True ns) (t, Proxy HNat HZero), HUnfoldFD (FHUProj True ns) (ApplyR (FHUProj True ns) (t, Proxy HNat HZero)) z) => Proxy [HNat] ns -> t -> HList z
- Data.HList.HArray: hProjectByHNats' :: (HMapAux r (FHLookupByHNat l) a b, SameLength' * * b a, SameLength' * * a b) => r a -> HList l -> r b
+ Data.HList.HArray: hProjectByHNats' :: (SameLength' * * a b, SameLength' * * b a, HMapAux r (FHLookupByHNat l) a b) => r a -> HList l -> r b
- Data.HList.HArray: hSplitByHNats :: (HUnfoldFD (FHUProj True ns) (ApplyR (FHUProj True ns) (t, Proxy HNat HZero)) z, HUnfoldFD (FHUProj False ns) (ApplyR (FHUProj False ns) (t, Proxy HNat HZero)) z1, Apply (FHUProj True ns) (t, Proxy HNat HZero), Apply (FHUProj False ns) (t, Proxy HNat HZero)) => Proxy [HNat] ns -> t -> (HList z, HList z1)
+ Data.HList.HArray: hSplitByHNats :: (Apply (FHUProj False ns) (t, Proxy HNat HZero), Apply (FHUProj True ns) (t, Proxy HNat HZero), HUnfoldFD (FHUProj False ns) (ApplyR (FHUProj False ns) (t, Proxy HNat HZero)) z1, HUnfoldFD (FHUProj True ns) (ApplyR (FHUProj True ns) (t, Proxy HNat HZero)) z) => Proxy [HNat] ns -> t -> (HList z, HList z1)
- Data.HList.HCurry: hCompose :: (HCurry' n2 f2 xs1 r, HCurry' n1 f1 xs x, HCurry' n f xsys r, HSplitAt1 ([] *) n1 xsys xs xs1, HAppendList1 * xs xs1 xsys, ArityFwd f2 n2, ArityFwd f1 n1, ArityRev f2 n2, ArityRev f1 n1) => (x -> f2) -> f1 -> f
+ Data.HList.HCurry: hCompose :: (ArityRev f1 n1, ArityRev f2 n2, ArityFwd f1 n1, ArityFwd f2 n2, HAppendList1 * xs xs1 xsys, HSplitAt1 ([] *) n1 xsys xs xs1, HCurry' n f xsys r, HCurry' n1 f1 xs x, HCurry' n2 f2 xs1 r) => (x -> f2) -> f1 -> f
- Data.HList.HCurry: hCurry :: (HCurry' n f xs r, ArityFwd f n, ArityRev f n) => (HList xs -> r) -> f
+ Data.HList.HCurry: hCurry :: (ArityRev f n, ArityFwd f n, HCurry' n f xs r) => (HList xs -> r) -> f
- Data.HList.HCurry: hUncurry :: (HCurry' n f xs r, ArityFwd f n, ArityRev f n) => f -> HList xs -> r
+ Data.HList.HCurry: hUncurry :: (ArityRev f n, ArityFwd f n, HCurry' n f xs r) => f -> HList xs -> r
- Data.HList.HList: class FromHJustR (ToHJustR l) ~ l => FromHJust l where type family FromHJustR l :: [*]
+ Data.HList.HList: class (FromHJustR (ToHJustR l) ~ l) => FromHJust l where type family FromHJustR l :: [*]
- Data.HList.HList: fromHJust2 :: HMapCxt r HFromJust a b => r a -> r b
+ Data.HList.HList: fromHJust2 :: (HMapCxt r HFromJust a b) => r a -> r b
- Data.HList.HList: hAddTag :: (HMapAux r (HAddTag t) a b, SameLength' * * b a, SameLength' * * a b) => t -> r a -> r b
+ Data.HList.HList: hAddTag :: (SameLength' * * a b, SameLength' * * b a, HMapAux r (HAddTag t) a b) => t -> r a -> r b
- Data.HList.HList: hAppend' :: HFoldr FHCons v l r => HList l -> v -> r
+ Data.HList.HList: hAppend' :: (HFoldr FHCons v l r) => HList l -> v -> r
- Data.HList.HList: hBuild :: HBuild' [] r => r
+ Data.HList.HList: hBuild :: (HBuild' '[] r) => r
- Data.HList.HList: hComposeList :: HFoldr Comp (a -> a) l (t -> a) => HList l -> t -> a
+ Data.HList.HList: hComposeList :: (HFoldr Comp (a -> a) l (t -> a)) => HList l -> t -> a
- Data.HList.HList: hFlag :: (HMapAux r (HAddTag (Proxy Bool True)) a b, SameLength' * * b a, SameLength' * * a b) => r a -> r b
+ Data.HList.HList: hFlag :: (SameLength' * * a b, SameLength' * * b a, HMapAux r (HAddTag (Proxy Bool True)) a b) => r a -> r b
- Data.HList.HList: hMap :: (HMapAux r f a b, SameLength' * * b a, SameLength' * * a b) => f -> r a -> r b
+ Data.HList.HList: hMap :: (SameLength' * * a b, SameLength' * * b a, HMapAux r f a b) => f -> r a -> r b
- Data.HList.HList: hMapL :: (HMapAux HList f a b, SameLength' * * b a, SameLength' * * a b) => f -> HList a -> HList b
+ Data.HList.HList: hMapL :: (SameLength' * * a b, SameLength' * * b a, HMapAux HList f a b) => f -> HList a -> HList b
- Data.HList.HList: hMapMapCar :: HFoldr (MapCar f) (HList []) l l' => f -> HList l -> l'
+ Data.HList.HList: hMapMapCar :: (HFoldr (MapCar f) (HList '[]) l l') => f -> HList l -> l'
- Data.HList.HList: hRmTag :: (HMapAux r HRmTag a b, SameLength' * * b a, SameLength' * * a b) => r a -> r b
+ Data.HList.HList: hRmTag :: (SameLength' * * a b, SameLength' * * b a, HMapAux r HRmTag a b) => r a -> r b
- Data.HList.HList: hSequence2 :: (HFoldr (LiftA2 FHCons) (f (HList ([] *))) l (f a), Applicative f) => HList l -> f a
+ Data.HList.HList: hSequence2 :: (Applicative f, HFoldr (LiftA2 FHCons) (f (HList ([] *))) l (f a)) => HList l -> f a
- Data.HList.HList: hTuple :: (HTuple v1 b, HTuple v a, Profunctor p, Functor f) => p a (f b) -> p (HList v) (f (HList v1))
+ Data.HList.HList: hTuple :: (Functor f, Profunctor p, HTuple v a, HTuple v1 t) => p a (f t) -> p (HList v) (f (HList v1))
- Data.HList.HList: hTuple' :: (HTuple v b, Profunctor p, Functor f) => p b (f b) -> p (HList v) (f (HList v))
+ Data.HList.HList: hTuple' :: (Functor f, Profunctor p, HTuple v t) => p t (f t) -> p (HList v) (f (HList v))
- Data.HList.HList: hUnfold :: (HUnfoldFD f (ApplyR f a) z, Apply f a) => f -> a -> HList z
+ Data.HList.HList: hUnfold :: (Apply f a, HUnfoldFD f (ApplyR f a) z) => f -> a -> HList z
- Data.HList.HList: listAsHList :: (HList2List l1 e1, HList2List l e, Choice p, Applicative f) => p (HList l1) (f (HList l)) -> p [e1] (f [e])
+ Data.HList.HList: listAsHList :: (Applicative f, Choice p, HList2List l e, HList2List l1 e1) => p (HList l1) (f (HList l)) -> p [e1] (f [e])
- Data.HList.HList: listAsHList' :: (HList2List l e, Choice p, Applicative f) => p (HList l) (f (HList l)) -> p [e] (f [e])
+ Data.HList.HList: listAsHList' :: (Applicative f, Choice p, HList2List l e) => p (HList l) (f (HList l)) -> p [e] (f [e])
- Data.HList.HOccurs: hOccursRest :: (HOccurs l (r v), HDeleteAtLabel * r l v v') => r v -> (l, r v')
+ Data.HList.HOccurs: hOccursRest :: (HDeleteAtLabel * r l v v', HOccurs l (r v)) => r v -> (l, r v')
- Data.HList.HSort: hMerge1 :: (HCond t2 y x t, HCond t2 x y t1) => Proxy Bool t2 -> y -> x -> (t, t1)
+ Data.HList.HSort: hMerge1 :: (HCond t2 x y t1, HCond t2 y x t) => Proxy Bool t2 -> y -> x -> (t, t1)
- Data.HList.HTypeIndexed: hDeleteAt :: (HDeleteAtHNat n l, HType2HNat * e l n) => proxy1 e -> HList l -> HList (HDeleteAtHNatR n l)
+ Data.HList.HTypeIndexed: hDeleteAt :: (HType2HNat * e l n, HDeleteAtHNat n l) => proxy1 e -> HList l -> HList (HDeleteAtHNatR n l)
- Data.HList.HTypeIndexed: hProjectBy :: (HUnfoldFD (FHUProj True ns) (ApplyR (FHUProj True ns) (hlist l, Proxy HNat HZero)) z, HTypes2HNats [*] k es l ns, Apply (FHUProj True ns) (hlist l, Proxy HNat HZero)) => Proxy [*] es -> hlist l -> HList z
+ Data.HList.HTypeIndexed: hProjectBy :: (Apply (FHUProj True ns) (hlist l, Proxy HNat HZero), HTypes2HNats [*] k es l ns, HUnfoldFD (FHUProj True ns) (ApplyR (FHUProj True ns) (hlist l, Proxy HNat HZero)) z) => Proxy [*] es -> hlist l -> HList z
- Data.HList.HTypeIndexed: hSplitBy :: (HUnfoldFD (FHUProj True ns) (ApplyR (FHUProj True ns) (hlist l, Proxy HNat HZero)) z, HUnfoldFD (FHUProj False ns) (ApplyR (FHUProj False ns) (hlist l, Proxy HNat HZero)) z1, HTypes2HNats [*] k es l ns, Apply (FHUProj True ns) (hlist l, Proxy HNat HZero), Apply (FHUProj False ns) (hlist l, Proxy HNat HZero)) => Proxy [*] es -> hlist l -> (HList z, HList z1)
+ Data.HList.HTypeIndexed: hSplitBy :: (Apply (FHUProj False ns) (hlist l, Proxy HNat HZero), Apply (FHUProj True ns) (hlist l, Proxy HNat HZero), HTypes2HNats [*] k es l ns, HUnfoldFD (FHUProj False ns) (ApplyR (FHUProj False ns) (hlist l, Proxy HNat HZero)) z1, HUnfoldFD (FHUProj True ns) (ApplyR (FHUProj True ns) (hlist l, Proxy HNat HZero)) z) => Proxy [*] es -> hlist l -> (HList z, HList z1)
- Data.HList.HTypeIndexed: hUpdateAt :: (HUpdateAtHNat n e l, HType2HNat * e l n) => e -> HList l -> HList (HUpdateAtHNatR n e l)
+ Data.HList.HTypeIndexed: hUpdateAt :: (HType2HNat * e l n, HUpdateAtHNat n e l) => e -> HList l -> HList (HUpdateAtHNatR n e l)
- Data.HList.HZip: hTranspose :: (HZip3 a b c, HFoldr HZipF (HList es) l (HList b), HReplicateFD n (HList ([] *)) es, HLengthEq1 HNat a n, HLengthEq2 HNat a n, SameLength' * * (HReplicateR * n ()) a) => HList ((:) * (HList a) l) -> HList c
+ Data.HList.HZip: hTranspose :: (SameLength' * * (HReplicateR * n ()) a, HLengthEq2 HNat a n, HLengthEq1 HNat a n, HReplicateFD n (HList ([] *)) es, HFoldr HZipF (HList es) l (HList b), HZip3 a b c) => HList ((:) * (HList a) l) -> HList c
- Data.HList.Keyword: reflect_fk :: ReflectFK fn kws => fn -> Arg kws []
+ Data.HList.Keyword: reflect_fk :: (ReflectFK fn kws) => fn -> Arg kws '[]
- Data.HList.Labelable: type LabeledCxt1 s t a b = (s ~ [], t ~ [], a ~ (), b ~ ())
+ Data.HList.Labelable: type LabeledCxt1 s t a b = (s ~ '[], t ~ '[], a ~ (), b ~ ())
- Data.HList.Record: (.!.) :: HasField l r v => r -> Label l -> v
+ Data.HList.Record: (.!.) :: (HasField l r v) => r -> Label l -> v
- Data.HList.Record: (.-.) :: HDeleteAtLabel r l xs xs' => r xs -> Label l -> r xs'
+ Data.HList.Record: (.-.) :: (HDeleteAtLabel r l xs xs') => r xs -> Label l -> r xs'
- Data.HList.Record: (.<++.) :: HLeftUnion r r' r'' => Record r -> Record r' -> Record r''
+ Data.HList.Record: (.<++.) :: (HLeftUnion r r' r'') => Record r -> Record r' -> Record r''
- Data.HList.Record: (.<.) :: (HUpdateAtLabel k record l v r r, SameLength' * * r r) => Tagged k l v -> record r -> record r
+ Data.HList.Record: (.<.) :: (SameLength' * * r r, HUpdateAtLabel k record l v r r) => Tagged k l v -> record r -> record r
- Data.HList.Record: (.@.) :: (HUpdateAtLabel k record l v r r', SameLength' * * r' r, SameLength' * * r r') => Tagged k l v -> record r -> record r'
+ Data.HList.Record: (.@.) :: (SameLength' * * r r', SameLength' * * r' r, HUpdateAtLabel k record l v r r') => Tagged k l v -> record r -> record r'
- Data.HList.Record: emptyRecord :: Record []
+ Data.HList.Record: emptyRecord :: Record '[]
- Data.HList.Record: hListRecord :: (HLabelSet [*] (LabelsOf r), HAllTaggedLV r, Profunctor p, Functor f) => p (Record r) (f (Record t)) -> p (HList r) (f (HList t))
+ Data.HList.Record: hListRecord :: (Functor f, Profunctor p, HAllTaggedLV r, HLabelSet [*] (LabelsOf r)) => p (Record r) (f (Record t)) -> p (HList r) (f (HList t))
- Data.HList.Record: hListRecord' :: (Profunctor p, Functor f) => p (Record r) (f (Record r)) -> p (HList r) (f (HList r))
+ Data.HList.Record: hListRecord' :: (Functor f, Profunctor p) => p (Record r) (f (Record r)) -> p (HList r) (f (HList r))
- Data.HList.Record: hMapR :: (HMapAux HList (HFmap f) x y, SameLength' * * y x, SameLength' * * x y) => f -> Record x -> Record y
+ Data.HList.Record: hMapR :: (SameLength' * * x y, SameLength' * * y x, HMapAux HList (HFmap f) x y) => f -> Record x -> Record y
- Data.HList.Record: hProjectByLabels' :: (HLabelSet [*] (LabelsOf l), HLabelSet [*] (LabelsOf r), H2ProjectByLabels (LabelsOf l) t r b, HRearrange3 (LabelsOf l) r l, SameLength' * * (LabelsOf l) r, SameLength' * * l r, SameLength' * * r (LabelsOf l), SameLength' * * r l, HAllTaggedLV r) => Record t -> Record l
+ Data.HList.Record: hProjectByLabels' :: (HAllTaggedLV r, SameLength' * * r l, SameLength' * * r (LabelsOf l), SameLength' * * l r, SameLength' * * (LabelsOf l) r, HRearrange3 (LabelsOf l) r l, H2ProjectByLabels (LabelsOf l) t r b, HLabelSet [*] (LabelsOf l), HLabelSet [*] (LabelsOf r)) => Record t -> Record l
- Data.HList.Record: hRearrange' :: (HLabelSet [*] (LabelsOf l), HRearrange3 (LabelsOf l) r l, SameLength' * * (LabelsOf l) r, SameLength' * * l r, SameLength' * * r (LabelsOf l), SameLength' * * r l) => Record r -> Record l
+ Data.HList.Record: hRearrange' :: (SameLength' * * r l, SameLength' * * r (LabelsOf l), SameLength' * * l r, SameLength' * * (LabelsOf l) r, HRearrange3 (LabelsOf l) r l, HLabelSet [*] (LabelsOf l)) => Record r -> Record l
- Data.HList.Record: hRenameLabel :: (HasField k l (r v) v1, HExtend (Tagged k1 l1 v1) (r v'), HDeleteAtLabel k r l v v') => Label k l -> Label k1 l1 -> r v -> HExtendR (Tagged k1 l1 v1) (r v')
+ Data.HList.Record: hRenameLabel :: (HDeleteAtLabel k r l v v', HExtend (Tagged k1 l1 v1) (r v'), HasField k l (r v) v1) => Label k l -> Label k1 l1 -> r v -> HExtendR (Tagged k1 l1 v1) (r v')
- Data.HList.Record: hUnzipRecord2 :: (RecordValues y, RecordValues x1, RecordValues x, HMapAux HList TaggedFn (RecordValuesR x) x, HMapAux HList TaggedFn (RecordValuesR x1) x1, HZipList (RecordValuesR x) (RecordValuesR x1) (RecordValuesR y), SameLength' * * y x1, SameLength' * * y x, SameLength' * * x1 y, SameLength' * * x y, SameLabels [*] [*] x1 y, SameLabels [*] [*] x y, HAllTaggedLV x1, HAllTaggedLV x) => Record y -> (Record x, Record x1)
+ Data.HList.Record: hUnzipRecord2 :: (HAllTaggedLV x, HAllTaggedLV x1, SameLabels [*] [*] x y, SameLabels [*] [*] x1 y, SameLength' * * x y, SameLength' * * x1 y, SameLength' * * y x, SameLength' * * y x1, HZipList (RecordValuesR x) (RecordValuesR x1) (RecordValuesR y), HMapAux HList TaggedFn (RecordValuesR x) x, HMapAux HList TaggedFn (RecordValuesR x1) x1, RecordValues x, RecordValues x1, RecordValues y) => Record y -> (Record x, Record x1)
- Data.HList.Record: hZipRecord2 :: (RecordValues y1, RecordValues y, RecordValues x, HMapAux HList TaggedFn (RecordValuesR x) x, HZipList (RecordValuesR y1) (RecordValuesR y) (RecordValuesR x), SameLength' * * y1 x, SameLength' * * y x, SameLength' * * x y1, SameLength' * * x y, SameLabels [*] [*] x y1, SameLabels [*] [*] x y, HAllTaggedLV x) => Record y1 -> Record y -> Record x
+ Data.HList.Record: hZipRecord2 :: (HAllTaggedLV x, SameLabels [*] [*] x y, SameLabels [*] [*] x y1, SameLength' * * x y, SameLength' * * x y1, SameLength' * * y x, SameLength' * * y1 x, HZipList (RecordValuesR y1) (RecordValuesR y) (RecordValuesR x), HMapAux HList TaggedFn (RecordValuesR x) x, RecordValues x, RecordValues y, RecordValues y1) => Record y1 -> Record y -> Record x
- Data.HList.Record: rearranged' :: (Rearranged k r s s b b, Profunctor p, Functor f) => p (r b) (f (r b)) -> p (r s) (f (r s))
+ Data.HList.Record: rearranged' :: (Functor f, Profunctor p, Rearranged k r s s b b) => p (r b) (f (r b)) -> p (r s) (f (r s))
- Data.HList.Record: relabeled' :: (Relabeled r, RecordValues b, RecordValues a, RecordValues s, HMapAux HList TaggedFn (RecordValuesR s) a, HMapAux HList TaggedFn (RecordValuesR s) s, SameLength' * * (RecordValuesR s) a, SameLength' * * b s, SameLength' * * a (RecordValuesR s), SameLength' * * a s, SameLength' * * s b, SameLength' * * s a, Profunctor p, Functor f, (~) [*] (RecordValuesR b) (RecordValuesR s), (~) [*] (RecordValuesR a) (RecordValuesR s)) => p (r a) (f (r b)) -> p (r s) (f (r s))
+ Data.HList.Record: relabeled' :: (Functor f, Profunctor p, SameLength' * * s a, SameLength' * * s b, SameLength' * * s (RecordValuesR b), SameLength' * * a s, SameLength' * * a (RecordValuesR s), SameLength' * * b s, SameLength' * * (RecordValuesR b) s, SameLength' * * (RecordValuesR s) a, HMapAux HList TaggedFn (RecordValuesR b) s, HMapAux HList TaggedFn (RecordValuesR s) a, RecordValues s, RecordValues a, RecordValues b, Relabeled r, (~) [*] (RecordValuesR s) (RecordValuesR a), (~) [*] (RecordValuesR s) (RecordValuesR b)) => p (r a) (f (r b)) -> p (r s) (f (r s))
- Data.HList.Record: unlabeled0 :: (RecordValues y, RecordValues x, HMapAux HList TaggedFn (RecordValuesR y) y, SameLabels [*] [*] x y, Profunctor p, Functor f) => p (HList (RecordValuesR x)) (f (HList (RecordValuesR y))) -> p (Record x) (f (Record y))
+ Data.HList.Record: unlabeled0 :: (Functor f, Profunctor p, SameLabels [*] [*] r y, HMapAux HList TaggedFn (RecordValuesR y) y, RecordValues y, RecordValues r) => p (HList (RecordValuesR r)) (f (HList (RecordValuesR y))) -> p (Record r) (f (Record y))
- Data.HList.RecordU: recordUS :: (HMapUnboxF g1 u1, HMapUnboxF g u, HGroupBy * EqTagValue x1 g1, HGroupBy * EqTagValue x g, Profunctor p, Functor f) => p (RecordUS x) (f (RecordUS x1)) -> p (HList u) (f (HList u1))
+ Data.HList.RecordU: recordUS :: (Functor f, Profunctor p, HGroupBy * EqTagValue x g, HGroupBy * EqTagValue x1 g1, HMapUnboxF g u, HMapUnboxF g1 u1) => p (RecordUS x) (f (RecordUS x1)) -> p (HList u) (f (HList u1))
- Data.HList.RecordU: recordUS' :: (HMapUnboxF g u, HGroupBy * EqTagValue x g, Profunctor p, Functor f) => p (RecordUS x) (f (RecordUS x)) -> p (HList u) (f (HList u))
+ Data.HList.RecordU: recordUS' :: (Functor f, Profunctor p, HGroupBy * EqTagValue x g, HMapUnboxF g u) => p (RecordUS x) (f (RecordUS x)) -> p (HList u) (f (HList u))
- Data.HList.RecordU: unboxed' :: (RecordValues x, HMapAux HList TaggedFn (RecordValuesR x) x, HList2List (RecordValuesR x) (GetElemTy x), HLengthEq1 HNat x n, HLengthEq2 HNat x n, SameLength' * * (HReplicateR * n ()) x, Profunctor p, IArray UArray (GetElemTy x), KnownNat (HNat2Nat n), Functor f) => p (RecordU x) (f (RecordU x)) -> p (Record x) (f (Record x))
+ Data.HList.RecordU: unboxed' :: (Functor f, KnownNat (HNat2Nat n), IArray UArray (GetElemTy x), Profunctor p, SameLength' * * (HReplicateR * n ()) x, HLengthEq2 HNat x n, HLengthEq1 HNat x n, HList2List (RecordValuesR x) (GetElemTy x), HMapAux HList TaggedFn (RecordValuesR x) x, RecordValues x) => p (RecordU x) (f (RecordU x)) -> p (Record x) (f (Record x))
- Data.HList.RecordU: unboxedS :: (HMapUnboxF g1 u1, HMapUnboxF g u, HConcatFD g1 x1, HMapAux HList UnboxF g u, HMapAux HList BoxF u1 g1, HGroupBy * EqTagValue x1 g1, HGroupBy * EqTagValue x g, SameLength' * * g1 u1, SameLength' * * g u, SameLength' * * u1 g1, SameLength' * * u g, Profunctor p, Functor f) => p (RecordUS x) (f (RecordUS x1)) -> p (Record x) (f (Record x1))
+ Data.HList.RecordU: unboxedS :: (Functor f, Profunctor p, SameLength' * * u g, SameLength' * * u1 g1, SameLength' * * g u, SameLength' * * g1 u1, HGroupBy * EqTagValue x g, HGroupBy * EqTagValue x1 g1, HMapAux HList BoxF u1 g1, HMapAux HList UnboxF g u, HConcatFD g1 x1, HMapUnboxF g u, HMapUnboxF g1 u1) => p (RecordUS x) (f (RecordUS x1)) -> p (Record x) (f (Record x1))
- Data.HList.RecordU: unboxedS' :: (HMapUnboxF g u, HConcatFD g x, HMapAux HList UnboxF g u, HMapAux HList BoxF u g, HGroupBy * EqTagValue x g, SameLength' * * g u, SameLength' * * u g, Profunctor p, Functor f) => p (RecordUS x) (f (RecordUS x)) -> p (Record x) (f (Record x))
+ Data.HList.RecordU: unboxedS' :: (Functor f, Profunctor p, SameLength' * * u g, SameLength' * * g u, HGroupBy * EqTagValue x g, HMapAux HList BoxF u g, HMapAux HList UnboxF g u, HConcatFD g x, HMapUnboxF g u) => p (RecordUS x) (f (RecordUS x)) -> p (Record x) (f (Record x))
- Data.HList.TIC: mkTIC :: (HAllTaggedEq l, HLabelSet [*] (LabelsOf l), HasField * i (Record l) i, HFind1 * i (UnLabel * i (LabelsOf l)) n, HAllTaggedLV l, KnownNat (HNat2Nat n)) => i -> TIC l
+ Data.HList.TIC: mkTIC :: (KnownNat (HNat2Nat n), HAllTaggedLV l, HFind1 * i (UnLabel * i (LabelsOf l)) n, HasField * i (Record l) i, HLabelSet [*] (LabelsOf l), HAllTaggedEq l) => i -> TIC l
- Data.HList.TIC: ticVariant :: (Profunctor p, Functor f) => p (Variant t) (f (Variant l)) -> p (TIC t) (f (TIC l))
+ Data.HList.TIC: ticVariant :: (Functor f, Profunctor p) => p (Variant t) (f (Variant l)) -> p (TIC t) (f (TIC l))
- Data.HList.TIC: ticVariant' :: (Profunctor p, Functor f) => p (Variant t) (f (Variant t)) -> p (TIC t) (f (TIC t))
+ Data.HList.TIC: ticVariant' :: (Functor f, Profunctor p) => p (Variant t) (f (Variant t)) -> p (TIC t) (f (TIC t))
- Data.HList.TIC: typeIndexed' :: (TypeIndexed r tr, TagUntagFD (RecordValuesR s) (TagR (RecordValuesR s)), HLabelSet [*] (LabelsOf s), RecordValues s, HMapAux HList TaggedFn (RecordValuesR s) s, SameLength' * * (RecordValuesR s) (RecordValuesR s), SameLength' * * s s, SameLabels [*] [*] s s, HAllTaggedLV s, Profunctor p, Coercible [*] (TagR (RecordValuesR s)) s, Functor f) => p (tr (TagR (RecordValuesR s))) (f (tr (TagR (RecordValuesR s)))) -> p (r s) (f (r s))
+ Data.HList.TIC: typeIndexed' :: (Functor f, Profunctor p, HAllTaggedLV s, SameLabels [*] [*] s s, SameLength' * * s s, SameLength' * * (RecordValuesR s) (RecordValuesR s), HMapAux HList TaggedFn (RecordValuesR s) s, RecordValues s, HLabelSet [*] (LabelsOf s), TagUntagFD (RecordValuesR s) (TagR (RecordValuesR s)), TypeIndexed r tr, Coercible [*] (TagR (RecordValuesR s)) s) => p (tr (TagR (RecordValuesR s))) (f (tr (TagR (RecordValuesR s)))) -> p (r s) (f (r s))
- Data.HList.TIP: emptyTIP :: TIP []
+ Data.HList.TIP: emptyTIP :: TIP '[]
- Data.HList.TIP: hUnzipTIP :: (HAllTaggedEq l2, HAllTaggedEq l1, TagUntagFD a1 l2, TagUntagFD a l1, TagUntagFD l ta, HLabelSet [*] (LabelsOf l1), HLabelSet [*] (LabelsOf l2), HZipList a a1 l, HAllTaggedLV l2, HAllTaggedLV l1) => TIP ta -> (TIP l1, TIP l2)
+ Data.HList.TIP: hUnzipTIP :: (HAllTaggedLV l1, HAllTaggedLV l2, HZipList a a1 l, HLabelSet [*] (LabelsOf l1), HLabelSet [*] (LabelsOf l2), TagUntagFD l ta, TagUntagFD a l1, TagUntagFD a1 l2, HAllTaggedEq l1, HAllTaggedEq l2) => TIP ta -> (TIP l1, TIP l2)
- Data.HList.TIP: hZipTIP :: (TagUntagFD y ta1, TagUntagFD x ta, TagUntagFD a l, HZipList x y a) => TIP ta -> TIP ta1 -> TIP l
+ Data.HList.TIP: hZipTIP :: (HZipList x y a, TagUntagFD a l, TagUntagFD x ta, TagUntagFD y ta1) => TIP ta -> TIP ta1 -> TIP l
- Data.HList.TIP: onRecord :: (HAllTaggedEq l, HLabelSet [*] (LabelsOf l), HAllTaggedLV l) => (Record r -> Record l) -> TIP r -> TIP l
+ Data.HList.TIP: onRecord :: (HAllTaggedLV l, HLabelSet [*] (LabelsOf l), HAllTaggedEq l) => (Record r -> Record l) -> TIP r -> TIP l
- Data.HList.TIP: tipHList :: (TagUntagFD a1 l, TagUntagFD a ta, Profunctor p, Functor f) => p (HList a) (f (HList a1)) -> p (TIP ta) (f (TIP l))
+ Data.HList.TIP: tipHList :: (Functor f, Profunctor p, TagUntagFD a ta, TagUntagFD a1 l) => p (HList a) (f (HList a1)) -> p (TIP ta) (f (TIP l))
- Data.HList.TIP: tipHList' :: (TagUntagFD a ta, Profunctor p, Functor f) => p (HList a) (f (HList a)) -> p (TIP ta) (f (TIP ta))
+ Data.HList.TIP: tipHList' :: (Functor f, Profunctor p, TagUntagFD a ta) => p (HList a) (f (HList a)) -> p (TIP ta) (f (TIP ta))
- Data.HList.TIP: tipRecord :: (Profunctor p, Functor f) => p (Record r) (f (Record l)) -> p (TIP r) (f (TIP l))
+ Data.HList.TIP: tipRecord :: (Functor f, Profunctor p) => p (Record r) (f (Record l)) -> p (TIP r) (f (TIP l))
- Data.HList.TIP: tipRecord' :: (Profunctor p, Functor f) => p (Record r) (f (Record r)) -> p (TIP r) (f (TIP r))
+ Data.HList.TIP: tipRecord' :: (Functor f, Profunctor p) => p (Record r) (f (Record r)) -> p (TIP r) (f (TIP r))
- Data.HList.TIP: tipyLens :: (HAllTaggedEq t, HAllTaggedEq s, HLabelSet [*] (LabelsOf t), HLabelSet [*] (LabelsOf s), HasField * b (Record t) b, HasField * b (Record s) b, HUpdateAtLabel2 * b b t s, HUpdateAtLabel2 * b b s t, SameLength' * * t s, SameLength' * * s t, SameLabels [*] [*] s t, HAllTaggedLV t, HAllTaggedLV s, Functor f) => (b -> f b) -> TIP s -> f (TIP t)
+ Data.HList.TIP: tipyLens :: (Functor f, HAllTaggedLV s, HAllTaggedLV t, SameLabels [*] [*] s t, SameLength' * * s t, SameLength' * * t s, HUpdateAtLabel2 * a a s t, HUpdateAtLabel2 * a a t s, HasField * a (Record s) a, HasField * a (Record t) a, HLabelSet [*] (LabelsOf t), HLabelSet [*] (LabelsOf s), HAllTaggedEq s, HAllTaggedEq t) => (a -> f a) -> TIP s -> f (TIP t)
- Data.HList.TIP: tipyLens' :: (HAllTaggedEq t, HLabelSet [*] (LabelsOf t), HasField * b (Record t) b, HUpdateAtLabel2 * b b t t, SameLength' * * t t, SameLabels [*] [*] t t, HAllTaggedLV t, Functor f) => (b -> f b) -> TIP t -> f (TIP t)
+ Data.HList.TIP: tipyLens' :: (Functor f, HAllTaggedLV a, SameLabels [*] [*] a a, SameLength' * * a a, HUpdateAtLabel2 * b b a a, HasField * b (Record a) b, HLabelSet [*] (LabelsOf a), HAllTaggedEq a) => (b -> f b) -> TIP a -> f (TIP a)
- Data.HList.TIP: tipyProject :: (HAllTaggedEq l, HLabelSet [*] (LabelsOf l), H2ProjectByLabels ls r l b, HAllTaggedLV l) => proxy ls -> TIP r -> TIP l
+ Data.HList.TIP: tipyProject :: (HAllTaggedLV l, H2ProjectByLabels ls t l b, HLabelSet [*] (LabelsOf l), HAllTaggedEq l) => proxy ls -> TIP t -> TIP l
- Data.HList.TIP: tipyProject2 :: (HAllTaggedEq l1, HAllTaggedEq l, HLabelSet [*] (LabelsOf l), HLabelSet [*] (LabelsOf l1), H2ProjectByLabels ls r l l1, HAllTaggedLV l1, HAllTaggedLV l) => proxy ls -> TIP r -> (TIP l, TIP l1)
+ Data.HList.TIP: tipyProject2 :: (HAllTaggedLV l, HAllTaggedLV l1, H2ProjectByLabels ls r l l1, HLabelSet [*] (LabelsOf l), HLabelSet [*] (LabelsOf l1), HAllTaggedEq l, HAllTaggedEq l1) => proxy ls -> TIP r -> (TIP l, TIP l1)
- Data.HList.TIP: tipyUpdate :: (HUpdateAtLabel * record v v r r, SameLength' * * r r) => v -> record r -> record r
+ Data.HList.TIP: tipyUpdate :: (SameLength' * * r r, HUpdateAtLabel * record v v r r) => v -> record r -> record r
- Data.HList.TIPtuple: tipyTuple :: (HOccurs l1 (r v1), HOccurs l1 (r v), HOccurs l (r v2), HOccurs l (r v), HDeleteAtLabel * r l1 v1 v', HDeleteAtLabel * r l1 v v2, HDeleteAtLabel * r l v2 v'1, HDeleteAtLabel * r l v v1) => r v -> (l, l1)
+ Data.HList.TIPtuple: tipyTuple :: (HDeleteAtLabel * r a v v1, HDeleteAtLabel * r a v2 v'1, HDeleteAtLabel * r b v v2, HDeleteAtLabel * r b v1 v', HOccurs a (r v), HOccurs a (r v2), HOccurs b (r v), HOccurs b (r v1)) => r v -> (a, b)
- Data.HList.TIPtuple: tipyTuple3 :: (HOccurs l2 (r v5), HOccurs l2 (r v2), HOccurs l2 (r v), HOccurs l1 (r v4), HOccurs l1 (r v1), HOccurs l1 (r v), HOccurs l (r v6), HOccurs l (r v3), HOccurs l (r v), HDeleteAtLabel * r l2 v5 v6, HDeleteAtLabel * r l2 v2 v', HDeleteAtLabel * r l2 v v3, HDeleteAtLabel * r l1 v4 v'1, HDeleteAtLabel * r l1 v1 v2, HDeleteAtLabel * r l1 v v5, HDeleteAtLabel * r l v6 v'2, HDeleteAtLabel * r l v3 v4, HDeleteAtLabel * r l v v1) => r v -> (l, l1, l2)
+ Data.HList.TIPtuple: tipyTuple3 :: (HDeleteAtLabel * r a v v1, HDeleteAtLabel * r a v3 v4, HDeleteAtLabel * r a v6 v'2, HDeleteAtLabel * r b v v5, HDeleteAtLabel * r b v1 v2, HDeleteAtLabel * r b v4 v'1, HDeleteAtLabel * r c v v3, HDeleteAtLabel * r c v2 v', HDeleteAtLabel * r c v5 v6, HOccurs a (r v), HOccurs a (r v3), HOccurs a (r v6), HOccurs b (r v), HOccurs b (r v1), HOccurs b (r v4), HOccurs c (r v), HOccurs c (r v2), HOccurs c (r v5)) => r v -> (a, b, c)
- Data.HList.TIPtuple: tipyTuple4 :: (HOccurs l3 (r v11), HOccurs l3 (r v7), HOccurs l3 (r v3), HOccurs l3 (r v), HOccurs l2 (r v10), HOccurs l2 (r v6), HOccurs l2 (r v2), HOccurs l2 (r v), HOccurs l1 (r v9), HOccurs l1 (r v5), HOccurs l1 (r v1), HOccurs l1 (r v), HOccurs l (r v12), HOccurs l (r v8), HOccurs l (r v4), HOccurs l (r v), HDeleteAtLabel * r l3 v11 v12, HDeleteAtLabel * r l3 v7 v8, HDeleteAtLabel * r l3 v3 v', HDeleteAtLabel * r l3 v v4, HDeleteAtLabel * r l2 v10 v11, HDeleteAtLabel * r l2 v6 v'1, HDeleteAtLabel * r l2 v2 v3, HDeleteAtLabel * r l2 v v7, HDeleteAtLabel * r l1 v9 v'2, HDeleteAtLabel * r l1 v5 v6, HDeleteAtLabel * r l1 v1 v2, HDeleteAtLabel * r l1 v v10, HDeleteAtLabel * r l v12 v'3, HDeleteAtLabel * r l v8 v9, HDeleteAtLabel * r l v4 v5, HDeleteAtLabel * r l v v1) => r v -> (l, l1, l2, l3)
+ Data.HList.TIPtuple: tipyTuple4 :: (HDeleteAtLabel * r a v v1, HDeleteAtLabel * r a v4 v5, HDeleteAtLabel * r a v8 v9, HDeleteAtLabel * r a v12 v'3, HDeleteAtLabel * r b v v10, HDeleteAtLabel * r b v1 v2, HDeleteAtLabel * r b v5 v6, HDeleteAtLabel * r b v9 v'2, HDeleteAtLabel * r c v v7, HDeleteAtLabel * r c v2 v3, HDeleteAtLabel * r c v6 v'1, HDeleteAtLabel * r c v10 v11, HDeleteAtLabel * r d v v4, HDeleteAtLabel * r d v3 v', HDeleteAtLabel * r d v7 v8, HDeleteAtLabel * r d v11 v12, HOccurs a (r v), HOccurs a (r v4), HOccurs a (r v8), HOccurs a (r v12), HOccurs b (r v), HOccurs b (r v1), HOccurs b (r v5), HOccurs b (r v9), HOccurs c (r v), HOccurs c (r v2), HOccurs c (r v6), HOccurs c (r v10), HOccurs d (r v), HOccurs d (r v3), HOccurs d (r v7), HOccurs d (r v11)) => r v -> (a, b, c, d)
- Data.HList.TIPtuple: tipyTuple5 :: (HOccurs l4 (r v19), HOccurs l4 (r v14), HOccurs l4 (r v9), HOccurs l4 (r v4), HOccurs l4 (r v), HOccurs l3 (r v18), HOccurs l3 (r v13), HOccurs l3 (r v8), HOccurs l3 (r v3), HOccurs l3 (r v), HOccurs l2 (r v17), HOccurs l2 (r v12), HOccurs l2 (r v7), HOccurs l2 (r v2), HOccurs l2 (r v), HOccurs l1 (r v16), HOccurs l1 (r v11), HOccurs l1 (r v6), HOccurs l1 (r v1), HOccurs l1 (r v), HOccurs l (r v20), HOccurs l (r v15), HOccurs l (r v10), HOccurs l (r v5), HOccurs l (r v), HDeleteAtLabel * r l4 v19 v20, HDeleteAtLabel * r l4 v14 v15, HDeleteAtLabel * r l4 v9 v10, HDeleteAtLabel * r l4 v4 v', HDeleteAtLabel * r l4 v v5, HDeleteAtLabel * r l3 v18 v19, HDeleteAtLabel * r l3 v13 v14, HDeleteAtLabel * r l3 v8 v'1, HDeleteAtLabel * r l3 v3 v4, HDeleteAtLabel * r l3 v v9, HDeleteAtLabel * r l2 v17 v18, HDeleteAtLabel * r l2 v12 v'2, HDeleteAtLabel * r l2 v7 v8, HDeleteAtLabel * r l2 v2 v3, HDeleteAtLabel * r l2 v v13, HDeleteAtLabel * r l1 v16 v'3, HDeleteAtLabel * r l1 v11 v12, HDeleteAtLabel * r l1 v6 v7, HDeleteAtLabel * r l1 v1 v2, HDeleteAtLabel * r l1 v v17, HDeleteAtLabel * r l v20 v'4, HDeleteAtLabel * r l v15 v16, HDeleteAtLabel * r l v10 v11, HDeleteAtLabel * r l v5 v6, HDeleteAtLabel * r l v v1) => r v -> (l, l1, l2, l3, l4)
+ Data.HList.TIPtuple: tipyTuple5 :: (HDeleteAtLabel * r a v v1, HDeleteAtLabel * r a v5 v6, HDeleteAtLabel * r a v10 v11, HDeleteAtLabel * r a v15 v16, HDeleteAtLabel * r a v20 v'4, HDeleteAtLabel * r b v v17, HDeleteAtLabel * r b v1 v2, HDeleteAtLabel * r b v6 v7, HDeleteAtLabel * r b v11 v12, HDeleteAtLabel * r b v16 v'3, HDeleteAtLabel * r c v v13, HDeleteAtLabel * r c v2 v3, HDeleteAtLabel * r c v7 v8, HDeleteAtLabel * r c v12 v'2, HDeleteAtLabel * r c v17 v18, HDeleteAtLabel * r d v v9, HDeleteAtLabel * r d v3 v4, HDeleteAtLabel * r d v8 v'1, HDeleteAtLabel * r d v13 v14, HDeleteAtLabel * r d v18 v19, HDeleteAtLabel * r e v v5, HDeleteAtLabel * r e v4 v', HDeleteAtLabel * r e v9 v10, HDeleteAtLabel * r e v14 v15, HDeleteAtLabel * r e v19 v20, HOccurs a (r v), HOccurs a (r v5), HOccurs a (r v10), HOccurs a (r v15), HOccurs a (r v20), HOccurs b (r v), HOccurs b (r v1), HOccurs b (r v6), HOccurs b (r v11), HOccurs b (r v16), HOccurs c (r v), HOccurs c (r v2), HOccurs c (r v7), HOccurs c (r v12), HOccurs c (r v17), HOccurs d (r v), HOccurs d (r v3), HOccurs d (r v8), HOccurs d (r v13), HOccurs d (r v18), HOccurs e (r v), HOccurs e (r v4), HOccurs e (r v9), HOccurs e (r v14), HOccurs e (r v19)) => r v -> (a, b, c, d, e)
- Data.HList.Variant: eqVariant :: (HAllEqVal ((:) * (Tagged * () Bool) (HMapOutV_gety x Bool)) b, HAllEqVal (HMapOutV_gety x Bool) b, Unvariant1 Bool b (HMapOutV_gety x Bool) Bool, ZipVariant x1 y x, HMapAux Variant (HFmap UncurryEq) x (HMapOutV_gety x Bool), SameLength' * * (HMapOutV_gety x Bool) x, SameLength' * * x (HMapOutV_gety x Bool)) => Variant x1 -> Variant y -> Bool
+ Data.HList.Variant: eqVariant :: (SameLength' * * x (HMapOutV_gety x Bool), SameLength' * * (HMapOutV_gety x Bool) x, HMapAux Variant (HFmap UncurryEq) x (HMapOutV_gety x Bool), ZipVariant x1 y x, Unvariant1 Bool b (HMapOutV_gety x Bool) Bool, HAllEqVal (HMapOutV_gety x Bool) b, HAllEqVal ((:) * (Tagged * () Bool) (HMapOutV_gety x Bool)) b) => Variant x1 -> Variant y -> Bool
- Data.HList.Variant: hMapV :: (HMapAux Variant (HFmap f) x y, SameLength' * * y x, SameLength' * * x y) => f -> Variant x -> Variant y
+ Data.HList.Variant: hMapV :: (SameLength' * * x y, SameLength' * * y x, HMapAux Variant (HFmap f) x y) => f -> Variant x -> Variant y
- Data.HList.Variant: hMaybied :: (VariantToHMaybied v1 x, VariantToHMaybied v r, HFoldr HMaybiedToVariantFs [Variant ([] *)] x [Variant v1], HMapAux HList (HFmap HCastF) x r, SameLength' * * x r, SameLength' * * r x, Choice p, Applicative f) => p (Variant v1) (f (Variant v)) -> p (Record x) (f (Record r))
+ Data.HList.Variant: hMaybied :: (Applicative f, Choice p, SameLength' * * r x, SameLength' * * x r, HMapAux HList (HFmap HCastF) x r, HFoldr HMaybiedToVariantFs [Variant ([] *)] x [Variant v1], VariantToHMaybied v r, VariantToHMaybied v1 x) => p (Variant v1) (f (Variant v)) -> p (Record x) (f (Record r))
- Data.HList.Variant: hMaybied' :: (VariantToHMaybied v x, HFoldr HMaybiedToVariantFs [Variant ([] *)] x [Variant v], HMapAux HList (HFmap HCastF) x x, SameLength' * * x x, Choice p, Applicative f) => p (Variant v) (f (Variant v)) -> p (Record x) (f (Record x))
+ Data.HList.Variant: hMaybied' :: (Applicative f, Choice p, SameLength' * * x x, HMapAux HList (HFmap HCastF) x x, HFoldr HMaybiedToVariantFs [Variant ([] *)] x [Variant v], VariantToHMaybied v x) => p (Variant v) (f (Variant v)) -> p (Record x) (f (Record x))
- Data.HList.Variant: hMaybiedToVariants :: (HFoldr HMaybiedToVariantFs [Variant []] r [Variant v], VariantToHMaybied v r) => Record r -> [Variant v]
+ Data.HList.Variant: hMaybiedToVariants :: (HFoldr HMaybiedToVariantFs [Variant '[]] r [Variant v], VariantToHMaybied v r) => Record r -> [Variant v]
- Data.HList.Variant: unsafeEmptyVariant :: Variant []
+ Data.HList.Variant: unsafeEmptyVariant :: Variant '[]
- Data.HList.Variant: unvarianted' :: (HAllEqVal ((:) * (Tagged * () b) s) b1, HAllEqVal s b1, HAllEqVal' ((:) * (Tagged * () b) s), Unvariant1 Bool b1 s b, SameLength' * * s s, SameLabels [*] [*] s s, Functor f) => (b -> f b) -> Variant s -> f (Variant s)
+ Data.HList.Variant: unvarianted' :: (Functor f, SameLabels [*] [*] s s, SameLength' * * s s, Unvariant1 Bool b s a, HAllEqVal' ((:) * (Tagged * () a) s), HAllEqVal s b, HAllEqVal ((:) * (Tagged * () a) s) b) => (a -> f a) -> Variant s -> f (Variant s)
Files
- Data/HList/Data.hs +2/−5
- Data/HList/HList.hs +1/−1
- Data/HList/Record.hs +2/−2
- Data/HList/TIP.hs +4/−1
- HList.cabal +6/−2
- examples/Properties/LengthDependent.hs +25/−7
Data/HList/Data.hs view
@@ -70,6 +70,8 @@ import Data.HList.TIC import Data.HList.TIP +-- for Typeable '[] and Typeable '(:) with ghc-7.6+import Data.Orphans () #if OLD_TYPEABLE import Data.List@@ -232,11 +234,6 @@ -- orphans deriving instance Typeable 'HZero deriving instance Typeable 'HSucc-#if !MIN_VERSION_base(4,8,0)--- GHC 7.9 adds these instances-deriving instance Typeable '[]-deriving instance Typeable '(:)-#endif #else instance TypeRepsList (Record xs) => Typeable (HList xs) where
Data/HList/HList.hs view
@@ -641,7 +641,7 @@ >>> let a = hEnd $ hBuild 1 2 3 >>> let b = hEnd $ hBuild 'a' "abc" >>> hConcat $ hBuild a b-H[1, 2, 3, 'a', "abc"]+H[1,2,3,'a',"abc"] -} type HConcat xs = HConcatFD xs (HConcatR xs)
Data/HList/Record.hs view
@@ -1143,7 +1143,7 @@ >>> let circSucc_ x | x == maxBound = minBound | otherwise = succ x >>> :t circSucc_-circSucc_ :: (Eq a, Enum a, Bounded a) => a -> a+circSucc_ :: (Bounded a, Enum a, Eq a) => a -> a Use a shortcut ('Fun') to create a value that has an appropriate 'ApplyAB' instance: @@ -1182,7 +1182,7 @@ -- ----------------------------------------------------------------------------- | This instance allows creating Record with+-- | This instance allows creating a Record with -- -- @hBuild 3 'a' :: Record '[Tagged "x" Int, Tagged "y" Char]@ instance (HReverse l lRev,
Data/HList/TIP.hs view
@@ -467,7 +467,10 @@ [@Session log@] >>> :t myTipyCow-myTipyCow :: TIP Animal+myTipyCow+ :: TIP+ '[Tagged Key Key, Tagged Name Name, Tagged Breed Breed,+ Tagged Price Price] >>> hOccurs myTipyCow :: Breed Cow
HList.cabal view
@@ -1,5 +1,5 @@ Name: HList-Version: 0.4.1.0+Version: 0.4.2.0 Category: Data Synopsis: Heterogeneous lists Description: HList provides many operations to create and manipulate@@ -22,7 +22,7 @@ Data-files: README, ChangeLog Cabal-version: >= 1.10-Tested-With: GHC==7.6.3, GHC==7.8.4, GHC==7.10.1+Tested-With: GHC==7.6.3, GHC==7.8.4, GHC==7.10.2 Build-Type: Simple Extra-Source-Files:@@ -56,6 +56,8 @@ library Build-Depends: base >= 4.6 && < 4.9,+ -- for Typeable '[] and '(:) with ghc-7.6+ base-orphans, template-haskell, ghc-prim, mtl,@@ -140,6 +142,8 @@ Hs-Source-Dirs: examples Build-Depends: base, hspec >= 1.7, directory, filepath, process, syb, cmdargs, lens, HList, mtl+ if impl(ghc > 7.9)+ Ghc-Options: -fno-warn-tabs Test-Suite doctests Type: exitcode-stdio-1.0
examples/Properties/LengthDependent.hs view
@@ -270,20 +270,38 @@ return $ hZip x y `eq` hZip2 x y #endif - it "HList monoid assoc" $- property $ do- x <- genHL (BoolN True :: BoolN "x")- y <- genHL (BoolN True :: BoolN "x")- z <- genHL (BoolN True :: BoolN "x")- return $ ((x `mappend` y) `mappend` z) `eq` (x `mappend` (y `mappend` z))-+ -- lots of duplication, not sure if it's worth factoring out it "HList monoid unit" $ property $ do x <- genHL (BoolN True :: BoolN "x") return $ conjoin [ x === (x `mappend` mempty), x === (mempty `mappend` x) ]+ it "Record monoid unit" $+ property $ do+ x <- $(rN n1) (BoolN True :: BoolN "x")+ return $ conjoin+ [ x === (x `mappend` mempty),+ x === (mempty `mappend` x) ]+ it "Variant monoid unit" $+ property $ do+ x <- $(rN n1) (BoolN True :: BoolN "x")+ return $ conjoin+ [ x === (x `mappend` mempty),+ x === (mempty `mappend` x) ] + -- lots of duplication, not sure if it's worth factoring out+ it "HList monoid assoc" $+ property $ do+ x <- genHL (BoolN True :: BoolN "x")+ y <- genHL (BoolN True :: BoolN "x")+ z <- genHL (BoolN True :: BoolN "x")+ return $ ((x `mappend` y) `mappend` z) `eq` (x `mappend` (y `mappend` z))+ it "Record monoid assoc" $ property $ do+ x <- $(rN n1) (BoolN True :: BoolN "x")+ y <- $(rN n1) (BoolN True :: BoolN "x")+ z <- $(rN n1) (BoolN True :: BoolN "x")+ return $ ((x `mappend` y) `mappend` z) `eq` (x `mappend` (y `mappend` z)) it "Variant monoid assoc" $ property $ do x <- $(vN n1) (BoolN True :: BoolN "x") y <- $(vN n1) (BoolN True :: BoolN "x")