Modulefcf-containers-0.8.2Haskell2010

Fcf.Alg.Sort

datadata ListCmpFnd (a :: [Ordering]) (b :: Ordering)

Instances2Eval

type Eval (ListCmpFnd '[]) = 'EQDefined in fcf-containers-0.8.2 · Fcf.Alg.Sort
type Eval (ListCmpFnd (a ': as)) = Eval (If (Eval (TyEq a 'EQ)) (ListCmpFnd as) (Pure a))Defined in fcf-containers-0.8.2 · Fcf.Alg.Sort

datadata ListCmp (b :: a -> a -> Exp Ordering) (c :: [a]) (d :: [a]) (e :: Ordering)

Compare lists with the given comparison for the elements.

Instances1Eval

type Eval (ListCmp f as bs) = Eval (ListCmpFnd =<< ZipWith f as bs)Defined in fcf-containers-0.8.2 · Fcf.Alg.Sort

datadata ListOrd (b :: a -> a -> Exp Ordering) (c :: [a]) (d :: [a]) (e :: Bool)

Give true if the first list is before the second, given the comparison function for the elements.

Instances1Eval

type Eval (ListOrd f as bs) = Eval (If (Eval (TyEq 'LT (Eval (ListCmp f as bs)))) (Pure 'True) (Pure 'False))Defined in fcf-containers-0.8.2 · Fcf.Alg.Sort

datadata NatOrd (a :: Nat) (b :: Nat) (c :: Ordering)

Comparison for the Nats.

TODO: Would this fit to Fcf.Data.Nat on first-class-families?

Instances1Eval

type Eval (NatOrd a b) = CmpNat a bDefined in fcf-containers-0.8.2 · Fcf.Alg.Sort

datadata SymbolListOrd (a :: [Symbol]) (b :: [Symbol]) (c :: Bool)

Comparison for Symbol lists.

Useful when sorting with Qsort.

Instances1Eval

type Eval (SymbolListOrd as bs) = Eval (ListOrd SymbolOrd as bs)Defined in fcf-containers-0.8.2 · Fcf.Alg.Sort

datadata NatListOrd (a :: [Nat]) (b :: [Nat]) (c :: Bool)

Comparison for Nat lists.

Useful when sorting with Qsort.

Instances1Eval

type Eval (NatListOrd as bs) = Eval (ListOrd NatOrd as bs)Defined in fcf-containers-0.8.2 · Fcf.Alg.Sort

datadata PartHlp (b :: a -> a -> Exp Bool) (c :: [a]) (d :: BTreeF a [a])

Instances2Eval

type Eval (PartHlp _1 '[]) = 'BEmptyFDefined in fcf-containers-0.8.2 · Fcf.Alg.Sort
type Eval (PartHlp smaller (h ': t)) = 'BNodeF h (Eval (Filter (smaller h) t)) (Eval (Filter (Not <=< smaller h) t))Defined in fcf-containers-0.8.2 · Fcf.Alg.Sort

datadata Inord (b :: BTreeF a [a]) (c :: [a])

Instances2Eval

type Eval (Inord 'BEmptyF) = '[]Defined in fcf-containers-0.8.2 · Fcf.Alg.Sort
type Eval (Inord ('BNodeF v l r)) = Eval (l ++ Eval ('[v] ++ r))Defined in fcf-containers-0.8.2 · Fcf.Alg.Sort

datadata Qsort (b :: a -> a -> Exp Bool) (c :: [a]) (d :: [a])

Qsort - give the comparison function a -> a -> Exp Bool comparing your list elements and then Qsort will order the list.

Example

:kind! Eval (Qsort (N.<) '[5,3,1,9,4,6,3])

Eval (Qsort (N.<) '[5,3,1,9,4,6,3]) :: [TL.Natural] = '[1, 3, 3, 4, 5, 6, 9]

:kind! Eval (Qsort (S.<) '[ "bb", "e", "a", "e", "d" ])

Eval (Qsort (S.<) '[ "bb", "e", "a", "e", "d" ]) :: [Symbol] = '["a", "bb", "d", "e", "e"]

Instances1Eval

type Eval (Qsort cmp lst) = Eval (Hylo Inord (PartCmp cmp) lst)Defined in fcf-containers-0.8.2 · Fcf.Alg.Sort

datadata PartCmp (b :: a -> a -> Exp Bool) (c :: [a]) (d :: BTreeF a [a])

Instances1Eval

type Eval (PartCmp cmp coalg) = Eval (PartHlp (Flip cmp) coalg)Defined in fcf-containers-0.8.2 · Fcf.Alg.Sort