Copyright	(C) 2018 Ryan Scott
License	BSD-style (see LICENSE)
Maintainer	Ryan Scott
Stability	experimental
Portability	non-portable
Safe Haskell	None
Language	GHC2021

Data.Foldable.Singletons

Contents

Defunctionalization symbols

Description

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 #

Associated Types

type Fold (arg :: t m) :: m Source #

type Fold (arg :: t m) = Apply (Fold_6989586621680390454Sym0 :: TyFun (t m) m -> Type) arg

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 ToList (arg :: t a) = Apply (ToList_6989586621680390594Sym0 :: TyFun (t a) [a] -> Type) arg

type Null (arg :: t a) :: Bool Source #

type Null (arg :: t a) = Apply (Null_6989586621680390603Sym0 :: TyFun (t a) Bool -> Type) arg

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 Maximum (arg :: t a) = Apply (Maximum_6989586621680390653Sym0 :: TyFun (t a) a -> Type) arg

type Minimum (arg :: t a) :: a Source #

type Minimum (arg :: t a) = Apply (Minimum_6989586621680390668Sym0 :: TyFun (t a) a -> Type) arg

type Sum (arg :: t a) :: a Source #

type Sum (arg :: t a) = Apply (Sum_6989586621680390683Sym0 :: TyFun (t a) a -> Type) arg

type Product (arg :: t a) :: a Source #

type Product (arg :: t a) = Apply (Product_6989586621680390692Sym0 :: TyFun (t a) a -> Type) arg

Instances

Instances details

PFoldable Identity Source #

Instance details

Defined in Data.Functor.Identity.Singletons

Associated Types

type Fold (arg :: Identity m)
Instance details Defined in Data.Functor.Identity.Singletons type Fold (arg :: Identity m)
type FoldMap (a2 :: a1 ~> k2) (a3 :: Identity a1)
Instance details Defined in Data.Functor.Identity.Singletons type FoldMap (a2 :: a1 ~> k2) (a3 :: Identity a1)
type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Identity a1)
Instance details Defined in Data.Functor.Identity.Singletons type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Identity a1)
type Foldr' (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Identity a1)
Instance details Defined in Data.Functor.Identity.Singletons type Foldr' (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Identity a1)
type Foldl (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Identity a1)
Instance details Defined in Data.Functor.Identity.Singletons type Foldl (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Identity a1)
type Foldl' (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Identity a1)
Instance details Defined in Data.Functor.Identity.Singletons type Foldl' (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Identity a1)
type Foldr1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Identity k2)
Instance details Defined in Data.Functor.Identity.Singletons type Foldr1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Identity k2)
type Foldl1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Identity k2)
Instance details Defined in Data.Functor.Identity.Singletons type Foldl1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Identity k2)
type ToList (a2 :: Identity a1)
Instance details Defined in Data.Functor.Identity.Singletons type ToList (a2 :: Identity a1)
type Null (a2 :: Identity a1)
Instance details Defined in Data.Functor.Identity.Singletons type Null (a2 :: Identity a1)
type Length (a2 :: Identity a1)
Instance details Defined in Data.Functor.Identity.Singletons type Length (a2 :: Identity a1)
type Elem (a1 :: k1) (a2 :: Identity k1)
Instance details Defined in Data.Functor.Identity.Singletons type Elem (a1 :: k1) (a2 :: Identity k1)
type Maximum (a :: Identity k2)
Instance details Defined in Data.Functor.Identity.Singletons type Maximum (a :: Identity k2)
type Minimum (a :: Identity k2)
Instance details Defined in Data.Functor.Identity.Singletons type Minimum (a :: Identity k2)
type Sum (a :: Identity k2)
Instance details Defined in Data.Functor.Identity.Singletons type Sum (a :: Identity k2)
type Product (a :: Identity k2)
Instance details Defined in Data.Functor.Identity.Singletons type Product (a :: Identity k2)

PFoldable First Source #

Instance details

Defined in Data.Foldable.Singletons

Associated Types

type Fold (arg :: First m)
Instance details Defined in Data.Foldable.Singletons type Fold (arg :: First m)
type FoldMap (a2 :: a1 ~> k2) (a3 :: First a1)
Instance details Defined in Data.Foldable.Singletons type FoldMap (a2 :: a1 ~> k2) (a3 :: First a1)
type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: First a1)
Instance details Defined in Data.Foldable.Singletons type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: First a1)
type Foldr' (arg1 :: a ~> (b ~> b)) (arg2 :: b) (arg3 :: First a)
Instance details Defined in Data.Foldable.Singletons type Foldr' (arg1 :: a ~> (b ~> b)) (arg2 :: b) (arg3 :: First a)
type Foldl (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: First a)
Instance details Defined in Data.Foldable.Singletons type Foldl (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: First a)
type Foldl' (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: First a)
Instance details Defined in Data.Foldable.Singletons type Foldl' (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: First a)
type Foldr1 (arg1 :: a ~> (a ~> a)) (arg2 :: First a)
Instance details Defined in Data.Foldable.Singletons type Foldr1 (arg1 :: a ~> (a ~> a)) (arg2 :: First a)
type Foldl1 (arg1 :: a ~> (a ~> a)) (arg2 :: First a)
Instance details Defined in Data.Foldable.Singletons type Foldl1 (arg1 :: a ~> (a ~> a)) (arg2 :: First a)
type ToList (arg :: First a)
Instance details Defined in Data.Foldable.Singletons type ToList (arg :: First a)
type Null (arg :: First a)
Instance details Defined in Data.Foldable.Singletons type Null (arg :: First a)
type Length (arg :: First a)
Instance details Defined in Data.Foldable.Singletons type Length (arg :: First a)
type Elem (arg1 :: a) (arg2 :: First a)
Instance details Defined in Data.Foldable.Singletons type Elem (arg1 :: a) (arg2 :: First a)
type Maximum (arg :: First a)
Instance details Defined in Data.Foldable.Singletons type Maximum (arg :: First a)
type Minimum (arg :: First a)
Instance details Defined in Data.Foldable.Singletons type Minimum (arg :: First a)
type Sum (arg :: First a)
Instance details Defined in Data.Foldable.Singletons type Sum (arg :: First a)
type Product (arg :: First a)
Instance details Defined in Data.Foldable.Singletons type Product (arg :: First a)

PFoldable Last Source #

Instance details

Defined in Data.Foldable.Singletons

Associated Types

type Fold (arg :: Last m)
Instance details Defined in Data.Foldable.Singletons type Fold (arg :: Last m)
type FoldMap (a2 :: a1 ~> k2) (a3 :: Last a1)
Instance details Defined in Data.Foldable.Singletons type FoldMap (a2 :: a1 ~> k2) (a3 :: Last a1)
type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Last a1)
Instance details Defined in Data.Foldable.Singletons type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Last a1)
type Foldr' (arg1 :: a ~> (b ~> b)) (arg2 :: b) (arg3 :: Last a)
Instance details Defined in Data.Foldable.Singletons type Foldr' (arg1 :: a ~> (b ~> b)) (arg2 :: b) (arg3 :: Last a)
type Foldl (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: Last a)
Instance details Defined in Data.Foldable.Singletons type Foldl (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: Last a)
type Foldl' (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: Last a)
Instance details Defined in Data.Foldable.Singletons type Foldl' (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: Last a)
type Foldr1 (arg1 :: a ~> (a ~> a)) (arg2 :: Last a)
Instance details Defined in Data.Foldable.Singletons type Foldr1 (arg1 :: a ~> (a ~> a)) (arg2 :: Last a)
type Foldl1 (arg1 :: a ~> (a ~> a)) (arg2 :: Last a)
Instance details Defined in Data.Foldable.Singletons type Foldl1 (arg1 :: a ~> (a ~> a)) (arg2 :: Last a)
type ToList (arg :: Last a)
Instance details Defined in Data.Foldable.Singletons type ToList (arg :: Last a)
type Null (arg :: Last a)
Instance details Defined in Data.Foldable.Singletons type Null (arg :: Last a)
type Length (arg :: Last a)
Instance details Defined in Data.Foldable.Singletons type Length (arg :: Last a)
type Elem (arg1 :: a) (arg2 :: Last a)
Instance details Defined in Data.Foldable.Singletons type Elem (arg1 :: a) (arg2 :: Last a)
type Maximum (arg :: Last a)
Instance details Defined in Data.Foldable.Singletons type Maximum (arg :: Last a)
type Minimum (arg :: Last a)
Instance details Defined in Data.Foldable.Singletons type Minimum (arg :: Last a)
type Sum (arg :: Last a)
Instance details Defined in Data.Foldable.Singletons type Sum (arg :: Last a)
type Product (arg :: Last a)
Instance details Defined in Data.Foldable.Singletons type Product (arg :: Last a)

PFoldable First Source #

Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type Fold (arg :: First m)
Instance details Defined in Data.Semigroup.Singletons type Fold (arg :: First m)
type FoldMap (a2 :: a1 ~> k2) (a3 :: First a1)
Instance details Defined in Data.Semigroup.Singletons type FoldMap (a2 :: a1 ~> k2) (a3 :: First a1)
type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: First a1)
Instance details Defined in Data.Semigroup.Singletons type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: First a1)
type Foldr' (arg :: a ~> (b ~> b)) (arg1 :: b) (arg2 :: First a)
Instance details Defined in Data.Semigroup.Singletons type Foldr' (arg :: a ~> (b ~> b)) (arg1 :: b) (arg2 :: First a)
type Foldl (arg :: b ~> (a ~> b)) (arg1 :: b) (arg2 :: First a)
Instance details Defined in Data.Semigroup.Singletons type Foldl (arg :: b ~> (a ~> b)) (arg1 :: b) (arg2 :: First a)
type Foldl' (arg :: b ~> (a ~> b)) (arg1 :: b) (arg2 :: First a)
Instance details Defined in Data.Semigroup.Singletons type Foldl' (arg :: b ~> (a ~> b)) (arg1 :: b) (arg2 :: First a)
type Foldr1 (arg :: a ~> (a ~> a)) (arg1 :: First a)
Instance details Defined in Data.Semigroup.Singletons type Foldr1 (arg :: a ~> (a ~> a)) (arg1 :: First a)
type Foldl1 (arg :: a ~> (a ~> a)) (arg1 :: First a)
Instance details Defined in Data.Semigroup.Singletons type Foldl1 (arg :: a ~> (a ~> a)) (arg1 :: First a)
type ToList (arg :: First a)
Instance details Defined in Data.Semigroup.Singletons type ToList (arg :: First a)
type Null (arg :: First a)
Instance details Defined in Data.Semigroup.Singletons type Null (arg :: First a)
type Length (arg :: First a)
Instance details Defined in Data.Semigroup.Singletons type Length (arg :: First a)
type Elem (arg :: a) (arg1 :: First a)
Instance details Defined in Data.Semigroup.Singletons type Elem (arg :: a) (arg1 :: First a)
type Maximum (arg :: First a)
Instance details Defined in Data.Semigroup.Singletons type Maximum (arg :: First a)
type Minimum (arg :: First a)
Instance details Defined in Data.Semigroup.Singletons type Minimum (arg :: First a)
type Sum (arg :: First a)
Instance details Defined in Data.Semigroup.Singletons type Sum (arg :: First a)
type Product (arg :: First a)
Instance details Defined in Data.Semigroup.Singletons type Product (arg :: First a)

PFoldable Last Source #

Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type Fold (arg :: Last m)
Instance details Defined in Data.Semigroup.Singletons type Fold (arg :: Last m)
type FoldMap (a2 :: a1 ~> k2) (a3 :: Last a1)
Instance details Defined in Data.Semigroup.Singletons type FoldMap (a2 :: a1 ~> k2) (a3 :: Last a1)
type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Last a1)
Instance details Defined in Data.Semigroup.Singletons type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Last a1)
type Foldr' (arg :: a ~> (b ~> b)) (arg1 :: b) (arg2 :: Last a)
Instance details Defined in Data.Semigroup.Singletons type Foldr' (arg :: a ~> (b ~> b)) (arg1 :: b) (arg2 :: Last a)
type Foldl (arg :: b ~> (a ~> b)) (arg1 :: b) (arg2 :: Last a)
Instance details Defined in Data.Semigroup.Singletons type Foldl (arg :: b ~> (a ~> b)) (arg1 :: b) (arg2 :: Last a)
type Foldl' (arg :: b ~> (a ~> b)) (arg1 :: b) (arg2 :: Last a)
Instance details Defined in Data.Semigroup.Singletons type Foldl' (arg :: b ~> (a ~> b)) (arg1 :: b) (arg2 :: Last a)
type Foldr1 (arg :: a ~> (a ~> a)) (arg1 :: Last a)
Instance details Defined in Data.Semigroup.Singletons type Foldr1 (arg :: a ~> (a ~> a)) (arg1 :: Last a)
type Foldl1 (arg :: a ~> (a ~> a)) (arg1 :: Last a)
Instance details Defined in Data.Semigroup.Singletons type Foldl1 (arg :: a ~> (a ~> a)) (arg1 :: Last a)
type ToList (arg :: Last a)
Instance details Defined in Data.Semigroup.Singletons type ToList (arg :: Last a)
type Null (arg :: Last a)
Instance details Defined in Data.Semigroup.Singletons type Null (arg :: Last a)
type Length (arg :: Last a)
Instance details Defined in Data.Semigroup.Singletons type Length (arg :: Last a)
type Elem (arg :: a) (arg1 :: Last a)
Instance details Defined in Data.Semigroup.Singletons type Elem (arg :: a) (arg1 :: Last a)
type Maximum (arg :: Last a)
Instance details Defined in Data.Semigroup.Singletons type Maximum (arg :: Last a)
type Minimum (arg :: Last a)
Instance details Defined in Data.Semigroup.Singletons type Minimum (arg :: Last a)
type Sum (arg :: Last a)
Instance details Defined in Data.Semigroup.Singletons type Sum (arg :: Last a)
type Product (arg :: Last a)
Instance details Defined in Data.Semigroup.Singletons type Product (arg :: Last a)

PFoldable Max Source #

Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type Fold (arg :: Max m)
Instance details Defined in Data.Semigroup.Singletons type Fold (arg :: Max m)
type FoldMap (a2 :: a1 ~> k2) (a3 :: Max a1)
Instance details Defined in Data.Semigroup.Singletons type FoldMap (a2 :: a1 ~> k2) (a3 :: Max a1)
type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Max a1)
Instance details Defined in Data.Semigroup.Singletons type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Max a1)
type Foldr' (arg :: a ~> (b ~> b)) (arg1 :: b) (arg2 :: Max a)
Instance details Defined in Data.Semigroup.Singletons type Foldr' (arg :: a ~> (b ~> b)) (arg1 :: b) (arg2 :: Max a)
type Foldl (arg :: b ~> (a ~> b)) (arg1 :: b) (arg2 :: Max a)
Instance details Defined in Data.Semigroup.Singletons type Foldl (arg :: b ~> (a ~> b)) (arg1 :: b) (arg2 :: Max a)
type Foldl' (arg :: b ~> (a ~> b)) (arg1 :: b) (arg2 :: Max a)
Instance details Defined in Data.Semigroup.Singletons type Foldl' (arg :: b ~> (a ~> b)) (arg1 :: b) (arg2 :: Max a)
type Foldr1 (arg :: a ~> (a ~> a)) (arg1 :: Max a)
Instance details Defined in Data.Semigroup.Singletons type Foldr1 (arg :: a ~> (a ~> a)) (arg1 :: Max a)
type Foldl1 (arg :: a ~> (a ~> a)) (arg1 :: Max a)
Instance details Defined in Data.Semigroup.Singletons type Foldl1 (arg :: a ~> (a ~> a)) (arg1 :: Max a)
type ToList (arg :: Max a)
Instance details Defined in Data.Semigroup.Singletons type ToList (arg :: Max a)
type Null (arg :: Max a)
Instance details Defined in Data.Semigroup.Singletons type Null (arg :: Max a)
type Length (arg :: Max a)
Instance details Defined in Data.Semigroup.Singletons type Length (arg :: Max a)
type Elem (arg :: a) (arg1 :: Max a)
Instance details Defined in Data.Semigroup.Singletons type Elem (arg :: a) (arg1 :: Max a)
type Maximum (arg :: Max a)
Instance details Defined in Data.Semigroup.Singletons type Maximum (arg :: Max a)
type Minimum (arg :: Max a)
Instance details Defined in Data.Semigroup.Singletons type Minimum (arg :: Max a)
type Sum (arg :: Max a)
Instance details Defined in Data.Semigroup.Singletons type Sum (arg :: Max a)
type Product (arg :: Max a)
Instance details Defined in Data.Semigroup.Singletons type Product (arg :: Max a)

PFoldable Min Source #

Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type Fold (arg :: Min m)
Instance details Defined in Data.Semigroup.Singletons type Fold (arg :: Min m)
type FoldMap (a2 :: a1 ~> k2) (a3 :: Min a1)
Instance details Defined in Data.Semigroup.Singletons type FoldMap (a2 :: a1 ~> k2) (a3 :: Min a1)
type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Min a1)
Instance details Defined in Data.Semigroup.Singletons type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Min a1)
type Foldr' (arg :: a ~> (b ~> b)) (arg1 :: b) (arg2 :: Min a)
Instance details Defined in Data.Semigroup.Singletons type Foldr' (arg :: a ~> (b ~> b)) (arg1 :: b) (arg2 :: Min a)
type Foldl (arg :: b ~> (a ~> b)) (arg1 :: b) (arg2 :: Min a)
Instance details Defined in Data.Semigroup.Singletons type Foldl (arg :: b ~> (a ~> b)) (arg1 :: b) (arg2 :: Min a)
type Foldl' (arg :: b ~> (a ~> b)) (arg1 :: b) (arg2 :: Min a)
Instance details Defined in Data.Semigroup.Singletons type Foldl' (arg :: b ~> (a ~> b)) (arg1 :: b) (arg2 :: Min a)
type Foldr1 (arg :: a ~> (a ~> a)) (arg1 :: Min a)
Instance details Defined in Data.Semigroup.Singletons type Foldr1 (arg :: a ~> (a ~> a)) (arg1 :: Min a)
type Foldl1 (arg :: a ~> (a ~> a)) (arg1 :: Min a)
Instance details Defined in Data.Semigroup.Singletons type Foldl1 (arg :: a ~> (a ~> a)) (arg1 :: Min a)
type ToList (arg :: Min a)
Instance details Defined in Data.Semigroup.Singletons type ToList (arg :: Min a)
type Null (arg :: Min a)
Instance details Defined in Data.Semigroup.Singletons type Null (arg :: Min a)
type Length (arg :: Min a)
Instance details Defined in Data.Semigroup.Singletons type Length (arg :: Min a)
type Elem (arg :: a) (arg1 :: Min a)
Instance details Defined in Data.Semigroup.Singletons type Elem (arg :: a) (arg1 :: Min a)
type Maximum (arg :: Min a)
Instance details Defined in Data.Semigroup.Singletons type Maximum (arg :: Min a)
type Minimum (arg :: Min a)
Instance details Defined in Data.Semigroup.Singletons type Minimum (arg :: Min a)
type Sum (arg :: Min a)
Instance details Defined in Data.Semigroup.Singletons type Sum (arg :: Min a)
type Product (arg :: Min a)
Instance details Defined in Data.Semigroup.Singletons type Product (arg :: Min a)

PFoldable Dual Source #

Instance details

Defined in Data.Foldable.Singletons

Associated Types

type Fold (arg :: Dual m)
Instance details Defined in Data.Foldable.Singletons type Fold (arg :: Dual m)
type FoldMap (a2 :: a1 ~> k2) (a3 :: Dual a1)
Instance details Defined in Data.Foldable.Singletons type FoldMap (a2 :: a1 ~> k2) (a3 :: Dual a1)
type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Dual a1)
Instance details Defined in Data.Foldable.Singletons type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Dual a1)
type Foldr' (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Dual a1)
Instance details Defined in Data.Foldable.Singletons type Foldr' (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Dual a1)
type Foldl (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Dual a1)
Instance details Defined in Data.Foldable.Singletons type Foldl (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Dual a1)
type Foldl' (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Dual a1)
Instance details Defined in Data.Foldable.Singletons type Foldl' (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Dual a1)
type Foldr1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Dual k2)
Instance details Defined in Data.Foldable.Singletons type Foldr1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Dual k2)
type Foldl1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Dual k2)
Instance details Defined in Data.Foldable.Singletons type Foldl1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Dual k2)
type ToList (a2 :: Dual a1)
Instance details Defined in Data.Foldable.Singletons type ToList (a2 :: Dual a1)
type Null (a2 :: Dual a1)
Instance details Defined in Data.Foldable.Singletons type Null (a2 :: Dual a1)
type Length (a2 :: Dual a1)
Instance details Defined in Data.Foldable.Singletons type Length (a2 :: Dual a1)
type Elem (a1 :: k1) (a2 :: Dual k1)
Instance details Defined in Data.Foldable.Singletons type Elem (a1 :: k1) (a2 :: Dual k1)
type Maximum (a :: Dual k2)
Instance details Defined in Data.Foldable.Singletons type Maximum (a :: Dual k2)
type Minimum (a :: Dual k2)
Instance details Defined in Data.Foldable.Singletons type Minimum (a :: Dual k2)
type Sum (a :: Dual k2)
Instance details Defined in Data.Foldable.Singletons type Sum (a :: Dual k2)
type Product (a :: Dual k2)
Instance details Defined in Data.Foldable.Singletons type Product (a :: Dual k2)

PFoldable Product Source #

Instance details

Defined in Data.Foldable.Singletons

Associated Types

type Fold (arg :: Product m)
Instance details Defined in Data.Foldable.Singletons type Fold (arg :: Product m)
type FoldMap (a2 :: a1 ~> k2) (a3 :: Product a1)
Instance details Defined in Data.Foldable.Singletons type FoldMap (a2 :: a1 ~> k2) (a3 :: Product a1)
type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Product a1)
Instance details Defined in Data.Foldable.Singletons type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Product a1)
type Foldr' (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Product a1)
Instance details Defined in Data.Foldable.Singletons type Foldr' (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Product a1)
type Foldl (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Product a1)
Instance details Defined in Data.Foldable.Singletons type Foldl (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Product a1)
type Foldl' (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Product a1)
Instance details Defined in Data.Foldable.Singletons type Foldl' (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Product a1)
type Foldr1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Product k2)
Instance details Defined in Data.Foldable.Singletons type Foldr1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Product k2)
type Foldl1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Product k2)
Instance details Defined in Data.Foldable.Singletons type Foldl1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Product k2)
type ToList (a2 :: Product a1)
Instance details Defined in Data.Foldable.Singletons type ToList (a2 :: Product a1)
type Null (a2 :: Product a1)
Instance details Defined in Data.Foldable.Singletons type Null (a2 :: Product a1)
type Length (a2 :: Product a1)
Instance details Defined in Data.Foldable.Singletons type Length (a2 :: Product a1)
type Elem (a1 :: k1) (a2 :: Product k1)
Instance details Defined in Data.Foldable.Singletons type Elem (a1 :: k1) (a2 :: Product k1)
type Maximum (a :: Product k2)
Instance details Defined in Data.Foldable.Singletons type Maximum (a :: Product k2)
type Minimum (a :: Product k2)
Instance details Defined in Data.Foldable.Singletons type Minimum (a :: Product k2)
type Sum (a :: Product k2)
Instance details Defined in Data.Foldable.Singletons type Sum (a :: Product k2)
type Product (a :: Product k2)
Instance details Defined in Data.Foldable.Singletons type Product (a :: Product k2)

PFoldable Sum Source #

Instance details

Defined in Data.Foldable.Singletons

Associated Types

type Fold (arg :: Sum m)
Instance details Defined in Data.Foldable.Singletons type Fold (arg :: Sum m)
type FoldMap (a2 :: a1 ~> k2) (a3 :: Sum a1)
Instance details Defined in Data.Foldable.Singletons type FoldMap (a2 :: a1 ~> k2) (a3 :: Sum a1)
type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Sum a1)
Instance details Defined in Data.Foldable.Singletons type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Sum a1)
type Foldr' (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Sum a1)
Instance details Defined in Data.Foldable.Singletons type Foldr' (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Sum a1)
type Foldl (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Sum a1)
Instance details Defined in Data.Foldable.Singletons type Foldl (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Sum a1)
type Foldl' (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Sum a1)
Instance details Defined in Data.Foldable.Singletons type Foldl' (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Sum a1)
type Foldr1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Sum k2)
Instance details Defined in Data.Foldable.Singletons type Foldr1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Sum k2)
type Foldl1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Sum k2)
Instance details Defined in Data.Foldable.Singletons type Foldl1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Sum k2)
type ToList (a2 :: Sum a1)
Instance details Defined in Data.Foldable.Singletons type ToList (a2 :: Sum a1)
type Null (a2 :: Sum a1)
Instance details Defined in Data.Foldable.Singletons type Null (a2 :: Sum a1)
type Length (a2 :: Sum a1)
Instance details Defined in Data.Foldable.Singletons type Length (a2 :: Sum a1)
type Elem (a1 :: k1) (a2 :: Sum k1)
Instance details Defined in Data.Foldable.Singletons type Elem (a1 :: k1) (a2 :: Sum k1)
type Maximum (a :: Sum k2)
Instance details Defined in Data.Foldable.Singletons type Maximum (a :: Sum k2)
type Minimum (a :: Sum k2)
Instance details Defined in Data.Foldable.Singletons type Minimum (a :: Sum k2)
type Sum (a :: Sum k2)
Instance details Defined in Data.Foldable.Singletons type Sum (a :: Sum k2)
type Product (a :: Sum k2)
Instance details Defined in Data.Foldable.Singletons type Product (a :: Sum k2)

PFoldable NonEmpty Source #

Instance details

Defined in Data.Foldable.Singletons

Associated Types

type Fold (a :: NonEmpty k2)
Instance details Defined in Data.Foldable.Singletons type Fold (a :: NonEmpty k2)
type FoldMap (a2 :: a1 ~> k2) (a3 :: NonEmpty a1)
Instance details Defined in Data.Foldable.Singletons type FoldMap (a2 :: a1 ~> k2) (a3 :: NonEmpty a1)
type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: NonEmpty a1)
Instance details Defined in Data.Foldable.Singletons type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: NonEmpty a1)
type Foldr' (arg1 :: a ~> (b ~> b)) (arg2 :: b) (arg3 :: NonEmpty a)
Instance details Defined in Data.Foldable.Singletons type Foldr' (arg1 :: a ~> (b ~> b)) (arg2 :: b) (arg3 :: NonEmpty a)
type Foldl (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: NonEmpty a1)
Instance details Defined in Data.Foldable.Singletons type Foldl (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: NonEmpty a1)
type Foldl' (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: NonEmpty a)
Instance details Defined in Data.Foldable.Singletons type Foldl' (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: NonEmpty a)
type Foldr1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: NonEmpty k2)
Instance details Defined in Data.Foldable.Singletons type Foldr1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: NonEmpty k2)
type Foldl1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: NonEmpty k2)
Instance details Defined in Data.Foldable.Singletons type Foldl1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: NonEmpty k2)
type ToList (a2 :: NonEmpty a1)
Instance details Defined in Data.Foldable.Singletons type ToList (a2 :: NonEmpty a1)
type Null (arg :: NonEmpty a)
Instance details Defined in Data.Foldable.Singletons type Null (arg :: NonEmpty a)
type Length (arg :: NonEmpty a)
Instance details Defined in Data.Foldable.Singletons type Length (arg :: NonEmpty a)
type Elem (arg1 :: a) (arg2 :: NonEmpty a)
Instance details Defined in Data.Foldable.Singletons type Elem (arg1 :: a) (arg2 :: NonEmpty a)
type Maximum (arg :: NonEmpty a)
Instance details Defined in Data.Foldable.Singletons type Maximum (arg :: NonEmpty a)
type Minimum (arg :: NonEmpty a)
Instance details Defined in Data.Foldable.Singletons type Minimum (arg :: NonEmpty a)
type Sum (arg :: NonEmpty a)
Instance details Defined in Data.Foldable.Singletons type Sum (arg :: NonEmpty a)
type Product (arg :: NonEmpty a)
Instance details Defined in Data.Foldable.Singletons type Product (arg :: NonEmpty a)

PFoldable Maybe Source #

Instance details

Defined in Data.Foldable.Singletons

Associated Types

type Fold (arg :: Maybe m)
Instance details Defined in Data.Foldable.Singletons type Fold (arg :: Maybe m)
type FoldMap (a2 :: a1 ~> k2) (a3 :: Maybe a1)
Instance details Defined in Data.Foldable.Singletons type FoldMap (a2 :: a1 ~> k2) (a3 :: Maybe a1)
type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Maybe a1)
Instance details Defined in Data.Foldable.Singletons type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Maybe a1)
type Foldr' (arg1 :: a ~> (b ~> b)) (arg2 :: b) (arg3 :: Maybe a)
Instance details Defined in Data.Foldable.Singletons type Foldr' (arg1 :: a ~> (b ~> b)) (arg2 :: b) (arg3 :: Maybe a)
type Foldl (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Maybe a1)
Instance details Defined in Data.Foldable.Singletons type Foldl (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Maybe a1)
type Foldl' (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: Maybe a)
Instance details Defined in Data.Foldable.Singletons type Foldl' (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: Maybe a)
type Foldr1 (arg1 :: a ~> (a ~> a)) (arg2 :: Maybe a)
Instance details Defined in Data.Foldable.Singletons type Foldr1 (arg1 :: a ~> (a ~> a)) (arg2 :: Maybe a)
type Foldl1 (arg1 :: a ~> (a ~> a)) (arg2 :: Maybe a)
Instance details Defined in Data.Foldable.Singletons type Foldl1 (arg1 :: a ~> (a ~> a)) (arg2 :: Maybe a)
type ToList (arg :: Maybe a)
Instance details Defined in Data.Foldable.Singletons type ToList (arg :: Maybe a)
type Null (arg :: Maybe a)
Instance details Defined in Data.Foldable.Singletons type Null (arg :: Maybe a)
type Length (arg :: Maybe a)
Instance details Defined in Data.Foldable.Singletons type Length (arg :: Maybe a)
type Elem (arg1 :: a) (arg2 :: Maybe a)
Instance details Defined in Data.Foldable.Singletons type Elem (arg1 :: a) (arg2 :: Maybe a)
type Maximum (arg :: Maybe a)
Instance details Defined in Data.Foldable.Singletons type Maximum (arg :: Maybe a)
type Minimum (arg :: Maybe a)
Instance details Defined in Data.Foldable.Singletons type Minimum (arg :: Maybe a)
type Sum (arg :: Maybe a)
Instance details Defined in Data.Foldable.Singletons type Sum (arg :: Maybe a)
type Product (arg :: Maybe a)
Instance details Defined in Data.Foldable.Singletons type Product (arg :: Maybe a)

PFoldable [] Source #

Instance details

Defined in Data.Foldable.Singletons

Associated Types

type Fold (arg :: [m])
Instance details Defined in Data.Foldable.Singletons type Fold (arg :: [m])
type FoldMap (arg1 :: a ~> m) (arg2 :: [a])
Instance details Defined in Data.Foldable.Singletons type FoldMap (arg1 :: a ~> m) (arg2 :: [a])
type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: [a1])
Instance details Defined in Data.Foldable.Singletons type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: [a1])
type Foldr' (arg1 :: a ~> (b ~> b)) (arg2 :: b) (arg3 :: [a])
Instance details Defined in Data.Foldable.Singletons type Foldr' (arg1 :: a ~> (b ~> b)) (arg2 :: b) (arg3 :: [a])
type Foldl (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: [a1])
Instance details Defined in Data.Foldable.Singletons type Foldl (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: [a1])
type Foldl' (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: [a1])
Instance details Defined in Data.Foldable.Singletons type Foldl' (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: [a1])
type Foldr1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: [k2])
Instance details Defined in Data.Foldable.Singletons type Foldr1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: [k2])
type Foldl1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: [k2])
Instance details Defined in Data.Foldable.Singletons type Foldl1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: [k2])
type ToList (a2 :: [a1])
Instance details Defined in Data.Foldable.Singletons type ToList (a2 :: [a1])
type Null (a2 :: [a1])
Instance details Defined in Data.Foldable.Singletons type Null (a2 :: [a1])
type Length (a2 :: [a1])
Instance details Defined in Data.Foldable.Singletons type Length (a2 :: [a1])
type Elem (a1 :: k1) (a2 :: [k1])
Instance details Defined in Data.Foldable.Singletons type Elem (a1 :: k1) (a2 :: [k1])
type Maximum (a :: [k2])
Instance details Defined in Data.Foldable.Singletons type Maximum (a :: [k2])
type Minimum (a :: [k2])
Instance details Defined in Data.Foldable.Singletons type Minimum (a :: [k2])
type Sum (a :: [k2])
Instance details Defined in Data.Foldable.Singletons type Sum (a :: [k2])
type Product (a :: [k2])
Instance details Defined in Data.Foldable.Singletons type Product (a :: [k2])

PFoldable (Either a) Source #

Instance details

Defined in Data.Foldable.Singletons

PFoldable (Proxy :: Type -> Type) Source #

Instance details

Defined in Data.Foldable.Singletons

Associated Types

type Fold (a :: Proxy k2)
Instance details Defined in Data.Foldable.Singletons type Fold (a :: Proxy k2)
type FoldMap (a2 :: a1 ~> k2) (a3 :: Proxy a1)
Instance details Defined in Data.Foldable.Singletons type FoldMap (a2 :: a1 ~> k2) (a3 :: Proxy a1)
type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Proxy a1)
Instance details Defined in Data.Foldable.Singletons type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Proxy a1)
type Foldr' (arg1 :: a ~> (b ~> b)) (arg2 :: b) (arg3 :: Proxy a)
Instance details Defined in Data.Foldable.Singletons type Foldr' (arg1 :: a ~> (b ~> b)) (arg2 :: b) (arg3 :: Proxy a)
type Foldl (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Proxy a1)
Instance details Defined in Data.Foldable.Singletons type Foldl (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Proxy a1)
type Foldl' (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: Proxy a)
Instance details Defined in Data.Foldable.Singletons type Foldl' (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: Proxy a)
type Foldr1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Proxy k2)
Instance details Defined in Data.Foldable.Singletons type Foldr1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Proxy k2)
type Foldl1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Proxy k2)
Instance details Defined in Data.Foldable.Singletons type Foldl1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Proxy k2)
type ToList (arg :: Proxy a)
Instance details Defined in Data.Foldable.Singletons type ToList (arg :: Proxy a)
type Null (a2 :: Proxy a1)
Instance details Defined in Data.Foldable.Singletons type Null (a2 :: Proxy a1)
type Length (a2 :: Proxy a1)
Instance details Defined in Data.Foldable.Singletons type Length (a2 :: Proxy a1)
type Elem (a1 :: k1) (a2 :: Proxy k1)
Instance details Defined in Data.Foldable.Singletons type Elem (a1 :: k1) (a2 :: Proxy k1)
type Maximum (arg :: Proxy a)
Instance details Defined in Data.Foldable.Singletons type Maximum (arg :: Proxy a)
type Minimum (arg :: Proxy a)
Instance details Defined in Data.Foldable.Singletons type Minimum (arg :: Proxy a)
type Sum (a :: Proxy k2)
Instance details Defined in Data.Foldable.Singletons type Sum (a :: Proxy k2)
type Product (a :: Proxy k2)
Instance details Defined in Data.Foldable.Singletons type Product (a :: Proxy k2)

PFoldable (Arg a) Source #

Instance details

Defined in Data.Semigroup.Singletons

PFoldable ((,) a) Source #

Instance details

Defined in Data.Foldable.Singletons

PFoldable (Const m :: Type -> Type) Source #

Instance details

Defined in Data.Functor.Const.Singletons

PFoldable (Product f g) Source #

Instance details

Defined in Data.Functor.Product.Singletons

PFoldable (Sum f g) Source #

Instance details

Defined in Data.Functor.Sum.Singletons

PFoldable (Compose f g) Source #

Instance details

Defined in Data.Functor.Compose.Singletons

class SFoldable (t :: Type -> Type) where Source #

Minimal complete definition

Nothing

Methods

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 #

default sProduct :: forall a (t1 :: t a). (Apply (ProductSym0 :: TyFun (t a) a -> Type) t1 ~ Apply (Product_6989586621680390692Sym0 :: TyFun (t a) a -> Type) t1, SNum a) => Sing t1 -> Sing (Apply (ProductSym0 :: TyFun (t a) a -> Type) t1) Source #

Instances

Instances details

SFoldable Identity Source #
Instance details Defined in Data.Functor.Identity.Singletons Methods 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 #
Instance details Defined in Data.Foldable.Singletons Methods 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 #
Instance details Defined in Data.Foldable.Singletons Methods 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 #
Instance details Defined in Data.Semigroup.Singletons Methods 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 #
Instance details Defined in Data.Semigroup.Singletons Methods 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 #
Instance details Defined in Data.Semigroup.Singletons Methods 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 #
Instance details Defined in Data.Semigroup.Singletons Methods 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 #
Instance details Defined in Data.Foldable.Singletons Methods 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 #
Instance details Defined in Data.Foldable.Singletons Methods 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 #
Instance details Defined in Data.Foldable.Singletons Methods 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 #
Instance details Defined in Data.Foldable.Singletons Methods 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 #
Instance details Defined in Data.Foldable.Singletons Methods 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 #
Instance details Defined in Data.Foldable.Singletons Methods 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 #
Instance details Defined in Data.Foldable.Singletons Methods 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 #
Instance details Defined in Data.Foldable.Singletons Methods 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 #
Instance details Defined in Data.Semigroup.Singletons Methods 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 #
Instance details Defined in Data.Foldable.Singletons Methods 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 #
Instance details Defined in Data.Functor.Const.Singletons Methods 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 #
Instance details Defined in Data.Functor.Product.Singletons Methods 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 #
Instance details Defined in Data.Functor.Sum.Singletons Methods 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 #
Instance details Defined in Data.Functor.Compose.Singletons Methods 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 #

Equations

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 #

Equations

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 #

Equations

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 #

type family For_ (a1 :: t a) (a2 :: a ~> f b) :: f () where ... Source #

Equations

For_ (a_6989586621680390325 :: t a) (a_6989586621680390327 :: a ~> f b) = Apply (Apply (Apply (FlipSym0 :: TyFun ((a ~> f b) ~> (t a ~> f ())) (t a ~> ((a ~> f b) ~> f ())) -> Type) (Traverse_Sym0 :: TyFun (a ~> f b) (t a ~> f ()) -> Type)) a_6989586621680390325) a_6989586621680390327

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 #

Equations

SequenceA_ (a_6989586621680390299 :: t (f a)) = Apply (Apply (Apply (FoldrSym0 :: TyFun (f a ~> (f () ~> f ())) (f () ~> (t (f a) ~> f ())) -> Type) ((*>@#@$) :: TyFun (f a) (f () ~> f ()) -> Type)) (Apply (PureSym0 :: TyFun () (f ()) -> Type) Tuple0Sym0)) a_6989586621680390299

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 #

type family Asum (a1 :: t (f a)) :: f a where ... Source #

Equations

Asum (a_6989586621680390287 :: t (f a)) = Apply (Apply (Apply (FoldrSym0 :: TyFun (f a ~> (f a ~> f a)) (f a ~> (t (f a) ~> f a)) -> Type) ((<|>@#@$) :: TyFun (f a) (f a ~> f a) -> Type)) (EmptySym0 :: f a)) a_6989586621680390287

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 #

Equations

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 #

type family ForM_ (a1 :: t a) (a2 :: a ~> m b) :: m () where ... Source #

Equations

ForM_ (a_6989586621680390305 :: t a) (a_6989586621680390307 :: a ~> m b) = Apply (Apply (Apply (FlipSym0 :: TyFun ((a ~> m b) ~> (t a ~> m ())) (t a ~> ((a ~> m b) ~> m ())) -> Type) (MapM_Sym0 :: TyFun (a ~> m b) (t a ~> m ()) -> Type)) a_6989586621680390305) a_6989586621680390307

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 #

type family Sequence_ (a1 :: t (m a)) :: m () where ... Source #

Equations

Sequence_ (a_6989586621680390293 :: t (m a)) = Apply (Apply (Apply (FoldrSym0 :: TyFun (m a ~> (m () ~> m ())) (m () ~> (t (m a) ~> m ())) -> Type) ((>>@#@$) :: TyFun (m a) (m () ~> m ()) -> Type)) (Apply (ReturnSym0 :: TyFun () (m ()) -> Type) Tuple0Sym0)) a_6989586621680390293

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 #

type family Msum (a1 :: t (m a)) :: m a where ... Source #

Equations

Msum (a_6989586621680390281 :: t (f a)) = Apply (AsumSym0 :: TyFun (t (f a)) (f a) -> Type) a_6989586621680390281

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 #

type family Concat (a1 :: t [a]) :: [a] where ... Source #

Equations

Concat (xs :: t [a]) = Apply (Apply (Apply (FoldrSym0 :: TyFun ([a] ~> ([a] ~> [a])) ([a] ~> (t [a] ~> [a])) -> Type) (Apply (Lambda_6989586621680390276Sym0 :: TyFun (t [a]) (TyFun [a] (TyFun [a] [a] -> Type) -> Type) -> Type) xs)) (NilSym0 :: [a])) xs

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 #

Equations

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 #

type family And (a :: t Bool) :: Bool where ... Source #

Equations

And (a_6989586621680390254 :: t Bool) = Apply (Apply (Apply ((.@#@$) :: TyFun (All ~> Bool) ((t Bool ~> All) ~> (t Bool ~> Bool)) -> Type) GetAllSym0) (Apply (FoldMapSym0 :: TyFun (Bool ~> All) (t Bool ~> All) -> Type) All_Sym0)) a_6989586621680390254

sAnd :: forall (t1 :: Type -> Type) (t2 :: t1 Bool). SFoldable t1 => Sing t2 -> Sing (Apply (AndSym0 :: TyFun (t1 Bool) Bool -> Type) t2) Source #

type family Or (a :: t Bool) :: Bool where ... Source #

Equations

Or (a_6989586621680390248 :: t Bool) = Apply (Apply (Apply ((.@#@$) :: TyFun (Any ~> Bool) ((t Bool ~> Any) ~> (t Bool ~> Bool)) -> Type) GetAnySym0) (Apply (FoldMapSym0 :: TyFun (Bool ~> Any) (t Bool ~> Any) -> Type) Any_Sym0)) a_6989586621680390248

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 #

Equations

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 #

Equations

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 #

type family MaximumBy (a1 :: a ~> (a ~> Ordering)) (a2 :: t a) :: a where ... Source #

Equations

MaximumBy (cmp :: k2 ~> (k2 ~> Ordering)) (a_6989586621680390210 :: t k2) = Apply (Apply (Foldl1Sym0 :: TyFun (k2 ~> (k2 ~> k2)) (t k2 ~> k2) -> Type) (Let6989586621680390219Max'Sym2 cmp a_6989586621680390210)) a_6989586621680390210

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 #

type family MinimumBy (a1 :: a ~> (a ~> Ordering)) (a2 :: t a) :: a where ... Source #

Equations

MinimumBy (cmp :: k2 ~> (k2 ~> Ordering)) (a_6989586621680390190 :: t k2) = Apply (Apply (Foldl1Sym0 :: TyFun (k2 ~> (k2 ~> k2)) (t k2 ~> k2) -> Type) (Let6989586621680390199Min'Sym2 cmp a_6989586621680390190)) a_6989586621680390190

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 #

type family NotElem (a1 :: a) (a2 :: t a) :: Bool where ... Source #

Equations

NotElem (x :: k1) (a_6989586621680390181 :: t k1) = Apply (Apply (Apply ((.@#@$) :: TyFun (Bool ~> Bool) ((t k1 ~> Bool) ~> (t k1 ~> Bool)) -> Type) NotSym0) (Apply (ElemSym0 :: TyFun k1 (t k1 ~> Bool) -> Type) x)) a_6989586621680390181

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 #

Equations

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

Instances details

(SFoldable t, SMonoid m) => SingI (FoldSym0 :: TyFun (t m) m -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (FoldSym0 :: TyFun (t m) m -> Type) #
SuppressUnusedWarnings (FoldSym0 :: TyFun (t m) m -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (FoldSym0 :: TyFun (t m) m -> Type) (a6989586621680390383 :: t m) Source #
Instance details Defined in Data.Foldable.Singletons type Apply (FoldSym0 :: TyFun (t m) m -> Type) (a6989586621680390383 :: t m) = Fold a6989586621680390383

type family FoldSym1 (a6989586621680390383 :: t m) :: m where ... Source #

Equations

FoldSym1 (a6989586621680390383 :: t m) = Fold a6989586621680390383

data FoldMapSym0 (a1 :: TyFun (a ~> m) (t a ~> m)) Source #

Instances

Instances details

(SFoldable t, SMonoid m) => SingI (FoldMapSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (FoldMapSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) #
SuppressUnusedWarnings (FoldMapSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (FoldMapSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) (a6989586621680390387 :: a ~> m) Source #
Instance details 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

Instances details

(SFoldable t, SMonoid m) => SingI1 (FoldMapSym1 :: (a ~> m) -> TyFun (t a) m -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods liftSing :: forall (x :: a ~> m). Sing x -> Sing (FoldMapSym1 x :: TyFun (t a) m -> Type) #
(SFoldable t, SMonoid m, SingI d) => SingI (FoldMapSym1 d :: TyFun (t a) m -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (FoldMapSym1 d :: TyFun (t a) m -> Type) #
SuppressUnusedWarnings (FoldMapSym1 a6989586621680390387 :: TyFun (t a) m -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (FoldMapSym1 a6989586621680390387 :: TyFun (t a) m -> Type) (a6989586621680390388 :: t a) Source #
Instance details 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 #

Equations

FoldMapSym2 (a6989586621680390387 :: a ~> m) (a6989586621680390388 :: t a) = FoldMap a6989586621680390387 a6989586621680390388

data FoldrSym0 (a1 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b))) Source #

Instances

Instances details

SFoldable t => SingI (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) #
SuppressUnusedWarnings (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) (a6989586621680390393 :: a ~> (b ~> b)) Source #
Instance details Defined in Data.Foldable.Singletons type Apply (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) (a6989586621680390393 :: a ~> (b ~> b)) = FoldrSym1 a6989586621680390393 :: TyFun b (t a ~> b) -> Type

data FoldrSym1 (a6989586621680390393 :: a ~> (b ~> b)) (b1 :: TyFun b (t a ~> b)) Source #

Instances

Instances details

SFoldable t => SingI1 (FoldrSym1 :: (a ~> (b ~> b)) -> TyFun b (t a ~> b) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods liftSing :: forall (x :: a ~> (b ~> b)). Sing x -> Sing (FoldrSym1 x :: TyFun b (t a ~> b) -> Type) #
(SFoldable t, SingI d) => SingI (FoldrSym1 d :: TyFun b (t a ~> b) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (FoldrSym1 d :: TyFun b (t a ~> b) -> Type) #
SuppressUnusedWarnings (FoldrSym1 a6989586621680390393 :: TyFun b (t a ~> b) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (FoldrSym1 a6989586621680390393 :: TyFun b (t a ~> b) -> Type) (a6989586621680390394 :: b) Source #
Instance details Defined in Data.Foldable.Singletons type Apply (FoldrSym1 a6989586621680390393 :: TyFun b (t a ~> b) -> Type) (a6989586621680390394 :: b) = FoldrSym2 a6989586621680390393 a6989586621680390394 :: TyFun (t a) b -> Type

data FoldrSym2 (a6989586621680390393 :: a ~> (b ~> b)) (a6989586621680390394 :: b) (c :: TyFun (t a) b) Source #

Instances

Instances details

(SFoldable t, SingI d) => SingI1 (FoldrSym2 d :: b -> TyFun (t a) b -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods liftSing :: forall (x :: b). Sing x -> Sing (FoldrSym2 d x :: TyFun (t a) b -> Type) #
SFoldable t => SingI2 (FoldrSym2 :: (a ~> (b ~> b)) -> b -> TyFun (t a) b -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods liftSing2 :: forall (x :: a ~> (b ~> b)) (y :: b). Sing x -> Sing y -> Sing (FoldrSym2 x y :: TyFun (t a) b -> Type) #
(SFoldable t, SingI d1, SingI d2) => SingI (FoldrSym2 d1 d2 :: TyFun (t a) b -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (FoldrSym2 d1 d2 :: TyFun (t a) b -> Type) #
SuppressUnusedWarnings (FoldrSym2 a6989586621680390393 a6989586621680390394 :: TyFun (t a) b -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (FoldrSym2 a6989586621680390393 a6989586621680390394 :: TyFun (t a) b -> Type) (a6989586621680390395 :: t a) Source #
Instance details Defined in Data.Foldable.Singletons type Apply (FoldrSym2 a6989586621680390393 a6989586621680390394 :: TyFun (t a) b -> Type) (a6989586621680390395 :: t a) = Foldr a6989586621680390393 a6989586621680390394 a6989586621680390395

type family FoldrSym3 (a6989586621680390393 :: a ~> (b ~> b)) (a6989586621680390394 :: b) (a6989586621680390395 :: t a) :: b where ... Source #

Equations

FoldrSym3 (a6989586621680390393 :: a ~> (b ~> b)) (a6989586621680390394 :: b) (a6989586621680390395 :: t a) = Foldr a6989586621680390393 a6989586621680390394 a6989586621680390395

data Foldr'Sym0 (a1 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b))) Source #

Instances

Instances details

SFoldable t => SingI (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) #
SuppressUnusedWarnings (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) (a6989586621680390400 :: a ~> (b ~> b)) Source #
Instance details Defined in Data.Foldable.Singletons type Apply (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) (a6989586621680390400 :: a ~> (b ~> b)) = Foldr'Sym1 a6989586621680390400 :: TyFun b (t a ~> b) -> Type

data Foldr'Sym1 (a6989586621680390400 :: a ~> (b ~> b)) (b1 :: TyFun b (t a ~> b)) Source #

Instances

Instances details

SFoldable t => SingI1 (Foldr'Sym1 :: (a ~> (b ~> b)) -> TyFun b (t a ~> b) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods liftSing :: forall (x :: a ~> (b ~> b)). Sing x -> Sing (Foldr'Sym1 x :: TyFun b (t a ~> b) -> Type) #
(SFoldable t, SingI d) => SingI (Foldr'Sym1 d :: TyFun b (t a ~> b) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (Foldr'Sym1 d :: TyFun b (t a ~> b) -> Type) #
SuppressUnusedWarnings (Foldr'Sym1 a6989586621680390400 :: TyFun b (t a ~> b) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (Foldr'Sym1 a6989586621680390400 :: TyFun b (t a ~> b) -> Type) (a6989586621680390401 :: b) Source #
Instance details 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

Instances details

(SFoldable t, SingI d) => SingI1 (Foldr'Sym2 d :: b -> TyFun (t a) b -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods liftSing :: forall (x :: b). Sing x -> Sing (Foldr'Sym2 d x :: TyFun (t a) b -> Type) #
SFoldable t => SingI2 (Foldr'Sym2 :: (a ~> (b ~> b)) -> b -> TyFun (t a) b -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods liftSing2 :: forall (x :: a ~> (b ~> b)) (y :: b). Sing x -> Sing y -> Sing (Foldr'Sym2 x y :: TyFun (t a) b -> Type) #
(SFoldable t, SingI d1, SingI d2) => SingI (Foldr'Sym2 d1 d2 :: TyFun (t a) b -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (Foldr'Sym2 d1 d2 :: TyFun (t a) b -> Type) #
SuppressUnusedWarnings (Foldr'Sym2 a6989586621680390400 a6989586621680390401 :: TyFun (t a) b -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (Foldr'Sym2 a6989586621680390400 a6989586621680390401 :: TyFun (t a) b -> Type) (a6989586621680390402 :: t a) Source #
Instance details 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 #

Equations

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

Instances details

SFoldable t => SingI (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) #
SuppressUnusedWarnings (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) (a6989586621680390407 :: b ~> (a ~> b)) Source #
Instance details Defined in Data.Foldable.Singletons type Apply (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) (a6989586621680390407 :: b ~> (a ~> b)) = FoldlSym1 a6989586621680390407 :: TyFun b (t a ~> b) -> Type

data FoldlSym1 (a6989586621680390407 :: b ~> (a ~> b)) (b1 :: TyFun b (t a ~> b)) Source #

Instances

Instances details

SFoldable t => SingI1 (FoldlSym1 :: (b ~> (a ~> b)) -> TyFun b (t a ~> b) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods liftSing :: forall (x :: b ~> (a ~> b)). Sing x -> Sing (FoldlSym1 x :: TyFun b (t a ~> b) -> Type) #
(SFoldable t, SingI d) => SingI (FoldlSym1 d :: TyFun b (t a ~> b) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (FoldlSym1 d :: TyFun b (t a ~> b) -> Type) #
SuppressUnusedWarnings (FoldlSym1 a6989586621680390407 :: TyFun b (t a ~> b) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (FoldlSym1 a6989586621680390407 :: TyFun b (t a ~> b) -> Type) (a6989586621680390408 :: b) Source #
Instance details Defined in Data.Foldable.Singletons type Apply (FoldlSym1 a6989586621680390407 :: TyFun b (t a ~> b) -> Type) (a6989586621680390408 :: b) = FoldlSym2 a6989586621680390407 a6989586621680390408 :: TyFun (t a) b -> Type

data FoldlSym2 (a6989586621680390407 :: b ~> (a ~> b)) (a6989586621680390408 :: b) (c :: TyFun (t a) b) Source #

Instances

Instances details

(SFoldable t, SingI d) => SingI1 (FoldlSym2 d :: b -> TyFun (t a) b -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods liftSing :: forall (x :: b). Sing x -> Sing (FoldlSym2 d x :: TyFun (t a) b -> Type) #
SFoldable t => SingI2 (FoldlSym2 :: (b ~> (a ~> b)) -> b -> TyFun (t a) b -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods liftSing2 :: forall (x :: b ~> (a ~> b)) (y :: b). Sing x -> Sing y -> Sing (FoldlSym2 x y :: TyFun (t a) b -> Type) #
(SFoldable t, SingI d1, SingI d2) => SingI (FoldlSym2 d1 d2 :: TyFun (t a) b -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (FoldlSym2 d1 d2 :: TyFun (t a) b -> Type) #
SuppressUnusedWarnings (FoldlSym2 a6989586621680390407 a6989586621680390408 :: TyFun (t a) b -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (FoldlSym2 a6989586621680390407 a6989586621680390408 :: TyFun (t a) b -> Type) (a6989586621680390409 :: t a) Source #
Instance details Defined in Data.Foldable.Singletons type Apply (FoldlSym2 a6989586621680390407 a6989586621680390408 :: TyFun (t a) b -> Type) (a6989586621680390409 :: t a) = Foldl a6989586621680390407 a6989586621680390408 a6989586621680390409

type family FoldlSym3 (a6989586621680390407 :: b ~> (a ~> b)) (a6989586621680390408 :: b) (a6989586621680390409 :: t a) :: b where ... Source #

Equations

FoldlSym3 (a6989586621680390407 :: b ~> (a ~> b)) (a6989586621680390408 :: b) (a6989586621680390409 :: t a) = Foldl a6989586621680390407 a6989586621680390408 a6989586621680390409

data Foldl'Sym0 (a1 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b))) Source #

Instances

Instances details

SFoldable t => SingI (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) #
SuppressUnusedWarnings (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) (a6989586621680390414 :: b ~> (a ~> b)) Source #
Instance details Defined in Data.Foldable.Singletons type Apply (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) (a6989586621680390414 :: b ~> (a ~> b)) = Foldl'Sym1 a6989586621680390414 :: TyFun b (t a ~> b) -> Type

data Foldl'Sym1 (a6989586621680390414 :: b ~> (a ~> b)) (b1 :: TyFun b (t a ~> b)) Source #

Instances

Instances details

SFoldable t => SingI1 (Foldl'Sym1 :: (b ~> (a ~> b)) -> TyFun b (t a ~> b) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods liftSing :: forall (x :: b ~> (a ~> b)). Sing x -> Sing (Foldl'Sym1 x :: TyFun b (t a ~> b) -> Type) #
(SFoldable t, SingI d) => SingI (Foldl'Sym1 d :: TyFun b (t a ~> b) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (Foldl'Sym1 d :: TyFun b (t a ~> b) -> Type) #
SuppressUnusedWarnings (Foldl'Sym1 a6989586621680390414 :: TyFun b (t a ~> b) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (Foldl'Sym1 a6989586621680390414 :: TyFun b (t a ~> b) -> Type) (a6989586621680390415 :: b) Source #
Instance details 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

Instances details

(SFoldable t, SingI d) => SingI1 (Foldl'Sym2 d :: b -> TyFun (t a) b -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods liftSing :: forall (x :: b). Sing x -> Sing (Foldl'Sym2 d x :: TyFun (t a) b -> Type) #
SFoldable t => SingI2 (Foldl'Sym2 :: (b ~> (a ~> b)) -> b -> TyFun (t a) b -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods liftSing2 :: forall (x :: b ~> (a ~> b)) (y :: b). Sing x -> Sing y -> Sing (Foldl'Sym2 x y :: TyFun (t a) b -> Type) #
(SFoldable t, SingI d1, SingI d2) => SingI (Foldl'Sym2 d1 d2 :: TyFun (t a) b -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (Foldl'Sym2 d1 d2 :: TyFun (t a) b -> Type) #
SuppressUnusedWarnings (Foldl'Sym2 a6989586621680390414 a6989586621680390415 :: TyFun (t a) b -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (Foldl'Sym2 a6989586621680390414 a6989586621680390415 :: TyFun (t a) b -> Type) (a6989586621680390416 :: t a) Source #
Instance details 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 #

Equations

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

Instances details

SFoldable t => SingI (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) #
SuppressUnusedWarnings (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) (a6989586621680390420 :: a ~> (a ~> a)) Source #
Instance details Defined in Data.Foldable.Singletons type Apply (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) (a6989586621680390420 :: a ~> (a ~> a)) = Foldr1Sym1 a6989586621680390420 :: TyFun (t a) a -> Type

data Foldr1Sym1 (a6989586621680390420 :: a ~> (a ~> a)) (b :: TyFun (t a) a) Source #

Instances

Instances details

SFoldable t => SingI1 (Foldr1Sym1 :: (a ~> (a ~> a)) -> TyFun (t a) a -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods liftSing :: forall (x :: a ~> (a ~> a)). Sing x -> Sing (Foldr1Sym1 x :: TyFun (t a) a -> Type) #
(SFoldable t, SingI d) => SingI (Foldr1Sym1 d :: TyFun (t a) a -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (Foldr1Sym1 d :: TyFun (t a) a -> Type) #
SuppressUnusedWarnings (Foldr1Sym1 a6989586621680390420 :: TyFun (t a) a -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (Foldr1Sym1 a6989586621680390420 :: TyFun (t a) a -> Type) (a6989586621680390421 :: t a) Source #
Instance details 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 #

Equations

Foldr1Sym2 (a6989586621680390420 :: a ~> (a ~> a)) (a6989586621680390421 :: t a) = Foldr1 a6989586621680390420 a6989586621680390421

data Foldl1Sym0 (a1 :: TyFun (a ~> (a ~> a)) (t a ~> a)) Source #

Instances

Instances details

SFoldable t => SingI (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) #
SuppressUnusedWarnings (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) (a6989586621680390425 :: a ~> (a ~> a)) Source #
Instance details Defined in Data.Foldable.Singletons type Apply (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) (a6989586621680390425 :: a ~> (a ~> a)) = Foldl1Sym1 a6989586621680390425 :: TyFun (t a) a -> Type

data Foldl1Sym1 (a6989586621680390425 :: a ~> (a ~> a)) (b :: TyFun (t a) a) Source #

Instances

Instances details

SFoldable t => SingI1 (Foldl1Sym1 :: (a ~> (a ~> a)) -> TyFun (t a) a -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods liftSing :: forall (x :: a ~> (a ~> a)). Sing x -> Sing (Foldl1Sym1 x :: TyFun (t a) a -> Type) #
(SFoldable t, SingI d) => SingI (Foldl1Sym1 d :: TyFun (t a) a -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (Foldl1Sym1 d :: TyFun (t a) a -> Type) #
SuppressUnusedWarnings (Foldl1Sym1 a6989586621680390425 :: TyFun (t a) a -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (Foldl1Sym1 a6989586621680390425 :: TyFun (t a) a -> Type) (a6989586621680390426 :: t a) Source #
Instance details 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 #

Equations

Foldl1Sym2 (a6989586621680390425 :: a ~> (a ~> a)) (a6989586621680390426 :: t a) = Foldl1 a6989586621680390425 a6989586621680390426

data ToListSym0 (a1 :: TyFun (t a) [a]) Source #

Instances

Instances details

SFoldable t => SingI (ToListSym0 :: TyFun (t a) [a] -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (ToListSym0 :: TyFun (t a) [a] -> Type) #
SuppressUnusedWarnings (ToListSym0 :: TyFun (t a) [a] -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (ToListSym0 :: TyFun (t a) [a] -> Type) (a6989586621680390429 :: t a) Source #
Instance details 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 #

Equations

ToListSym1 (a6989586621680390429 :: t a) = ToList a6989586621680390429

data NullSym0 (a1 :: TyFun (t a) Bool) Source #

Instances

Instances details

SFoldable t => SingI (NullSym0 :: TyFun (t a) Bool -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (NullSym0 :: TyFun (t a) Bool -> Type) #
SuppressUnusedWarnings (NullSym0 :: TyFun (t a) Bool -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (NullSym0 :: TyFun (t a) Bool -> Type) (a6989586621680390432 :: t a) Source #
Instance details Defined in Data.Foldable.Singletons type Apply (NullSym0 :: TyFun (t a) Bool -> Type) (a6989586621680390432 :: t a) = Null a6989586621680390432

type family NullSym1 (a6989586621680390432 :: t a) :: Bool where ... Source #

Equations

NullSym1 (a6989586621680390432 :: t a) = Null a6989586621680390432

data LengthSym0 (a1 :: TyFun (t a) Natural) Source #

Instances

Instances details

SFoldable t => SingI (LengthSym0 :: TyFun (t a) Natural -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (LengthSym0 :: TyFun (t a) Natural -> Type) #
SuppressUnusedWarnings (LengthSym0 :: TyFun (t a) Natural -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (LengthSym0 :: TyFun (t a) Natural -> Type) (a6989586621680390435 :: t a) Source #
Instance details Defined in Data.Foldable.Singletons type Apply (LengthSym0 :: TyFun (t a) Natural -> Type) (a6989586621680390435 :: t a) = Length a6989586621680390435

type family LengthSym1 (a6989586621680390435 :: t a) :: Natural where ... Source #

Equations

LengthSym1 (a6989586621680390435 :: t a) = Length a6989586621680390435

data ElemSym0 (a1 :: TyFun a (t a ~> Bool)) Source #

Instances

Instances details

(SFoldable t, SEq a) => SingI (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) #
SuppressUnusedWarnings (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680390439 :: a) Source #
Instance details Defined in Data.Foldable.Singletons type Apply (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680390439 :: a) = ElemSym1 a6989586621680390439 :: TyFun (t a) Bool -> Type

data ElemSym1 (a6989586621680390439 :: a) (b :: TyFun (t a) Bool) Source #

Instances

Instances details

(SFoldable t, SEq a) => SingI1 (ElemSym1 :: a -> TyFun (t a) Bool -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods liftSing :: forall (x :: a). Sing x -> Sing (ElemSym1 x :: TyFun (t a) Bool -> Type) #
(SFoldable t, SEq a, SingI d) => SingI (ElemSym1 d :: TyFun (t a) Bool -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (ElemSym1 d :: TyFun (t a) Bool -> Type) #
SuppressUnusedWarnings (ElemSym1 a6989586621680390439 :: TyFun (t a) Bool -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (ElemSym1 a6989586621680390439 :: TyFun (t a) Bool -> Type) (a6989586621680390440 :: t a) Source #
Instance details Defined in Data.Foldable.Singletons type Apply (ElemSym1 a6989586621680390439 :: TyFun (t a) Bool -> Type) (a6989586621680390440 :: t a) = Elem a6989586621680390439 a6989586621680390440

type family ElemSym2 (a6989586621680390439 :: a) (a6989586621680390440 :: t a) :: Bool where ... Source #

Equations

ElemSym2 (a6989586621680390439 :: a) (a6989586621680390440 :: t a) = Elem a6989586621680390439 a6989586621680390440

data MaximumSym0 (a1 :: TyFun (t a) a) Source #

Instances

Instances details

(SFoldable t, SOrd a) => SingI (MaximumSym0 :: TyFun (t a) a -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (MaximumSym0 :: TyFun (t a) a -> Type) #
SuppressUnusedWarnings (MaximumSym0 :: TyFun (t a) a -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (MaximumSym0 :: TyFun (t a) a -> Type) (a6989586621680390443 :: t a) Source #
Instance details 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 #

Equations

MaximumSym1 (a6989586621680390443 :: t a) = Maximum a6989586621680390443

data MinimumSym0 (a1 :: TyFun (t a) a) Source #

Instances

Instances details

(SFoldable t, SOrd a) => SingI (MinimumSym0 :: TyFun (t a) a -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (MinimumSym0 :: TyFun (t a) a -> Type) #
SuppressUnusedWarnings (MinimumSym0 :: TyFun (t a) a -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (MinimumSym0 :: TyFun (t a) a -> Type) (a6989586621680390446 :: t a) Source #
Instance details 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 #

Equations

MinimumSym1 (a6989586621680390446 :: t a) = Minimum a6989586621680390446

data SumSym0 (a1 :: TyFun (t a) a) Source #

Instances

Instances details

(SFoldable t, SNum a) => SingI (SumSym0 :: TyFun (t a) a -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (SumSym0 :: TyFun (t a) a -> Type) #
SuppressUnusedWarnings (SumSym0 :: TyFun (t a) a -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (SumSym0 :: TyFun (t a) a -> Type) (a6989586621680390449 :: t a) Source #
Instance details Defined in Data.Foldable.Singletons type Apply (SumSym0 :: TyFun (t a) a -> Type) (a6989586621680390449 :: t a) = Sum a6989586621680390449

type family SumSym1 (a6989586621680390449 :: t a) :: a where ... Source #

Equations

SumSym1 (a6989586621680390449 :: t a) = Sum a6989586621680390449

data ProductSym0 (a1 :: TyFun (t a) a) Source #

Instances

Instances details

(SFoldable t, SNum a) => SingI (ProductSym0 :: TyFun (t a) a -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (ProductSym0 :: TyFun (t a) a -> Type) #
SuppressUnusedWarnings (ProductSym0 :: TyFun (t a) a -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (ProductSym0 :: TyFun (t a) a -> Type) (a6989586621680390452 :: t a) Source #
Instance details 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 #

Equations

ProductSym1 (a6989586621680390452 :: t a) = Product a6989586621680390452

data FoldrMSym0 (a1 :: TyFun (a ~> (b ~> m b)) (b ~> (t a ~> m b))) Source #

Instances

Instances details

(SFoldable t, SMonad m) => SingI (FoldrMSym0 :: TyFun (a ~> (b ~> m b)) (b ~> (t a ~> m b)) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (FoldrMSym0 :: TyFun (a ~> (b ~> m b)) (b ~> (t a ~> m b)) -> Type) #
SuppressUnusedWarnings (FoldrMSym0 :: TyFun (a ~> (b ~> m b)) (b ~> (t a ~> m b)) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (FoldrMSym0 :: TyFun (a ~> (b ~> m b)) (b ~> (t a ~> m b)) -> Type) (a6989586621680390367 :: a ~> (b ~> m b)) Source #
Instance details Defined in Data.Foldable.Singletons type Apply (FoldrMSym0 :: TyFun (a ~> (b ~> m b)) (b ~> (t a ~> m b)) -> Type) (a6989586621680390367 :: a ~> (b ~> m b)) = FoldrMSym1 a6989586621680390367 :: TyFun b (t a ~> m b) -> Type

data FoldrMSym1 (a6989586621680390367 :: a ~> (b ~> m b)) (b1 :: TyFun b (t a ~> m b)) Source #

Instances

Instances details

(SFoldable t, SMonad m) => SingI1 (FoldrMSym1 :: (a ~> (b ~> m b)) -> TyFun b (t a ~> m b) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods liftSing :: forall (x :: a ~> (b ~> m b)). Sing x -> Sing (FoldrMSym1 x :: TyFun b (t a ~> m b) -> Type) #
(SFoldable t, SMonad m, SingI d) => SingI (FoldrMSym1 d :: TyFun b (t a ~> m b) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (FoldrMSym1 d :: TyFun b (t a ~> m b) -> Type) #
SuppressUnusedWarnings (FoldrMSym1 a6989586621680390367 :: TyFun b (t a ~> m b) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (FoldrMSym1 a6989586621680390367 :: TyFun b (t a ~> m b) -> Type) (a6989586621680390368 :: b) Source #
Instance details 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

Instances details

(SFoldable t, SMonad m, SingI d) => SingI1 (FoldrMSym2 d :: b -> TyFun (t a) (m b) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods liftSing :: forall (x :: b). Sing x -> Sing (FoldrMSym2 d x :: TyFun (t a) (m b) -> Type) #
(SFoldable t, SMonad m) => SingI2 (FoldrMSym2 :: (a ~> (b ~> m b)) -> b -> TyFun (t a) (m b) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods liftSing2 :: forall (x :: a ~> (b ~> m b)) (y :: b). Sing x -> Sing y -> Sing (FoldrMSym2 x y :: TyFun (t a) (m b) -> Type) #
(SFoldable t, SMonad m, SingI d1, SingI d2) => SingI (FoldrMSym2 d1 d2 :: TyFun (t a) (m b) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (FoldrMSym2 d1 d2 :: TyFun (t a) (m b) -> Type) #
SuppressUnusedWarnings (FoldrMSym2 a6989586621680390367 a6989586621680390368 :: TyFun (t a) (m b) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (FoldrMSym2 a6989586621680390367 a6989586621680390368 :: TyFun (t a) (m b) -> Type) (a6989586621680390369 :: t a) Source #
Instance details 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 #

Equations

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

Instances details

(SFoldable t, SMonad m) => SingI (FoldlMSym0 :: TyFun (b ~> (a ~> m b)) (b ~> (t a ~> m b)) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (FoldlMSym0 :: TyFun (b ~> (a ~> m b)) (b ~> (t a ~> m b)) -> Type) #
SuppressUnusedWarnings (FoldlMSym0 :: TyFun (b ~> (a ~> m b)) (b ~> (t a ~> m b)) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (FoldlMSym0 :: TyFun (b ~> (a ~> m b)) (b ~> (t a ~> m b)) -> Type) (a6989586621680390349 :: b ~> (a ~> m b)) Source #
Instance details Defined in Data.Foldable.Singletons type Apply (FoldlMSym0 :: TyFun (b ~> (a ~> m b)) (b ~> (t a ~> m b)) -> Type) (a6989586621680390349 :: b ~> (a ~> m b)) = FoldlMSym1 a6989586621680390349 :: TyFun b (t a ~> m b) -> Type

data FoldlMSym1 (a6989586621680390349 :: b ~> (a ~> m b)) (b1 :: TyFun b (t a ~> m b)) Source #

Instances

Instances details

(SFoldable t, SMonad m) => SingI1 (FoldlMSym1 :: (b ~> (a ~> m b)) -> TyFun b (t a ~> m b) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods liftSing :: forall (x :: b ~> (a ~> m b)). Sing x -> Sing (FoldlMSym1 x :: TyFun b (t a ~> m b) -> Type) #
(SFoldable t, SMonad m, SingI d) => SingI (FoldlMSym1 d :: TyFun b (t a ~> m b) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (FoldlMSym1 d :: TyFun b (t a ~> m b) -> Type) #
SuppressUnusedWarnings (FoldlMSym1 a6989586621680390349 :: TyFun b (t a ~> m b) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (FoldlMSym1 a6989586621680390349 :: TyFun b (t a ~> m b) -> Type) (a6989586621680390350 :: b) Source #
Instance details 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

Instances details

(SFoldable t, SMonad m, SingI d) => SingI1 (FoldlMSym2 d :: b -> TyFun (t a) (m b) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods liftSing :: forall (x :: b). Sing x -> Sing (FoldlMSym2 d x :: TyFun (t a) (m b) -> Type) #
(SFoldable t, SMonad m) => SingI2 (FoldlMSym2 :: (b ~> (a ~> m b)) -> b -> TyFun (t a) (m b) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods liftSing2 :: forall (x :: b ~> (a ~> m b)) (y :: b). Sing x -> Sing y -> Sing (FoldlMSym2 x y :: TyFun (t a) (m b) -> Type) #
(SFoldable t, SMonad m, SingI d1, SingI d2) => SingI (FoldlMSym2 d1 d2 :: TyFun (t a) (m b) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (FoldlMSym2 d1 d2 :: TyFun (t a) (m b) -> Type) #
SuppressUnusedWarnings (FoldlMSym2 a6989586621680390349 a6989586621680390350 :: TyFun (t a) (m b) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (FoldlMSym2 a6989586621680390349 a6989586621680390350 :: TyFun (t a) (m b) -> Type) (a6989586621680390351 :: t a) Source #
Instance details 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 #

Equations

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

Instances details

(SFoldable t, SApplicative f) => SingI (Traverse_Sym0 :: TyFun (a ~> f b) (t a ~> f ()) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (Traverse_Sym0 :: TyFun (a ~> f b) (t a ~> f ()) -> Type) #
SuppressUnusedWarnings (Traverse_Sym0 :: TyFun (a ~> f b) (t a ~> f ()) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (Traverse_Sym0 :: TyFun (a ~> f b) (t a ~> f ()) -> Type) (a6989586621680390341 :: a ~> f b) Source #
Instance details 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

Instances details

(SFoldable t, SApplicative f) => SingI1 (Traverse_Sym1 :: (a ~> f b) -> TyFun (t a) (f ()) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods liftSing :: forall (x :: a ~> f b). Sing x -> Sing (Traverse_Sym1 x :: TyFun (t a) (f ()) -> Type) #
(SFoldable t, SApplicative f, SingI d) => SingI (Traverse_Sym1 d :: TyFun (t a) (f ()) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (Traverse_Sym1 d :: TyFun (t a) (f ()) -> Type) #
SuppressUnusedWarnings (Traverse_Sym1 a6989586621680390341 :: TyFun (t a) (f ()) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (Traverse_Sym1 a6989586621680390341 :: TyFun (t a) (f ()) -> Type) (a6989586621680390342 :: t a) Source #
Instance details 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 #

Equations

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

Instances details

(SFoldable t, SApplicative f) => SingI (For_Sym0 :: TyFun (t a) ((a ~> f b) ~> f ()) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (For_Sym0 :: TyFun (t a) ((a ~> f b) ~> f ()) -> Type) #
SuppressUnusedWarnings (For_Sym0 :: TyFun (t a) ((a ~> f b) ~> f ()) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (For_Sym0 :: TyFun (t a) ((a ~> f b) ~> f ()) -> Type) (a6989586621680390332 :: t a) Source #
Instance details Defined in Data.Foldable.Singletons type Apply (For_Sym0 :: TyFun (t a) ((a ~> f b) ~> f ()) -> Type) (a6989586621680390332 :: t a) = For_Sym1 a6989586621680390332 :: TyFun (a ~> f b) (f ()) -> Type

data For_Sym1 (a6989586621680390332 :: t a) (b1 :: TyFun (a ~> f b) (f ())) Source #

Instances

Instances details

(SFoldable t, SApplicative f) => SingI1 (For_Sym1 :: t a -> TyFun (a ~> f b) (f ()) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods liftSing :: forall (x :: t a). Sing x -> Sing (For_Sym1 x :: TyFun (a ~> f b) (f ()) -> Type) #
(SFoldable t, SApplicative f, SingI d) => SingI (For_Sym1 d :: TyFun (a ~> f b) (f ()) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (For_Sym1 d :: TyFun (a ~> f b) (f ()) -> Type) #
SuppressUnusedWarnings (For_Sym1 a6989586621680390332 :: TyFun (a ~> f b) (f ()) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (For_Sym1 a6989586621680390332 :: TyFun (a ~> f b) (f ()) -> Type) (a6989586621680390333 :: a ~> f b) Source #
Instance details Defined in Data.Foldable.Singletons type Apply (For_Sym1 a6989586621680390332 :: TyFun (a ~> f b) (f ()) -> Type) (a6989586621680390333 :: a ~> f b) = For_ a6989586621680390332 a6989586621680390333

type family For_Sym2 (a6989586621680390332 :: t a) (a6989586621680390333 :: a ~> f b) :: f () where ... Source #

Equations

For_Sym2 (a6989586621680390332 :: t a) (a6989586621680390333 :: a ~> f b) = For_ a6989586621680390332 a6989586621680390333

data SequenceA_Sym0 (a1 :: TyFun (t (f a)) (f ())) Source #

Instances

Instances details

(SFoldable t, SApplicative f) => SingI (SequenceA_Sym0 :: TyFun (t (f a)) (f ()) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (SequenceA_Sym0 :: TyFun (t (f a)) (f ()) -> Type) #
SuppressUnusedWarnings (SequenceA_Sym0 :: TyFun (t (f a)) (f ()) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (SequenceA_Sym0 :: TyFun (t (f a)) (f ()) -> Type) (a6989586621680390303 :: t (f a)) Source #
Instance details 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 #

Equations

SequenceA_Sym1 (a6989586621680390303 :: t (f a)) = SequenceA_ a6989586621680390303

data AsumSym0 (a1 :: TyFun (t (f a)) (f a)) Source #

Instances

Instances details

(SFoldable t, SAlternative f) => SingI (AsumSym0 :: TyFun (t (f a)) (f a) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (AsumSym0 :: TyFun (t (f a)) (f a) -> Type) #
SuppressUnusedWarnings (AsumSym0 :: TyFun (t (f a)) (f a) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (AsumSym0 :: TyFun (t (f a)) (f a) -> Type) (a6989586621680390291 :: t (f a)) Source #
Instance details Defined in Data.Foldable.Singletons type Apply (AsumSym0 :: TyFun (t (f a)) (f a) -> Type) (a6989586621680390291 :: t (f a)) = Asum a6989586621680390291

type family AsumSym1 (a6989586621680390291 :: t (f a)) :: f a where ... Source #

Equations

AsumSym1 (a6989586621680390291 :: t (f a)) = Asum a6989586621680390291

data MapM_Sym0 (a1 :: TyFun (a ~> m b) (t a ~> m ())) Source #

Instances

Instances details

(SFoldable t, SMonad m) => SingI (MapM_Sym0 :: TyFun (a ~> m b) (t a ~> m ()) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (MapM_Sym0 :: TyFun (a ~> m b) (t a ~> m ()) -> Type) #
SuppressUnusedWarnings (MapM_Sym0 :: TyFun (a ~> m b) (t a ~> m ()) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (MapM_Sym0 :: TyFun (a ~> m b) (t a ~> m ()) -> Type) (a6989586621680390321 :: a ~> m b) Source #
Instance details Defined in Data.Foldable.Singletons type Apply (MapM_Sym0 :: TyFun (a ~> m b) (t a ~> m ()) -> Type) (a6989586621680390321 :: a ~> m b) = MapM_Sym1 a6989586621680390321 :: TyFun (t a) (m ()) -> Type

data MapM_Sym1 (a6989586621680390321 :: a ~> m b) (b1 :: TyFun (t a) (m ())) Source #

Instances

Instances details

(SFoldable t, SMonad m) => SingI1 (MapM_Sym1 :: (a ~> m b) -> TyFun (t a) (m ()) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods liftSing :: forall (x :: a ~> m b). Sing x -> Sing (MapM_Sym1 x :: TyFun (t a) (m ()) -> Type) #
(SFoldable t, SMonad m, SingI d) => SingI (MapM_Sym1 d :: TyFun (t a) (m ()) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (MapM_Sym1 d :: TyFun (t a) (m ()) -> Type) #
SuppressUnusedWarnings (MapM_Sym1 a6989586621680390321 :: TyFun (t a) (m ()) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (MapM_Sym1 a6989586621680390321 :: TyFun (t a) (m ()) -> Type) (a6989586621680390322 :: t a) Source #
Instance details Defined in Data.Foldable.Singletons type Apply (MapM_Sym1 a6989586621680390321 :: TyFun (t a) (m ()) -> Type) (a6989586621680390322 :: t a) = MapM_ a6989586621680390321 a6989586621680390322

type family MapM_Sym2 (a6989586621680390321 :: a ~> m b) (a6989586621680390322 :: t a) :: m () where ... Source #

Equations

MapM_Sym2 (a6989586621680390321 :: a ~> m b) (a6989586621680390322 :: t a) = MapM_ a6989586621680390321 a6989586621680390322

data ForM_Sym0 (a1 :: TyFun (t a) ((a ~> m b) ~> m ())) Source #

Instances

Instances details

(SFoldable t, SMonad m) => SingI (ForM_Sym0 :: TyFun (t a) ((a ~> m b) ~> m ()) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (ForM_Sym0 :: TyFun (t a) ((a ~> m b) ~> m ()) -> Type) #
SuppressUnusedWarnings (ForM_Sym0 :: TyFun (t a) ((a ~> m b) ~> m ()) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (ForM_Sym0 :: TyFun (t a) ((a ~> m b) ~> m ()) -> Type) (a6989586621680390312 :: t a) Source #
Instance details Defined in Data.Foldable.Singletons type Apply (ForM_Sym0 :: TyFun (t a) ((a ~> m b) ~> m ()) -> Type) (a6989586621680390312 :: t a) = ForM_Sym1 a6989586621680390312 :: TyFun (a ~> m b) (m ()) -> Type

data ForM_Sym1 (a6989586621680390312 :: t a) (b1 :: TyFun (a ~> m b) (m ())) Source #

Instances

Instances details

(SFoldable t, SMonad m) => SingI1 (ForM_Sym1 :: t a -> TyFun (a ~> m b) (m ()) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods liftSing :: forall (x :: t a). Sing x -> Sing (ForM_Sym1 x :: TyFun (a ~> m b) (m ()) -> Type) #
(SFoldable t, SMonad m, SingI d) => SingI (ForM_Sym1 d :: TyFun (a ~> m b) (m ()) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (ForM_Sym1 d :: TyFun (a ~> m b) (m ()) -> Type) #
SuppressUnusedWarnings (ForM_Sym1 a6989586621680390312 :: TyFun (a ~> m b) (m ()) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (ForM_Sym1 a6989586621680390312 :: TyFun (a ~> m b) (m ()) -> Type) (a6989586621680390313 :: a ~> m b) Source #
Instance details Defined in Data.Foldable.Singletons type Apply (ForM_Sym1 a6989586621680390312 :: TyFun (a ~> m b) (m ()) -> Type) (a6989586621680390313 :: a ~> m b) = ForM_ a6989586621680390312 a6989586621680390313

type family ForM_Sym2 (a6989586621680390312 :: t a) (a6989586621680390313 :: a ~> m b) :: m () where ... Source #

Equations

ForM_Sym2 (a6989586621680390312 :: t a) (a6989586621680390313 :: a ~> m b) = ForM_ a6989586621680390312 a6989586621680390313

data Sequence_Sym0 (a1 :: TyFun (t (m a)) (m ())) Source #

Instances

Instances details

(SFoldable t, SMonad m) => SingI (Sequence_Sym0 :: TyFun (t (m a)) (m ()) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (Sequence_Sym0 :: TyFun (t (m a)) (m ()) -> Type) #
SuppressUnusedWarnings (Sequence_Sym0 :: TyFun (t (m a)) (m ()) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (Sequence_Sym0 :: TyFun (t (m a)) (m ()) -> Type) (a6989586621680390297 :: t (m a)) Source #
Instance details 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 #

Equations

Sequence_Sym1 (a6989586621680390297 :: t (m a)) = Sequence_ a6989586621680390297

data MsumSym0 (a1 :: TyFun (t (m a)) (m a)) Source #

Instances

Instances details

(SFoldable t, SMonadPlus m) => SingI (MsumSym0 :: TyFun (t (m a)) (m a) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (MsumSym0 :: TyFun (t (m a)) (m a) -> Type) #
SuppressUnusedWarnings (MsumSym0 :: TyFun (t (m a)) (m a) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (MsumSym0 :: TyFun (t (m a)) (m a) -> Type) (a6989586621680390285 :: t (m a)) Source #
Instance details Defined in Data.Foldable.Singletons type Apply (MsumSym0 :: TyFun (t (m a)) (m a) -> Type) (a6989586621680390285 :: t (m a)) = Msum a6989586621680390285

type family MsumSym1 (a6989586621680390285 :: t (m a)) :: m a where ... Source #

Equations

MsumSym1 (a6989586621680390285 :: t (m a)) = Msum a6989586621680390285

data ConcatSym0 (a1 :: TyFun (t [a]) [a]) Source #

Instances

Instances details

SFoldable t => SingI (ConcatSym0 :: TyFun (t [a]) [a] -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (ConcatSym0 :: TyFun (t [a]) [a] -> Type) #
SuppressUnusedWarnings (ConcatSym0 :: TyFun (t [a]) [a] -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (ConcatSym0 :: TyFun (t [a]) [a] -> Type) (a6989586621680390274 :: t [a]) Source #
Instance details 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 #

Equations

ConcatSym1 (a6989586621680390274 :: t [a]) = Concat a6989586621680390274

data ConcatMapSym0 (a1 :: TyFun (a ~> [b]) (t a ~> [b])) Source #

Instances

Instances details

SFoldable t => SingI (ConcatMapSym0 :: TyFun (a ~> [b]) (t a ~> [b]) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (ConcatMapSym0 :: TyFun (a ~> [b]) (t a ~> [b]) -> Type) #
SuppressUnusedWarnings (ConcatMapSym0 :: TyFun (a ~> [b]) (t a ~> [b]) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (ConcatMapSym0 :: TyFun (a ~> [b]) (t a ~> [b]) -> Type) (a6989586621680390263 :: a ~> [b]) Source #
Instance details 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

Instances details

SFoldable t => SingI1 (ConcatMapSym1 :: (a ~> [b]) -> TyFun (t a) [b] -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods liftSing :: forall (x :: a ~> [b]). Sing x -> Sing (ConcatMapSym1 x :: TyFun (t a) [b] -> Type) #
(SFoldable t, SingI d) => SingI (ConcatMapSym1 d :: TyFun (t a) [b] -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (ConcatMapSym1 d :: TyFun (t a) [b] -> Type) #
SuppressUnusedWarnings (ConcatMapSym1 a6989586621680390263 :: TyFun (t a) [b] -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (ConcatMapSym1 a6989586621680390263 :: TyFun (t a) [b] -> Type) (a6989586621680390264 :: t a) Source #
Instance details 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 #

Equations

ConcatMapSym2 (a6989586621680390263 :: a ~> [b]) (a6989586621680390264 :: t a) = ConcatMap a6989586621680390263 a6989586621680390264

data AndSym0 (a :: TyFun (t Bool) Bool) Source #

Instances

Instances details

SFoldable t => SingI (AndSym0 :: TyFun (t Bool) Bool -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (AndSym0 :: TyFun (t Bool) Bool -> Type) #
SuppressUnusedWarnings (AndSym0 :: TyFun (t Bool) Bool -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (AndSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680390258 :: t Bool) Source #
Instance details Defined in Data.Foldable.Singletons type Apply (AndSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680390258 :: t Bool) = And a6989586621680390258

type family AndSym1 (a6989586621680390258 :: t Bool) :: Bool where ... Source #

Equations

AndSym1 (a6989586621680390258 :: t Bool) = And a6989586621680390258

data OrSym0 (a :: TyFun (t Bool) Bool) Source #

Instances

Instances details

SFoldable t => SingI (OrSym0 :: TyFun (t Bool) Bool -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (OrSym0 :: TyFun (t Bool) Bool -> Type) #
SuppressUnusedWarnings (OrSym0 :: TyFun (t Bool) Bool -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (OrSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680390252 :: t Bool) Source #
Instance details Defined in Data.Foldable.Singletons type Apply (OrSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680390252 :: t Bool) = Or a6989586621680390252

type family OrSym1 (a6989586621680390252 :: t Bool) :: Bool where ... Source #

Equations

OrSym1 (a6989586621680390252 :: t Bool) = Or a6989586621680390252

data AnySym0 (a1 :: TyFun (a ~> Bool) (t a ~> Bool)) Source #

Instances

Instances details

SFoldable t => SingI (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) #
SuppressUnusedWarnings (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) (a6989586621680390244 :: a ~> Bool) Source #
Instance details Defined in Data.Foldable.Singletons type Apply (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) (a6989586621680390244 :: a ~> Bool) = AnySym1 a6989586621680390244 :: TyFun (t a) Bool -> Type

data AnySym1 (a6989586621680390244 :: a ~> Bool) (b :: TyFun (t a) Bool) Source #

Instances

Instances details

SFoldable t => SingI1 (AnySym1 :: (a ~> Bool) -> TyFun (t a) Bool -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods liftSing :: forall (x :: a ~> Bool). Sing x -> Sing (AnySym1 x :: TyFun (t a) Bool -> Type) #
(SFoldable t, SingI d) => SingI (AnySym1 d :: TyFun (t a) Bool -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (AnySym1 d :: TyFun (t a) Bool -> Type) #
SuppressUnusedWarnings (AnySym1 a6989586621680390244 :: TyFun (t a) Bool -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (AnySym1 a6989586621680390244 :: TyFun (t a) Bool -> Type) (a6989586621680390245 :: t a) Source #
Instance details Defined in Data.Foldable.Singletons type Apply (AnySym1 a6989586621680390244 :: TyFun (t a) Bool -> Type) (a6989586621680390245 :: t a) = Any a6989586621680390244 a6989586621680390245

type family AnySym2 (a6989586621680390244 :: a ~> Bool) (a6989586621680390245 :: t a) :: Bool where ... Source #

Equations

AnySym2 (a6989586621680390244 :: a ~> Bool) (a6989586621680390245 :: t a) = Any a6989586621680390244 a6989586621680390245

data AllSym0 (a1 :: TyFun (a ~> Bool) (t a ~> Bool)) Source #

Instances

Instances details

SFoldable t => SingI (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) #
SuppressUnusedWarnings (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) (a6989586621680390235 :: a ~> Bool) Source #
Instance details Defined in Data.Foldable.Singletons type Apply (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) (a6989586621680390235 :: a ~> Bool) = AllSym1 a6989586621680390235 :: TyFun (t a) Bool -> Type

data AllSym1 (a6989586621680390235 :: a ~> Bool) (b :: TyFun (t a) Bool) Source #

Instances

Instances details

SFoldable t => SingI1 (AllSym1 :: (a ~> Bool) -> TyFun (t a) Bool -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods liftSing :: forall (x :: a ~> Bool). Sing x -> Sing (AllSym1 x :: TyFun (t a) Bool -> Type) #
(SFoldable t, SingI d) => SingI (AllSym1 d :: TyFun (t a) Bool -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (AllSym1 d :: TyFun (t a) Bool -> Type) #
SuppressUnusedWarnings (AllSym1 a6989586621680390235 :: TyFun (t a) Bool -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (AllSym1 a6989586621680390235 :: TyFun (t a) Bool -> Type) (a6989586621680390236 :: t a) Source #
Instance details Defined in Data.Foldable.Singletons type Apply (AllSym1 a6989586621680390235 :: TyFun (t a) Bool -> Type) (a6989586621680390236 :: t a) = All a6989586621680390235 a6989586621680390236

type family AllSym2 (a6989586621680390235 :: a ~> Bool) (a6989586621680390236 :: t a) :: Bool where ... Source #

Equations

AllSym2 (a6989586621680390235 :: a ~> Bool) (a6989586621680390236 :: t a) = All a6989586621680390235 a6989586621680390236

data MaximumBySym0 (a1 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a)) Source #

Instances

Instances details

SFoldable t => SingI (MaximumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (MaximumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) #
SuppressUnusedWarnings (MaximumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (MaximumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) (a6989586621680390215 :: a ~> (a ~> Ordering)) Source #
Instance details Defined in Data.Foldable.Singletons type Apply (MaximumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) (a6989586621680390215 :: a ~> (a ~> Ordering)) = MaximumBySym1 a6989586621680390215 :: TyFun (t a) a -> Type

data MaximumBySym1 (a6989586621680390215 :: a ~> (a ~> Ordering)) (b :: TyFun (t a) a) Source #

Instances

Instances details

SFoldable t => SingI1 (MaximumBySym1 :: (a ~> (a ~> Ordering)) -> TyFun (t a) a -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods liftSing :: forall (x :: a ~> (a ~> Ordering)). Sing x -> Sing (MaximumBySym1 x :: TyFun (t a) a -> Type) #
(SFoldable t, SingI d) => SingI (MaximumBySym1 d :: TyFun (t a) a -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (MaximumBySym1 d :: TyFun (t a) a -> Type) #
SuppressUnusedWarnings (MaximumBySym1 a6989586621680390215 :: TyFun (t a) a -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (MaximumBySym1 a6989586621680390215 :: TyFun (t a) a -> Type) (a6989586621680390216 :: t a) Source #
Instance details 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 #

Equations

MaximumBySym2 (a6989586621680390215 :: a ~> (a ~> Ordering)) (a6989586621680390216 :: t a) = MaximumBy a6989586621680390215 a6989586621680390216

data MinimumBySym0 (a1 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a)) Source #

Instances

Instances details

SFoldable t => SingI (MinimumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (MinimumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) #
SuppressUnusedWarnings (MinimumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (MinimumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) (a6989586621680390195 :: a ~> (a ~> Ordering)) Source #
Instance details Defined in Data.Foldable.Singletons type Apply (MinimumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) (a6989586621680390195 :: a ~> (a ~> Ordering)) = MinimumBySym1 a6989586621680390195 :: TyFun (t a) a -> Type

data MinimumBySym1 (a6989586621680390195 :: a ~> (a ~> Ordering)) (b :: TyFun (t a) a) Source #

Instances

Instances details

SFoldable t => SingI1 (MinimumBySym1 :: (a ~> (a ~> Ordering)) -> TyFun (t a) a -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods liftSing :: forall (x :: a ~> (a ~> Ordering)). Sing x -> Sing (MinimumBySym1 x :: TyFun (t a) a -> Type) #
(SFoldable t, SingI d) => SingI (MinimumBySym1 d :: TyFun (t a) a -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (MinimumBySym1 d :: TyFun (t a) a -> Type) #
SuppressUnusedWarnings (MinimumBySym1 a6989586621680390195 :: TyFun (t a) a -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (MinimumBySym1 a6989586621680390195 :: TyFun (t a) a -> Type) (a6989586621680390196 :: t a) Source #
Instance details 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 #

Equations

MinimumBySym2 (a6989586621680390195 :: a ~> (a ~> Ordering)) (a6989586621680390196 :: t a) = MinimumBy a6989586621680390195 a6989586621680390196

data NotElemSym0 (a1 :: TyFun a (t a ~> Bool)) Source #

Instances

Instances details

(SFoldable t, SEq a) => SingI (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) #
SuppressUnusedWarnings (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680390186 :: a) Source #
Instance details 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

Instances details

(SFoldable t, SEq a) => SingI1 (NotElemSym1 :: a -> TyFun (t a) Bool -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods liftSing :: forall (x :: a). Sing x -> Sing (NotElemSym1 x :: TyFun (t a) Bool -> Type) #
(SFoldable t, SEq a, SingI d) => SingI (NotElemSym1 d :: TyFun (t a) Bool -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (NotElemSym1 d :: TyFun (t a) Bool -> Type) #
SuppressUnusedWarnings (NotElemSym1 a6989586621680390186 :: TyFun (t a) Bool -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (NotElemSym1 a6989586621680390186 :: TyFun (t a) Bool -> Type) (a6989586621680390187 :: t a) Source #
Instance details Defined in Data.Foldable.Singletons type Apply (NotElemSym1 a6989586621680390186 :: TyFun (t a) Bool -> Type) (a6989586621680390187 :: t a) = NotElem a6989586621680390186 a6989586621680390187

type family NotElemSym2 (a6989586621680390186 :: a) (a6989586621680390187 :: t a) :: Bool where ... Source #

Equations

NotElemSym2 (a6989586621680390186 :: a) (a6989586621680390187 :: t a) = NotElem a6989586621680390186 a6989586621680390187

data FindSym0 (a1 :: TyFun (a ~> Bool) (t a ~> Maybe a)) Source #

Instances

Instances details

SFoldable t => SingI (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) #
SuppressUnusedWarnings (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) (a6989586621680390168 :: a ~> Bool) Source #
Instance details Defined in Data.Foldable.Singletons type Apply (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) (a6989586621680390168 :: a ~> Bool) = FindSym1 a6989586621680390168 :: TyFun (t a) (Maybe a) -> Type

data FindSym1 (a6989586621680390168 :: a ~> Bool) (b :: TyFun (t a) (Maybe a)) Source #

Instances

Instances details

SFoldable t => SingI1 (FindSym1 :: (a ~> Bool) -> TyFun (t a) (Maybe a) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods liftSing :: forall (x :: a ~> Bool). Sing x -> Sing (FindSym1 x :: TyFun (t a) (Maybe a) -> Type) #
(SFoldable t, SingI d) => SingI (FindSym1 d :: TyFun (t a) (Maybe a) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods sing :: Sing (FindSym1 d :: TyFun (t a) (Maybe a) -> Type) #
SuppressUnusedWarnings (FindSym1 a6989586621680390168 :: TyFun (t a) (Maybe a) -> Type) Source #
Instance details Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (FindSym1 a6989586621680390168 :: TyFun (t a) (Maybe a) -> Type) (a6989586621680390169 :: t a) Source #
Instance details Defined in Data.Foldable.Singletons type Apply (FindSym1 a6989586621680390168 :: TyFun (t a) (Maybe a) -> Type) (a6989586621680390169 :: t a) = Find a6989586621680390168 a6989586621680390169

type family FindSym2 (a6989586621680390168 :: a ~> Bool) (a6989586621680390169 :: t a) :: Maybe a where ... Source #

Equations

FindSym2 (a6989586621680390168 :: a ~> Bool) (a6989586621680390169 :: t a) = Find a6989586621680390168 a6989586621680390169