Lib

Documentation

someFunc :: IO ()

type family RevAppend (a :: [a]) (a :: [a]) :: [a] where ...

Equations

RevAppend '[] x = x

RevAppend ((:) x xs) n = Apply (Apply RevAppendSym0 xs) (Apply (Apply (:$) x) n)

data RevAppendSym0 (l :: TyFun [a6989586621679076944] (TyFun [a6989586621679076944] [a6989586621679076944] -> Type))

Constructors

SameKind (Apply RevAppendSym0 arg) (RevAppendSym1 arg) => RevAppendSym0KindInference

Instances

SuppressUnusedWarnings (TyFun [a6989586621679076944] (TyFun [a6989586621679076944] [a6989586621679076944] -> Type) -> *) (RevAppendSym0 a6989586621679076944)

Methods

suppressUnusedWarnings :: Proxy (RevAppendSym0 a6989586621679076944) t -> ()

type Apply [a6989586621679076944] (TyFun [a6989586621679076944] [a6989586621679076944] -> Type) (RevAppendSym0 a6989586621679076944) l

type Apply [a6989586621679076944] (TyFun [a6989586621679076944] [a6989586621679076944] -> Type) (RevAppendSym0 a6989586621679076944) l = RevAppendSym1 a6989586621679076944 l

data RevAppendSym1 (l :: [a6989586621679076944]) (l :: TyFun [a6989586621679076944] [a6989586621679076944])

Constructors

SameKind (Apply (RevAppendSym1 l) arg) (RevAppendSym2 l arg) => RevAppendSym1KindInference

Instances

SuppressUnusedWarnings ([a6989586621679076944] -> TyFun [a6989586621679076944] [a6989586621679076944] -> *) (RevAppendSym1 a6989586621679076944)

Methods

suppressUnusedWarnings :: Proxy (RevAppendSym1 a6989586621679076944) t -> ()

type Apply [a] [a] (RevAppendSym1 a l1) l2

type Apply [a] [a] (RevAppendSym1 a l1) l2 = RevAppend a l1 l2

type RevAppendSym2 (t :: [a6989586621679076944]) (t :: [a6989586621679076944]) = RevAppend t t

type family TakeElemAux (a :: [a]) (a :: [a]) :: [(a, [a])] where ...

Equations

TakeElemAux l '[] = '[]

TakeElemAux l ((:) r rs) = Apply (Apply (:$) (Apply (Apply Tuple2Sym0 r) (Apply (Apply RevAppendSym0 l) rs))) (Apply (Apply TakeElemAuxSym0 (Apply (Apply (:$) r) l)) rs)

data TakeElemAuxSym0 (l :: TyFun [a6989586621679076943] (TyFun [a6989586621679076943] [(a6989586621679076943, [a6989586621679076943])] -> Type))

Constructors

SameKind (Apply TakeElemAuxSym0 arg) (TakeElemAuxSym1 arg) => TakeElemAuxSym0KindInference

Instances

SuppressUnusedWarnings (TyFun [a6989586621679076943] (TyFun [a6989586621679076943] [(a6989586621679076943, [a6989586621679076943])] -> Type) -> *) (TakeElemAuxSym0 a6989586621679076943)

Methods

suppressUnusedWarnings :: Proxy (TakeElemAuxSym0 a6989586621679076943) t -> ()

type Apply [a6989586621679076943] (TyFun [a6989586621679076943] [(a6989586621679076943, [a6989586621679076943])] -> Type) (TakeElemAuxSym0 a6989586621679076943) l

type Apply [a6989586621679076943] (TyFun [a6989586621679076943] [(a6989586621679076943, [a6989586621679076943])] -> Type) (TakeElemAuxSym0 a6989586621679076943) l = TakeElemAuxSym1 a6989586621679076943 l

data TakeElemAuxSym1 (l :: [a6989586621679076943]) (l :: TyFun [a6989586621679076943] [(a6989586621679076943, [a6989586621679076943])])

Constructors

SameKind (Apply (TakeElemAuxSym1 l) arg) (TakeElemAuxSym2 l arg) => TakeElemAuxSym1KindInference

Instances

SuppressUnusedWarnings ([a6989586621679076943] -> TyFun [a6989586621679076943] [(a6989586621679076943, [a6989586621679076943])] -> *) (TakeElemAuxSym1 a6989586621679076943)

Methods

suppressUnusedWarnings :: Proxy (TakeElemAuxSym1 a6989586621679076943) t -> ()

type Apply [a] [(a, [a])] (TakeElemAuxSym1 a l1) l2

type Apply [a] [(a, [a])] (TakeElemAuxSym1 a l1) l2 = TakeElemAux a l1 l2

type TakeElemAuxSym2 (t :: [a6989586621679076943]) (t :: [a6989586621679076943]) = TakeElemAux t t

type family TakeElem (a :: [a]) :: [(a, [a])] where ...

Equations

TakeElem a_6989586621679076982 = Apply (Apply TakeElemAuxSym0 '[]) a_6989586621679076982

type TakeElemSym1 (t :: [a6989586621679076942]) = TakeElem t

data TakeElemSym0 (l :: TyFun [a6989586621679076942] [(a6989586621679076942, [a6989586621679076942])])

Constructors

SameKind (Apply TakeElemSym0 arg) (TakeElemSym1 arg) => TakeElemSym0KindInference

Instances

SuppressUnusedWarnings (TyFun [a6989586621679076942] [(a6989586621679076942, [a6989586621679076942])] -> *) (TakeElemSym0 a6989586621679076942)

Methods

suppressUnusedWarnings :: Proxy (TakeElemSym0 a6989586621679076942) t -> ()

type Apply [a] [(a, [a])] (TakeElemSym0 a) l

type Apply [a] [(a, [a])] (TakeElemSym0 a) l = TakeElem a l

sTakeElem :: forall (t :: [a]). Sing t -> Sing (Apply TakeElemSym0 t :: [(a, [a])])

sTakeElemAux :: forall (t :: [a]) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply TakeElemAuxSym0 t) t :: [(a, [a])])

sRevAppend :: forall (t :: [a]) (t :: [a]). Sing t -> Sing t -> Sing (Apply (Apply RevAppendSym0 t) t :: [a])

takeElem :: [a] -> [(a, [a])]

takeElemAux :: [a] -> [a] -> [(a, [a])]

revAppend :: [a] -> [a] -> [a]

class (SplitCode a ~ Code a, Generic a) => SplitStructure a where

Minimal complete definition

splitStructureTo

Associated Types

type SplitCode a :: [[*]]

Methods

splitStructureFrom :: a -> SOP I (SplitCode a)

splitStructureTo :: SOP I (SplitCode a) -> a

class Ord a => SplitOrd a

newtype SplitStructureOnAux dt b r a

Constructors

SplitStructureOnAux

Fields

• runSplitStructureOnAux :: dt (r :++ a) b

newtype SplitStructureOn dt b a

Constructors

SplitStructureOn

Fields

• runSplitStructureOn :: (Dict (SplitStructure (Fst a)), NP (SplitStructureOnAux dt b (Snd a)) (SplitCode (Fst a)))

newtype SplitOrderOn dt b a

Constructors

SplitOrderOn

Fields

• runSplitOrderOn :: (Dict (SplitOrd (Fst a)), Fst a, dt (Fst a ': Snd a) b, dt (Snd a) b, dt (Fst a ': Snd a) b)

data DecisionTree (a :: [*]) (b :: *)

Constructors

Leaf (NP I a -> b)

SplitOnStructure (NS (SplitStructureOn DecisionTree b) (TakeElem a))

SplitOnOrd (NS (SplitOrderOn DecisionTree b) (TakeElem a))

newtype TakeElemTypeAux a

Constructors

TakeElemTypeAux

Fields

• runTakeElemTypeAux :: (Fst a, NP I (Snd a))

type family TakeElemAuxType (a :: [*]) (b :: [*]) :: *

Instances

type TakeElemAuxType a b

type TakeElemAuxType a b = NP (*, [*]) TakeElemTypeAux (TakeElemAux * a b)

type family TakeElemType (a :: [*]) :: *

Instances

type TakeElemType a

type TakeElemType a = TakeElemAuxType ([] *) a

revAppendDT :: NP f a -> NP f b -> NP f (RevAppend a b)

takeElemAuxDT :: NP I a -> NP I b -> TakeElemAuxType a b

dictSList :: SList a -> Dict (SListI a)

sListCons :: Proxy a -> SList b -> SList (a ': b)

unSListCons :: forall (a :: [k]). SList (_ ': a) -> SList a

takeElemAuxDTSingAux :: SList (a ': as) -> Proxy a

takeElemAuxDTSing :: SList a -> SList b -> SList (TakeElemAux a b)

takeElemDT :: NP I a -> TakeElemType a

sopAppend :: NP f a -> NP f b -> NP f (a :++ b)

npToSList :: NP f a -> SList a

eval :: DecisionTree a b -> NP I a -> b