Copyright | (C) 2018 Ryan Scott |
---|---|
License | BSD-style (see LICENSE) |
Maintainer | Ryan Scott |
Stability | experimental |
Portability | non-portable |
Safe Haskell | None |
Language | GHC2021 |
Defines the promoted and singled versions of the Foldable
type class.
Synopsis
- class PFoldable (t :: Type -> Type) where
- type Fold (arg :: t m) :: m
- type FoldMap (arg :: a ~> m) (arg1 :: t a) :: m
- type Foldr (arg :: a ~> (b ~> b)) (arg1 :: b) (arg2 :: t a) :: b
- type Foldr' (arg :: a ~> (b ~> b)) (arg1 :: b) (arg2 :: t a) :: b
- type Foldl (arg :: b ~> (a ~> b)) (arg1 :: b) (arg2 :: t a) :: b
- type Foldl' (arg :: b ~> (a ~> b)) (arg1 :: b) (arg2 :: t a) :: b
- type Foldr1 (arg :: a ~> (a ~> a)) (arg1 :: t a) :: a
- type Foldl1 (arg :: a ~> (a ~> a)) (arg1 :: t a) :: a
- type ToList (arg :: t a) :: [a]
- type Null (arg :: t a) :: Bool
- type Length (arg :: t a) :: Natural
- type Elem (arg :: a) (arg1 :: t a) :: Bool
- type Maximum (arg :: t a) :: a
- type Minimum (arg :: t a) :: a
- type Sum (arg :: t a) :: a
- type Product (arg :: t a) :: a
- class SFoldable (t :: Type -> Type) where
- sFold :: forall m (t1 :: t m). SMonoid m => Sing t1 -> Sing (Apply (FoldSym0 :: TyFun (t m) m -> Type) t1)
- sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: t a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (FoldMapSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) t1) t2)
- sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: t a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) t1) t2) t3)
- sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: t a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) t1) t2) t3)
- sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: t a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) t1) t2) t3)
- sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: t a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) t1) t2) t3)
- sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: t a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) t1) t2)
- sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: t a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) t1) t2)
- sToList :: forall a (t1 :: t a). Sing t1 -> Sing (Apply (ToListSym0 :: TyFun (t a) [a] -> Type) t1)
- sNull :: forall a (t1 :: t a). Sing t1 -> Sing (Apply (NullSym0 :: TyFun (t a) Bool -> Type) t1)
- sLength :: forall a (t1 :: t a). Sing t1 -> Sing (Apply (LengthSym0 :: TyFun (t a) Natural -> Type) t1)
- sElem :: forall a (t1 :: a) (t2 :: t a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) t1) t2)
- sMaximum :: forall a (t1 :: t a). SOrd a => Sing t1 -> Sing (Apply (MaximumSym0 :: TyFun (t a) a -> Type) t1)
- sMinimum :: forall a (t1 :: t a). SOrd a => Sing t1 -> Sing (Apply (MinimumSym0 :: TyFun (t a) a -> Type) t1)
- sSum :: forall a (t1 :: t a). SNum a => Sing t1 -> Sing (Apply (SumSym0 :: TyFun (t a) a -> Type) t1)
- sProduct :: forall a (t1 :: t a). SNum a => Sing t1 -> Sing (Apply (ProductSym0 :: TyFun (t a) a -> Type) t1)
- type family FoldrM (a1 :: a ~> (b ~> m b)) (a2 :: b) (a3 :: t a) :: m b where ...
- sFoldrM :: forall a b (m :: Type -> Type) (t1 :: Type -> Type) (t2 :: a ~> (b ~> m b)) (t3 :: b) (t4 :: t1 a). (SFoldable t1, SMonad m) => Sing t2 -> Sing t3 -> Sing t4 -> Sing (Apply (Apply (Apply (FoldrMSym0 :: TyFun (a ~> (b ~> m b)) (b ~> (t1 a ~> m b)) -> Type) t2) t3) t4)
- type family FoldlM (a1 :: b ~> (a ~> m b)) (a2 :: b) (a3 :: t a) :: m b where ...
- sFoldlM :: forall b a (m :: Type -> Type) (t1 :: Type -> Type) (t2 :: b ~> (a ~> m b)) (t3 :: b) (t4 :: t1 a). (SFoldable t1, SMonad m) => Sing t2 -> Sing t3 -> Sing t4 -> Sing (Apply (Apply (Apply (FoldlMSym0 :: TyFun (b ~> (a ~> m b)) (b ~> (t1 a ~> m b)) -> Type) t2) t3) t4)
- type family Traverse_ (a1 :: a ~> f b) (a2 :: t a) :: f () where ...
- sTraverse_ :: forall a (f :: Type -> Type) b (t1 :: Type -> Type) (t2 :: a ~> f b) (t3 :: t1 a). (SFoldable t1, SApplicative f) => Sing t2 -> Sing t3 -> Sing (Apply (Apply (Traverse_Sym0 :: TyFun (a ~> f b) (t1 a ~> f ()) -> Type) t2) t3)
- type family For_ (a1 :: t a) (a2 :: a ~> f b) :: f () where ...
- sFor_ :: forall (t1 :: Type -> Type) a (f :: Type -> Type) b (t2 :: t1 a) (t3 :: a ~> f b). (SFoldable t1, SApplicative f) => Sing t2 -> Sing t3 -> Sing (Apply (Apply (For_Sym0 :: TyFun (t1 a) ((a ~> f b) ~> f ()) -> Type) t2) t3)
- type family SequenceA_ (a1 :: t (f a)) :: f () where ...
- sSequenceA_ :: forall (t1 :: Type -> Type) (f :: Type -> Type) a (t2 :: t1 (f a)). (SFoldable t1, SApplicative f) => Sing t2 -> Sing (Apply (SequenceA_Sym0 :: TyFun (t1 (f a)) (f ()) -> Type) t2)
- type family Asum (a1 :: t (f a)) :: f a where ...
- sAsum :: forall (t1 :: Type -> Type) (f :: Type -> Type) a (t2 :: t1 (f a)). (SFoldable t1, SAlternative f) => Sing t2 -> Sing (Apply (AsumSym0 :: TyFun (t1 (f a)) (f a) -> Type) t2)
- type family MapM_ (a1 :: a ~> m b) (a2 :: t a) :: m () where ...
- sMapM_ :: forall a (m :: Type -> Type) b (t1 :: Type -> Type) (t2 :: a ~> m b) (t3 :: t1 a). (SFoldable t1, SMonad m) => Sing t2 -> Sing t3 -> Sing (Apply (Apply (MapM_Sym0 :: TyFun (a ~> m b) (t1 a ~> m ()) -> Type) t2) t3)
- type family ForM_ (a1 :: t a) (a2 :: a ~> m b) :: m () where ...
- sForM_ :: forall (t1 :: Type -> Type) a (m :: Type -> Type) b (t2 :: t1 a) (t3 :: a ~> m b). (SFoldable t1, SMonad m) => Sing t2 -> Sing t3 -> Sing (Apply (Apply (ForM_Sym0 :: TyFun (t1 a) ((a ~> m b) ~> m ()) -> Type) t2) t3)
- type family Sequence_ (a1 :: t (m a)) :: m () where ...
- sSequence_ :: forall (t1 :: Type -> Type) (m :: Type -> Type) a (t2 :: t1 (m a)). (SFoldable t1, SMonad m) => Sing t2 -> Sing (Apply (Sequence_Sym0 :: TyFun (t1 (m a)) (m ()) -> Type) t2)
- type family Msum (a1 :: t (m a)) :: m a where ...
- sMsum :: forall (t1 :: Type -> Type) (m :: Type -> Type) a (t2 :: t1 (m a)). (SFoldable t1, SMonadPlus m) => Sing t2 -> Sing (Apply (MsumSym0 :: TyFun (t1 (m a)) (m a) -> Type) t2)
- type family Concat (a1 :: t [a]) :: [a] where ...
- sConcat :: forall (t1 :: Type -> Type) a (t2 :: t1 [a]). SFoldable t1 => Sing t2 -> Sing (Apply (ConcatSym0 :: TyFun (t1 [a]) [a] -> Type) t2)
- type family ConcatMap (a1 :: a ~> [b]) (a2 :: t a) :: [b] where ...
- sConcatMap :: forall a b (t1 :: Type -> Type) (t2 :: a ~> [b]) (t3 :: t1 a). SFoldable t1 => Sing t2 -> Sing t3 -> Sing (Apply (Apply (ConcatMapSym0 :: TyFun (a ~> [b]) (t1 a ~> [b]) -> Type) t2) t3)
- type family And (a :: t Bool) :: Bool where ...
- sAnd :: forall (t1 :: Type -> Type) (t2 :: t1 Bool). SFoldable t1 => Sing t2 -> Sing (Apply (AndSym0 :: TyFun (t1 Bool) Bool -> Type) t2)
- type family Or (a :: t Bool) :: Bool where ...
- sOr :: forall (t1 :: Type -> Type) (t2 :: t1 Bool). SFoldable t1 => Sing t2 -> Sing (Apply (OrSym0 :: TyFun (t1 Bool) Bool -> Type) t2)
- type family Any (a1 :: a ~> Bool) (a2 :: t a) :: Bool where ...
- sAny :: forall a (t1 :: Type -> Type) (t2 :: a ~> Bool) (t3 :: t1 a). SFoldable t1 => Sing t2 -> Sing t3 -> Sing (Apply (Apply (AnySym0 :: TyFun (a ~> Bool) (t1 a ~> Bool) -> Type) t2) t3)
- type family All (a1 :: a ~> Bool) (a2 :: t a) :: Bool where ...
- sAll :: forall a (t1 :: Type -> Type) (t2 :: a ~> Bool) (t3 :: t1 a). SFoldable t1 => Sing t2 -> Sing t3 -> Sing (Apply (Apply (AllSym0 :: TyFun (a ~> Bool) (t1 a ~> Bool) -> Type) t2) t3)
- type family MaximumBy (a1 :: a ~> (a ~> Ordering)) (a2 :: t a) :: a where ...
- sMaximumBy :: forall a (t1 :: Type -> Type) (t2 :: a ~> (a ~> Ordering)) (t3 :: t1 a). SFoldable t1 => Sing t2 -> Sing t3 -> Sing (Apply (Apply (MaximumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t1 a ~> a) -> Type) t2) t3)
- type family MinimumBy (a1 :: a ~> (a ~> Ordering)) (a2 :: t a) :: a where ...
- sMinimumBy :: forall a (t1 :: Type -> Type) (t2 :: a ~> (a ~> Ordering)) (t3 :: t1 a). SFoldable t1 => Sing t2 -> Sing t3 -> Sing (Apply (Apply (MinimumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t1 a ~> a) -> Type) t2) t3)
- type family NotElem (a1 :: a) (a2 :: t a) :: Bool where ...
- sNotElem :: forall a (t1 :: Type -> Type) (t2 :: a) (t3 :: t1 a). (SFoldable t1, SEq a) => Sing t2 -> Sing t3 -> Sing (Apply (Apply (NotElemSym0 :: TyFun a (t1 a ~> Bool) -> Type) t2) t3)
- type family Find (a1 :: a ~> Bool) (a2 :: t a) :: Maybe a where ...
- sFind :: forall a (t1 :: Type -> Type) (t2 :: a ~> Bool) (t3 :: t1 a). SFoldable t1 => Sing t2 -> Sing t3 -> Sing (Apply (Apply (FindSym0 :: TyFun (a ~> Bool) (t1 a ~> Maybe a) -> Type) t2) t3)
- data FoldSym0 (a :: TyFun (t m) m)
- type family FoldSym1 (a6989586621680390383 :: t m) :: m where ...
- data FoldMapSym0 (a1 :: TyFun (a ~> m) (t a ~> m))
- data FoldMapSym1 (a6989586621680390387 :: a ~> m) (b :: TyFun (t a) m)
- type family FoldMapSym2 (a6989586621680390387 :: a ~> m) (a6989586621680390388 :: t a) :: m where ...
- data FoldrSym0 (a1 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)))
- data FoldrSym1 (a6989586621680390393 :: a ~> (b ~> b)) (b1 :: TyFun b (t a ~> b))
- data FoldrSym2 (a6989586621680390393 :: a ~> (b ~> b)) (a6989586621680390394 :: b) (c :: TyFun (t a) b)
- type family FoldrSym3 (a6989586621680390393 :: a ~> (b ~> b)) (a6989586621680390394 :: b) (a6989586621680390395 :: t a) :: b where ...
- data Foldr'Sym0 (a1 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)))
- data Foldr'Sym1 (a6989586621680390400 :: a ~> (b ~> b)) (b1 :: TyFun b (t a ~> b))
- data Foldr'Sym2 (a6989586621680390400 :: a ~> (b ~> b)) (a6989586621680390401 :: b) (c :: TyFun (t a) b)
- type family Foldr'Sym3 (a6989586621680390400 :: a ~> (b ~> b)) (a6989586621680390401 :: b) (a6989586621680390402 :: t a) :: b where ...
- data FoldlSym0 (a1 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)))
- data FoldlSym1 (a6989586621680390407 :: b ~> (a ~> b)) (b1 :: TyFun b (t a ~> b))
- data FoldlSym2 (a6989586621680390407 :: b ~> (a ~> b)) (a6989586621680390408 :: b) (c :: TyFun (t a) b)
- type family FoldlSym3 (a6989586621680390407 :: b ~> (a ~> b)) (a6989586621680390408 :: b) (a6989586621680390409 :: t a) :: b where ...
- data Foldl'Sym0 (a1 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)))
- data Foldl'Sym1 (a6989586621680390414 :: b ~> (a ~> b)) (b1 :: TyFun b (t a ~> b))
- data Foldl'Sym2 (a6989586621680390414 :: b ~> (a ~> b)) (a6989586621680390415 :: b) (c :: TyFun (t a) b)
- type family Foldl'Sym3 (a6989586621680390414 :: b ~> (a ~> b)) (a6989586621680390415 :: b) (a6989586621680390416 :: t a) :: b where ...
- data Foldr1Sym0 (a1 :: TyFun (a ~> (a ~> a)) (t a ~> a))
- data Foldr1Sym1 (a6989586621680390420 :: a ~> (a ~> a)) (b :: TyFun (t a) a)
- type family Foldr1Sym2 (a6989586621680390420 :: a ~> (a ~> a)) (a6989586621680390421 :: t a) :: a where ...
- data Foldl1Sym0 (a1 :: TyFun (a ~> (a ~> a)) (t a ~> a))
- data Foldl1Sym1 (a6989586621680390425 :: a ~> (a ~> a)) (b :: TyFun (t a) a)
- type family Foldl1Sym2 (a6989586621680390425 :: a ~> (a ~> a)) (a6989586621680390426 :: t a) :: a where ...
- data ToListSym0 (a1 :: TyFun (t a) [a])
- type family ToListSym1 (a6989586621680390429 :: t a) :: [a] where ...
- data NullSym0 (a1 :: TyFun (t a) Bool)
- type family NullSym1 (a6989586621680390432 :: t a) :: Bool where ...
- data LengthSym0 (a1 :: TyFun (t a) Natural)
- type family LengthSym1 (a6989586621680390435 :: t a) :: Natural where ...
- data ElemSym0 (a1 :: TyFun a (t a ~> Bool))
- data ElemSym1 (a6989586621680390439 :: a) (b :: TyFun (t a) Bool)
- type family ElemSym2 (a6989586621680390439 :: a) (a6989586621680390440 :: t a) :: Bool where ...
- data MaximumSym0 (a1 :: TyFun (t a) a)
- type family MaximumSym1 (a6989586621680390443 :: t a) :: a where ...
- data MinimumSym0 (a1 :: TyFun (t a) a)
- type family MinimumSym1 (a6989586621680390446 :: t a) :: a where ...
- data SumSym0 (a1 :: TyFun (t a) a)
- type family SumSym1 (a6989586621680390449 :: t a) :: a where ...
- data ProductSym0 (a1 :: TyFun (t a) a)
- type family ProductSym1 (a6989586621680390452 :: t a) :: a where ...
- data FoldrMSym0 (a1 :: TyFun (a ~> (b ~> m b)) (b ~> (t a ~> m b)))
- data FoldrMSym1 (a6989586621680390367 :: a ~> (b ~> m b)) (b1 :: TyFun b (t a ~> m b))
- data FoldrMSym2 (a6989586621680390367 :: a ~> (b ~> m b)) (a6989586621680390368 :: b) (c :: TyFun (t a) (m b))
- type family FoldrMSym3 (a6989586621680390367 :: a ~> (b ~> m b)) (a6989586621680390368 :: b) (a6989586621680390369 :: t a) :: m b where ...
- data FoldlMSym0 (a1 :: TyFun (b ~> (a ~> m b)) (b ~> (t a ~> m b)))
- data FoldlMSym1 (a6989586621680390349 :: b ~> (a ~> m b)) (b1 :: TyFun b (t a ~> m b))
- data FoldlMSym2 (a6989586621680390349 :: b ~> (a ~> m b)) (a6989586621680390350 :: b) (c :: TyFun (t a) (m b))
- type family FoldlMSym3 (a6989586621680390349 :: b ~> (a ~> m b)) (a6989586621680390350 :: b) (a6989586621680390351 :: t a) :: m b where ...
- data Traverse_Sym0 (a1 :: TyFun (a ~> f b) (t a ~> f ()))
- data Traverse_Sym1 (a6989586621680390341 :: a ~> f b) (b1 :: TyFun (t a) (f ()))
- type family Traverse_Sym2 (a6989586621680390341 :: a ~> f b) (a6989586621680390342 :: t a) :: f () where ...
- data For_Sym0 (a1 :: TyFun (t a) ((a ~> f b) ~> f ()))
- data For_Sym1 (a6989586621680390332 :: t a) (b1 :: TyFun (a ~> f b) (f ()))
- type family For_Sym2 (a6989586621680390332 :: t a) (a6989586621680390333 :: a ~> f b) :: f () where ...
- data SequenceA_Sym0 (a1 :: TyFun (t (f a)) (f ()))
- type family SequenceA_Sym1 (a6989586621680390303 :: t (f a)) :: f () where ...
- data AsumSym0 (a1 :: TyFun (t (f a)) (f a))
- type family AsumSym1 (a6989586621680390291 :: t (f a)) :: f a where ...
- data MapM_Sym0 (a1 :: TyFun (a ~> m b) (t a ~> m ()))
- data MapM_Sym1 (a6989586621680390321 :: a ~> m b) (b1 :: TyFun (t a) (m ()))
- type family MapM_Sym2 (a6989586621680390321 :: a ~> m b) (a6989586621680390322 :: t a) :: m () where ...
- data ForM_Sym0 (a1 :: TyFun (t a) ((a ~> m b) ~> m ()))
- data ForM_Sym1 (a6989586621680390312 :: t a) (b1 :: TyFun (a ~> m b) (m ()))
- type family ForM_Sym2 (a6989586621680390312 :: t a) (a6989586621680390313 :: a ~> m b) :: m () where ...
- data Sequence_Sym0 (a1 :: TyFun (t (m a)) (m ()))
- type family Sequence_Sym1 (a6989586621680390297 :: t (m a)) :: m () where ...
- data MsumSym0 (a1 :: TyFun (t (m a)) (m a))
- type family MsumSym1 (a6989586621680390285 :: t (m a)) :: m a where ...
- data ConcatSym0 (a1 :: TyFun (t [a]) [a])
- type family ConcatSym1 (a6989586621680390274 :: t [a]) :: [a] where ...
- data ConcatMapSym0 (a1 :: TyFun (a ~> [b]) (t a ~> [b]))
- data ConcatMapSym1 (a6989586621680390263 :: a ~> [b]) (b1 :: TyFun (t a) [b])
- type family ConcatMapSym2 (a6989586621680390263 :: a ~> [b]) (a6989586621680390264 :: t a) :: [b] where ...
- data AndSym0 (a :: TyFun (t Bool) Bool)
- type family AndSym1 (a6989586621680390258 :: t Bool) :: Bool where ...
- data OrSym0 (a :: TyFun (t Bool) Bool)
- type family OrSym1 (a6989586621680390252 :: t Bool) :: Bool where ...
- data AnySym0 (a1 :: TyFun (a ~> Bool) (t a ~> Bool))
- data AnySym1 (a6989586621680390244 :: a ~> Bool) (b :: TyFun (t a) Bool)
- type family AnySym2 (a6989586621680390244 :: a ~> Bool) (a6989586621680390245 :: t a) :: Bool where ...
- data AllSym0 (a1 :: TyFun (a ~> Bool) (t a ~> Bool))
- data AllSym1 (a6989586621680390235 :: a ~> Bool) (b :: TyFun (t a) Bool)
- type family AllSym2 (a6989586621680390235 :: a ~> Bool) (a6989586621680390236 :: t a) :: Bool where ...
- data MaximumBySym0 (a1 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a))
- data MaximumBySym1 (a6989586621680390215 :: a ~> (a ~> Ordering)) (b :: TyFun (t a) a)
- type family MaximumBySym2 (a6989586621680390215 :: a ~> (a ~> Ordering)) (a6989586621680390216 :: t a) :: a where ...
- data MinimumBySym0 (a1 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a))
- data MinimumBySym1 (a6989586621680390195 :: a ~> (a ~> Ordering)) (b :: TyFun (t a) a)
- type family MinimumBySym2 (a6989586621680390195 :: a ~> (a ~> Ordering)) (a6989586621680390196 :: t a) :: a where ...
- data NotElemSym0 (a1 :: TyFun a (t a ~> Bool))
- data NotElemSym1 (a6989586621680390186 :: a) (b :: TyFun (t a) Bool)
- type family NotElemSym2 (a6989586621680390186 :: a) (a6989586621680390187 :: t a) :: Bool where ...
- data FindSym0 (a1 :: TyFun (a ~> Bool) (t a ~> Maybe a))
- data FindSym1 (a6989586621680390168 :: a ~> Bool) (b :: TyFun (t a) (Maybe a))
- type family FindSym2 (a6989586621680390168 :: a ~> Bool) (a6989586621680390169 :: t a) :: Maybe a where ...
Documentation
class PFoldable (t :: Type -> Type) Source #
type Fold (arg :: t m) :: m Source #
type FoldMap (arg :: a ~> m) (arg1 :: t a) :: m Source #
type FoldMap (arg :: a ~> m) (arg1 :: t a) = Apply (Apply (FoldMap_6989586621680390464Sym0 :: TyFun (a ~> m) (t a ~> m) -> Type) arg) arg1
type Foldr (arg :: a ~> (b ~> b)) (arg1 :: b) (arg2 :: t a) :: b Source #
type Foldr (arg :: a ~> (b ~> b)) (arg1 :: b) (arg2 :: t a) = Apply (Apply (Apply (Foldr_6989586621680390478Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) arg) arg1) arg2
type Foldr' (arg :: a ~> (b ~> b)) (arg1 :: b) (arg2 :: t a) :: b Source #
type Foldr' (arg :: a ~> (b ~> b)) (arg1 :: b) (arg2 :: t a) = Apply (Apply (Apply (Foldr'_6989586621680390493Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) arg) arg1) arg2
type Foldl (arg :: b ~> (a ~> b)) (arg1 :: b) (arg2 :: t a) :: b Source #
type Foldl (arg :: b ~> (a ~> b)) (arg1 :: b) (arg2 :: t a) = Apply (Apply (Apply (Foldl_6989586621680390516Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) arg) arg1) arg2
type Foldl' (arg :: b ~> (a ~> b)) (arg1 :: b) (arg2 :: t a) :: b Source #
type Foldl' (arg :: b ~> (a ~> b)) (arg1 :: b) (arg2 :: t a) = Apply (Apply (Apply (Foldl'_6989586621680390531Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) arg) arg1) arg2
type Foldr1 (arg :: a ~> (a ~> a)) (arg1 :: t a) :: a Source #
type Foldr1 (arg :: a ~> (a ~> a)) (arg1 :: t a) = Apply (Apply (Foldr1_6989586621680390553Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) arg) arg1
type Foldl1 (arg :: a ~> (a ~> a)) (arg1 :: t a) :: a Source #
type Foldl1 (arg :: a ~> (a ~> a)) (arg1 :: t a) = Apply (Apply (Foldl1_6989586621680390574Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) arg) arg1
type ToList (arg :: t a) :: [a] Source #
type Null (arg :: t a) :: Bool Source #
type Length (arg :: t a) :: Natural Source #
type Length (arg :: t a) = Apply (Length_6989586621680390620Sym0 :: TyFun (t a) Natural -> Type) arg
type Elem (arg :: a) (arg1 :: t a) :: Bool Source #
type Elem (arg :: a) (arg1 :: t a) = Apply (Apply (Elem_6989586621680390639Sym0 :: TyFun a (t a ~> Bool) -> Type) arg) arg1
type Maximum (arg :: t a) :: a Source #
type Minimum (arg :: t a) :: a Source #
Instances
PFoldable Identity Source # | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Defined in Data.Functor.Identity.Singletons | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
PFoldable First Source # | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Defined in Data.Foldable.Singletons
| |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
PFoldable Last Source # | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Defined in Data.Foldable.Singletons
| |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
PFoldable First Source # | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Defined in Data.Semigroup.Singletons
| |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
PFoldable Last Source # | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Defined in Data.Semigroup.Singletons
| |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
PFoldable Max Source # | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Defined in Data.Semigroup.Singletons
| |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
PFoldable Min Source # | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Defined in Data.Semigroup.Singletons
| |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
PFoldable Dual Source # | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Defined in Data.Foldable.Singletons
| |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
PFoldable Product Source # | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Defined in Data.Foldable.Singletons
| |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
PFoldable Sum Source # | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Defined in Data.Foldable.Singletons
| |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
PFoldable NonEmpty Source # | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Defined in Data.Foldable.Singletons
| |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
PFoldable Maybe Source # | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Defined in Data.Foldable.Singletons
| |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
PFoldable [] Source # | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Defined in Data.Foldable.Singletons
| |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
PFoldable (Either a) Source # | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Defined in Data.Foldable.Singletons | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
PFoldable (Proxy :: Type -> Type) Source # | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Defined in Data.Foldable.Singletons
| |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
PFoldable (Arg a) Source # | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Defined in Data.Semigroup.Singletons | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
PFoldable ((,) a) Source # | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Defined in Data.Foldable.Singletons | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
PFoldable (Const m :: Type -> Type) Source # | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Defined in Data.Functor.Const.Singletons | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
PFoldable (Product f g) Source # | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Defined in Data.Functor.Product.Singletons | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
PFoldable (Sum f g) Source # | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Defined in Data.Functor.Sum.Singletons | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
PFoldable (Compose f g) Source # | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Defined in Data.Functor.Compose.Singletons |
class SFoldable (t :: Type -> Type) where Source #
Nothing
sFold :: forall m (t1 :: t m). SMonoid m => Sing t1 -> Sing (Apply (FoldSym0 :: TyFun (t m) m -> Type) t1) Source #
default sFold :: forall m (t1 :: t m). (Apply (FoldSym0 :: TyFun (t m) m -> Type) t1 ~ Apply (Fold_6989586621680390454Sym0 :: TyFun (t m) m -> Type) t1, SMonoid m) => Sing t1 -> Sing (Apply (FoldSym0 :: TyFun (t m) m -> Type) t1) Source #
sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: t a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (FoldMapSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) t1) t2) Source #
default sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: t a). (Apply (Apply (FoldMapSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) t1) t2 ~ Apply (Apply (FoldMap_6989586621680390464Sym0 :: TyFun (a ~> m) (t a ~> m) -> Type) t1) t2, SMonoid m) => Sing t1 -> Sing t2 -> Sing (Apply (Apply (FoldMapSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) t1) t2) Source #
sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: t a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) t1) t2) t3) Source #
default sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: t a). Apply (Apply (Apply (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) t1) t2) t3 ~ Apply (Apply (Apply (Foldr_6989586621680390478Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) t1) t2) t3 => Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) t1) t2) t3) Source #
sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: t a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) t1) t2) t3) Source #
default sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: t a). Apply (Apply (Apply (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) t1) t2) t3 ~ Apply (Apply (Apply (Foldr'_6989586621680390493Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) t1) t2) t3 => Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) t1) t2) t3) Source #
sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: t a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) t1) t2) t3) Source #
default sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: t a). Apply (Apply (Apply (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) t1) t2) t3 ~ Apply (Apply (Apply (Foldl_6989586621680390516Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) t1) t2) t3 => Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) t1) t2) t3) Source #
sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: t a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) t1) t2) t3) Source #
default sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: t a). Apply (Apply (Apply (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) t1) t2) t3 ~ Apply (Apply (Apply (Foldl'_6989586621680390531Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) t1) t2) t3 => Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) t1) t2) t3) Source #
sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: t a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) t1) t2) Source #
default sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: t a). Apply (Apply (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) t1) t2 ~ Apply (Apply (Foldr1_6989586621680390553Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) t1) t2 => Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) t1) t2) Source #
sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: t a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) t1) t2) Source #
default sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: t a). Apply (Apply (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) t1) t2 ~ Apply (Apply (Foldl1_6989586621680390574Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) t1) t2 => Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) t1) t2) Source #
sToList :: forall a (t1 :: t a). Sing t1 -> Sing (Apply (ToListSym0 :: TyFun (t a) [a] -> Type) t1) Source #
default sToList :: forall a (t1 :: t a). Apply (ToListSym0 :: TyFun (t a) [a] -> Type) t1 ~ Apply (ToList_6989586621680390594Sym0 :: TyFun (t a) [a] -> Type) t1 => Sing t1 -> Sing (Apply (ToListSym0 :: TyFun (t a) [a] -> Type) t1) Source #
sNull :: forall a (t1 :: t a). Sing t1 -> Sing (Apply (NullSym0 :: TyFun (t a) Bool -> Type) t1) Source #
default sNull :: forall a (t1 :: t a). Apply (NullSym0 :: TyFun (t a) Bool -> Type) t1 ~ Apply (Null_6989586621680390603Sym0 :: TyFun (t a) Bool -> Type) t1 => Sing t1 -> Sing (Apply (NullSym0 :: TyFun (t a) Bool -> Type) t1) Source #
sLength :: forall a (t1 :: t a). Sing t1 -> Sing (Apply (LengthSym0 :: TyFun (t a) Natural -> Type) t1) Source #
default sLength :: forall a (t1 :: t a). Apply (LengthSym0 :: TyFun (t a) Natural -> Type) t1 ~ Apply (Length_6989586621680390620Sym0 :: TyFun (t a) Natural -> Type) t1 => Sing t1 -> Sing (Apply (LengthSym0 :: TyFun (t a) Natural -> Type) t1) Source #
sElem :: forall a (t1 :: a) (t2 :: t a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) t1) t2) Source #
default sElem :: forall a (t1 :: a) (t2 :: t a). (Apply (Apply (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) t1) t2 ~ Apply (Apply (Elem_6989586621680390639Sym0 :: TyFun a (t a ~> Bool) -> Type) t1) t2, SEq a) => Sing t1 -> Sing t2 -> Sing (Apply (Apply (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) t1) t2) Source #
sMaximum :: forall a (t1 :: t a). SOrd a => Sing t1 -> Sing (Apply (MaximumSym0 :: TyFun (t a) a -> Type) t1) Source #
default sMaximum :: forall a (t1 :: t a). (Apply (MaximumSym0 :: TyFun (t a) a -> Type) t1 ~ Apply (Maximum_6989586621680390653Sym0 :: TyFun (t a) a -> Type) t1, SOrd a) => Sing t1 -> Sing (Apply (MaximumSym0 :: TyFun (t a) a -> Type) t1) Source #
sMinimum :: forall a (t1 :: t a). SOrd a => Sing t1 -> Sing (Apply (MinimumSym0 :: TyFun (t a) a -> Type) t1) Source #
default sMinimum :: forall a (t1 :: t a). (Apply (MinimumSym0 :: TyFun (t a) a -> Type) t1 ~ Apply (Minimum_6989586621680390668Sym0 :: TyFun (t a) a -> Type) t1, SOrd a) => Sing t1 -> Sing (Apply (MinimumSym0 :: TyFun (t a) a -> Type) t1) Source #
sSum :: forall a (t1 :: t a). SNum a => Sing t1 -> Sing (Apply (SumSym0 :: TyFun (t a) a -> Type) t1) Source #
default sSum :: forall a (t1 :: t a). (Apply (SumSym0 :: TyFun (t a) a -> Type) t1 ~ Apply (Sum_6989586621680390683Sym0 :: TyFun (t a) a -> Type) t1, SNum a) => Sing t1 -> Sing (Apply (SumSym0 :: TyFun (t a) a -> Type) t1) Source #
sProduct :: forall a (t1 :: t a). SNum a => Sing t1 -> Sing (Apply (ProductSym0 :: TyFun (t a) a -> Type) t1) Source #
Instances
SFoldable Identity Source # | |
Defined in Data.Functor.Identity.Singletons sFold :: forall m (t1 :: Identity m). SMonoid m => Sing t1 -> Sing (Apply (FoldSym0 :: TyFun (Identity m) m -> Type) t1) Source # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Identity a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (FoldMapSym0 :: TyFun (a ~> m) (Identity a ~> m) -> Type) t1) t2) Source # sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Identity a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (Identity a ~> b)) -> Type) t1) t2) t3) Source # sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Identity a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Identity a ~> b)) -> Type) t1) t2) t3) Source # sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Identity a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (Identity a ~> b)) -> Type) t1) t2) t3) Source # sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Identity a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Identity a ~> b)) -> Type) t1) t2) t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Identity a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (Identity a ~> a) -> Type) t1) t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Identity a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (Identity a ~> a) -> Type) t1) t2) Source # sToList :: forall a (t1 :: Identity a). Sing t1 -> Sing (Apply (ToListSym0 :: TyFun (Identity a) [a] -> Type) t1) Source # sNull :: forall a (t1 :: Identity a). Sing t1 -> Sing (Apply (NullSym0 :: TyFun (Identity a) Bool -> Type) t1) Source # sLength :: forall a (t1 :: Identity a). Sing t1 -> Sing (Apply (LengthSym0 :: TyFun (Identity a) Natural -> Type) t1) Source # sElem :: forall a (t1 :: a) (t2 :: Identity a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply (ElemSym0 :: TyFun a (Identity a ~> Bool) -> Type) t1) t2) Source # sMaximum :: forall a (t1 :: Identity a). SOrd a => Sing t1 -> Sing (Apply (MaximumSym0 :: TyFun (Identity a) a -> Type) t1) Source # sMinimum :: forall a (t1 :: Identity a). SOrd a => Sing t1 -> Sing (Apply (MinimumSym0 :: TyFun (Identity a) a -> Type) t1) Source # sSum :: forall a (t1 :: Identity a). SNum a => Sing t1 -> Sing (Apply (SumSym0 :: TyFun (Identity a) a -> Type) t1) Source # sProduct :: forall a (t1 :: Identity a). SNum a => Sing t1 -> Sing (Apply (ProductSym0 :: TyFun (Identity a) a -> Type) t1) Source # | |
SFoldable First Source # | |
Defined in Data.Foldable.Singletons sFold :: forall m (t1 :: First m). SMonoid m => Sing t1 -> Sing (Apply (FoldSym0 :: TyFun (First m) m -> Type) t1) Source # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: First a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (FoldMapSym0 :: TyFun (a ~> m) (First a ~> m) -> Type) t1) t2) Source # sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: First a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (First a ~> b)) -> Type) t1) t2) t3) Source # sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: First a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (First a ~> b)) -> Type) t1) t2) t3) Source # sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: First a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (First a ~> b)) -> Type) t1) t2) t3) Source # sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: First a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (First a ~> b)) -> Type) t1) t2) t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: First a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (First a ~> a) -> Type) t1) t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: First a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (First a ~> a) -> Type) t1) t2) Source # sToList :: forall a (t1 :: First a). Sing t1 -> Sing (Apply (ToListSym0 :: TyFun (First a) [a] -> Type) t1) Source # sNull :: forall a (t1 :: First a). Sing t1 -> Sing (Apply (NullSym0 :: TyFun (First a) Bool -> Type) t1) Source # sLength :: forall a (t1 :: First a). Sing t1 -> Sing (Apply (LengthSym0 :: TyFun (First a) Natural -> Type) t1) Source # sElem :: forall a (t1 :: a) (t2 :: First a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply (ElemSym0 :: TyFun a (First a ~> Bool) -> Type) t1) t2) Source # sMaximum :: forall a (t1 :: First a). SOrd a => Sing t1 -> Sing (Apply (MaximumSym0 :: TyFun (First a) a -> Type) t1) Source # sMinimum :: forall a (t1 :: First a). SOrd a => Sing t1 -> Sing (Apply (MinimumSym0 :: TyFun (First a) a -> Type) t1) Source # sSum :: forall a (t1 :: First a). SNum a => Sing t1 -> Sing (Apply (SumSym0 :: TyFun (First a) a -> Type) t1) Source # sProduct :: forall a (t1 :: First a). SNum a => Sing t1 -> Sing (Apply (ProductSym0 :: TyFun (First a) a -> Type) t1) Source # | |
SFoldable Last Source # | |
Defined in Data.Foldable.Singletons sFold :: forall m (t1 :: Last m). SMonoid m => Sing t1 -> Sing (Apply (FoldSym0 :: TyFun (Last m) m -> Type) t1) Source # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Last a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (FoldMapSym0 :: TyFun (a ~> m) (Last a ~> m) -> Type) t1) t2) Source # sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Last a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (Last a ~> b)) -> Type) t1) t2) t3) Source # sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Last a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Last a ~> b)) -> Type) t1) t2) t3) Source # sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Last a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (Last a ~> b)) -> Type) t1) t2) t3) Source # sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Last a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Last a ~> b)) -> Type) t1) t2) t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Last a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (Last a ~> a) -> Type) t1) t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Last a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (Last a ~> a) -> Type) t1) t2) Source # sToList :: forall a (t1 :: Last a). Sing t1 -> Sing (Apply (ToListSym0 :: TyFun (Last a) [a] -> Type) t1) Source # sNull :: forall a (t1 :: Last a). Sing t1 -> Sing (Apply (NullSym0 :: TyFun (Last a) Bool -> Type) t1) Source # sLength :: forall a (t1 :: Last a). Sing t1 -> Sing (Apply (LengthSym0 :: TyFun (Last a) Natural -> Type) t1) Source # sElem :: forall a (t1 :: a) (t2 :: Last a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply (ElemSym0 :: TyFun a (Last a ~> Bool) -> Type) t1) t2) Source # sMaximum :: forall a (t1 :: Last a). SOrd a => Sing t1 -> Sing (Apply (MaximumSym0 :: TyFun (Last a) a -> Type) t1) Source # sMinimum :: forall a (t1 :: Last a). SOrd a => Sing t1 -> Sing (Apply (MinimumSym0 :: TyFun (Last a) a -> Type) t1) Source # sSum :: forall a (t1 :: Last a). SNum a => Sing t1 -> Sing (Apply (SumSym0 :: TyFun (Last a) a -> Type) t1) Source # sProduct :: forall a (t1 :: Last a). SNum a => Sing t1 -> Sing (Apply (ProductSym0 :: TyFun (Last a) a -> Type) t1) Source # | |
SFoldable First Source # | |
Defined in Data.Semigroup.Singletons sFold :: forall m (t1 :: First m). SMonoid m => Sing t1 -> Sing (Apply (FoldSym0 :: TyFun (First m) m -> Type) t1) Source # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: First a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (FoldMapSym0 :: TyFun (a ~> m) (First a ~> m) -> Type) t1) t2) Source # sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: First a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (First a ~> b)) -> Type) t1) t2) t3) Source # sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: First a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (First a ~> b)) -> Type) t1) t2) t3) Source # sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: First a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (First a ~> b)) -> Type) t1) t2) t3) Source # sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: First a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (First a ~> b)) -> Type) t1) t2) t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: First a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (First a ~> a) -> Type) t1) t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: First a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (First a ~> a) -> Type) t1) t2) Source # sToList :: forall a (t1 :: First a). Sing t1 -> Sing (Apply (ToListSym0 :: TyFun (First a) [a] -> Type) t1) Source # sNull :: forall a (t1 :: First a). Sing t1 -> Sing (Apply (NullSym0 :: TyFun (First a) Bool -> Type) t1) Source # sLength :: forall a (t1 :: First a). Sing t1 -> Sing (Apply (LengthSym0 :: TyFun (First a) Natural -> Type) t1) Source # sElem :: forall a (t1 :: a) (t2 :: First a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply (ElemSym0 :: TyFun a (First a ~> Bool) -> Type) t1) t2) Source # sMaximum :: forall a (t1 :: First a). SOrd a => Sing t1 -> Sing (Apply (MaximumSym0 :: TyFun (First a) a -> Type) t1) Source # sMinimum :: forall a (t1 :: First a). SOrd a => Sing t1 -> Sing (Apply (MinimumSym0 :: TyFun (First a) a -> Type) t1) Source # sSum :: forall a (t1 :: First a). SNum a => Sing t1 -> Sing (Apply (SumSym0 :: TyFun (First a) a -> Type) t1) Source # sProduct :: forall a (t1 :: First a). SNum a => Sing t1 -> Sing (Apply (ProductSym0 :: TyFun (First a) a -> Type) t1) Source # | |
SFoldable Last Source # | |
Defined in Data.Semigroup.Singletons sFold :: forall m (t1 :: Last m). SMonoid m => Sing t1 -> Sing (Apply (FoldSym0 :: TyFun (Last m) m -> Type) t1) Source # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Last a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (FoldMapSym0 :: TyFun (a ~> m) (Last a ~> m) -> Type) t1) t2) Source # sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Last a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (Last a ~> b)) -> Type) t1) t2) t3) Source # sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Last a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Last a ~> b)) -> Type) t1) t2) t3) Source # sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Last a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (Last a ~> b)) -> Type) t1) t2) t3) Source # sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Last a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Last a ~> b)) -> Type) t1) t2) t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Last a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (Last a ~> a) -> Type) t1) t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Last a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (Last a ~> a) -> Type) t1) t2) Source # sToList :: forall a (t1 :: Last a). Sing t1 -> Sing (Apply (ToListSym0 :: TyFun (Last a) [a] -> Type) t1) Source # sNull :: forall a (t1 :: Last a). Sing t1 -> Sing (Apply (NullSym0 :: TyFun (Last a) Bool -> Type) t1) Source # sLength :: forall a (t1 :: Last a). Sing t1 -> Sing (Apply (LengthSym0 :: TyFun (Last a) Natural -> Type) t1) Source # sElem :: forall a (t1 :: a) (t2 :: Last a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply (ElemSym0 :: TyFun a (Last a ~> Bool) -> Type) t1) t2) Source # sMaximum :: forall a (t1 :: Last a). SOrd a => Sing t1 -> Sing (Apply (MaximumSym0 :: TyFun (Last a) a -> Type) t1) Source # sMinimum :: forall a (t1 :: Last a). SOrd a => Sing t1 -> Sing (Apply (MinimumSym0 :: TyFun (Last a) a -> Type) t1) Source # sSum :: forall a (t1 :: Last a). SNum a => Sing t1 -> Sing (Apply (SumSym0 :: TyFun (Last a) a -> Type) t1) Source # sProduct :: forall a (t1 :: Last a). SNum a => Sing t1 -> Sing (Apply (ProductSym0 :: TyFun (Last a) a -> Type) t1) Source # | |
SFoldable Max Source # | |
Defined in Data.Semigroup.Singletons sFold :: forall m (t1 :: Max m). SMonoid m => Sing t1 -> Sing (Apply (FoldSym0 :: TyFun (Max m) m -> Type) t1) Source # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Max a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (FoldMapSym0 :: TyFun (a ~> m) (Max a ~> m) -> Type) t1) t2) Source # sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Max a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (Max a ~> b)) -> Type) t1) t2) t3) Source # sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Max a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Max a ~> b)) -> Type) t1) t2) t3) Source # sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Max a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (Max a ~> b)) -> Type) t1) t2) t3) Source # sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Max a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Max a ~> b)) -> Type) t1) t2) t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Max a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (Max a ~> a) -> Type) t1) t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Max a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (Max a ~> a) -> Type) t1) t2) Source # sToList :: forall a (t1 :: Max a). Sing t1 -> Sing (Apply (ToListSym0 :: TyFun (Max a) [a] -> Type) t1) Source # sNull :: forall a (t1 :: Max a). Sing t1 -> Sing (Apply (NullSym0 :: TyFun (Max a) Bool -> Type) t1) Source # sLength :: forall a (t1 :: Max a). Sing t1 -> Sing (Apply (LengthSym0 :: TyFun (Max a) Natural -> Type) t1) Source # sElem :: forall a (t1 :: a) (t2 :: Max a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply (ElemSym0 :: TyFun a (Max a ~> Bool) -> Type) t1) t2) Source # sMaximum :: forall a (t1 :: Max a). SOrd a => Sing t1 -> Sing (Apply (MaximumSym0 :: TyFun (Max a) a -> Type) t1) Source # sMinimum :: forall a (t1 :: Max a). SOrd a => Sing t1 -> Sing (Apply (MinimumSym0 :: TyFun (Max a) a -> Type) t1) Source # sSum :: forall a (t1 :: Max a). SNum a => Sing t1 -> Sing (Apply (SumSym0 :: TyFun (Max a) a -> Type) t1) Source # sProduct :: forall a (t1 :: Max a). SNum a => Sing t1 -> Sing (Apply (ProductSym0 :: TyFun (Max a) a -> Type) t1) Source # | |
SFoldable Min Source # | |
Defined in Data.Semigroup.Singletons sFold :: forall m (t1 :: Min m). SMonoid m => Sing t1 -> Sing (Apply (FoldSym0 :: TyFun (Min m) m -> Type) t1) Source # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Min a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (FoldMapSym0 :: TyFun (a ~> m) (Min a ~> m) -> Type) t1) t2) Source # sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Min a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (Min a ~> b)) -> Type) t1) t2) t3) Source # sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Min a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Min a ~> b)) -> Type) t1) t2) t3) Source # sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Min a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (Min a ~> b)) -> Type) t1) t2) t3) Source # sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Min a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Min a ~> b)) -> Type) t1) t2) t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Min a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (Min a ~> a) -> Type) t1) t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Min a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (Min a ~> a) -> Type) t1) t2) Source # sToList :: forall a (t1 :: Min a). Sing t1 -> Sing (Apply (ToListSym0 :: TyFun (Min a) [a] -> Type) t1) Source # sNull :: forall a (t1 :: Min a). Sing t1 -> Sing (Apply (NullSym0 :: TyFun (Min a) Bool -> Type) t1) Source # sLength :: forall a (t1 :: Min a). Sing t1 -> Sing (Apply (LengthSym0 :: TyFun (Min a) Natural -> Type) t1) Source # sElem :: forall a (t1 :: a) (t2 :: Min a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply (ElemSym0 :: TyFun a (Min a ~> Bool) -> Type) t1) t2) Source # sMaximum :: forall a (t1 :: Min a). SOrd a => Sing t1 -> Sing (Apply (MaximumSym0 :: TyFun (Min a) a -> Type) t1) Source # sMinimum :: forall a (t1 :: Min a). SOrd a => Sing t1 -> Sing (Apply (MinimumSym0 :: TyFun (Min a) a -> Type) t1) Source # sSum :: forall a (t1 :: Min a). SNum a => Sing t1 -> Sing (Apply (SumSym0 :: TyFun (Min a) a -> Type) t1) Source # sProduct :: forall a (t1 :: Min a). SNum a => Sing t1 -> Sing (Apply (ProductSym0 :: TyFun (Min a) a -> Type) t1) Source # | |
SFoldable Dual Source # | |
Defined in Data.Foldable.Singletons sFold :: forall m (t1 :: Dual m). SMonoid m => Sing t1 -> Sing (Apply (FoldSym0 :: TyFun (Dual m) m -> Type) t1) Source # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Dual a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (FoldMapSym0 :: TyFun (a ~> m) (Dual a ~> m) -> Type) t1) t2) Source # sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Dual a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (Dual a ~> b)) -> Type) t1) t2) t3) Source # sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Dual a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Dual a ~> b)) -> Type) t1) t2) t3) Source # sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Dual a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (Dual a ~> b)) -> Type) t1) t2) t3) Source # sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Dual a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Dual a ~> b)) -> Type) t1) t2) t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Dual a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (Dual a ~> a) -> Type) t1) t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Dual a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (Dual a ~> a) -> Type) t1) t2) Source # sToList :: forall a (t1 :: Dual a). Sing t1 -> Sing (Apply (ToListSym0 :: TyFun (Dual a) [a] -> Type) t1) Source # sNull :: forall a (t1 :: Dual a). Sing t1 -> Sing (Apply (NullSym0 :: TyFun (Dual a) Bool -> Type) t1) Source # sLength :: forall a (t1 :: Dual a). Sing t1 -> Sing (Apply (LengthSym0 :: TyFun (Dual a) Natural -> Type) t1) Source # sElem :: forall a (t1 :: a) (t2 :: Dual a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply (ElemSym0 :: TyFun a (Dual a ~> Bool) -> Type) t1) t2) Source # sMaximum :: forall a (t1 :: Dual a). SOrd a => Sing t1 -> Sing (Apply (MaximumSym0 :: TyFun (Dual a) a -> Type) t1) Source # sMinimum :: forall a (t1 :: Dual a). SOrd a => Sing t1 -> Sing (Apply (MinimumSym0 :: TyFun (Dual a) a -> Type) t1) Source # sSum :: forall a (t1 :: Dual a). SNum a => Sing t1 -> Sing (Apply (SumSym0 :: TyFun (Dual a) a -> Type) t1) Source # sProduct :: forall a (t1 :: Dual a). SNum a => Sing t1 -> Sing (Apply (ProductSym0 :: TyFun (Dual a) a -> Type) t1) Source # | |
SFoldable Product Source # | |
Defined in Data.Foldable.Singletons sFold :: forall m (t1 :: Product m). SMonoid m => Sing t1 -> Sing (Apply (FoldSym0 :: TyFun (Product m) m -> Type) t1) Source # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Product a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (FoldMapSym0 :: TyFun (a ~> m) (Product a ~> m) -> Type) t1) t2) Source # sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Product a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (Product a ~> b)) -> Type) t1) t2) t3) Source # sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Product a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Product a ~> b)) -> Type) t1) t2) t3) Source # sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Product a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (Product a ~> b)) -> Type) t1) t2) t3) Source # sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Product a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Product a ~> b)) -> Type) t1) t2) t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Product a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (Product a ~> a) -> Type) t1) t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Product a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (Product a ~> a) -> Type) t1) t2) Source # sToList :: forall a (t1 :: Product a). Sing t1 -> Sing (Apply (ToListSym0 :: TyFun (Product a) [a] -> Type) t1) Source # sNull :: forall a (t1 :: Product a). Sing t1 -> Sing (Apply (NullSym0 :: TyFun (Product a) Bool -> Type) t1) Source # sLength :: forall a (t1 :: Product a). Sing t1 -> Sing (Apply (LengthSym0 :: TyFun (Product a) Natural -> Type) t1) Source # sElem :: forall a (t1 :: a) (t2 :: Product a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply (ElemSym0 :: TyFun a (Product a ~> Bool) -> Type) t1) t2) Source # sMaximum :: forall a (t1 :: Product a). SOrd a => Sing t1 -> Sing (Apply (MaximumSym0 :: TyFun (Product a) a -> Type) t1) Source # sMinimum :: forall a (t1 :: Product a). SOrd a => Sing t1 -> Sing (Apply (MinimumSym0 :: TyFun (Product a) a -> Type) t1) Source # sSum :: forall a (t1 :: Product a). SNum a => Sing t1 -> Sing (Apply (SumSym0 :: TyFun (Product a) a -> Type) t1) Source # sProduct :: forall a (t1 :: Product a). SNum a => Sing t1 -> Sing (Apply (ProductSym0 :: TyFun (Product a) a -> Type) t1) Source # | |
SFoldable Sum Source # | |
Defined in Data.Foldable.Singletons sFold :: forall m (t1 :: Sum m). SMonoid m => Sing t1 -> Sing (Apply (FoldSym0 :: TyFun (Sum m) m -> Type) t1) Source # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Sum a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (FoldMapSym0 :: TyFun (a ~> m) (Sum a ~> m) -> Type) t1) t2) Source # sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Sum a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (Sum a ~> b)) -> Type) t1) t2) t3) Source # sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Sum a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Sum a ~> b)) -> Type) t1) t2) t3) Source # sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Sum a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (Sum a ~> b)) -> Type) t1) t2) t3) Source # sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Sum a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Sum a ~> b)) -> Type) t1) t2) t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Sum a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (Sum a ~> a) -> Type) t1) t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Sum a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (Sum a ~> a) -> Type) t1) t2) Source # sToList :: forall a (t1 :: Sum a). Sing t1 -> Sing (Apply (ToListSym0 :: TyFun (Sum a) [a] -> Type) t1) Source # sNull :: forall a (t1 :: Sum a). Sing t1 -> Sing (Apply (NullSym0 :: TyFun (Sum a) Bool -> Type) t1) Source # sLength :: forall a (t1 :: Sum a). Sing t1 -> Sing (Apply (LengthSym0 :: TyFun (Sum a) Natural -> Type) t1) Source # sElem :: forall a (t1 :: a) (t2 :: Sum a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply (ElemSym0 :: TyFun a (Sum a ~> Bool) -> Type) t1) t2) Source # sMaximum :: forall a (t1 :: Sum a). SOrd a => Sing t1 -> Sing (Apply (MaximumSym0 :: TyFun (Sum a) a -> Type) t1) Source # sMinimum :: forall a (t1 :: Sum a). SOrd a => Sing t1 -> Sing (Apply (MinimumSym0 :: TyFun (Sum a) a -> Type) t1) Source # sSum :: forall a (t1 :: Sum a). SNum a => Sing t1 -> Sing (Apply (SumSym0 :: TyFun (Sum a) a -> Type) t1) Source # sProduct :: forall a (t1 :: Sum a). SNum a => Sing t1 -> Sing (Apply (ProductSym0 :: TyFun (Sum a) a -> Type) t1) Source # | |
SFoldable NonEmpty Source # | |
Defined in Data.Foldable.Singletons sFold :: forall m (t1 :: NonEmpty m). SMonoid m => Sing t1 -> Sing (Apply (FoldSym0 :: TyFun (NonEmpty m) m -> Type) t1) Source # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: NonEmpty a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (FoldMapSym0 :: TyFun (a ~> m) (NonEmpty a ~> m) -> Type) t1) t2) Source # sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (NonEmpty a ~> b)) -> Type) t1) t2) t3) Source # sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (NonEmpty a ~> b)) -> Type) t1) t2) t3) Source # sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (NonEmpty a ~> b)) -> Type) t1) t2) t3) Source # sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (NonEmpty a ~> b)) -> Type) t1) t2) t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (NonEmpty a ~> a) -> Type) t1) t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (NonEmpty a ~> a) -> Type) t1) t2) Source # sToList :: forall a (t1 :: NonEmpty a). Sing t1 -> Sing (Apply (ToListSym0 :: TyFun (NonEmpty a) [a] -> Type) t1) Source # sNull :: forall a (t1 :: NonEmpty a). Sing t1 -> Sing (Apply (NullSym0 :: TyFun (NonEmpty a) Bool -> Type) t1) Source # sLength :: forall a (t1 :: NonEmpty a). Sing t1 -> Sing (Apply (LengthSym0 :: TyFun (NonEmpty a) Natural -> Type) t1) Source # sElem :: forall a (t1 :: a) (t2 :: NonEmpty a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply (ElemSym0 :: TyFun a (NonEmpty a ~> Bool) -> Type) t1) t2) Source # sMaximum :: forall a (t1 :: NonEmpty a). SOrd a => Sing t1 -> Sing (Apply (MaximumSym0 :: TyFun (NonEmpty a) a -> Type) t1) Source # sMinimum :: forall a (t1 :: NonEmpty a). SOrd a => Sing t1 -> Sing (Apply (MinimumSym0 :: TyFun (NonEmpty a) a -> Type) t1) Source # sSum :: forall a (t1 :: NonEmpty a). SNum a => Sing t1 -> Sing (Apply (SumSym0 :: TyFun (NonEmpty a) a -> Type) t1) Source # sProduct :: forall a (t1 :: NonEmpty a). SNum a => Sing t1 -> Sing (Apply (ProductSym0 :: TyFun (NonEmpty a) a -> Type) t1) Source # | |
SFoldable Maybe Source # | |
Defined in Data.Foldable.Singletons sFold :: forall m (t1 :: Maybe m). SMonoid m => Sing t1 -> Sing (Apply (FoldSym0 :: TyFun (Maybe m) m -> Type) t1) Source # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Maybe a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (FoldMapSym0 :: TyFun (a ~> m) (Maybe a ~> m) -> Type) t1) t2) Source # sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Maybe a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (Maybe a ~> b)) -> Type) t1) t2) t3) Source # sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Maybe a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Maybe a ~> b)) -> Type) t1) t2) t3) Source # sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Maybe a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (Maybe a ~> b)) -> Type) t1) t2) t3) Source # sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Maybe a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Maybe a ~> b)) -> Type) t1) t2) t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (Maybe a ~> a) -> Type) t1) t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (Maybe a ~> a) -> Type) t1) t2) Source # sToList :: forall a (t1 :: Maybe a). Sing t1 -> Sing (Apply (ToListSym0 :: TyFun (Maybe a) [a] -> Type) t1) Source # sNull :: forall a (t1 :: Maybe a). Sing t1 -> Sing (Apply (NullSym0 :: TyFun (Maybe a) Bool -> Type) t1) Source # sLength :: forall a (t1 :: Maybe a). Sing t1 -> Sing (Apply (LengthSym0 :: TyFun (Maybe a) Natural -> Type) t1) Source # sElem :: forall a (t1 :: a) (t2 :: Maybe a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply (ElemSym0 :: TyFun a (Maybe a ~> Bool) -> Type) t1) t2) Source # sMaximum :: forall a (t1 :: Maybe a). SOrd a => Sing t1 -> Sing (Apply (MaximumSym0 :: TyFun (Maybe a) a -> Type) t1) Source # sMinimum :: forall a (t1 :: Maybe a). SOrd a => Sing t1 -> Sing (Apply (MinimumSym0 :: TyFun (Maybe a) a -> Type) t1) Source # sSum :: forall a (t1 :: Maybe a). SNum a => Sing t1 -> Sing (Apply (SumSym0 :: TyFun (Maybe a) a -> Type) t1) Source # sProduct :: forall a (t1 :: Maybe a). SNum a => Sing t1 -> Sing (Apply (ProductSym0 :: TyFun (Maybe a) a -> Type) t1) Source # | |
SFoldable [] Source # | |
Defined in Data.Foldable.Singletons sFold :: forall m (t1 :: [m]). SMonoid m => Sing t1 -> Sing (Apply (FoldSym0 :: TyFun [m] m -> Type) t1) Source # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: [a]). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (FoldMapSym0 :: TyFun (a ~> m) ([a] ~> m) -> Type) t1) t2) Source # sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: [a]). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> ([a] ~> b)) -> Type) t1) t2) t3) Source # sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: [a]). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> ([a] ~> b)) -> Type) t1) t2) t3) Source # sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: [a]). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> ([a] ~> b)) -> Type) t1) t2) t3) Source # sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: [a]). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> ([a] ~> b)) -> Type) t1) t2) t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) ([a] ~> a) -> Type) t1) t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) ([a] ~> a) -> Type) t1) t2) Source # sToList :: forall a (t1 :: [a]). Sing t1 -> Sing (Apply (ToListSym0 :: TyFun [a] [a] -> Type) t1) Source # sNull :: forall a (t1 :: [a]). Sing t1 -> Sing (Apply (NullSym0 :: TyFun [a] Bool -> Type) t1) Source # sLength :: forall a (t1 :: [a]). Sing t1 -> Sing (Apply (LengthSym0 :: TyFun [a] Natural -> Type) t1) Source # sElem :: forall a (t1 :: a) (t2 :: [a]). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply (ElemSym0 :: TyFun a ([a] ~> Bool) -> Type) t1) t2) Source # sMaximum :: forall a (t1 :: [a]). SOrd a => Sing t1 -> Sing (Apply (MaximumSym0 :: TyFun [a] a -> Type) t1) Source # sMinimum :: forall a (t1 :: [a]). SOrd a => Sing t1 -> Sing (Apply (MinimumSym0 :: TyFun [a] a -> Type) t1) Source # sSum :: forall a (t1 :: [a]). SNum a => Sing t1 -> Sing (Apply (SumSym0 :: TyFun [a] a -> Type) t1) Source # sProduct :: forall a (t1 :: [a]). SNum a => Sing t1 -> Sing (Apply (ProductSym0 :: TyFun [a] a -> Type) t1) Source # | |
SFoldable (Either a) Source # | |
Defined in Data.Foldable.Singletons sFold :: forall m (t1 :: Either a m). SMonoid m => Sing t1 -> Sing (Apply (FoldSym0 :: TyFun (Either a m) m -> Type) t1) Source # sFoldMap :: forall a0 m (t1 :: a0 ~> m) (t2 :: Either a a0). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (FoldMapSym0 :: TyFun (a ~> m) (Either a a ~> m) -> Type) t1) t2) Source # sFoldr :: forall a0 b (t1 :: a0 ~> (b ~> b)) (t2 :: b) (t3 :: Either a a0). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (Either a a ~> b)) -> Type) t1) t2) t3) Source # sFoldr' :: forall a0 b (t1 :: a0 ~> (b ~> b)) (t2 :: b) (t3 :: Either a a0). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Either a a ~> b)) -> Type) t1) t2) t3) Source # sFoldl :: forall b a0 (t1 :: b ~> (a0 ~> b)) (t2 :: b) (t3 :: Either a a0). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (Either a a ~> b)) -> Type) t1) t2) t3) Source # sFoldl' :: forall b a0 (t1 :: b ~> (a0 ~> b)) (t2 :: b) (t3 :: Either a a0). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Either a a ~> b)) -> Type) t1) t2) t3) Source # sFoldr1 :: forall a0 (t1 :: a0 ~> (a0 ~> a0)) (t2 :: Either a a0). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (Either a a ~> a) -> Type) t1) t2) Source # sFoldl1 :: forall a0 (t1 :: a0 ~> (a0 ~> a0)) (t2 :: Either a a0). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (Either a a ~> a) -> Type) t1) t2) Source # sToList :: forall a0 (t1 :: Either a a0). Sing t1 -> Sing (Apply (ToListSym0 :: TyFun (Either a a) [a] -> Type) t1) Source # sNull :: forall a0 (t1 :: Either a a0). Sing t1 -> Sing (Apply (NullSym0 :: TyFun (Either a a) Bool -> Type) t1) Source # sLength :: forall a0 (t1 :: Either a a0). Sing t1 -> Sing (Apply (LengthSym0 :: TyFun (Either a a) Natural -> Type) t1) Source # sElem :: forall a0 (t1 :: a0) (t2 :: Either a a0). SEq a0 => Sing t1 -> Sing t2 -> Sing (Apply (Apply (ElemSym0 :: TyFun a (Either a a ~> Bool) -> Type) t1) t2) Source # sMaximum :: forall a0 (t1 :: Either a a0). SOrd a0 => Sing t1 -> Sing (Apply (MaximumSym0 :: TyFun (Either a a) a -> Type) t1) Source # sMinimum :: forall a0 (t1 :: Either a a0). SOrd a0 => Sing t1 -> Sing (Apply (MinimumSym0 :: TyFun (Either a a) a -> Type) t1) Source # sSum :: forall a0 (t1 :: Either a a0). SNum a0 => Sing t1 -> Sing (Apply (SumSym0 :: TyFun (Either a a) a -> Type) t1) Source # sProduct :: forall a0 (t1 :: Either a a0). SNum a0 => Sing t1 -> Sing (Apply (ProductSym0 :: TyFun (Either a a) a -> Type) t1) Source # | |
SFoldable (Proxy :: Type -> Type) Source # | |
Defined in Data.Foldable.Singletons sFold :: forall m (t1 :: Proxy m). SMonoid m => Sing t1 -> Sing (Apply (FoldSym0 :: TyFun (Proxy m) m -> Type) t1) Source # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Proxy a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (FoldMapSym0 :: TyFun (a ~> m) (Proxy a ~> m) -> Type) t1) t2) Source # sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Proxy a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (Proxy a ~> b)) -> Type) t1) t2) t3) Source # sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Proxy a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Proxy a ~> b)) -> Type) t1) t2) t3) Source # sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Proxy a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (Proxy a ~> b)) -> Type) t1) t2) t3) Source # sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Proxy a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Proxy a ~> b)) -> Type) t1) t2) t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Proxy a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (Proxy a ~> a) -> Type) t1) t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Proxy a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (Proxy a ~> a) -> Type) t1) t2) Source # sToList :: forall a (t1 :: Proxy a). Sing t1 -> Sing (Apply (ToListSym0 :: TyFun (Proxy a) [a] -> Type) t1) Source # sNull :: forall a (t1 :: Proxy a). Sing t1 -> Sing (Apply (NullSym0 :: TyFun (Proxy a) Bool -> Type) t1) Source # sLength :: forall a (t1 :: Proxy a). Sing t1 -> Sing (Apply (LengthSym0 :: TyFun (Proxy a) Natural -> Type) t1) Source # sElem :: forall a (t1 :: a) (t2 :: Proxy a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply (ElemSym0 :: TyFun a (Proxy a ~> Bool) -> Type) t1) t2) Source # sMaximum :: forall a (t1 :: Proxy a). SOrd a => Sing t1 -> Sing (Apply (MaximumSym0 :: TyFun (Proxy a) a -> Type) t1) Source # sMinimum :: forall a (t1 :: Proxy a). SOrd a => Sing t1 -> Sing (Apply (MinimumSym0 :: TyFun (Proxy a) a -> Type) t1) Source # sSum :: forall a (t1 :: Proxy a). SNum a => Sing t1 -> Sing (Apply (SumSym0 :: TyFun (Proxy a) a -> Type) t1) Source # sProduct :: forall a (t1 :: Proxy a). SNum a => Sing t1 -> Sing (Apply (ProductSym0 :: TyFun (Proxy a) a -> Type) t1) Source # | |
SFoldable (Arg a) Source # | |
Defined in Data.Semigroup.Singletons sFold :: forall m (t1 :: Arg a m). SMonoid m => Sing t1 -> Sing (Apply (FoldSym0 :: TyFun (Arg a m) m -> Type) t1) Source # sFoldMap :: forall a0 m (t1 :: a0 ~> m) (t2 :: Arg a a0). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (FoldMapSym0 :: TyFun (a ~> m) (Arg a a ~> m) -> Type) t1) t2) Source # sFoldr :: forall a0 b (t1 :: a0 ~> (b ~> b)) (t2 :: b) (t3 :: Arg a a0). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (Arg a a ~> b)) -> Type) t1) t2) t3) Source # sFoldr' :: forall a0 b (t1 :: a0 ~> (b ~> b)) (t2 :: b) (t3 :: Arg a a0). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Arg a a ~> b)) -> Type) t1) t2) t3) Source # sFoldl :: forall b a0 (t1 :: b ~> (a0 ~> b)) (t2 :: b) (t3 :: Arg a a0). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (Arg a a ~> b)) -> Type) t1) t2) t3) Source # sFoldl' :: forall b a0 (t1 :: b ~> (a0 ~> b)) (t2 :: b) (t3 :: Arg a a0). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Arg a a ~> b)) -> Type) t1) t2) t3) Source # sFoldr1 :: forall a0 (t1 :: a0 ~> (a0 ~> a0)) (t2 :: Arg a a0). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (Arg a a ~> a) -> Type) t1) t2) Source # sFoldl1 :: forall a0 (t1 :: a0 ~> (a0 ~> a0)) (t2 :: Arg a a0). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (Arg a a ~> a) -> Type) t1) t2) Source # sToList :: forall a0 (t1 :: Arg a a0). Sing t1 -> Sing (Apply (ToListSym0 :: TyFun (Arg a a) [a] -> Type) t1) Source # sNull :: forall a0 (t1 :: Arg a a0). Sing t1 -> Sing (Apply (NullSym0 :: TyFun (Arg a a) Bool -> Type) t1) Source # sLength :: forall a0 (t1 :: Arg a a0). Sing t1 -> Sing (Apply (LengthSym0 :: TyFun (Arg a a) Natural -> Type) t1) Source # sElem :: forall a0 (t1 :: a0) (t2 :: Arg a a0). SEq a0 => Sing t1 -> Sing t2 -> Sing (Apply (Apply (ElemSym0 :: TyFun a (Arg a a ~> Bool) -> Type) t1) t2) Source # sMaximum :: forall a0 (t1 :: Arg a a0). SOrd a0 => Sing t1 -> Sing (Apply (MaximumSym0 :: TyFun (Arg a a) a -> Type) t1) Source # sMinimum :: forall a0 (t1 :: Arg a a0). SOrd a0 => Sing t1 -> Sing (Apply (MinimumSym0 :: TyFun (Arg a a) a -> Type) t1) Source # sSum :: forall a0 (t1 :: Arg a a0). SNum a0 => Sing t1 -> Sing (Apply (SumSym0 :: TyFun (Arg a a) a -> Type) t1) Source # sProduct :: forall a0 (t1 :: Arg a a0). SNum a0 => Sing t1 -> Sing (Apply (ProductSym0 :: TyFun (Arg a a) a -> Type) t1) Source # | |
SFoldable ((,) a) Source # | |
Defined in Data.Foldable.Singletons sFold :: forall m (t1 :: (a, m)). SMonoid m => Sing t1 -> Sing (Apply (FoldSym0 :: TyFun (a, m) m -> Type) t1) Source # sFoldMap :: forall a0 m (t1 :: a0 ~> m) (t2 :: (a, a0)). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (FoldMapSym0 :: TyFun (a ~> m) ((a, a) ~> m) -> Type) t1) t2) Source # sFoldr :: forall a0 b (t1 :: a0 ~> (b ~> b)) (t2 :: b) (t3 :: (a, a0)). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> ((a, a) ~> b)) -> Type) t1) t2) t3) Source # sFoldr' :: forall a0 b (t1 :: a0 ~> (b ~> b)) (t2 :: b) (t3 :: (a, a0)). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> ((a, a) ~> b)) -> Type) t1) t2) t3) Source # sFoldl :: forall b a0 (t1 :: b ~> (a0 ~> b)) (t2 :: b) (t3 :: (a, a0)). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> ((a, a) ~> b)) -> Type) t1) t2) t3) Source # sFoldl' :: forall b a0 (t1 :: b ~> (a0 ~> b)) (t2 :: b) (t3 :: (a, a0)). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> ((a, a) ~> b)) -> Type) t1) t2) t3) Source # sFoldr1 :: forall a0 (t1 :: a0 ~> (a0 ~> a0)) (t2 :: (a, a0)). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) ((a, a) ~> a) -> Type) t1) t2) Source # sFoldl1 :: forall a0 (t1 :: a0 ~> (a0 ~> a0)) (t2 :: (a, a0)). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) ((a, a) ~> a) -> Type) t1) t2) Source # sToList :: forall a0 (t1 :: (a, a0)). Sing t1 -> Sing (Apply (ToListSym0 :: TyFun (a, a) [a] -> Type) t1) Source # sNull :: forall a0 (t1 :: (a, a0)). Sing t1 -> Sing (Apply (NullSym0 :: TyFun (a, a) Bool -> Type) t1) Source # sLength :: forall a0 (t1 :: (a, a0)). Sing t1 -> Sing (Apply (LengthSym0 :: TyFun (a, a) Natural -> Type) t1) Source # sElem :: forall a0 (t1 :: a0) (t2 :: (a, a0)). SEq a0 => Sing t1 -> Sing t2 -> Sing (Apply (Apply (ElemSym0 :: TyFun a ((a, a) ~> Bool) -> Type) t1) t2) Source # sMaximum :: forall a0 (t1 :: (a, a0)). SOrd a0 => Sing t1 -> Sing (Apply (MaximumSym0 :: TyFun (a, a) a -> Type) t1) Source # sMinimum :: forall a0 (t1 :: (a, a0)). SOrd a0 => Sing t1 -> Sing (Apply (MinimumSym0 :: TyFun (a, a) a -> Type) t1) Source # sSum :: forall a0 (t1 :: (a, a0)). SNum a0 => Sing t1 -> Sing (Apply (SumSym0 :: TyFun (a, a) a -> Type) t1) Source # sProduct :: forall a0 (t1 :: (a, a0)). SNum a0 => Sing t1 -> Sing (Apply (ProductSym0 :: TyFun (a, a) a -> Type) t1) Source # | |
SFoldable (Const m :: Type -> Type) Source # | |
Defined in Data.Functor.Const.Singletons sFold :: forall m0 (t1 :: Const m m0). SMonoid m0 => Sing t1 -> Sing (Apply (FoldSym0 :: TyFun (Const m m) m -> Type) t1) Source # sFoldMap :: forall a m0 (t1 :: a ~> m0) (t2 :: Const m a). SMonoid m0 => Sing t1 -> Sing t2 -> Sing (Apply (Apply (FoldMapSym0 :: TyFun (a ~> m) (Const m a ~> m) -> Type) t1) t2) Source # sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Const m a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (Const m a ~> b)) -> Type) t1) t2) t3) Source # sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Const m a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Const m a ~> b)) -> Type) t1) t2) t3) Source # sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Const m a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (Const m a ~> b)) -> Type) t1) t2) t3) Source # sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Const m a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Const m a ~> b)) -> Type) t1) t2) t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Const m a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (Const m a ~> a) -> Type) t1) t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Const m a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (Const m a ~> a) -> Type) t1) t2) Source # sToList :: forall a (t1 :: Const m a). Sing t1 -> Sing (Apply (ToListSym0 :: TyFun (Const m a) [a] -> Type) t1) Source # sNull :: forall a (t1 :: Const m a). Sing t1 -> Sing (Apply (NullSym0 :: TyFun (Const m a) Bool -> Type) t1) Source # sLength :: forall a (t1 :: Const m a). Sing t1 -> Sing (Apply (LengthSym0 :: TyFun (Const m a) Natural -> Type) t1) Source # sElem :: forall a (t1 :: a) (t2 :: Const m a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply (ElemSym0 :: TyFun a (Const m a ~> Bool) -> Type) t1) t2) Source # sMaximum :: forall a (t1 :: Const m a). SOrd a => Sing t1 -> Sing (Apply (MaximumSym0 :: TyFun (Const m a) a -> Type) t1) Source # sMinimum :: forall a (t1 :: Const m a). SOrd a => Sing t1 -> Sing (Apply (MinimumSym0 :: TyFun (Const m a) a -> Type) t1) Source # sSum :: forall a (t1 :: Const m a). SNum a => Sing t1 -> Sing (Apply (SumSym0 :: TyFun (Const m a) a -> Type) t1) Source # sProduct :: forall a (t1 :: Const m a). SNum a => Sing t1 -> Sing (Apply (ProductSym0 :: TyFun (Const m a) a -> Type) t1) Source # | |
(SFoldable f, SFoldable g) => SFoldable (Product f g) Source # | |
Defined in Data.Functor.Product.Singletons sFold :: forall m (t1 :: Product f g m). SMonoid m => Sing t1 -> Sing (Apply (FoldSym0 :: TyFun (Product f g m) m -> Type) t1) Source # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Product f g a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (FoldMapSym0 :: TyFun (a ~> m) (Product f g a ~> m) -> Type) t1) t2) Source # sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Product f g a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (Product f g a ~> b)) -> Type) t1) t2) t3) Source # sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Product f g a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Product f g a ~> b)) -> Type) t1) t2) t3) Source # sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Product f g a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (Product f g a ~> b)) -> Type) t1) t2) t3) Source # sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Product f g a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Product f g a ~> b)) -> Type) t1) t2) t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Product f g a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (Product f g a ~> a) -> Type) t1) t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Product f g a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (Product f g a ~> a) -> Type) t1) t2) Source # sToList :: forall a (t1 :: Product f g a). Sing t1 -> Sing (Apply (ToListSym0 :: TyFun (Product f g a) [a] -> Type) t1) Source # sNull :: forall a (t1 :: Product f g a). Sing t1 -> Sing (Apply (NullSym0 :: TyFun (Product f g a) Bool -> Type) t1) Source # sLength :: forall a (t1 :: Product f g a). Sing t1 -> Sing (Apply (LengthSym0 :: TyFun (Product f g a) Natural -> Type) t1) Source # sElem :: forall a (t1 :: a) (t2 :: Product f g a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply (ElemSym0 :: TyFun a (Product f g a ~> Bool) -> Type) t1) t2) Source # sMaximum :: forall a (t1 :: Product f g a). SOrd a => Sing t1 -> Sing (Apply (MaximumSym0 :: TyFun (Product f g a) a -> Type) t1) Source # sMinimum :: forall a (t1 :: Product f g a). SOrd a => Sing t1 -> Sing (Apply (MinimumSym0 :: TyFun (Product f g a) a -> Type) t1) Source # sSum :: forall a (t1 :: Product f g a). SNum a => Sing t1 -> Sing (Apply (SumSym0 :: TyFun (Product f g a) a -> Type) t1) Source # sProduct :: forall a (t1 :: Product f g a). SNum a => Sing t1 -> Sing (Apply (ProductSym0 :: TyFun (Product f g a) a -> Type) t1) Source # | |
(SFoldable f, SFoldable g) => SFoldable (Sum f g) Source # | |
Defined in Data.Functor.Sum.Singletons sFold :: forall m (t1 :: Sum f g m). SMonoid m => Sing t1 -> Sing (Apply (FoldSym0 :: TyFun (Sum f g m) m -> Type) t1) Source # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Sum f g a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (FoldMapSym0 :: TyFun (a ~> m) (Sum f g a ~> m) -> Type) t1) t2) Source # sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Sum f g a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (Sum f g a ~> b)) -> Type) t1) t2) t3) Source # sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Sum f g a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Sum f g a ~> b)) -> Type) t1) t2) t3) Source # sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Sum f g a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (Sum f g a ~> b)) -> Type) t1) t2) t3) Source # sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Sum f g a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Sum f g a ~> b)) -> Type) t1) t2) t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Sum f g a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (Sum f g a ~> a) -> Type) t1) t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Sum f g a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (Sum f g a ~> a) -> Type) t1) t2) Source # sToList :: forall a (t1 :: Sum f g a). Sing t1 -> Sing (Apply (ToListSym0 :: TyFun (Sum f g a) [a] -> Type) t1) Source # sNull :: forall a (t1 :: Sum f g a). Sing t1 -> Sing (Apply (NullSym0 :: TyFun (Sum f g a) Bool -> Type) t1) Source # sLength :: forall a (t1 :: Sum f g a). Sing t1 -> Sing (Apply (LengthSym0 :: TyFun (Sum f g a) Natural -> Type) t1) Source # sElem :: forall a (t1 :: a) (t2 :: Sum f g a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply (ElemSym0 :: TyFun a (Sum f g a ~> Bool) -> Type) t1) t2) Source # sMaximum :: forall a (t1 :: Sum f g a). SOrd a => Sing t1 -> Sing (Apply (MaximumSym0 :: TyFun (Sum f g a) a -> Type) t1) Source # sMinimum :: forall a (t1 :: Sum f g a). SOrd a => Sing t1 -> Sing (Apply (MinimumSym0 :: TyFun (Sum f g a) a -> Type) t1) Source # sSum :: forall a (t1 :: Sum f g a). SNum a => Sing t1 -> Sing (Apply (SumSym0 :: TyFun (Sum f g a) a -> Type) t1) Source # sProduct :: forall a (t1 :: Sum f g a). SNum a => Sing t1 -> Sing (Apply (ProductSym0 :: TyFun (Sum f g a) a -> Type) t1) Source # | |
(SFoldable f, SFoldable g) => SFoldable (Compose f g) Source # | |
Defined in Data.Functor.Compose.Singletons sFold :: forall m (t1 :: Compose f g m). SMonoid m => Sing t1 -> Sing (Apply (FoldSym0 :: TyFun (Compose f g m) m -> Type) t1) Source # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Compose f g a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (FoldMapSym0 :: TyFun (a ~> m) (Compose f g a ~> m) -> Type) t1) t2) Source # sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Compose f g a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (Compose f g a ~> b)) -> Type) t1) t2) t3) Source # sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Compose f g a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Compose f g a ~> b)) -> Type) t1) t2) t3) Source # sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Compose f g a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (Compose f g a ~> b)) -> Type) t1) t2) t3) Source # sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Compose f g a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Compose f g a ~> b)) -> Type) t1) t2) t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Compose f g a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (Compose f g a ~> a) -> Type) t1) t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Compose f g a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (Compose f g a ~> a) -> Type) t1) t2) Source # sToList :: forall a (t1 :: Compose f g a). Sing t1 -> Sing (Apply (ToListSym0 :: TyFun (Compose f g a) [a] -> Type) t1) Source # sNull :: forall a (t1 :: Compose f g a). Sing t1 -> Sing (Apply (NullSym0 :: TyFun (Compose f g a) Bool -> Type) t1) Source # sLength :: forall a (t1 :: Compose f g a). Sing t1 -> Sing (Apply (LengthSym0 :: TyFun (Compose f g a) Natural -> Type) t1) Source # sElem :: forall a (t1 :: a) (t2 :: Compose f g a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply (ElemSym0 :: TyFun a (Compose f g a ~> Bool) -> Type) t1) t2) Source # sMaximum :: forall a (t1 :: Compose f g a). SOrd a => Sing t1 -> Sing (Apply (MaximumSym0 :: TyFun (Compose f g a) a -> Type) t1) Source # sMinimum :: forall a (t1 :: Compose f g a). SOrd a => Sing t1 -> Sing (Apply (MinimumSym0 :: TyFun (Compose f g a) a -> Type) t1) Source # sSum :: forall a (t1 :: Compose f g a). SNum a => Sing t1 -> Sing (Apply (SumSym0 :: TyFun (Compose f g a) a -> Type) t1) Source # sProduct :: forall a (t1 :: Compose f g a). SNum a => Sing t1 -> Sing (Apply (ProductSym0 :: TyFun (Compose f g a) a -> Type) t1) Source # |
type family FoldrM (a1 :: a ~> (b ~> m b)) (a2 :: b) (a3 :: t a) :: m b where ... Source #
FoldrM (f :: a ~> (k1 ~> m k1)) (z0 :: k1) (xs :: t a) = Apply (Apply (Apply (Apply (FoldlSym0 :: TyFun ((k1 ~> m k1) ~> (a ~> (k1 ~> m k1))) ((k1 ~> m k1) ~> (t a ~> (k1 ~> m k1))) -> Type) (Let6989586621680390373F'Sym3 f z0 xs :: TyFun (k1 ~> m k1) (TyFun a (TyFun k1 (m k1) -> Type) -> Type) -> Type)) (ReturnSym0 :: TyFun k1 (m k1) -> Type)) xs) z0 |
sFoldrM :: forall a b (m :: Type -> Type) (t1 :: Type -> Type) (t2 :: a ~> (b ~> m b)) (t3 :: b) (t4 :: t1 a). (SFoldable t1, SMonad m) => Sing t2 -> Sing t3 -> Sing t4 -> Sing (Apply (Apply (Apply (FoldrMSym0 :: TyFun (a ~> (b ~> m b)) (b ~> (t1 a ~> m b)) -> Type) t2) t3) t4) Source #
type family FoldlM (a1 :: b ~> (a ~> m b)) (a2 :: b) (a3 :: t a) :: m b where ... Source #
FoldlM (f :: k1 ~> (a ~> m k1)) (z0 :: k1) (xs :: t a) = Apply (Apply (Apply (Apply (FoldrSym0 :: TyFun (a ~> ((k1 ~> m k1) ~> (k1 ~> m k1))) ((k1 ~> m k1) ~> (t a ~> (k1 ~> m k1))) -> Type) (Let6989586621680390355F'Sym3 f z0 xs :: TyFun a (TyFun (k1 ~> m k1) (TyFun k1 (m k1) -> Type) -> Type) -> Type)) (ReturnSym0 :: TyFun k1 (m k1) -> Type)) xs) z0 |
sFoldlM :: forall b a (m :: Type -> Type) (t1 :: Type -> Type) (t2 :: b ~> (a ~> m b)) (t3 :: b) (t4 :: t1 a). (SFoldable t1, SMonad m) => Sing t2 -> Sing t3 -> Sing t4 -> Sing (Apply (Apply (Apply (FoldlMSym0 :: TyFun (b ~> (a ~> m b)) (b ~> (t1 a ~> m b)) -> Type) t2) t3) t4) Source #
type family Traverse_ (a1 :: a ~> f b) (a2 :: t a) :: f () where ... Source #
Traverse_ (f2 :: a1 ~> f1 a2) (a_6989586621680390336 :: t a1) = Apply (Apply (Apply (FoldrSym0 :: TyFun (a1 ~> (f1 () ~> f1 ())) (f1 () ~> (t a1 ~> f1 ())) -> Type) (Apply (Apply ((.@#@$) :: TyFun (f1 a2 ~> (f1 () ~> f1 ())) ((a1 ~> f1 a2) ~> (a1 ~> (f1 () ~> f1 ()))) -> Type) ((*>@#@$) :: TyFun (f1 a2) (f1 () ~> f1 ()) -> Type)) f2)) (Apply (PureSym0 :: TyFun () (f1 ()) -> Type) Tuple0Sym0)) a_6989586621680390336 |
sTraverse_ :: forall a (f :: Type -> Type) b (t1 :: Type -> Type) (t2 :: a ~> f b) (t3 :: t1 a). (SFoldable t1, SApplicative f) => Sing t2 -> Sing t3 -> Sing (Apply (Apply (Traverse_Sym0 :: TyFun (a ~> f b) (t1 a ~> f ()) -> Type) t2) t3) Source #
sFor_ :: forall (t1 :: Type -> Type) a (f :: Type -> Type) b (t2 :: t1 a) (t3 :: a ~> f b). (SFoldable t1, SApplicative f) => Sing t2 -> Sing t3 -> Sing (Apply (Apply (For_Sym0 :: TyFun (t1 a) ((a ~> f b) ~> f ()) -> Type) t2) t3) Source #
type family SequenceA_ (a1 :: t (f a)) :: f () where ... Source #
sSequenceA_ :: forall (t1 :: Type -> Type) (f :: Type -> Type) a (t2 :: t1 (f a)). (SFoldable t1, SApplicative f) => Sing t2 -> Sing (Apply (SequenceA_Sym0 :: TyFun (t1 (f a)) (f ()) -> Type) t2) Source #
sAsum :: forall (t1 :: Type -> Type) (f :: Type -> Type) a (t2 :: t1 (f a)). (SFoldable t1, SAlternative f) => Sing t2 -> Sing (Apply (AsumSym0 :: TyFun (t1 (f a)) (f a) -> Type) t2) Source #
type family MapM_ (a1 :: a ~> m b) (a2 :: t a) :: m () where ... Source #
MapM_ (f :: a1 ~> m a2) (a_6989586621680390316 :: t a1) = Apply (Apply (Apply (FoldrSym0 :: TyFun (a1 ~> (m () ~> m ())) (m () ~> (t a1 ~> m ())) -> Type) (Apply (Apply ((.@#@$) :: TyFun (m a2 ~> (m () ~> m ())) ((a1 ~> m a2) ~> (a1 ~> (m () ~> m ()))) -> Type) ((>>@#@$) :: TyFun (m a2) (m () ~> m ()) -> Type)) f)) (Apply (ReturnSym0 :: TyFun () (m ()) -> Type) Tuple0Sym0)) a_6989586621680390316 |
sMapM_ :: forall a (m :: Type -> Type) b (t1 :: Type -> Type) (t2 :: a ~> m b) (t3 :: t1 a). (SFoldable t1, SMonad m) => Sing t2 -> Sing t3 -> Sing (Apply (Apply (MapM_Sym0 :: TyFun (a ~> m b) (t1 a ~> m ()) -> Type) t2) t3) Source #
sForM_ :: forall (t1 :: Type -> Type) a (m :: Type -> Type) b (t2 :: t1 a) (t3 :: a ~> m b). (SFoldable t1, SMonad m) => Sing t2 -> Sing t3 -> Sing (Apply (Apply (ForM_Sym0 :: TyFun (t1 a) ((a ~> m b) ~> m ()) -> Type) t2) t3) Source #
sSequence_ :: forall (t1 :: Type -> Type) (m :: Type -> Type) a (t2 :: t1 (m a)). (SFoldable t1, SMonad m) => Sing t2 -> Sing (Apply (Sequence_Sym0 :: TyFun (t1 (m a)) (m ()) -> Type) t2) Source #
sMsum :: forall (t1 :: Type -> Type) (m :: Type -> Type) a (t2 :: t1 (m a)). (SFoldable t1, SMonadPlus m) => Sing t2 -> Sing (Apply (MsumSym0 :: TyFun (t1 (m a)) (m a) -> Type) t2) Source #
sConcat :: forall (t1 :: Type -> Type) a (t2 :: t1 [a]). SFoldable t1 => Sing t2 -> Sing (Apply (ConcatSym0 :: TyFun (t1 [a]) [a] -> Type) t2) Source #
type family ConcatMap (a1 :: a ~> [b]) (a2 :: t a) :: [b] where ... Source #
ConcatMap (f :: a1 ~> [a2]) (xs :: t a1) = Apply (Apply (Apply (FoldrSym0 :: TyFun (a1 ~> ([a2] ~> [a2])) ([a2] ~> (t a1 ~> [a2])) -> Type) (Apply (Apply (Lambda_6989586621680390267Sym0 :: TyFun (a1 ~> [a2]) (TyFun (t a1) (TyFun a1 (TyFun [a2] [a2] -> Type) -> Type) -> Type) -> Type) f) xs)) (NilSym0 :: [a2])) xs |
sConcatMap :: forall a b (t1 :: Type -> Type) (t2 :: a ~> [b]) (t3 :: t1 a). SFoldable t1 => Sing t2 -> Sing t3 -> Sing (Apply (Apply (ConcatMapSym0 :: TyFun (a ~> [b]) (t1 a ~> [b]) -> Type) t2) t3) Source #
sAnd :: forall (t1 :: Type -> Type) (t2 :: t1 Bool). SFoldable t1 => Sing t2 -> Sing (Apply (AndSym0 :: TyFun (t1 Bool) Bool -> Type) t2) Source #
sOr :: forall (t1 :: Type -> Type) (t2 :: t1 Bool). SFoldable t1 => Sing t2 -> Sing (Apply (OrSym0 :: TyFun (t1 Bool) Bool -> Type) t2) Source #
type family Any (a1 :: a ~> Bool) (a2 :: t a) :: Bool where ... Source #
Any (p :: a ~> Bool) (a_6989586621680390239 :: t a) = Apply (Apply (Apply ((.@#@$) :: TyFun (Any ~> Bool) ((t a ~> Any) ~> (t a ~> Bool)) -> Type) GetAnySym0) (Apply (FoldMapSym0 :: TyFun (a ~> Any) (t a ~> Any) -> Type) (Apply (Apply ((.@#@$) :: TyFun (Bool ~> Any) ((a ~> Bool) ~> (a ~> Any)) -> Type) Any_Sym0) p))) a_6989586621680390239 |
sAny :: forall a (t1 :: Type -> Type) (t2 :: a ~> Bool) (t3 :: t1 a). SFoldable t1 => Sing t2 -> Sing t3 -> Sing (Apply (Apply (AnySym0 :: TyFun (a ~> Bool) (t1 a ~> Bool) -> Type) t2) t3) Source #
type family All (a1 :: a ~> Bool) (a2 :: t a) :: Bool where ... Source #
All (p :: a ~> Bool) (a_6989586621680390230 :: t a) = Apply (Apply (Apply ((.@#@$) :: TyFun (All ~> Bool) ((t a ~> All) ~> (t a ~> Bool)) -> Type) GetAllSym0) (Apply (FoldMapSym0 :: TyFun (a ~> All) (t a ~> All) -> Type) (Apply (Apply ((.@#@$) :: TyFun (Bool ~> All) ((a ~> Bool) ~> (a ~> All)) -> Type) All_Sym0) p))) a_6989586621680390230 |
sAll :: forall a (t1 :: Type -> Type) (t2 :: a ~> Bool) (t3 :: t1 a). SFoldable t1 => Sing t2 -> Sing t3 -> Sing (Apply (Apply (AllSym0 :: TyFun (a ~> Bool) (t1 a ~> Bool) -> Type) t2) t3) Source #
sMaximumBy :: forall a (t1 :: Type -> Type) (t2 :: a ~> (a ~> Ordering)) (t3 :: t1 a). SFoldable t1 => Sing t2 -> Sing t3 -> Sing (Apply (Apply (MaximumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t1 a ~> a) -> Type) t2) t3) Source #
sMinimumBy :: forall a (t1 :: Type -> Type) (t2 :: a ~> (a ~> Ordering)) (t3 :: t1 a). SFoldable t1 => Sing t2 -> Sing t3 -> Sing (Apply (Apply (MinimumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t1 a ~> a) -> Type) t2) t3) Source #
sNotElem :: forall a (t1 :: Type -> Type) (t2 :: a) (t3 :: t1 a). (SFoldable t1, SEq a) => Sing t2 -> Sing t3 -> Sing (Apply (Apply (NotElemSym0 :: TyFun a (t1 a ~> Bool) -> Type) t2) t3) Source #
type family Find (a1 :: a ~> Bool) (a2 :: t a) :: Maybe a where ... Source #
Find (p :: a ~> Bool) (a_6989586621680390163 :: t a) = Apply (Apply (Apply ((.@#@$) :: TyFun (First a ~> Maybe a) ((t a ~> First a) ~> (t a ~> Maybe a)) -> Type) (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type)) (Apply (FoldMapSym0 :: TyFun (a ~> First a) (t a ~> First a) -> Type) (Apply (Apply (Lambda_6989586621680390172Sym0 :: TyFun (a ~> Bool) (TyFun (t a) (TyFun a (First a) -> Type) -> Type) -> Type) p) a_6989586621680390163))) a_6989586621680390163 |
sFind :: forall a (t1 :: Type -> Type) (t2 :: a ~> Bool) (t3 :: t1 a). SFoldable t1 => Sing t2 -> Sing t3 -> Sing (Apply (Apply (FindSym0 :: TyFun (a ~> Bool) (t1 a ~> Maybe a) -> Type) t2) t3) Source #
Defunctionalization symbols
data FoldSym0 (a :: TyFun (t m) m) Source #
Instances
data FoldMapSym0 (a1 :: TyFun (a ~> m) (t a ~> m)) Source #
Instances
(SFoldable t, SMonoid m) => SingI (FoldMapSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
SuppressUnusedWarnings (FoldMapSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (FoldMapSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) (a6989586621680390387 :: a ~> m) Source # | |
Defined in Data.Foldable.Singletons type Apply (FoldMapSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) (a6989586621680390387 :: a ~> m) = FoldMapSym1 a6989586621680390387 :: TyFun (t a) m -> Type |
data FoldMapSym1 (a6989586621680390387 :: a ~> m) (b :: TyFun (t a) m) Source #
Instances
(SFoldable t, SMonoid m) => SingI1 (FoldMapSym1 :: (a ~> m) -> TyFun (t a) m -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
(SFoldable t, SMonoid m, SingI d) => SingI (FoldMapSym1 d :: TyFun (t a) m -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
SuppressUnusedWarnings (FoldMapSym1 a6989586621680390387 :: TyFun (t a) m -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (FoldMapSym1 a6989586621680390387 :: TyFun (t a) m -> Type) (a6989586621680390388 :: t a) Source # | |
Defined in Data.Foldable.Singletons type Apply (FoldMapSym1 a6989586621680390387 :: TyFun (t a) m -> Type) (a6989586621680390388 :: t a) = FoldMap a6989586621680390387 a6989586621680390388 |
type family FoldMapSym2 (a6989586621680390387 :: a ~> m) (a6989586621680390388 :: t a) :: m where ... Source #
FoldMapSym2 (a6989586621680390387 :: a ~> m) (a6989586621680390388 :: t a) = FoldMap a6989586621680390387 a6989586621680390388 |
data FoldrSym0 (a1 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b))) Source #
Instances
SFoldable t => SingI (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) Source # | |
SuppressUnusedWarnings (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) (a6989586621680390393 :: a ~> (b ~> b)) Source # | |
data FoldrSym1 (a6989586621680390393 :: a ~> (b ~> b)) (b1 :: TyFun b (t a ~> b)) Source #
Instances
SFoldable t => SingI1 (FoldrSym1 :: (a ~> (b ~> b)) -> TyFun b (t a ~> b) -> Type) Source # | |
(SFoldable t, SingI d) => SingI (FoldrSym1 d :: TyFun b (t a ~> b) -> Type) Source # | |
SuppressUnusedWarnings (FoldrSym1 a6989586621680390393 :: TyFun b (t a ~> b) -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (FoldrSym1 a6989586621680390393 :: TyFun b (t a ~> b) -> Type) (a6989586621680390394 :: b) Source # | |
data FoldrSym2 (a6989586621680390393 :: a ~> (b ~> b)) (a6989586621680390394 :: b) (c :: TyFun (t a) b) Source #
Instances
(SFoldable t, SingI d) => SingI1 (FoldrSym2 d :: b -> TyFun (t a) b -> Type) Source # | |
SFoldable t => SingI2 (FoldrSym2 :: (a ~> (b ~> b)) -> b -> TyFun (t a) b -> Type) Source # | |
(SFoldable t, SingI d1, SingI d2) => SingI (FoldrSym2 d1 d2 :: TyFun (t a) b -> Type) Source # | |
SuppressUnusedWarnings (FoldrSym2 a6989586621680390393 a6989586621680390394 :: TyFun (t a) b -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (FoldrSym2 a6989586621680390393 a6989586621680390394 :: TyFun (t a) b -> Type) (a6989586621680390395 :: t a) Source # | |
type family FoldrSym3 (a6989586621680390393 :: a ~> (b ~> b)) (a6989586621680390394 :: b) (a6989586621680390395 :: t a) :: b where ... Source #
data Foldr'Sym0 (a1 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b))) Source #
Instances
SFoldable t => SingI (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) Source # | |
SuppressUnusedWarnings (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) (a6989586621680390400 :: a ~> (b ~> b)) Source # | |
Defined in Data.Foldable.Singletons |
data Foldr'Sym1 (a6989586621680390400 :: a ~> (b ~> b)) (b1 :: TyFun b (t a ~> b)) Source #
Instances
SFoldable t => SingI1 (Foldr'Sym1 :: (a ~> (b ~> b)) -> TyFun b (t a ~> b) -> Type) Source # | |
(SFoldable t, SingI d) => SingI (Foldr'Sym1 d :: TyFun b (t a ~> b) -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
SuppressUnusedWarnings (Foldr'Sym1 a6989586621680390400 :: TyFun b (t a ~> b) -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (Foldr'Sym1 a6989586621680390400 :: TyFun b (t a ~> b) -> Type) (a6989586621680390401 :: b) Source # | |
Defined in Data.Foldable.Singletons type Apply (Foldr'Sym1 a6989586621680390400 :: TyFun b (t a ~> b) -> Type) (a6989586621680390401 :: b) = Foldr'Sym2 a6989586621680390400 a6989586621680390401 :: TyFun (t a) b -> Type |
data Foldr'Sym2 (a6989586621680390400 :: a ~> (b ~> b)) (a6989586621680390401 :: b) (c :: TyFun (t a) b) Source #
Instances
(SFoldable t, SingI d) => SingI1 (Foldr'Sym2 d :: b -> TyFun (t a) b -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
SFoldable t => SingI2 (Foldr'Sym2 :: (a ~> (b ~> b)) -> b -> TyFun (t a) b -> Type) Source # | |
(SFoldable t, SingI d1, SingI d2) => SingI (Foldr'Sym2 d1 d2 :: TyFun (t a) b -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
SuppressUnusedWarnings (Foldr'Sym2 a6989586621680390400 a6989586621680390401 :: TyFun (t a) b -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (Foldr'Sym2 a6989586621680390400 a6989586621680390401 :: TyFun (t a) b -> Type) (a6989586621680390402 :: t a) Source # | |
Defined in Data.Foldable.Singletons type Apply (Foldr'Sym2 a6989586621680390400 a6989586621680390401 :: TyFun (t a) b -> Type) (a6989586621680390402 :: t a) = Foldr' a6989586621680390400 a6989586621680390401 a6989586621680390402 |
type family Foldr'Sym3 (a6989586621680390400 :: a ~> (b ~> b)) (a6989586621680390401 :: b) (a6989586621680390402 :: t a) :: b where ... Source #
Foldr'Sym3 (a6989586621680390400 :: a ~> (b ~> b)) (a6989586621680390401 :: b) (a6989586621680390402 :: t a) = Foldr' a6989586621680390400 a6989586621680390401 a6989586621680390402 |
data FoldlSym0 (a1 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b))) Source #
Instances
SFoldable t => SingI (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) Source # | |
SuppressUnusedWarnings (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) (a6989586621680390407 :: b ~> (a ~> b)) Source # | |
data FoldlSym1 (a6989586621680390407 :: b ~> (a ~> b)) (b1 :: TyFun b (t a ~> b)) Source #
Instances
SFoldable t => SingI1 (FoldlSym1 :: (b ~> (a ~> b)) -> TyFun b (t a ~> b) -> Type) Source # | |
(SFoldable t, SingI d) => SingI (FoldlSym1 d :: TyFun b (t a ~> b) -> Type) Source # | |
SuppressUnusedWarnings (FoldlSym1 a6989586621680390407 :: TyFun b (t a ~> b) -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (FoldlSym1 a6989586621680390407 :: TyFun b (t a ~> b) -> Type) (a6989586621680390408 :: b) Source # | |
data FoldlSym2 (a6989586621680390407 :: b ~> (a ~> b)) (a6989586621680390408 :: b) (c :: TyFun (t a) b) Source #
Instances
(SFoldable t, SingI d) => SingI1 (FoldlSym2 d :: b -> TyFun (t a) b -> Type) Source # | |
SFoldable t => SingI2 (FoldlSym2 :: (b ~> (a ~> b)) -> b -> TyFun (t a) b -> Type) Source # | |
(SFoldable t, SingI d1, SingI d2) => SingI (FoldlSym2 d1 d2 :: TyFun (t a) b -> Type) Source # | |
SuppressUnusedWarnings (FoldlSym2 a6989586621680390407 a6989586621680390408 :: TyFun (t a) b -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (FoldlSym2 a6989586621680390407 a6989586621680390408 :: TyFun (t a) b -> Type) (a6989586621680390409 :: t a) Source # | |
type family FoldlSym3 (a6989586621680390407 :: b ~> (a ~> b)) (a6989586621680390408 :: b) (a6989586621680390409 :: t a) :: b where ... Source #
data Foldl'Sym0 (a1 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b))) Source #
Instances
SFoldable t => SingI (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) Source # | |
SuppressUnusedWarnings (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) (a6989586621680390414 :: b ~> (a ~> b)) Source # | |
Defined in Data.Foldable.Singletons |
data Foldl'Sym1 (a6989586621680390414 :: b ~> (a ~> b)) (b1 :: TyFun b (t a ~> b)) Source #
Instances
SFoldable t => SingI1 (Foldl'Sym1 :: (b ~> (a ~> b)) -> TyFun b (t a ~> b) -> Type) Source # | |
(SFoldable t, SingI d) => SingI (Foldl'Sym1 d :: TyFun b (t a ~> b) -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
SuppressUnusedWarnings (Foldl'Sym1 a6989586621680390414 :: TyFun b (t a ~> b) -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (Foldl'Sym1 a6989586621680390414 :: TyFun b (t a ~> b) -> Type) (a6989586621680390415 :: b) Source # | |
Defined in Data.Foldable.Singletons type Apply (Foldl'Sym1 a6989586621680390414 :: TyFun b (t a ~> b) -> Type) (a6989586621680390415 :: b) = Foldl'Sym2 a6989586621680390414 a6989586621680390415 :: TyFun (t a) b -> Type |
data Foldl'Sym2 (a6989586621680390414 :: b ~> (a ~> b)) (a6989586621680390415 :: b) (c :: TyFun (t a) b) Source #
Instances
(SFoldable t, SingI d) => SingI1 (Foldl'Sym2 d :: b -> TyFun (t a) b -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
SFoldable t => SingI2 (Foldl'Sym2 :: (b ~> (a ~> b)) -> b -> TyFun (t a) b -> Type) Source # | |
(SFoldable t, SingI d1, SingI d2) => SingI (Foldl'Sym2 d1 d2 :: TyFun (t a) b -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
SuppressUnusedWarnings (Foldl'Sym2 a6989586621680390414 a6989586621680390415 :: TyFun (t a) b -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (Foldl'Sym2 a6989586621680390414 a6989586621680390415 :: TyFun (t a) b -> Type) (a6989586621680390416 :: t a) Source # | |
Defined in Data.Foldable.Singletons type Apply (Foldl'Sym2 a6989586621680390414 a6989586621680390415 :: TyFun (t a) b -> Type) (a6989586621680390416 :: t a) = Foldl' a6989586621680390414 a6989586621680390415 a6989586621680390416 |
type family Foldl'Sym3 (a6989586621680390414 :: b ~> (a ~> b)) (a6989586621680390415 :: b) (a6989586621680390416 :: t a) :: b where ... Source #
Foldl'Sym3 (a6989586621680390414 :: b ~> (a ~> b)) (a6989586621680390415 :: b) (a6989586621680390416 :: t a) = Foldl' a6989586621680390414 a6989586621680390415 a6989586621680390416 |
data Foldr1Sym0 (a1 :: TyFun (a ~> (a ~> a)) (t a ~> a)) Source #
Instances
SFoldable t => SingI (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
SuppressUnusedWarnings (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) (a6989586621680390420 :: a ~> (a ~> a)) Source # | |
Defined in Data.Foldable.Singletons |
data Foldr1Sym1 (a6989586621680390420 :: a ~> (a ~> a)) (b :: TyFun (t a) a) Source #
Instances
SFoldable t => SingI1 (Foldr1Sym1 :: (a ~> (a ~> a)) -> TyFun (t a) a -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
(SFoldable t, SingI d) => SingI (Foldr1Sym1 d :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
SuppressUnusedWarnings (Foldr1Sym1 a6989586621680390420 :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (Foldr1Sym1 a6989586621680390420 :: TyFun (t a) a -> Type) (a6989586621680390421 :: t a) Source # | |
Defined in Data.Foldable.Singletons type Apply (Foldr1Sym1 a6989586621680390420 :: TyFun (t a) a -> Type) (a6989586621680390421 :: t a) = Foldr1 a6989586621680390420 a6989586621680390421 |
type family Foldr1Sym2 (a6989586621680390420 :: a ~> (a ~> a)) (a6989586621680390421 :: t a) :: a where ... Source #
Foldr1Sym2 (a6989586621680390420 :: a ~> (a ~> a)) (a6989586621680390421 :: t a) = Foldr1 a6989586621680390420 a6989586621680390421 |
data Foldl1Sym0 (a1 :: TyFun (a ~> (a ~> a)) (t a ~> a)) Source #
Instances
SFoldable t => SingI (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
SuppressUnusedWarnings (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) (a6989586621680390425 :: a ~> (a ~> a)) Source # | |
Defined in Data.Foldable.Singletons |
data Foldl1Sym1 (a6989586621680390425 :: a ~> (a ~> a)) (b :: TyFun (t a) a) Source #
Instances
SFoldable t => SingI1 (Foldl1Sym1 :: (a ~> (a ~> a)) -> TyFun (t a) a -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
(SFoldable t, SingI d) => SingI (Foldl1Sym1 d :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
SuppressUnusedWarnings (Foldl1Sym1 a6989586621680390425 :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (Foldl1Sym1 a6989586621680390425 :: TyFun (t a) a -> Type) (a6989586621680390426 :: t a) Source # | |
Defined in Data.Foldable.Singletons type Apply (Foldl1Sym1 a6989586621680390425 :: TyFun (t a) a -> Type) (a6989586621680390426 :: t a) = Foldl1 a6989586621680390425 a6989586621680390426 |
type family Foldl1Sym2 (a6989586621680390425 :: a ~> (a ~> a)) (a6989586621680390426 :: t a) :: a where ... Source #
Foldl1Sym2 (a6989586621680390425 :: a ~> (a ~> a)) (a6989586621680390426 :: t a) = Foldl1 a6989586621680390425 a6989586621680390426 |
data ToListSym0 (a1 :: TyFun (t a) [a]) Source #
Instances
SFoldable t => SingI (ToListSym0 :: TyFun (t a) [a] -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
SuppressUnusedWarnings (ToListSym0 :: TyFun (t a) [a] -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (ToListSym0 :: TyFun (t a) [a] -> Type) (a6989586621680390429 :: t a) Source # | |
Defined in Data.Foldable.Singletons type Apply (ToListSym0 :: TyFun (t a) [a] -> Type) (a6989586621680390429 :: t a) = ToList a6989586621680390429 |
type family ToListSym1 (a6989586621680390429 :: t a) :: [a] where ... Source #
ToListSym1 (a6989586621680390429 :: t a) = ToList a6989586621680390429 |
data NullSym0 (a1 :: TyFun (t a) Bool) Source #
Instances
data LengthSym0 (a1 :: TyFun (t a) Natural) Source #
Instances
SFoldable t => SingI (LengthSym0 :: TyFun (t a) Natural -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
SuppressUnusedWarnings (LengthSym0 :: TyFun (t a) Natural -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (LengthSym0 :: TyFun (t a) Natural -> Type) (a6989586621680390435 :: t a) Source # | |
Defined in Data.Foldable.Singletons |
type family LengthSym1 (a6989586621680390435 :: t a) :: Natural where ... Source #
LengthSym1 (a6989586621680390435 :: t a) = Length a6989586621680390435 |
data ElemSym0 (a1 :: TyFun a (t a ~> Bool)) Source #
Instances
(SFoldable t, SEq a) => SingI (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) Source # | |
SuppressUnusedWarnings (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680390439 :: a) Source # | |
data ElemSym1 (a6989586621680390439 :: a) (b :: TyFun (t a) Bool) Source #
Instances
(SFoldable t, SEq a) => SingI1 (ElemSym1 :: a -> TyFun (t a) Bool -> Type) Source # | |
(SFoldable t, SEq a, SingI d) => SingI (ElemSym1 d :: TyFun (t a) Bool -> Type) Source # | |
SuppressUnusedWarnings (ElemSym1 a6989586621680390439 :: TyFun (t a) Bool -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (ElemSym1 a6989586621680390439 :: TyFun (t a) Bool -> Type) (a6989586621680390440 :: t a) Source # | |
type family ElemSym2 (a6989586621680390439 :: a) (a6989586621680390440 :: t a) :: Bool where ... Source #
data MaximumSym0 (a1 :: TyFun (t a) a) Source #
Instances
(SFoldable t, SOrd a) => SingI (MaximumSym0 :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
SuppressUnusedWarnings (MaximumSym0 :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (MaximumSym0 :: TyFun (t a) a -> Type) (a6989586621680390443 :: t a) Source # | |
Defined in Data.Foldable.Singletons type Apply (MaximumSym0 :: TyFun (t a) a -> Type) (a6989586621680390443 :: t a) = Maximum a6989586621680390443 |
type family MaximumSym1 (a6989586621680390443 :: t a) :: a where ... Source #
MaximumSym1 (a6989586621680390443 :: t a) = Maximum a6989586621680390443 |
data MinimumSym0 (a1 :: TyFun (t a) a) Source #
Instances
(SFoldable t, SOrd a) => SingI (MinimumSym0 :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
SuppressUnusedWarnings (MinimumSym0 :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (MinimumSym0 :: TyFun (t a) a -> Type) (a6989586621680390446 :: t a) Source # | |
Defined in Data.Foldable.Singletons type Apply (MinimumSym0 :: TyFun (t a) a -> Type) (a6989586621680390446 :: t a) = Minimum a6989586621680390446 |
type family MinimumSym1 (a6989586621680390446 :: t a) :: a where ... Source #
MinimumSym1 (a6989586621680390446 :: t a) = Minimum a6989586621680390446 |
data SumSym0 (a1 :: TyFun (t a) a) Source #
Instances
data ProductSym0 (a1 :: TyFun (t a) a) Source #
Instances
(SFoldable t, SNum a) => SingI (ProductSym0 :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
SuppressUnusedWarnings (ProductSym0 :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (ProductSym0 :: TyFun (t a) a -> Type) (a6989586621680390452 :: t a) Source # | |
Defined in Data.Foldable.Singletons type Apply (ProductSym0 :: TyFun (t a) a -> Type) (a6989586621680390452 :: t a) = Product a6989586621680390452 |
type family ProductSym1 (a6989586621680390452 :: t a) :: a where ... Source #
ProductSym1 (a6989586621680390452 :: t a) = Product a6989586621680390452 |
data FoldrMSym0 (a1 :: TyFun (a ~> (b ~> m b)) (b ~> (t a ~> m b))) Source #
Instances
(SFoldable t, SMonad m) => SingI (FoldrMSym0 :: TyFun (a ~> (b ~> m b)) (b ~> (t a ~> m b)) -> Type) Source # | |
SuppressUnusedWarnings (FoldrMSym0 :: TyFun (a ~> (b ~> m b)) (b ~> (t a ~> m b)) -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (FoldrMSym0 :: TyFun (a ~> (b ~> m b)) (b ~> (t a ~> m b)) -> Type) (a6989586621680390367 :: a ~> (b ~> m b)) Source # | |
Defined in Data.Foldable.Singletons |
data FoldrMSym1 (a6989586621680390367 :: a ~> (b ~> m b)) (b1 :: TyFun b (t a ~> m b)) Source #
Instances
(SFoldable t, SMonad m) => SingI1 (FoldrMSym1 :: (a ~> (b ~> m b)) -> TyFun b (t a ~> m b) -> Type) Source # | |
(SFoldable t, SMonad m, SingI d) => SingI (FoldrMSym1 d :: TyFun b (t a ~> m b) -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
SuppressUnusedWarnings (FoldrMSym1 a6989586621680390367 :: TyFun b (t a ~> m b) -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (FoldrMSym1 a6989586621680390367 :: TyFun b (t a ~> m b) -> Type) (a6989586621680390368 :: b) Source # | |
Defined in Data.Foldable.Singletons type Apply (FoldrMSym1 a6989586621680390367 :: TyFun b (t a ~> m b) -> Type) (a6989586621680390368 :: b) = FoldrMSym2 a6989586621680390367 a6989586621680390368 :: TyFun (t a) (m b) -> Type |
data FoldrMSym2 (a6989586621680390367 :: a ~> (b ~> m b)) (a6989586621680390368 :: b) (c :: TyFun (t a) (m b)) Source #
Instances
(SFoldable t, SMonad m, SingI d) => SingI1 (FoldrMSym2 d :: b -> TyFun (t a) (m b) -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
(SFoldable t, SMonad m) => SingI2 (FoldrMSym2 :: (a ~> (b ~> m b)) -> b -> TyFun (t a) (m b) -> Type) Source # | |
(SFoldable t, SMonad m, SingI d1, SingI d2) => SingI (FoldrMSym2 d1 d2 :: TyFun (t a) (m b) -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
SuppressUnusedWarnings (FoldrMSym2 a6989586621680390367 a6989586621680390368 :: TyFun (t a) (m b) -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (FoldrMSym2 a6989586621680390367 a6989586621680390368 :: TyFun (t a) (m b) -> Type) (a6989586621680390369 :: t a) Source # | |
Defined in Data.Foldable.Singletons type Apply (FoldrMSym2 a6989586621680390367 a6989586621680390368 :: TyFun (t a) (m b) -> Type) (a6989586621680390369 :: t a) = FoldrM a6989586621680390367 a6989586621680390368 a6989586621680390369 |
type family FoldrMSym3 (a6989586621680390367 :: a ~> (b ~> m b)) (a6989586621680390368 :: b) (a6989586621680390369 :: t a) :: m b where ... Source #
FoldrMSym3 (a6989586621680390367 :: a ~> (b ~> m b)) (a6989586621680390368 :: b) (a6989586621680390369 :: t a) = FoldrM a6989586621680390367 a6989586621680390368 a6989586621680390369 |
data FoldlMSym0 (a1 :: TyFun (b ~> (a ~> m b)) (b ~> (t a ~> m b))) Source #
Instances
(SFoldable t, SMonad m) => SingI (FoldlMSym0 :: TyFun (b ~> (a ~> m b)) (b ~> (t a ~> m b)) -> Type) Source # | |
SuppressUnusedWarnings (FoldlMSym0 :: TyFun (b ~> (a ~> m b)) (b ~> (t a ~> m b)) -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (FoldlMSym0 :: TyFun (b ~> (a ~> m b)) (b ~> (t a ~> m b)) -> Type) (a6989586621680390349 :: b ~> (a ~> m b)) Source # | |
Defined in Data.Foldable.Singletons |
data FoldlMSym1 (a6989586621680390349 :: b ~> (a ~> m b)) (b1 :: TyFun b (t a ~> m b)) Source #
Instances
(SFoldable t, SMonad m) => SingI1 (FoldlMSym1 :: (b ~> (a ~> m b)) -> TyFun b (t a ~> m b) -> Type) Source # | |
(SFoldable t, SMonad m, SingI d) => SingI (FoldlMSym1 d :: TyFun b (t a ~> m b) -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
SuppressUnusedWarnings (FoldlMSym1 a6989586621680390349 :: TyFun b (t a ~> m b) -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (FoldlMSym1 a6989586621680390349 :: TyFun b (t a ~> m b) -> Type) (a6989586621680390350 :: b) Source # | |
Defined in Data.Foldable.Singletons type Apply (FoldlMSym1 a6989586621680390349 :: TyFun b (t a ~> m b) -> Type) (a6989586621680390350 :: b) = FoldlMSym2 a6989586621680390349 a6989586621680390350 :: TyFun (t a) (m b) -> Type |
data FoldlMSym2 (a6989586621680390349 :: b ~> (a ~> m b)) (a6989586621680390350 :: b) (c :: TyFun (t a) (m b)) Source #
Instances
(SFoldable t, SMonad m, SingI d) => SingI1 (FoldlMSym2 d :: b -> TyFun (t a) (m b) -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
(SFoldable t, SMonad m) => SingI2 (FoldlMSym2 :: (b ~> (a ~> m b)) -> b -> TyFun (t a) (m b) -> Type) Source # | |
(SFoldable t, SMonad m, SingI d1, SingI d2) => SingI (FoldlMSym2 d1 d2 :: TyFun (t a) (m b) -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
SuppressUnusedWarnings (FoldlMSym2 a6989586621680390349 a6989586621680390350 :: TyFun (t a) (m b) -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (FoldlMSym2 a6989586621680390349 a6989586621680390350 :: TyFun (t a) (m b) -> Type) (a6989586621680390351 :: t a) Source # | |
Defined in Data.Foldable.Singletons type Apply (FoldlMSym2 a6989586621680390349 a6989586621680390350 :: TyFun (t a) (m b) -> Type) (a6989586621680390351 :: t a) = FoldlM a6989586621680390349 a6989586621680390350 a6989586621680390351 |
type family FoldlMSym3 (a6989586621680390349 :: b ~> (a ~> m b)) (a6989586621680390350 :: b) (a6989586621680390351 :: t a) :: m b where ... Source #
FoldlMSym3 (a6989586621680390349 :: b ~> (a ~> m b)) (a6989586621680390350 :: b) (a6989586621680390351 :: t a) = FoldlM a6989586621680390349 a6989586621680390350 a6989586621680390351 |
data Traverse_Sym0 (a1 :: TyFun (a ~> f b) (t a ~> f ())) Source #
Instances
(SFoldable t, SApplicative f) => SingI (Traverse_Sym0 :: TyFun (a ~> f b) (t a ~> f ()) -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
SuppressUnusedWarnings (Traverse_Sym0 :: TyFun (a ~> f b) (t a ~> f ()) -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (Traverse_Sym0 :: TyFun (a ~> f b) (t a ~> f ()) -> Type) (a6989586621680390341 :: a ~> f b) Source # | |
Defined in Data.Foldable.Singletons type Apply (Traverse_Sym0 :: TyFun (a ~> f b) (t a ~> f ()) -> Type) (a6989586621680390341 :: a ~> f b) = Traverse_Sym1 a6989586621680390341 :: TyFun (t a) (f ()) -> Type |
data Traverse_Sym1 (a6989586621680390341 :: a ~> f b) (b1 :: TyFun (t a) (f ())) Source #
Instances
(SFoldable t, SApplicative f) => SingI1 (Traverse_Sym1 :: (a ~> f b) -> TyFun (t a) (f ()) -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
(SFoldable t, SApplicative f, SingI d) => SingI (Traverse_Sym1 d :: TyFun (t a) (f ()) -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
SuppressUnusedWarnings (Traverse_Sym1 a6989586621680390341 :: TyFun (t a) (f ()) -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (Traverse_Sym1 a6989586621680390341 :: TyFun (t a) (f ()) -> Type) (a6989586621680390342 :: t a) Source # | |
Defined in Data.Foldable.Singletons type Apply (Traverse_Sym1 a6989586621680390341 :: TyFun (t a) (f ()) -> Type) (a6989586621680390342 :: t a) = Traverse_ a6989586621680390341 a6989586621680390342 |
type family Traverse_Sym2 (a6989586621680390341 :: a ~> f b) (a6989586621680390342 :: t a) :: f () where ... Source #
Traverse_Sym2 (a6989586621680390341 :: a ~> f b) (a6989586621680390342 :: t a) = Traverse_ a6989586621680390341 a6989586621680390342 |
data For_Sym0 (a1 :: TyFun (t a) ((a ~> f b) ~> f ())) Source #
Instances
(SFoldable t, SApplicative f) => SingI (For_Sym0 :: TyFun (t a) ((a ~> f b) ~> f ()) -> Type) Source # | |
SuppressUnusedWarnings (For_Sym0 :: TyFun (t a) ((a ~> f b) ~> f ()) -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (For_Sym0 :: TyFun (t a) ((a ~> f b) ~> f ()) -> Type) (a6989586621680390332 :: t a) Source # | |
data For_Sym1 (a6989586621680390332 :: t a) (b1 :: TyFun (a ~> f b) (f ())) Source #
Instances
(SFoldable t, SApplicative f) => SingI1 (For_Sym1 :: t a -> TyFun (a ~> f b) (f ()) -> Type) Source # | |
(SFoldable t, SApplicative f, SingI d) => SingI (For_Sym1 d :: TyFun (a ~> f b) (f ()) -> Type) Source # | |
SuppressUnusedWarnings (For_Sym1 a6989586621680390332 :: TyFun (a ~> f b) (f ()) -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (For_Sym1 a6989586621680390332 :: TyFun (a ~> f b) (f ()) -> Type) (a6989586621680390333 :: a ~> f b) Source # | |
type family For_Sym2 (a6989586621680390332 :: t a) (a6989586621680390333 :: a ~> f b) :: f () where ... Source #
data SequenceA_Sym0 (a1 :: TyFun (t (f a)) (f ())) Source #
Instances
(SFoldable t, SApplicative f) => SingI (SequenceA_Sym0 :: TyFun (t (f a)) (f ()) -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
SuppressUnusedWarnings (SequenceA_Sym0 :: TyFun (t (f a)) (f ()) -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (SequenceA_Sym0 :: TyFun (t (f a)) (f ()) -> Type) (a6989586621680390303 :: t (f a)) Source # | |
Defined in Data.Foldable.Singletons type Apply (SequenceA_Sym0 :: TyFun (t (f a)) (f ()) -> Type) (a6989586621680390303 :: t (f a)) = SequenceA_ a6989586621680390303 |
type family SequenceA_Sym1 (a6989586621680390303 :: t (f a)) :: f () where ... Source #
SequenceA_Sym1 (a6989586621680390303 :: t (f a)) = SequenceA_ a6989586621680390303 |
data AsumSym0 (a1 :: TyFun (t (f a)) (f a)) Source #
Instances
(SFoldable t, SAlternative f) => SingI (AsumSym0 :: TyFun (t (f a)) (f a) -> Type) Source # | |
SuppressUnusedWarnings (AsumSym0 :: TyFun (t (f a)) (f a) -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (AsumSym0 :: TyFun (t (f a)) (f a) -> Type) (a6989586621680390291 :: t (f a)) Source # | |
data MapM_Sym0 (a1 :: TyFun (a ~> m b) (t a ~> m ())) Source #
Instances
(SFoldable t, SMonad m) => SingI (MapM_Sym0 :: TyFun (a ~> m b) (t a ~> m ()) -> Type) Source # | |
SuppressUnusedWarnings (MapM_Sym0 :: TyFun (a ~> m b) (t a ~> m ()) -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (MapM_Sym0 :: TyFun (a ~> m b) (t a ~> m ()) -> Type) (a6989586621680390321 :: a ~> m b) Source # | |
data MapM_Sym1 (a6989586621680390321 :: a ~> m b) (b1 :: TyFun (t a) (m ())) Source #
Instances
(SFoldable t, SMonad m) => SingI1 (MapM_Sym1 :: (a ~> m b) -> TyFun (t a) (m ()) -> Type) Source # | |
(SFoldable t, SMonad m, SingI d) => SingI (MapM_Sym1 d :: TyFun (t a) (m ()) -> Type) Source # | |
SuppressUnusedWarnings (MapM_Sym1 a6989586621680390321 :: TyFun (t a) (m ()) -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (MapM_Sym1 a6989586621680390321 :: TyFun (t a) (m ()) -> Type) (a6989586621680390322 :: t a) Source # | |
type family MapM_Sym2 (a6989586621680390321 :: a ~> m b) (a6989586621680390322 :: t a) :: m () where ... Source #
data ForM_Sym0 (a1 :: TyFun (t a) ((a ~> m b) ~> m ())) Source #
Instances
(SFoldable t, SMonad m) => SingI (ForM_Sym0 :: TyFun (t a) ((a ~> m b) ~> m ()) -> Type) Source # | |
SuppressUnusedWarnings (ForM_Sym0 :: TyFun (t a) ((a ~> m b) ~> m ()) -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (ForM_Sym0 :: TyFun (t a) ((a ~> m b) ~> m ()) -> Type) (a6989586621680390312 :: t a) Source # | |
data ForM_Sym1 (a6989586621680390312 :: t a) (b1 :: TyFun (a ~> m b) (m ())) Source #
Instances
(SFoldable t, SMonad m) => SingI1 (ForM_Sym1 :: t a -> TyFun (a ~> m b) (m ()) -> Type) Source # | |
(SFoldable t, SMonad m, SingI d) => SingI (ForM_Sym1 d :: TyFun (a ~> m b) (m ()) -> Type) Source # | |
SuppressUnusedWarnings (ForM_Sym1 a6989586621680390312 :: TyFun (a ~> m b) (m ()) -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (ForM_Sym1 a6989586621680390312 :: TyFun (a ~> m b) (m ()) -> Type) (a6989586621680390313 :: a ~> m b) Source # | |
type family ForM_Sym2 (a6989586621680390312 :: t a) (a6989586621680390313 :: a ~> m b) :: m () where ... Source #
data Sequence_Sym0 (a1 :: TyFun (t (m a)) (m ())) Source #
Instances
(SFoldable t, SMonad m) => SingI (Sequence_Sym0 :: TyFun (t (m a)) (m ()) -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
SuppressUnusedWarnings (Sequence_Sym0 :: TyFun (t (m a)) (m ()) -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (Sequence_Sym0 :: TyFun (t (m a)) (m ()) -> Type) (a6989586621680390297 :: t (m a)) Source # | |
Defined in Data.Foldable.Singletons type Apply (Sequence_Sym0 :: TyFun (t (m a)) (m ()) -> Type) (a6989586621680390297 :: t (m a)) = Sequence_ a6989586621680390297 |
type family Sequence_Sym1 (a6989586621680390297 :: t (m a)) :: m () where ... Source #
Sequence_Sym1 (a6989586621680390297 :: t (m a)) = Sequence_ a6989586621680390297 |
data MsumSym0 (a1 :: TyFun (t (m a)) (m a)) Source #
Instances
(SFoldable t, SMonadPlus m) => SingI (MsumSym0 :: TyFun (t (m a)) (m a) -> Type) Source # | |
SuppressUnusedWarnings (MsumSym0 :: TyFun (t (m a)) (m a) -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (MsumSym0 :: TyFun (t (m a)) (m a) -> Type) (a6989586621680390285 :: t (m a)) Source # | |
data ConcatSym0 (a1 :: TyFun (t [a]) [a]) Source #
Instances
SFoldable t => SingI (ConcatSym0 :: TyFun (t [a]) [a] -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
SuppressUnusedWarnings (ConcatSym0 :: TyFun (t [a]) [a] -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (ConcatSym0 :: TyFun (t [a]) [a] -> Type) (a6989586621680390274 :: t [a]) Source # | |
Defined in Data.Foldable.Singletons type Apply (ConcatSym0 :: TyFun (t [a]) [a] -> Type) (a6989586621680390274 :: t [a]) = Concat a6989586621680390274 |
type family ConcatSym1 (a6989586621680390274 :: t [a]) :: [a] where ... Source #
ConcatSym1 (a6989586621680390274 :: t [a]) = Concat a6989586621680390274 |
data ConcatMapSym0 (a1 :: TyFun (a ~> [b]) (t a ~> [b])) Source #
Instances
SFoldable t => SingI (ConcatMapSym0 :: TyFun (a ~> [b]) (t a ~> [b]) -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
SuppressUnusedWarnings (ConcatMapSym0 :: TyFun (a ~> [b]) (t a ~> [b]) -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (ConcatMapSym0 :: TyFun (a ~> [b]) (t a ~> [b]) -> Type) (a6989586621680390263 :: a ~> [b]) Source # | |
Defined in Data.Foldable.Singletons type Apply (ConcatMapSym0 :: TyFun (a ~> [b]) (t a ~> [b]) -> Type) (a6989586621680390263 :: a ~> [b]) = ConcatMapSym1 a6989586621680390263 :: TyFun (t a) [b] -> Type |
data ConcatMapSym1 (a6989586621680390263 :: a ~> [b]) (b1 :: TyFun (t a) [b]) Source #
Instances
SFoldable t => SingI1 (ConcatMapSym1 :: (a ~> [b]) -> TyFun (t a) [b] -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
(SFoldable t, SingI d) => SingI (ConcatMapSym1 d :: TyFun (t a) [b] -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
SuppressUnusedWarnings (ConcatMapSym1 a6989586621680390263 :: TyFun (t a) [b] -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (ConcatMapSym1 a6989586621680390263 :: TyFun (t a) [b] -> Type) (a6989586621680390264 :: t a) Source # | |
Defined in Data.Foldable.Singletons type Apply (ConcatMapSym1 a6989586621680390263 :: TyFun (t a) [b] -> Type) (a6989586621680390264 :: t a) = ConcatMap a6989586621680390263 a6989586621680390264 |
type family ConcatMapSym2 (a6989586621680390263 :: a ~> [b]) (a6989586621680390264 :: t a) :: [b] where ... Source #
ConcatMapSym2 (a6989586621680390263 :: a ~> [b]) (a6989586621680390264 :: t a) = ConcatMap a6989586621680390263 a6989586621680390264 |
data AndSym0 (a :: TyFun (t Bool) Bool) Source #
Instances
SFoldable t => SingI (AndSym0 :: TyFun (t Bool) Bool -> Type) Source # | |
SuppressUnusedWarnings (AndSym0 :: TyFun (t Bool) Bool -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (AndSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680390258 :: t Bool) Source # | |
data OrSym0 (a :: TyFun (t Bool) Bool) Source #
Instances
SFoldable t => SingI (OrSym0 :: TyFun (t Bool) Bool -> Type) Source # | |
SuppressUnusedWarnings (OrSym0 :: TyFun (t Bool) Bool -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (OrSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680390252 :: t Bool) Source # | |
data AnySym0 (a1 :: TyFun (a ~> Bool) (t a ~> Bool)) Source #
Instances
SFoldable t => SingI (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) Source # | |
SuppressUnusedWarnings (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) (a6989586621680390244 :: a ~> Bool) Source # | |
data AnySym1 (a6989586621680390244 :: a ~> Bool) (b :: TyFun (t a) Bool) Source #
Instances
SFoldable t => SingI1 (AnySym1 :: (a ~> Bool) -> TyFun (t a) Bool -> Type) Source # | |
(SFoldable t, SingI d) => SingI (AnySym1 d :: TyFun (t a) Bool -> Type) Source # | |
SuppressUnusedWarnings (AnySym1 a6989586621680390244 :: TyFun (t a) Bool -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (AnySym1 a6989586621680390244 :: TyFun (t a) Bool -> Type) (a6989586621680390245 :: t a) Source # | |
type family AnySym2 (a6989586621680390244 :: a ~> Bool) (a6989586621680390245 :: t a) :: Bool where ... Source #
data AllSym0 (a1 :: TyFun (a ~> Bool) (t a ~> Bool)) Source #
Instances
SFoldable t => SingI (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) Source # | |
SuppressUnusedWarnings (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) (a6989586621680390235 :: a ~> Bool) Source # | |
data AllSym1 (a6989586621680390235 :: a ~> Bool) (b :: TyFun (t a) Bool) Source #
Instances
SFoldable t => SingI1 (AllSym1 :: (a ~> Bool) -> TyFun (t a) Bool -> Type) Source # | |
(SFoldable t, SingI d) => SingI (AllSym1 d :: TyFun (t a) Bool -> Type) Source # | |
SuppressUnusedWarnings (AllSym1 a6989586621680390235 :: TyFun (t a) Bool -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (AllSym1 a6989586621680390235 :: TyFun (t a) Bool -> Type) (a6989586621680390236 :: t a) Source # | |
type family AllSym2 (a6989586621680390235 :: a ~> Bool) (a6989586621680390236 :: t a) :: Bool where ... Source #
data MaximumBySym0 (a1 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a)) Source #
Instances
SFoldable t => SingI (MaximumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) Source # | |
SuppressUnusedWarnings (MaximumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (MaximumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) (a6989586621680390215 :: a ~> (a ~> Ordering)) Source # | |
Defined in Data.Foldable.Singletons |
data MaximumBySym1 (a6989586621680390215 :: a ~> (a ~> Ordering)) (b :: TyFun (t a) a) Source #
Instances
SFoldable t => SingI1 (MaximumBySym1 :: (a ~> (a ~> Ordering)) -> TyFun (t a) a -> Type) Source # | |
(SFoldable t, SingI d) => SingI (MaximumBySym1 d :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
SuppressUnusedWarnings (MaximumBySym1 a6989586621680390215 :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (MaximumBySym1 a6989586621680390215 :: TyFun (t a) a -> Type) (a6989586621680390216 :: t a) Source # | |
Defined in Data.Foldable.Singletons type Apply (MaximumBySym1 a6989586621680390215 :: TyFun (t a) a -> Type) (a6989586621680390216 :: t a) = MaximumBy a6989586621680390215 a6989586621680390216 |
type family MaximumBySym2 (a6989586621680390215 :: a ~> (a ~> Ordering)) (a6989586621680390216 :: t a) :: a where ... Source #
MaximumBySym2 (a6989586621680390215 :: a ~> (a ~> Ordering)) (a6989586621680390216 :: t a) = MaximumBy a6989586621680390215 a6989586621680390216 |
data MinimumBySym0 (a1 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a)) Source #
Instances
SFoldable t => SingI (MinimumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) Source # | |
SuppressUnusedWarnings (MinimumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (MinimumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) (a6989586621680390195 :: a ~> (a ~> Ordering)) Source # | |
Defined in Data.Foldable.Singletons |
data MinimumBySym1 (a6989586621680390195 :: a ~> (a ~> Ordering)) (b :: TyFun (t a) a) Source #
Instances
SFoldable t => SingI1 (MinimumBySym1 :: (a ~> (a ~> Ordering)) -> TyFun (t a) a -> Type) Source # | |
(SFoldable t, SingI d) => SingI (MinimumBySym1 d :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
SuppressUnusedWarnings (MinimumBySym1 a6989586621680390195 :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (MinimumBySym1 a6989586621680390195 :: TyFun (t a) a -> Type) (a6989586621680390196 :: t a) Source # | |
Defined in Data.Foldable.Singletons type Apply (MinimumBySym1 a6989586621680390195 :: TyFun (t a) a -> Type) (a6989586621680390196 :: t a) = MinimumBy a6989586621680390195 a6989586621680390196 |
type family MinimumBySym2 (a6989586621680390195 :: a ~> (a ~> Ordering)) (a6989586621680390196 :: t a) :: a where ... Source #
MinimumBySym2 (a6989586621680390195 :: a ~> (a ~> Ordering)) (a6989586621680390196 :: t a) = MinimumBy a6989586621680390195 a6989586621680390196 |
data NotElemSym0 (a1 :: TyFun a (t a ~> Bool)) Source #
Instances
(SFoldable t, SEq a) => SingI (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
SuppressUnusedWarnings (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680390186 :: a) Source # | |
Defined in Data.Foldable.Singletons type Apply (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680390186 :: a) = NotElemSym1 a6989586621680390186 :: TyFun (t a) Bool -> Type |
data NotElemSym1 (a6989586621680390186 :: a) (b :: TyFun (t a) Bool) Source #
Instances
(SFoldable t, SEq a) => SingI1 (NotElemSym1 :: a -> TyFun (t a) Bool -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
(SFoldable t, SEq a, SingI d) => SingI (NotElemSym1 d :: TyFun (t a) Bool -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
SuppressUnusedWarnings (NotElemSym1 a6989586621680390186 :: TyFun (t a) Bool -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (NotElemSym1 a6989586621680390186 :: TyFun (t a) Bool -> Type) (a6989586621680390187 :: t a) Source # | |
Defined in Data.Foldable.Singletons |
type family NotElemSym2 (a6989586621680390186 :: a) (a6989586621680390187 :: t a) :: Bool where ... Source #
NotElemSym2 (a6989586621680390186 :: a) (a6989586621680390187 :: t a) = NotElem a6989586621680390186 a6989586621680390187 |
data FindSym0 (a1 :: TyFun (a ~> Bool) (t a ~> Maybe a)) Source #
Instances
SFoldable t => SingI (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) Source # | |
SuppressUnusedWarnings (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) (a6989586621680390168 :: a ~> Bool) Source # | |
data FindSym1 (a6989586621680390168 :: a ~> Bool) (b :: TyFun (t a) (Maybe a)) Source #
Instances
SFoldable t => SingI1 (FindSym1 :: (a ~> Bool) -> TyFun (t a) (Maybe a) -> Type) Source # | |
(SFoldable t, SingI d) => SingI (FindSym1 d :: TyFun (t a) (Maybe a) -> Type) Source # | |
SuppressUnusedWarnings (FindSym1 a6989586621680390168 :: TyFun (t a) (Maybe a) -> Type) Source # | |
Defined in Data.Foldable.Singletons suppressUnusedWarnings :: () # | |
type Apply (FindSym1 a6989586621680390168 :: TyFun (t a) (Maybe a) -> Type) (a6989586621680390169 :: t a) Source # | |