| Copyright | (C) 2018 Ryan Scott |
|---|---|
| License | BSD-style (see LICENSE) |
| Maintainer | Ryan Scott |
| Stability | experimental |
| Portability | non-portable |
| Safe Haskell | Safe-Inferred |
| Language | GHC2021 |
Data.Foldable.Singletons
Contents
Description
Defines the promoted and singled versions of the Foldable type class.
Synopsis
- class PFoldable t where
- type Fold (arg :: t m) :: m
- type FoldMap (arg :: (~>) a m) (arg :: t a) :: m
- type Foldr (arg :: (~>) a ((~>) b b)) (arg :: b) (arg :: t a) :: b
- type Foldr' (arg :: (~>) a ((~>) b b)) (arg :: b) (arg :: t a) :: b
- type Foldl (arg :: (~>) b ((~>) a b)) (arg :: b) (arg :: t a) :: b
- type Foldl' (arg :: (~>) b ((~>) a b)) (arg :: b) (arg :: t a) :: b
- type Foldr1 (arg :: (~>) a ((~>) a a)) (arg :: t a) :: a
- type Foldl1 (arg :: (~>) a ((~>) a a)) (arg :: 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) (arg :: 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 where
- sFold :: forall (t :: t m). SMonoid m => Sing t -> Sing (Apply FoldSym0 t :: m) :: Type
- sFoldMap :: forall (t :: (~>) a m) (t :: t a). SMonoid m => Sing t -> Sing t -> Sing (Apply (Apply FoldMapSym0 t) t :: m) :: Type
- sFoldr :: forall (t :: (~>) a ((~>) b b)) (t :: b) (t :: t a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldrSym0 t) t) t :: b) :: Type
- sFoldr' :: forall (t :: (~>) a ((~>) b b)) (t :: b) (t :: t a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldr'Sym0 t) t) t :: b) :: Type
- sFoldl :: forall (t :: (~>) b ((~>) a b)) (t :: b) (t :: t a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldlSym0 t) t) t :: b) :: Type
- sFoldl' :: forall (t :: (~>) b ((~>) a b)) (t :: b) (t :: t a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldl'Sym0 t) t) t :: b) :: Type
- sFoldr1 :: forall (t :: (~>) a ((~>) a a)) (t :: t a). Sing t -> Sing t -> Sing (Apply (Apply Foldr1Sym0 t) t :: a) :: Type
- sFoldl1 :: forall (t :: (~>) a ((~>) a a)) (t :: t a). Sing t -> Sing t -> Sing (Apply (Apply Foldl1Sym0 t) t :: a) :: Type
- sToList :: forall (t :: t a). Sing t -> Sing (Apply ToListSym0 t :: [a]) :: Type
- sNull :: forall (t :: t a). Sing t -> Sing (Apply NullSym0 t :: Bool) :: Type
- sLength :: forall (t :: t a). Sing t -> Sing (Apply LengthSym0 t :: Natural) :: Type
- sElem :: forall (t :: a) (t :: t a). SEq a => Sing t -> Sing t -> Sing (Apply (Apply ElemSym0 t) t :: Bool) :: Type
- sMaximum :: forall a (t :: t a). SOrd a => Sing t -> Sing (Apply MaximumSym0 t :: a)
- sMinimum :: forall a (t :: t a). SOrd a => Sing t -> Sing (Apply MinimumSym0 t :: a)
- sSum :: forall (t :: t a). SNum a => Sing t -> Sing (Apply SumSym0 t :: a) :: Type
- sProduct :: forall (t :: t a). SNum a => Sing t -> Sing (Apply ProductSym0 t :: a) :: Type
- type family FoldrM (a :: (~>) a ((~>) b (m b))) (a :: b) (a :: t a) :: m b where ...
- sFoldrM :: forall (t :: (~>) a ((~>) b (m b))) (t :: b) (t :: t a). (SFoldable t, SMonad m) => Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldrMSym0 t) t) t :: m b) :: Type
- type family FoldlM (a :: (~>) b ((~>) a (m b))) (a :: b) (a :: t a) :: m b where ...
- sFoldlM :: forall (t :: (~>) b ((~>) a (m b))) (t :: b) (t :: t a). (SFoldable t, SMonad m) => Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldlMSym0 t) t) t :: m b) :: Type
- type family Traverse_ (a :: (~>) a (f b)) (a :: t a) :: f () where ...
- sTraverse_ :: forall (t :: (~>) a (f b)) (t :: t a). (SFoldable t, SApplicative f) => Sing t -> Sing t -> Sing (Apply (Apply Traverse_Sym0 t) t :: f ()) :: Type
- type family For_ (a :: t a) (a :: (~>) a (f b)) :: f () where ...
- sFor_ :: forall (t :: t a) (t :: (~>) a (f b)). (SFoldable t, SApplicative f) => Sing t -> Sing t -> Sing (Apply (Apply For_Sym0 t) t :: f ()) :: Type
- type family SequenceA_ (a :: t (f a)) :: f () where ...
- sSequenceA_ :: forall (t :: t (f a)). (SFoldable t, SApplicative f) => Sing t -> Sing (Apply SequenceA_Sym0 t :: f ()) :: Type
- type family Asum (a :: t (f a)) :: f a where ...
- sAsum :: forall (t :: t (f a)). (SFoldable t, SAlternative f) => Sing t -> Sing (Apply AsumSym0 t :: f a) :: Type
- type family MapM_ (a :: (~>) a (m b)) (a :: t a) :: m () where ...
- sMapM_ :: forall (t :: (~>) a (m b)) (t :: t a). (SFoldable t, SMonad m) => Sing t -> Sing t -> Sing (Apply (Apply MapM_Sym0 t) t :: m ()) :: Type
- type family ForM_ (a :: t a) (a :: (~>) a (m b)) :: m () where ...
- sForM_ :: forall (t :: t a) (t :: (~>) a (m b)). (SFoldable t, SMonad m) => Sing t -> Sing t -> Sing (Apply (Apply ForM_Sym0 t) t :: m ()) :: Type
- type family Sequence_ (a :: t (m a)) :: m () where ...
- sSequence_ :: forall (t :: t (m a)). (SFoldable t, SMonad m) => Sing t -> Sing (Apply Sequence_Sym0 t :: m ()) :: Type
- type family Msum (a :: t (m a)) :: m a where ...
- sMsum :: forall (t :: t (m a)). (SFoldable t, SMonadPlus m) => Sing t -> Sing (Apply MsumSym0 t :: m a) :: Type
- type family Concat (a :: t [a]) :: [a] where ...
- sConcat :: forall (t :: t [a]). SFoldable t => Sing t -> Sing (Apply ConcatSym0 t :: [a]) :: Type
- type family ConcatMap (a :: (~>) a [b]) (a :: t a) :: [b] where ...
- sConcatMap :: forall (t :: (~>) a [b]) (t :: t a). SFoldable t => Sing t -> Sing t -> Sing (Apply (Apply ConcatMapSym0 t) t :: [b]) :: Type
- type family And (a :: t Bool) :: Bool where ...
- sAnd :: forall (t :: t Bool). SFoldable t => Sing t -> Sing (Apply AndSym0 t :: Bool) :: Type
- type family Or (a :: t Bool) :: Bool where ...
- sOr :: forall (t :: t Bool). SFoldable t => Sing t -> Sing (Apply OrSym0 t :: Bool) :: Type
- type family Any (a :: (~>) a Bool) (a :: t a) :: Bool where ...
- sAny :: forall (t :: (~>) a Bool) (t :: t a). SFoldable t => Sing t -> Sing t -> Sing (Apply (Apply AnySym0 t) t :: Bool) :: Type
- type family All (a :: (~>) a Bool) (a :: t a) :: Bool where ...
- sAll :: forall (t :: (~>) a Bool) (t :: t a). SFoldable t => Sing t -> Sing t -> Sing (Apply (Apply AllSym0 t) t :: Bool) :: Type
- type family MaximumBy (a :: (~>) a ((~>) a Ordering)) (a :: t a) :: a where ...
- sMaximumBy :: forall (t :: (~>) a ((~>) a Ordering)) (t :: t a). SFoldable t => Sing t -> Sing t -> Sing (Apply (Apply MaximumBySym0 t) t :: a) :: Type
- type family MinimumBy (a :: (~>) a ((~>) a Ordering)) (a :: t a) :: a where ...
- sMinimumBy :: forall (t :: (~>) a ((~>) a Ordering)) (t :: t a). SFoldable t => Sing t -> Sing t -> Sing (Apply (Apply MinimumBySym0 t) t :: a) :: Type
- type family NotElem (a :: a) (a :: t a) :: Bool where ...
- sNotElem :: forall (t :: a) (t :: t a). (SFoldable t, SEq a) => Sing t -> Sing t -> Sing (Apply (Apply NotElemSym0 t) t :: Bool) :: Type
- type family Find (a :: (~>) a Bool) (a :: t a) :: Maybe a where ...
- sFind :: forall (t :: (~>) a Bool) (t :: t a). SFoldable t => Sing t -> Sing t -> Sing (Apply (Apply FindSym0 t) t :: Maybe a) :: Type
- data FoldSym0 :: (~>) (t m) m
- type family FoldSym1 (a6989586621680416572 :: t m) :: m where ...
- data FoldMapSym0 :: (~>) ((~>) a m) ((~>) (t a) m)
- data FoldMapSym1 (a6989586621680416576 :: (~>) a m) :: (~>) (t a) m
- type family FoldMapSym2 (a6989586621680416576 :: (~>) a m) (a6989586621680416577 :: t a) :: m where ...
- data FoldrSym0 :: (~>) ((~>) a ((~>) b b)) ((~>) b ((~>) (t a) b))
- data FoldrSym1 (a6989586621680416582 :: (~>) a ((~>) b b)) :: (~>) b ((~>) (t a) b)
- data FoldrSym2 (a6989586621680416582 :: (~>) a ((~>) b b)) (a6989586621680416583 :: b) :: (~>) (t a) b
- type family FoldrSym3 (a6989586621680416582 :: (~>) a ((~>) b b)) (a6989586621680416583 :: b) (a6989586621680416584 :: t a) :: b where ...
- data Foldr'Sym0 :: (~>) ((~>) a ((~>) b b)) ((~>) b ((~>) (t a) b))
- data Foldr'Sym1 (a6989586621680416589 :: (~>) a ((~>) b b)) :: (~>) b ((~>) (t a) b)
- data Foldr'Sym2 (a6989586621680416589 :: (~>) a ((~>) b b)) (a6989586621680416590 :: b) :: (~>) (t a) b
- type family Foldr'Sym3 (a6989586621680416589 :: (~>) a ((~>) b b)) (a6989586621680416590 :: b) (a6989586621680416591 :: t a) :: b where ...
- data FoldlSym0 :: (~>) ((~>) b ((~>) a b)) ((~>) b ((~>) (t a) b))
- data FoldlSym1 (a6989586621680416596 :: (~>) b ((~>) a b)) :: (~>) b ((~>) (t a) b)
- data FoldlSym2 (a6989586621680416596 :: (~>) b ((~>) a b)) (a6989586621680416597 :: b) :: (~>) (t a) b
- type family FoldlSym3 (a6989586621680416596 :: (~>) b ((~>) a b)) (a6989586621680416597 :: b) (a6989586621680416598 :: t a) :: b where ...
- data Foldl'Sym0 :: (~>) ((~>) b ((~>) a b)) ((~>) b ((~>) (t a) b))
- data Foldl'Sym1 (a6989586621680416603 :: (~>) b ((~>) a b)) :: (~>) b ((~>) (t a) b)
- data Foldl'Sym2 (a6989586621680416603 :: (~>) b ((~>) a b)) (a6989586621680416604 :: b) :: (~>) (t a) b
- type family Foldl'Sym3 (a6989586621680416603 :: (~>) b ((~>) a b)) (a6989586621680416604 :: b) (a6989586621680416605 :: t a) :: b where ...
- data Foldr1Sym0 :: (~>) ((~>) a ((~>) a a)) ((~>) (t a) a)
- data Foldr1Sym1 (a6989586621680416609 :: (~>) a ((~>) a a)) :: (~>) (t a) a
- type family Foldr1Sym2 (a6989586621680416609 :: (~>) a ((~>) a a)) (a6989586621680416610 :: t a) :: a where ...
- data Foldl1Sym0 :: (~>) ((~>) a ((~>) a a)) ((~>) (t a) a)
- data Foldl1Sym1 (a6989586621680416614 :: (~>) a ((~>) a a)) :: (~>) (t a) a
- type family Foldl1Sym2 (a6989586621680416614 :: (~>) a ((~>) a a)) (a6989586621680416615 :: t a) :: a where ...
- data ToListSym0 :: (~>) (t a) [a]
- type family ToListSym1 (a6989586621680416618 :: t a) :: [a] where ...
- data NullSym0 :: (~>) (t a) Bool
- type family NullSym1 (a6989586621680416621 :: t a) :: Bool where ...
- data LengthSym0 :: (~>) (t a) Natural
- type family LengthSym1 (a6989586621680416624 :: t a) :: Natural where ...
- data ElemSym0 :: (~>) a ((~>) (t a) Bool)
- data ElemSym1 (a6989586621680416628 :: a) :: (~>) (t a) Bool
- type family ElemSym2 (a6989586621680416628 :: a) (a6989586621680416629 :: t a) :: Bool where ...
- data MaximumSym0 :: (~>) (t a) a
- type family MaximumSym1 (a6989586621680416632 :: t a) :: a where ...
- data MinimumSym0 :: (~>) (t a) a
- type family MinimumSym1 (a6989586621680416635 :: t a) :: a where ...
- data SumSym0 :: (~>) (t a) a
- type family SumSym1 (a6989586621680416638 :: t a) :: a where ...
- data ProductSym0 :: (~>) (t a) a
- type family ProductSym1 (a6989586621680416641 :: t a) :: a where ...
- data FoldrMSym0 :: (~>) ((~>) a ((~>) b (m b))) ((~>) b ((~>) (t a) (m b)))
- data FoldrMSym1 (a6989586621680416556 :: (~>) a ((~>) b (m b))) :: (~>) b ((~>) (t a) (m b))
- data FoldrMSym2 (a6989586621680416556 :: (~>) a ((~>) b (m b))) (a6989586621680416557 :: b) :: (~>) (t a) (m b)
- type family FoldrMSym3 (a6989586621680416556 :: (~>) a ((~>) b (m b))) (a6989586621680416557 :: b) (a6989586621680416558 :: t a) :: m b where ...
- data FoldlMSym0 :: (~>) ((~>) b ((~>) a (m b))) ((~>) b ((~>) (t a) (m b)))
- data FoldlMSym1 (a6989586621680416538 :: (~>) b ((~>) a (m b))) :: (~>) b ((~>) (t a) (m b))
- data FoldlMSym2 (a6989586621680416538 :: (~>) b ((~>) a (m b))) (a6989586621680416539 :: b) :: (~>) (t a) (m b)
- type family FoldlMSym3 (a6989586621680416538 :: (~>) b ((~>) a (m b))) (a6989586621680416539 :: b) (a6989586621680416540 :: t a) :: m b where ...
- data Traverse_Sym0 :: (~>) ((~>) a (f b)) ((~>) (t a) (f ()))
- data Traverse_Sym1 (a6989586621680416530 :: (~>) a (f b)) :: (~>) (t a) (f ())
- type family Traverse_Sym2 (a6989586621680416530 :: (~>) a (f b)) (a6989586621680416531 :: t a) :: f () where ...
- data For_Sym0 :: (~>) (t a) ((~>) ((~>) a (f b)) (f ()))
- data For_Sym1 (a6989586621680416521 :: t a) :: (~>) ((~>) a (f b)) (f ())
- type family For_Sym2 (a6989586621680416521 :: t a) (a6989586621680416522 :: (~>) a (f b)) :: f () where ...
- data SequenceA_Sym0 :: (~>) (t (f a)) (f ())
- type family SequenceA_Sym1 (a6989586621680416492 :: t (f a)) :: f () where ...
- data AsumSym0 :: (~>) (t (f a)) (f a)
- type family AsumSym1 (a6989586621680416480 :: t (f a)) :: f a where ...
- data MapM_Sym0 :: (~>) ((~>) a (m b)) ((~>) (t a) (m ()))
- data MapM_Sym1 (a6989586621680416510 :: (~>) a (m b)) :: (~>) (t a) (m ())
- type family MapM_Sym2 (a6989586621680416510 :: (~>) a (m b)) (a6989586621680416511 :: t a) :: m () where ...
- data ForM_Sym0 :: (~>) (t a) ((~>) ((~>) a (m b)) (m ()))
- data ForM_Sym1 (a6989586621680416501 :: t a) :: (~>) ((~>) a (m b)) (m ())
- type family ForM_Sym2 (a6989586621680416501 :: t a) (a6989586621680416502 :: (~>) a (m b)) :: m () where ...
- data Sequence_Sym0 :: (~>) (t (m a)) (m ())
- type family Sequence_Sym1 (a6989586621680416486 :: t (m a)) :: m () where ...
- data MsumSym0 :: (~>) (t (m a)) (m a)
- type family MsumSym1 (a6989586621680416474 :: t (m a)) :: m a where ...
- data ConcatSym0 :: (~>) (t [a]) [a]
- type family ConcatSym1 (a6989586621680416463 :: t [a]) :: [a] where ...
- data ConcatMapSym0 :: (~>) ((~>) a [b]) ((~>) (t a) [b])
- data ConcatMapSym1 (a6989586621680416452 :: (~>) a [b]) :: (~>) (t a) [b]
- type family ConcatMapSym2 (a6989586621680416452 :: (~>) a [b]) (a6989586621680416453 :: t a) :: [b] where ...
- data AndSym0 :: (~>) (t Bool) Bool
- type family AndSym1 (a6989586621680416447 :: t Bool) :: Bool where ...
- data OrSym0 :: (~>) (t Bool) Bool
- type family OrSym1 (a6989586621680416441 :: t Bool) :: Bool where ...
- data AnySym0 :: (~>) ((~>) a Bool) ((~>) (t a) Bool)
- data AnySym1 (a6989586621680416433 :: (~>) a Bool) :: (~>) (t a) Bool
- type family AnySym2 (a6989586621680416433 :: (~>) a Bool) (a6989586621680416434 :: t a) :: Bool where ...
- data AllSym0 :: (~>) ((~>) a Bool) ((~>) (t a) Bool)
- data AllSym1 (a6989586621680416424 :: (~>) a Bool) :: (~>) (t a) Bool
- type family AllSym2 (a6989586621680416424 :: (~>) a Bool) (a6989586621680416425 :: t a) :: Bool where ...
- data MaximumBySym0 :: (~>) ((~>) a ((~>) a Ordering)) ((~>) (t a) a)
- data MaximumBySym1 (a6989586621680416404 :: (~>) a ((~>) a Ordering)) :: (~>) (t a) a
- type family MaximumBySym2 (a6989586621680416404 :: (~>) a ((~>) a Ordering)) (a6989586621680416405 :: t a) :: a where ...
- data MinimumBySym0 :: (~>) ((~>) a ((~>) a Ordering)) ((~>) (t a) a)
- data MinimumBySym1 (a6989586621680416384 :: (~>) a ((~>) a Ordering)) :: (~>) (t a) a
- type family MinimumBySym2 (a6989586621680416384 :: (~>) a ((~>) a Ordering)) (a6989586621680416385 :: t a) :: a where ...
- data NotElemSym0 :: (~>) a ((~>) (t a) Bool)
- data NotElemSym1 (a6989586621680416375 :: a) :: (~>) (t a) Bool
- type family NotElemSym2 (a6989586621680416375 :: a) (a6989586621680416376 :: t a) :: Bool where ...
- data FindSym0 :: (~>) ((~>) a Bool) ((~>) (t a) (Maybe a))
- data FindSym1 (a6989586621680416357 :: (~>) a Bool) :: (~>) (t a) (Maybe a)
- type family FindSym2 (a6989586621680416357 :: (~>) a Bool) (a6989586621680416358 :: t a) :: Maybe a where ...
Documentation
Associated Types
type Fold (arg :: t m) :: m Source #
type FoldMap (arg :: (~>) a m) (arg :: t a) :: m Source #
type Foldr (arg :: (~>) a ((~>) b b)) (arg :: b) (arg :: t a) :: b Source #
type Foldr' (arg :: (~>) a ((~>) b b)) (arg :: b) (arg :: t a) :: b Source #
type Foldl (arg :: (~>) b ((~>) a b)) (arg :: b) (arg :: t a) :: b Source #
type Foldl' (arg :: (~>) b ((~>) a b)) (arg :: b) (arg :: t a) :: b Source #
type Foldr1 (arg :: (~>) a ((~>) a a)) (arg :: t a) :: a Source #
type Foldl1 (arg :: (~>) a ((~>) a a)) (arg :: t a) :: a Source #
type ToList (arg :: t a) :: [a] Source #
type Null (arg :: t a) :: Bool Source #
type Length (arg :: t a) :: Natural Source #
type Elem (arg :: a) (arg :: t a) :: Bool Source #
type Maximum (arg :: t a) :: a Source #
type Minimum (arg :: t a) :: a Source #
Instances
| PFoldable Identity Source # | |
Defined in Data.Functor.Identity.Singletons Associated Types type FoldMap arg arg1 :: m Source # type Foldr arg arg1 arg2 :: b Source # type Foldr' arg arg1 arg2 :: b Source # type Foldl arg arg1 arg2 :: b Source # type Foldl' arg arg1 arg2 :: b Source # type Foldr1 arg arg1 :: a Source # type Foldl1 arg arg1 :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Natural Source # type Elem arg arg1 :: Bool Source # type Maximum arg :: a Source # | |
| PFoldable First Source # | |
Defined in Data.Foldable.Singletons Associated Types type FoldMap arg arg1 :: m Source # type Foldr arg arg1 arg2 :: b Source # type Foldr' arg arg1 arg2 :: b Source # type Foldl arg arg1 arg2 :: b Source # type Foldl' arg arg1 arg2 :: b Source # type Foldr1 arg arg1 :: a Source # type Foldl1 arg arg1 :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Natural Source # type Elem arg arg1 :: Bool Source # type Maximum arg :: a Source # | |
| PFoldable Last Source # | |
Defined in Data.Foldable.Singletons Associated Types type FoldMap arg arg1 :: m Source # type Foldr arg arg1 arg2 :: b Source # type Foldr' arg arg1 arg2 :: b Source # type Foldl arg arg1 arg2 :: b Source # type Foldl' arg arg1 arg2 :: b Source # type Foldr1 arg arg1 :: a Source # type Foldl1 arg arg1 :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Natural Source # type Elem arg arg1 :: Bool Source # type Maximum arg :: a Source # | |
| PFoldable First Source # | |
Defined in Data.Semigroup.Singletons Associated Types type FoldMap arg arg1 :: m Source # type Foldr arg arg1 arg2 :: b Source # type Foldr' arg arg1 arg2 :: b Source # type Foldl arg arg1 arg2 :: b Source # type Foldl' arg arg1 arg2 :: b Source # type Foldr1 arg arg1 :: a Source # type Foldl1 arg arg1 :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Natural Source # type Elem arg arg1 :: Bool Source # type Maximum arg :: a Source # | |
| PFoldable Last Source # | |
Defined in Data.Semigroup.Singletons Associated Types type FoldMap arg arg1 :: m Source # type Foldr arg arg1 arg2 :: b Source # type Foldr' arg arg1 arg2 :: b Source # type Foldl arg arg1 arg2 :: b Source # type Foldl' arg arg1 arg2 :: b Source # type Foldr1 arg arg1 :: a Source # type Foldl1 arg arg1 :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Natural Source # type Elem arg arg1 :: Bool Source # type Maximum arg :: a Source # | |
| PFoldable Max Source # | |
Defined in Data.Semigroup.Singletons Associated Types type FoldMap arg arg1 :: m Source # type Foldr arg arg1 arg2 :: b Source # type Foldr' arg arg1 arg2 :: b Source # type Foldl arg arg1 arg2 :: b Source # type Foldl' arg arg1 arg2 :: b Source # type Foldr1 arg arg1 :: a Source # type Foldl1 arg arg1 :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Natural Source # type Elem arg arg1 :: Bool Source # type Maximum arg :: a Source # | |
| PFoldable Min Source # | |
Defined in Data.Semigroup.Singletons Associated Types type FoldMap arg arg1 :: m Source # type Foldr arg arg1 arg2 :: b Source # type Foldr' arg arg1 arg2 :: b Source # type Foldl arg arg1 arg2 :: b Source # type Foldl' arg arg1 arg2 :: b Source # type Foldr1 arg arg1 :: a Source # type Foldl1 arg arg1 :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Natural Source # type Elem arg arg1 :: Bool Source # type Maximum arg :: a Source # | |
| PFoldable Dual Source # | |
Defined in Data.Foldable.Singletons Associated Types type FoldMap arg arg1 :: m Source # type Foldr arg arg1 arg2 :: b Source # type Foldr' arg arg1 arg2 :: b Source # type Foldl arg arg1 arg2 :: b Source # type Foldl' arg arg1 arg2 :: b Source # type Foldr1 arg arg1 :: a Source # type Foldl1 arg arg1 :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Natural Source # type Elem arg arg1 :: Bool Source # type Maximum arg :: a Source # | |
| PFoldable Product Source # | |
Defined in Data.Foldable.Singletons Associated Types type FoldMap arg arg1 :: m Source # type Foldr arg arg1 arg2 :: b Source # type Foldr' arg arg1 arg2 :: b Source # type Foldl arg arg1 arg2 :: b Source # type Foldl' arg arg1 arg2 :: b Source # type Foldr1 arg arg1 :: a Source # type Foldl1 arg arg1 :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Natural Source # type Elem arg arg1 :: Bool Source # type Maximum arg :: a Source # | |
| PFoldable Sum Source # | |
Defined in Data.Foldable.Singletons Associated Types type FoldMap arg arg1 :: m Source # type Foldr arg arg1 arg2 :: b Source # type Foldr' arg arg1 arg2 :: b Source # type Foldl arg arg1 arg2 :: b Source # type Foldl' arg arg1 arg2 :: b Source # type Foldr1 arg arg1 :: a Source # type Foldl1 arg arg1 :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Natural Source # type Elem arg arg1 :: Bool Source # type Maximum arg :: a Source # | |
| PFoldable NonEmpty Source # | |
Defined in Data.Foldable.Singletons Associated Types type FoldMap arg arg1 :: m Source # type Foldr arg arg1 arg2 :: b Source # type Foldr' arg arg1 arg2 :: b Source # type Foldl arg arg1 arg2 :: b Source # type Foldl' arg arg1 arg2 :: b Source # type Foldr1 arg arg1 :: a Source # type Foldl1 arg arg1 :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Natural Source # type Elem arg arg1 :: Bool Source # type Maximum arg :: a Source # | |
| PFoldable Maybe Source # | |
Defined in Data.Foldable.Singletons Associated Types type FoldMap arg arg1 :: m Source # type Foldr arg arg1 arg2 :: b Source # type Foldr' arg arg1 arg2 :: b Source # type Foldl arg arg1 arg2 :: b Source # type Foldl' arg arg1 arg2 :: b Source # type Foldr1 arg arg1 :: a Source # type Foldl1 arg arg1 :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Natural Source # type Elem arg arg1 :: Bool Source # type Maximum arg :: a Source # | |
| PFoldable List Source # | |
Defined in Data.Foldable.Singletons Associated Types type FoldMap arg arg1 :: m Source # type Foldr arg arg1 arg2 :: b Source # type Foldr' arg arg1 arg2 :: b Source # type Foldl arg arg1 arg2 :: b Source # type Foldl' arg arg1 arg2 :: b Source # type Foldr1 arg arg1 :: a Source # type Foldl1 arg arg1 :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Natural Source # type Elem arg arg1 :: Bool Source # type Maximum arg :: a Source # | |
| PFoldable (Either a) Source # | |
Defined in Data.Foldable.Singletons Associated Types type FoldMap arg arg1 :: m Source # type Foldr arg arg1 arg2 :: b Source # type Foldr' arg arg1 arg2 :: b Source # type Foldl arg arg1 arg2 :: b Source # type Foldl' arg arg1 arg2 :: b Source # type Foldr1 arg arg1 :: a Source # type Foldl1 arg arg1 :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Natural Source # type Elem arg arg1 :: Bool Source # type Maximum arg :: a Source # | |
| PFoldable (Proxy :: Type -> Type) Source # | |
Defined in Data.Foldable.Singletons Associated Types type FoldMap arg arg1 :: m Source # type Foldr arg arg1 arg2 :: b Source # type Foldr' arg arg1 arg2 :: b Source # type Foldl arg arg1 arg2 :: b Source # type Foldl' arg arg1 arg2 :: b Source # type Foldr1 arg arg1 :: a Source # type Foldl1 arg arg1 :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Natural Source # type Elem arg arg1 :: Bool Source # type Maximum arg :: a Source # | |
| PFoldable (Arg a) Source # | |
Defined in Data.Semigroup.Singletons Associated Types type FoldMap arg arg1 :: m Source # type Foldr arg arg1 arg2 :: b Source # type Foldr' arg arg1 arg2 :: b Source # type Foldl arg arg1 arg2 :: b Source # type Foldl' arg arg1 arg2 :: b Source # type Foldr1 arg arg1 :: a Source # type Foldl1 arg arg1 :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Natural Source # type Elem arg arg1 :: Bool Source # type Maximum arg :: a Source # | |
| PFoldable ((,) a) Source # | |
Defined in Data.Foldable.Singletons Associated Types type FoldMap arg arg1 :: m Source # type Foldr arg arg1 arg2 :: b Source # type Foldr' arg arg1 arg2 :: b Source # type Foldl arg arg1 arg2 :: b Source # type Foldl' arg arg1 arg2 :: b Source # type Foldr1 arg arg1 :: a Source # type Foldl1 arg arg1 :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Natural Source # type Elem arg arg1 :: Bool Source # type Maximum arg :: a Source # | |
| PFoldable (Const m :: Type -> Type) Source # | |
Defined in Data.Functor.Const.Singletons Associated Types type FoldMap arg arg1 :: m Source # type Foldr arg arg1 arg2 :: b Source # type Foldr' arg arg1 arg2 :: b Source # type Foldl arg arg1 arg2 :: b Source # type Foldl' arg arg1 arg2 :: b Source # type Foldr1 arg arg1 :: a Source # type Foldl1 arg arg1 :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Natural Source # type Elem arg arg1 :: Bool Source # type Maximum arg :: a Source # | |
| PFoldable (Product f g) Source # | |
Defined in Data.Functor.Product.Singletons Associated Types type FoldMap arg arg1 :: m Source # type Foldr arg arg1 arg2 :: b Source # type Foldr' arg arg1 arg2 :: b Source # type Foldl arg arg1 arg2 :: b Source # type Foldl' arg arg1 arg2 :: b Source # type Foldr1 arg arg1 :: a Source # type Foldl1 arg arg1 :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Natural Source # type Elem arg arg1 :: Bool Source # type Maximum arg :: a Source # | |
| PFoldable (Sum f g) Source # | |
Defined in Data.Functor.Sum.Singletons Associated Types type FoldMap arg arg1 :: m Source # type Foldr arg arg1 arg2 :: b Source # type Foldr' arg arg1 arg2 :: b Source # type Foldl arg arg1 arg2 :: b Source # type Foldl' arg arg1 arg2 :: b Source # type Foldr1 arg arg1 :: a Source # type Foldl1 arg arg1 :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Natural Source # type Elem arg arg1 :: Bool Source # type Maximum arg :: a Source # | |
| PFoldable (Compose f g) Source # | |
Defined in Data.Functor.Compose.Singletons Associated Types type FoldMap arg arg1 :: m Source # type Foldr arg arg1 arg2 :: b Source # type Foldr' arg arg1 arg2 :: b Source # type Foldl arg arg1 arg2 :: b Source # type Foldl' arg arg1 arg2 :: b Source # type Foldr1 arg arg1 :: a Source # type Foldl1 arg arg1 :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Natural Source # type Elem arg arg1 :: Bool Source # type Maximum arg :: a Source # | |
class SFoldable t where Source #
Minimal complete definition
Nothing
Methods
sFold :: forall (t :: t m). SMonoid m => Sing t -> Sing (Apply FoldSym0 t :: m) :: Type Source #
default sFold :: forall (t :: t m). ((Apply FoldSym0 t :: m) ~ Apply Fold_6989586621680416643Sym0 t, SMonoid m) => Sing t -> Sing (Apply FoldSym0 t :: m) :: Type Source #
sFoldMap :: forall (t :: (~>) a m) (t :: t a). SMonoid m => Sing t -> Sing t -> Sing (Apply (Apply FoldMapSym0 t) t :: m) :: Type Source #
default sFoldMap :: forall (t :: (~>) a m) (t :: t a). ((Apply (Apply FoldMapSym0 t) t :: m) ~ Apply (Apply FoldMap_6989586621680416653Sym0 t) t, SMonoid m) => Sing t -> Sing t -> Sing (Apply (Apply FoldMapSym0 t) t :: m) :: Type Source #
sFoldr :: forall (t :: (~>) a ((~>) b b)) (t :: b) (t :: t a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldrSym0 t) t) t :: b) :: Type Source #
default sFoldr :: forall (t :: (~>) a ((~>) b b)) (t :: b) (t :: t a). (Apply (Apply (Apply FoldrSym0 t) t) t :: b) ~ Apply (Apply (Apply Foldr_6989586621680416667Sym0 t) t) t => Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldrSym0 t) t) t :: b) :: Type Source #
sFoldr' :: forall (t :: (~>) a ((~>) b b)) (t :: b) (t :: t a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldr'Sym0 t) t) t :: b) :: Type Source #
default sFoldr' :: forall (t :: (~>) a ((~>) b b)) (t :: b) (t :: t a). (Apply (Apply (Apply Foldr'Sym0 t) t) t :: b) ~ Apply (Apply (Apply Foldr'_6989586621680416682Sym0 t) t) t => Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldr'Sym0 t) t) t :: b) :: Type Source #
sFoldl :: forall (t :: (~>) b ((~>) a b)) (t :: b) (t :: t a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldlSym0 t) t) t :: b) :: Type Source #
default sFoldl :: forall (t :: (~>) b ((~>) a b)) (t :: b) (t :: t a). (Apply (Apply (Apply FoldlSym0 t) t) t :: b) ~ Apply (Apply (Apply Foldl_6989586621680416705Sym0 t) t) t => Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldlSym0 t) t) t :: b) :: Type Source #
sFoldl' :: forall (t :: (~>) b ((~>) a b)) (t :: b) (t :: t a). Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldl'Sym0 t) t) t :: b) :: Type Source #
default sFoldl' :: forall (t :: (~>) b ((~>) a b)) (t :: b) (t :: t a). (Apply (Apply (Apply Foldl'Sym0 t) t) t :: b) ~ Apply (Apply (Apply Foldl'_6989586621680416720Sym0 t) t) t => Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply Foldl'Sym0 t) t) t :: b) :: Type Source #
sFoldr1 :: forall (t :: (~>) a ((~>) a a)) (t :: t a). Sing t -> Sing t -> Sing (Apply (Apply Foldr1Sym0 t) t :: a) :: Type Source #
default sFoldr1 :: forall (t :: (~>) a ((~>) a a)) (t :: t a). (Apply (Apply Foldr1Sym0 t) t :: a) ~ Apply (Apply Foldr1_6989586621680416742Sym0 t) t => Sing t -> Sing t -> Sing (Apply (Apply Foldr1Sym0 t) t :: a) :: Type Source #
sFoldl1 :: forall (t :: (~>) a ((~>) a a)) (t :: t a). Sing t -> Sing t -> Sing (Apply (Apply Foldl1Sym0 t) t :: a) :: Type Source #
default sFoldl1 :: forall (t :: (~>) a ((~>) a a)) (t :: t a). (Apply (Apply Foldl1Sym0 t) t :: a) ~ Apply (Apply Foldl1_6989586621680416763Sym0 t) t => Sing t -> Sing t -> Sing (Apply (Apply Foldl1Sym0 t) t :: a) :: Type Source #
sToList :: forall (t :: t a). Sing t -> Sing (Apply ToListSym0 t :: [a]) :: Type Source #
default sToList :: forall (t :: t a). (Apply ToListSym0 t :: [a]) ~ Apply ToList_6989586621680416783Sym0 t => Sing t -> Sing (Apply ToListSym0 t :: [a]) :: Type Source #
sNull :: forall (t :: t a). Sing t -> Sing (Apply NullSym0 t :: Bool) :: Type Source #
default sNull :: forall (t :: t a). (Apply NullSym0 t :: Bool) ~ Apply Null_6989586621680416792Sym0 t => Sing t -> Sing (Apply NullSym0 t :: Bool) :: Type Source #
sLength :: forall (t :: t a). Sing t -> Sing (Apply LengthSym0 t :: Natural) :: Type Source #
default sLength :: forall (t :: t a). (Apply LengthSym0 t :: Natural) ~ Apply Length_6989586621680416809Sym0 t => Sing t -> Sing (Apply LengthSym0 t :: Natural) :: Type Source #
sElem :: forall (t :: a) (t :: t a). SEq a => Sing t -> Sing t -> Sing (Apply (Apply ElemSym0 t) t :: Bool) :: Type Source #
default sElem :: forall (t :: a) (t :: t a). ((Apply (Apply ElemSym0 t) t :: Bool) ~ Apply (Apply Elem_6989586621680416828Sym0 t) t, SEq a) => Sing t -> Sing t -> Sing (Apply (Apply ElemSym0 t) t :: Bool) :: Type Source #
sMaximum :: forall a (t :: t a). SOrd a => Sing t -> Sing (Apply MaximumSym0 t :: a) Source #
default sMaximum :: forall a (t :: t a). ((Apply MaximumSym0 t :: a) ~ Apply Maximum_6989586621680416842Sym0 t, SOrd a) => Sing t -> Sing (Apply MaximumSym0 t :: a) Source #
sMinimum :: forall a (t :: t a). SOrd a => Sing t -> Sing (Apply MinimumSym0 t :: a) Source #
default sMinimum :: forall a (t :: t a). ((Apply MinimumSym0 t :: a) ~ Apply Minimum_6989586621680416857Sym0 t, SOrd a) => Sing t -> Sing (Apply MinimumSym0 t :: a) Source #
sSum :: forall (t :: t a). SNum a => Sing t -> Sing (Apply SumSym0 t :: a) :: Type Source #
default sSum :: forall (t :: t a). ((Apply SumSym0 t :: a) ~ Apply Sum_6989586621680416872Sym0 t, SNum a) => Sing t -> Sing (Apply SumSym0 t :: a) :: Type Source #
sProduct :: forall (t :: t a). SNum a => Sing t -> Sing (Apply ProductSym0 t :: a) :: Type Source #
Instances
| SFoldable Identity Source # | |
Defined in Data.Functor.Identity.Singletons Methods sFold :: forall m (t1 :: Identity m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) Source # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Identity a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 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 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 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 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 t1) t2) t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Identity a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Identity a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source # sToList :: forall a (t1 :: Identity a). Sing t1 -> Sing (Apply ToListSym0 t1) Source # sNull :: forall a (t1 :: Identity a). Sing t1 -> Sing (Apply NullSym0 t1) Source # sLength :: forall a (t1 :: Identity a). Sing t1 -> Sing (Apply LengthSym0 t1) Source # sElem :: forall a (t1 :: a) (t2 :: Identity a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source # sMaximum :: forall a (t1 :: Identity a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) Source # sMinimum :: forall a (t1 :: Identity a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) Source # sSum :: forall a (t1 :: Identity a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) Source # sProduct :: forall a (t1 :: Identity a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) Source # | |
| SFoldable First Source # | |
Defined in Data.Foldable.Singletons Methods sFold :: forall m (t1 :: First m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) Source # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: First a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 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 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 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 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 t1) t2) t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: First a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: First a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source # sToList :: forall a (t1 :: First a). Sing t1 -> Sing (Apply ToListSym0 t1) Source # sNull :: forall a (t1 :: First a). Sing t1 -> Sing (Apply NullSym0 t1) Source # sLength :: forall a (t1 :: First a). Sing t1 -> Sing (Apply LengthSym0 t1) Source # sElem :: forall a (t1 :: a) (t2 :: First a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source # sMaximum :: forall a (t1 :: First a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) Source # sMinimum :: forall a (t1 :: First a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) Source # sSum :: forall a (t1 :: First a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) Source # sProduct :: forall a (t1 :: First a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) Source # | |
| SFoldable Last Source # | |
Defined in Data.Foldable.Singletons Methods sFold :: forall m (t1 :: Last m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) Source # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Last a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 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 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 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 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 t1) t2) t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Last a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Last a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source # sToList :: forall a (t1 :: Last a). Sing t1 -> Sing (Apply ToListSym0 t1) Source # sNull :: forall a (t1 :: Last a). Sing t1 -> Sing (Apply NullSym0 t1) Source # sLength :: forall a (t1 :: Last a). Sing t1 -> Sing (Apply LengthSym0 t1) Source # sElem :: forall a (t1 :: a) (t2 :: Last a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source # sMaximum :: forall a (t1 :: Last a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) Source # sMinimum :: forall a (t1 :: Last a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) Source # sSum :: forall a (t1 :: Last a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) Source # sProduct :: forall a (t1 :: Last a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) Source # | |
| SFoldable First Source # | |
Defined in Data.Semigroup.Singletons Methods sFold :: forall m (t1 :: First m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) Source # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: First a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 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 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 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 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 t1) t2) t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: First a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: First a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source # sToList :: forall a (t1 :: First a). Sing t1 -> Sing (Apply ToListSym0 t1) Source # sNull :: forall a (t1 :: First a). Sing t1 -> Sing (Apply NullSym0 t1) Source # sLength :: forall a (t1 :: First a). Sing t1 -> Sing (Apply LengthSym0 t1) Source # sElem :: forall a (t1 :: a) (t2 :: First a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source # sMaximum :: forall a (t1 :: First a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) Source # sMinimum :: forall a (t1 :: First a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) Source # sSum :: forall a (t1 :: First a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) Source # sProduct :: forall a (t1 :: First a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) Source # | |
| SFoldable Last Source # | |
Defined in Data.Semigroup.Singletons Methods sFold :: forall m (t1 :: Last m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) Source # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Last a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 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 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 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 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 t1) t2) t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Last a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Last a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source # sToList :: forall a (t1 :: Last a). Sing t1 -> Sing (Apply ToListSym0 t1) Source # sNull :: forall a (t1 :: Last a). Sing t1 -> Sing (Apply NullSym0 t1) Source # sLength :: forall a (t1 :: Last a). Sing t1 -> Sing (Apply LengthSym0 t1) Source # sElem :: forall a (t1 :: a) (t2 :: Last a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source # sMaximum :: forall a (t1 :: Last a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) Source # sMinimum :: forall a (t1 :: Last a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) Source # sSum :: forall a (t1 :: Last a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) Source # sProduct :: forall a (t1 :: Last a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) Source # | |
| SFoldable Max Source # | |
Defined in Data.Semigroup.Singletons Methods sFold :: forall m (t1 :: Max m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) Source # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Max a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 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 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 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 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 t1) t2) t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Max a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Max a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source # sToList :: forall a (t1 :: Max a). Sing t1 -> Sing (Apply ToListSym0 t1) Source # sNull :: forall a (t1 :: Max a). Sing t1 -> Sing (Apply NullSym0 t1) Source # sLength :: forall a (t1 :: Max a). Sing t1 -> Sing (Apply LengthSym0 t1) Source # sElem :: forall a (t1 :: a) (t2 :: Max a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source # sMaximum :: forall a (t1 :: Max a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) Source # sMinimum :: forall a (t1 :: Max a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) Source # sSum :: forall a (t1 :: Max a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) Source # sProduct :: forall a (t1 :: Max a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) Source # | |
| SFoldable Min Source # | |
Defined in Data.Semigroup.Singletons Methods sFold :: forall m (t1 :: Min m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) Source # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Min a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 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 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 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 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 t1) t2) t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Min a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Min a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source # sToList :: forall a (t1 :: Min a). Sing t1 -> Sing (Apply ToListSym0 t1) Source # sNull :: forall a (t1 :: Min a). Sing t1 -> Sing (Apply NullSym0 t1) Source # sLength :: forall a (t1 :: Min a). Sing t1 -> Sing (Apply LengthSym0 t1) Source # sElem :: forall a (t1 :: a) (t2 :: Min a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source # sMaximum :: forall a (t1 :: Min a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) Source # sMinimum :: forall a (t1 :: Min a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) Source # sSum :: forall a (t1 :: Min a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) Source # sProduct :: forall a (t1 :: Min a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) Source # | |
| SFoldable Dual Source # | |
Defined in Data.Foldable.Singletons Methods sFold :: forall m (t1 :: Dual m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) Source # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Dual a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 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 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 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 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 t1) t2) t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Dual a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Dual a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source # sToList :: forall a (t1 :: Dual a). Sing t1 -> Sing (Apply ToListSym0 t1) Source # sNull :: forall a (t1 :: Dual a). Sing t1 -> Sing (Apply NullSym0 t1) Source # sLength :: forall a (t1 :: Dual a). Sing t1 -> Sing (Apply LengthSym0 t1) Source # sElem :: forall a (t1 :: a) (t2 :: Dual a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source # sMaximum :: forall a (t1 :: Dual a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) Source # sMinimum :: forall a (t1 :: Dual a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) Source # sSum :: forall a (t1 :: Dual a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) Source # sProduct :: forall a (t1 :: Dual a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) Source # | |
| SFoldable Product Source # | |
Defined in Data.Foldable.Singletons Methods sFold :: forall m (t1 :: Product m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) Source # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Product a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 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 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 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 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 t1) t2) t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Product a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Product a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source # sToList :: forall a (t1 :: Product a). Sing t1 -> Sing (Apply ToListSym0 t1) Source # sNull :: forall a (t1 :: Product a). Sing t1 -> Sing (Apply NullSym0 t1) Source # sLength :: forall a (t1 :: Product a). Sing t1 -> Sing (Apply LengthSym0 t1) Source # sElem :: forall a (t1 :: a) (t2 :: Product a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source # sMaximum :: forall a (t1 :: Product a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) Source # sMinimum :: forall a (t1 :: Product a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) Source # sSum :: forall a (t1 :: Product a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) Source # sProduct :: forall a (t1 :: Product a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) Source # | |
| SFoldable Sum Source # | |
Defined in Data.Foldable.Singletons Methods sFold :: forall m (t1 :: Sum m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) Source # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Sum a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 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 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 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 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 t1) t2) t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Sum a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Sum a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source # sToList :: forall a (t1 :: Sum a). Sing t1 -> Sing (Apply ToListSym0 t1) Source # sNull :: forall a (t1 :: Sum a). Sing t1 -> Sing (Apply NullSym0 t1) Source # sLength :: forall a (t1 :: Sum a). Sing t1 -> Sing (Apply LengthSym0 t1) Source # sElem :: forall a (t1 :: a) (t2 :: Sum a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source # sMaximum :: forall a (t1 :: Sum a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) Source # sMinimum :: forall a (t1 :: Sum a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) Source # sSum :: forall a (t1 :: Sum a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) Source # sProduct :: forall a (t1 :: Sum a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) Source # | |
| SFoldable NonEmpty Source # | |
Defined in Data.Foldable.Singletons Methods sFold :: forall m (t1 :: NonEmpty m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) Source # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: NonEmpty a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 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 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 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 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 t1) t2) t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source # sToList :: forall a (t1 :: NonEmpty a). Sing t1 -> Sing (Apply ToListSym0 t1) Source # sNull :: forall a (t1 :: NonEmpty a). Sing t1 -> Sing (Apply NullSym0 t1) Source # sLength :: forall a (t1 :: NonEmpty a). Sing t1 -> Sing (Apply LengthSym0 t1) Source # sElem :: forall a (t1 :: a) (t2 :: NonEmpty a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source # sMaximum :: forall a (t1 :: NonEmpty a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) Source # sMinimum :: forall a (t1 :: NonEmpty a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) Source # sSum :: forall a (t1 :: NonEmpty a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) Source # sProduct :: forall a (t1 :: NonEmpty a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) Source # | |
| SFoldable Maybe Source # | |
Defined in Data.Foldable.Singletons Methods sFold :: forall m (t1 :: Maybe m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) Source # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Maybe a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 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 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 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 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 t1) t2) t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source # sToList :: forall a (t1 :: Maybe a). Sing t1 -> Sing (Apply ToListSym0 t1) Source # sNull :: forall a (t1 :: Maybe a). Sing t1 -> Sing (Apply NullSym0 t1) Source # sLength :: forall a (t1 :: Maybe a). Sing t1 -> Sing (Apply LengthSym0 t1) Source # sElem :: forall a (t1 :: a) (t2 :: Maybe a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source # sMaximum :: forall a (t1 :: Maybe a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) Source # sMinimum :: forall a (t1 :: Maybe a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) Source # sSum :: forall a (t1 :: Maybe a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) Source # sProduct :: forall a (t1 :: Maybe a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) Source # | |
| SFoldable List Source # | |
Defined in Data.Foldable.Singletons Methods sFold :: forall m (t1 :: [m]). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) Source # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: [a]). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 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 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 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 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 t1) t2) t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: [a]). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source # sToList :: forall a (t1 :: [a]). Sing t1 -> Sing (Apply ToListSym0 t1) Source # sNull :: forall a (t1 :: [a]). Sing t1 -> Sing (Apply NullSym0 t1) Source # sLength :: forall a (t1 :: [a]). Sing t1 -> Sing (Apply LengthSym0 t1) Source # sElem :: forall a (t1 :: a) (t2 :: [a]). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source # sMaximum :: forall a (t1 :: [a]). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) Source # sMinimum :: forall a (t1 :: [a]). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) Source # sSum :: forall a (t1 :: [a]). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) Source # sProduct :: forall a (t1 :: [a]). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) Source # | |
| SFoldable (Either a) Source # | |
Defined in Data.Foldable.Singletons Methods sFold :: forall m (t1 :: Either a m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) Source # sFoldMap :: forall a0 m (t1 :: a0 ~> m) (t2 :: Either a a0). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 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 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 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 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 t1) t2) t3) Source # sFoldr1 :: forall a0 (t1 :: a0 ~> (a0 ~> a0)) (t2 :: Either a a0). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source # sFoldl1 :: forall a0 (t1 :: a0 ~> (a0 ~> a0)) (t2 :: Either a a0). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source # sToList :: forall a0 (t1 :: Either a a0). Sing t1 -> Sing (Apply ToListSym0 t1) Source # sNull :: forall a0 (t1 :: Either a a0). Sing t1 -> Sing (Apply NullSym0 t1) Source # sLength :: forall a0 (t1 :: Either a a0). Sing t1 -> Sing (Apply LengthSym0 t1) Source # sElem :: forall a0 (t1 :: a0) (t2 :: Either a a0). SEq a0 => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source # sMaximum :: forall a0 (t1 :: Either a a0). SOrd a0 => Sing t1 -> Sing (Apply MaximumSym0 t1) Source # sMinimum :: forall a0 (t1 :: Either a a0). SOrd a0 => Sing t1 -> Sing (Apply MinimumSym0 t1) Source # sSum :: forall a0 (t1 :: Either a a0). SNum a0 => Sing t1 -> Sing (Apply SumSym0 t1) Source # sProduct :: forall a0 (t1 :: Either a a0). SNum a0 => Sing t1 -> Sing (Apply ProductSym0 t1) Source # | |
| SFoldable (Proxy :: Type -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods sFold :: forall m (t1 :: Proxy m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) Source # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Proxy a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 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 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 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 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 t1) t2) t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Proxy a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Proxy a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source # sToList :: forall a (t1 :: Proxy a). Sing t1 -> Sing (Apply ToListSym0 t1) Source # sNull :: forall a (t1 :: Proxy a). Sing t1 -> Sing (Apply NullSym0 t1) Source # sLength :: forall a (t1 :: Proxy a). Sing t1 -> Sing (Apply LengthSym0 t1) Source # sElem :: forall a (t1 :: a) (t2 :: Proxy a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source # sMaximum :: forall a (t1 :: Proxy a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) Source # sMinimum :: forall a (t1 :: Proxy a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) Source # sSum :: forall a (t1 :: Proxy a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) Source # sProduct :: forall a (t1 :: Proxy a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) Source # | |
| SFoldable (Arg a) Source # | |
Defined in Data.Semigroup.Singletons Methods sFold :: forall m (t1 :: Arg a m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) Source # sFoldMap :: forall a0 m (t1 :: a0 ~> m) (t2 :: Arg a a0). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 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 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 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 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 t1) t2) t3) Source # sFoldr1 :: forall a0 (t1 :: a0 ~> (a0 ~> a0)) (t2 :: Arg a a0). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source # sFoldl1 :: forall a0 (t1 :: a0 ~> (a0 ~> a0)) (t2 :: Arg a a0). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source # sToList :: forall a0 (t1 :: Arg a a0). Sing t1 -> Sing (Apply ToListSym0 t1) Source # sNull :: forall a0 (t1 :: Arg a a0). Sing t1 -> Sing (Apply NullSym0 t1) Source # sLength :: forall a0 (t1 :: Arg a a0). Sing t1 -> Sing (Apply LengthSym0 t1) Source # sElem :: forall a0 (t1 :: a0) (t2 :: Arg a a0). SEq a0 => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source # sMaximum :: forall a0 (t1 :: Arg a a0). SOrd a0 => Sing t1 -> Sing (Apply MaximumSym0 t1) Source # sMinimum :: forall a0 (t1 :: Arg a a0). SOrd a0 => Sing t1 -> Sing (Apply MinimumSym0 t1) Source # sSum :: forall a0 (t1 :: Arg a a0). SNum a0 => Sing t1 -> Sing (Apply SumSym0 t1) Source # sProduct :: forall a0 (t1 :: Arg a a0). SNum a0 => Sing t1 -> Sing (Apply ProductSym0 t1) Source # | |
| SFoldable ((,) a) Source # | |
Defined in Data.Foldable.Singletons Methods sFold :: forall m (t1 :: (a, m)). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) Source # sFoldMap :: forall a0 m (t1 :: a0 ~> m) (t2 :: (a, a0)). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 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 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 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 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 t1) t2) t3) Source # sFoldr1 :: forall a0 (t1 :: a0 ~> (a0 ~> a0)) (t2 :: (a, a0)). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source # sFoldl1 :: forall a0 (t1 :: a0 ~> (a0 ~> a0)) (t2 :: (a, a0)). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source # sToList :: forall a0 (t1 :: (a, a0)). Sing t1 -> Sing (Apply ToListSym0 t1) Source # sNull :: forall a0 (t1 :: (a, a0)). Sing t1 -> Sing (Apply NullSym0 t1) Source # sLength :: forall a0 (t1 :: (a, a0)). Sing t1 -> Sing (Apply LengthSym0 t1) Source # sElem :: forall a0 (t1 :: a0) (t2 :: (a, a0)). SEq a0 => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source # sMaximum :: forall a0 (t1 :: (a, a0)). SOrd a0 => Sing t1 -> Sing (Apply MaximumSym0 t1) Source # sMinimum :: forall a0 (t1 :: (a, a0)). SOrd a0 => Sing t1 -> Sing (Apply MinimumSym0 t1) Source # sSum :: forall a0 (t1 :: (a, a0)). SNum a0 => Sing t1 -> Sing (Apply SumSym0 t1) Source # sProduct :: forall a0 (t1 :: (a, a0)). SNum a0 => Sing t1 -> Sing (Apply ProductSym0 t1) Source # | |
| SFoldable (Const m :: Type -> Type) Source # | |
Defined in Data.Functor.Const.Singletons Methods sFold :: forall m0 (t1 :: Const m m0). SMonoid m0 => Sing t1 -> Sing (Apply FoldSym0 t1) Source # sFoldMap :: forall a m0 (t1 :: a ~> m0) (t2 :: Const m a). SMonoid m0 => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 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 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 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 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 t1) t2) t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Const m a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Const m a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source # sToList :: forall a (t1 :: Const m a). Sing t1 -> Sing (Apply ToListSym0 t1) Source # sNull :: forall a (t1 :: Const m a). Sing t1 -> Sing (Apply NullSym0 t1) Source # sLength :: forall a (t1 :: Const m a). Sing t1 -> Sing (Apply LengthSym0 t1) Source # sElem :: forall a (t1 :: a) (t2 :: Const m a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source # sMaximum :: forall a (t1 :: Const m a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) Source # sMinimum :: forall a (t1 :: Const m a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) Source # sSum :: forall a (t1 :: Const m a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) Source # sProduct :: forall a (t1 :: Const m a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) Source # | |
| (SFoldable f, SFoldable g) => SFoldable (Product f g) Source # | |
Defined in Data.Functor.Product.Singletons Methods sFold :: forall m (t1 :: Product f g m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) Source # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Product f g a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 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 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 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 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 t1) t2) t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Product f g a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Product f g a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source # sToList :: forall a (t1 :: Product f g a). Sing t1 -> Sing (Apply ToListSym0 t1) Source # sNull :: forall a (t1 :: Product f g a). Sing t1 -> Sing (Apply NullSym0 t1) Source # sLength :: forall a (t1 :: Product f g a). Sing t1 -> Sing (Apply LengthSym0 t1) Source # sElem :: forall a (t1 :: a) (t2 :: Product f g a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source # sMaximum :: forall a (t1 :: Product f g a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) Source # sMinimum :: forall a (t1 :: Product f g a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) Source # sSum :: forall a (t1 :: Product f g a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) Source # sProduct :: forall a (t1 :: Product f g a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) Source # | |
| (SFoldable f, SFoldable g) => SFoldable (Sum f g) Source # | |
Defined in Data.Functor.Sum.Singletons Methods sFold :: forall m (t1 :: Sum f g m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) Source # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Sum f g a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 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 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 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 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 t1) t2) t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Sum f g a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Sum f g a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source # sToList :: forall a (t1 :: Sum f g a). Sing t1 -> Sing (Apply ToListSym0 t1) Source # sNull :: forall a (t1 :: Sum f g a). Sing t1 -> Sing (Apply NullSym0 t1) Source # sLength :: forall a (t1 :: Sum f g a). Sing t1 -> Sing (Apply LengthSym0 t1) Source # sElem :: forall a (t1 :: a) (t2 :: Sum f g a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source # sMaximum :: forall a (t1 :: Sum f g a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) Source # sMinimum :: forall a (t1 :: Sum f g a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) Source # sSum :: forall a (t1 :: Sum f g a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) Source # sProduct :: forall a (t1 :: Sum f g a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) Source # | |
| (SFoldable f, SFoldable g) => SFoldable (Compose f g) Source # | |
Defined in Data.Functor.Compose.Singletons Methods sFold :: forall m (t1 :: Compose f g m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) Source # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Compose f g a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 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 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 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 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 t1) t2) t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Compose f g a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Compose f g a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source # sToList :: forall a (t1 :: Compose f g a). Sing t1 -> Sing (Apply ToListSym0 t1) Source # sNull :: forall a (t1 :: Compose f g a). Sing t1 -> Sing (Apply NullSym0 t1) Source # sLength :: forall a (t1 :: Compose f g a). Sing t1 -> Sing (Apply LengthSym0 t1) Source # sElem :: forall a (t1 :: a) (t2 :: Compose f g a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source # sMaximum :: forall a (t1 :: Compose f g a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) Source # sMinimum :: forall a (t1 :: Compose f g a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) Source # sSum :: forall a (t1 :: Compose f g a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) Source # sProduct :: forall a (t1 :: Compose f g a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) Source # | |
sFoldrM :: forall (t :: (~>) a ((~>) b (m b))) (t :: b) (t :: t a). (SFoldable t, SMonad m) => Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldrMSym0 t) t) t :: m b) :: Type Source #
sFoldlM :: forall (t :: (~>) b ((~>) a (m b))) (t :: b) (t :: t a). (SFoldable t, SMonad m) => Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply FoldlMSym0 t) t) t :: m b) :: Type Source #
sTraverse_ :: forall (t :: (~>) a (f b)) (t :: t a). (SFoldable t, SApplicative f) => Sing t -> Sing t -> Sing (Apply (Apply Traverse_Sym0 t) t :: f ()) :: Type Source #
sFor_ :: forall (t :: t a) (t :: (~>) a (f b)). (SFoldable t, SApplicative f) => Sing t -> Sing t -> Sing (Apply (Apply For_Sym0 t) t :: f ()) :: Type Source #
type family SequenceA_ (a :: t (f a)) :: f () where ... Source #
Equations
| SequenceA_ a_6989586621680416488 = Apply (Apply (Apply FoldrSym0 (*>@#@$)) (Apply PureSym0 Tuple0Sym0)) a_6989586621680416488 |
sSequenceA_ :: forall (t :: t (f a)). (SFoldable t, SApplicative f) => Sing t -> Sing (Apply SequenceA_Sym0 t :: f ()) :: Type Source #
sAsum :: forall (t :: t (f a)). (SFoldable t, SAlternative f) => Sing t -> Sing (Apply AsumSym0 t :: f a) :: Type Source #
sMapM_ :: forall (t :: (~>) a (m b)) (t :: t a). (SFoldable t, SMonad m) => Sing t -> Sing t -> Sing (Apply (Apply MapM_Sym0 t) t :: m ()) :: Type Source #
sForM_ :: forall (t :: t a) (t :: (~>) a (m b)). (SFoldable t, SMonad m) => Sing t -> Sing t -> Sing (Apply (Apply ForM_Sym0 t) t :: m ()) :: Type Source #
type family Sequence_ (a :: t (m a)) :: m () where ... Source #
Equations
| Sequence_ a_6989586621680416482 = Apply (Apply (Apply FoldrSym0 (>>@#@$)) (Apply ReturnSym0 Tuple0Sym0)) a_6989586621680416482 |
sSequence_ :: forall (t :: t (m a)). (SFoldable t, SMonad m) => Sing t -> Sing (Apply Sequence_Sym0 t :: m ()) :: Type Source #
sMsum :: forall (t :: t (m a)). (SFoldable t, SMonadPlus m) => Sing t -> Sing (Apply MsumSym0 t :: m a) :: Type Source #
sConcat :: forall (t :: t [a]). SFoldable t => Sing t -> Sing (Apply ConcatSym0 t :: [a]) :: Type Source #
sConcatMap :: forall (t :: (~>) a [b]) (t :: t a). SFoldable t => Sing t -> Sing t -> Sing (Apply (Apply ConcatMapSym0 t) t :: [b]) :: Type Source #
type family And (a :: t Bool) :: Bool where ... Source #
Equations
| And a_6989586621680416443 = Apply (Apply (Apply (.@#@$) GetAllSym0) (Apply FoldMapSym0 All_Sym0)) a_6989586621680416443 |
sAnd :: forall (t :: t Bool). SFoldable t => Sing t -> Sing (Apply AndSym0 t :: Bool) :: Type Source #
type family Or (a :: t Bool) :: Bool where ... Source #
Equations
| Or a_6989586621680416437 = Apply (Apply (Apply (.@#@$) GetAnySym0) (Apply FoldMapSym0 Any_Sym0)) a_6989586621680416437 |
sOr :: forall (t :: t Bool). SFoldable t => Sing t -> Sing (Apply OrSym0 t :: Bool) :: Type Source #
sAny :: forall (t :: (~>) a Bool) (t :: t a). SFoldable t => Sing t -> Sing t -> Sing (Apply (Apply AnySym0 t) t :: Bool) :: Type Source #
sAll :: forall (t :: (~>) a Bool) (t :: t a). SFoldable t => Sing t -> Sing t -> Sing (Apply (Apply AllSym0 t) t :: Bool) :: Type Source #
type family MaximumBy (a :: (~>) a ((~>) a Ordering)) (a :: t a) :: a where ... Source #
Equations
| MaximumBy cmp a_6989586621680416399 = Apply (Apply Foldl1Sym0 (Let6989586621680416408Max'Sym2 cmp a_6989586621680416399)) a_6989586621680416399 |
sMaximumBy :: forall (t :: (~>) a ((~>) a Ordering)) (t :: t a). SFoldable t => Sing t -> Sing t -> Sing (Apply (Apply MaximumBySym0 t) t :: a) :: Type Source #
type family MinimumBy (a :: (~>) a ((~>) a Ordering)) (a :: t a) :: a where ... Source #
Equations
| MinimumBy cmp a_6989586621680416379 = Apply (Apply Foldl1Sym0 (Let6989586621680416388Min'Sym2 cmp a_6989586621680416379)) a_6989586621680416379 |
sMinimumBy :: forall (t :: (~>) a ((~>) a Ordering)) (t :: t a). SFoldable t => Sing t -> Sing t -> Sing (Apply (Apply MinimumBySym0 t) t :: a) :: Type Source #
sNotElem :: forall (t :: a) (t :: t a). (SFoldable t, SEq a) => Sing t -> Sing t -> Sing (Apply (Apply NotElemSym0 t) t :: Bool) :: Type Source #
type family Find (a :: (~>) a Bool) (a :: t a) :: Maybe a where ... Source #
Equations
| Find p a_6989586621680416352 = Apply (Apply (Apply (.@#@$) GetFirstSym0) (Apply FoldMapSym0 (Apply (Apply Lambda_6989586621680416361Sym0 p) a_6989586621680416352))) a_6989586621680416352 |
sFind :: forall (t :: (~>) a Bool) (t :: t a). SFoldable t => Sing t -> Sing t -> Sing (Apply (Apply FindSym0 t) t :: Maybe a) :: Type Source #
Defunctionalization symbols
data FoldSym0 :: (~>) (t m) m Source #
Instances
| (SFoldable t, SMonoid m) => SingI (FoldSym0 :: TyFun (t m) m -> Type) Source # | |
| SuppressUnusedWarnings (FoldSym0 :: TyFun (t m) m -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (FoldSym0 :: TyFun (t m) m -> Type) (a6989586621680416572 :: t m) Source # | |
data FoldMapSym0 :: (~>) ((~>) a m) ((~>) (t a) m) Source #
Instances
| (SFoldable t, SMonoid m) => SingI (FoldMapSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods sing :: Sing FoldMapSym0 Source # | |
| SuppressUnusedWarnings (FoldMapSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (FoldMapSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) (a6989586621680416576 :: a ~> m) Source # | |
Defined in Data.Foldable.Singletons type Apply (FoldMapSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) (a6989586621680416576 :: a ~> m) = FoldMapSym1 a6989586621680416576 :: TyFun (t a) m -> Type | |
data FoldMapSym1 (a6989586621680416576 :: (~>) a m) :: (~>) (t a) m Source #
Instances
| (SFoldable t, SMonoid m) => SingI1 (FoldMapSym1 :: (a ~> m) -> TyFun (t a) m -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
| (SFoldable t, SMonoid m, SingI d) => SingI (FoldMapSym1 d :: TyFun (t a) m -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods sing :: Sing (FoldMapSym1 d) Source # | |
| SuppressUnusedWarnings (FoldMapSym1 a6989586621680416576 :: TyFun (t a) m -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (FoldMapSym1 a6989586621680416576 :: TyFun (t a) m -> Type) (a6989586621680416577 :: t a) Source # | |
Defined in Data.Foldable.Singletons type Apply (FoldMapSym1 a6989586621680416576 :: TyFun (t a) m -> Type) (a6989586621680416577 :: t a) = FoldMap a6989586621680416576 a6989586621680416577 | |
type family FoldMapSym2 (a6989586621680416576 :: (~>) a m) (a6989586621680416577 :: t a) :: m where ... Source #
Equations
| FoldMapSym2 a6989586621680416576 a6989586621680416577 = FoldMap a6989586621680416576 a6989586621680416577 |
data FoldrSym0 :: (~>) ((~>) a ((~>) b b)) ((~>) b ((~>) (t a) b)) Source #
Instances
| SFoldable t => SingI (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) Source # | |
| SuppressUnusedWarnings (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (FoldrSym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) (a6989586621680416582 :: a ~> (b ~> b)) Source # | |
data FoldrSym1 (a6989586621680416582 :: (~>) a ((~>) b b)) :: (~>) b ((~>) (t a) b) Source #
Instances
| SFoldable t => SingI1 (FoldrSym1 :: (a ~> (b ~> b)) -> TyFun b (t a ~> b) -> Type) Source # | |
| (SFoldable t, SingI d) => SingI (FoldrSym1 d :: TyFun b (t a ~> b) -> Type) Source # | |
| SuppressUnusedWarnings (FoldrSym1 a6989586621680416582 :: TyFun b (t a ~> b) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (FoldrSym1 a6989586621680416582 :: TyFun b (t a ~> b) -> Type) (a6989586621680416583 :: b) Source # | |
data FoldrSym2 (a6989586621680416582 :: (~>) a ((~>) b b)) (a6989586621680416583 :: b) :: (~>) (t a) b Source #
Instances
| (SFoldable t, SingI d) => SingI1 (FoldrSym2 d :: b -> TyFun (t a) b -> Type) Source # | |
| SFoldable t => SingI2 (FoldrSym2 :: (a ~> (b ~> b)) -> b -> TyFun (t a) b -> Type) Source # | |
| (SFoldable t, SingI d1, SingI d2) => SingI (FoldrSym2 d1 d2 :: TyFun (t a) b -> Type) Source # | |
| SuppressUnusedWarnings (FoldrSym2 a6989586621680416582 a6989586621680416583 :: TyFun (t a) b -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (FoldrSym2 a6989586621680416582 a6989586621680416583 :: TyFun (t a) b -> Type) (a6989586621680416584 :: t a) Source # | |
type family FoldrSym3 (a6989586621680416582 :: (~>) a ((~>) b b)) (a6989586621680416583 :: b) (a6989586621680416584 :: t a) :: b where ... Source #
data Foldr'Sym0 :: (~>) ((~>) a ((~>) b b)) ((~>) b ((~>) (t a) b)) Source #
Instances
| SFoldable t => SingI (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods sing :: Sing Foldr'Sym0 Source # | |
| SuppressUnusedWarnings (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (Foldr'Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (t a ~> b)) -> Type) (a6989586621680416589 :: a ~> (b ~> b)) Source # | |
Defined in Data.Foldable.Singletons | |
data Foldr'Sym1 (a6989586621680416589 :: (~>) a ((~>) b b)) :: (~>) b ((~>) (t a) b) Source #
Instances
| SFoldable t => SingI1 (Foldr'Sym1 :: (a ~> (b ~> b)) -> TyFun b (t a ~> b) -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
| (SFoldable t, SingI d) => SingI (Foldr'Sym1 d :: TyFun b (t a ~> b) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods sing :: Sing (Foldr'Sym1 d) Source # | |
| SuppressUnusedWarnings (Foldr'Sym1 a6989586621680416589 :: TyFun b (t a ~> b) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (Foldr'Sym1 a6989586621680416589 :: TyFun b (t a ~> b) -> Type) (a6989586621680416590 :: b) Source # | |
Defined in Data.Foldable.Singletons type Apply (Foldr'Sym1 a6989586621680416589 :: TyFun b (t a ~> b) -> Type) (a6989586621680416590 :: b) = Foldr'Sym2 a6989586621680416589 a6989586621680416590 :: TyFun (t a) b -> Type | |
data Foldr'Sym2 (a6989586621680416589 :: (~>) a ((~>) b b)) (a6989586621680416590 :: b) :: (~>) (t a) b Source #
Instances
| (SFoldable t, SingI d) => SingI1 (Foldr'Sym2 d :: b -> TyFun (t a) b -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
| SFoldable t => SingI2 (Foldr'Sym2 :: (a ~> (b ~> b)) -> b -> TyFun (t a) b -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
| (SFoldable t, SingI d1, SingI d2) => SingI (Foldr'Sym2 d1 d2 :: TyFun (t a) b -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods sing :: Sing (Foldr'Sym2 d1 d2) Source # | |
| SuppressUnusedWarnings (Foldr'Sym2 a6989586621680416589 a6989586621680416590 :: TyFun (t a) b -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (Foldr'Sym2 a6989586621680416589 a6989586621680416590 :: TyFun (t a) b -> Type) (a6989586621680416591 :: t a) Source # | |
Defined in Data.Foldable.Singletons type Apply (Foldr'Sym2 a6989586621680416589 a6989586621680416590 :: TyFun (t a) b -> Type) (a6989586621680416591 :: t a) = Foldr' a6989586621680416589 a6989586621680416590 a6989586621680416591 | |
type family Foldr'Sym3 (a6989586621680416589 :: (~>) a ((~>) b b)) (a6989586621680416590 :: b) (a6989586621680416591 :: t a) :: b where ... Source #
Equations
| Foldr'Sym3 a6989586621680416589 a6989586621680416590 a6989586621680416591 = Foldr' a6989586621680416589 a6989586621680416590 a6989586621680416591 |
data FoldlSym0 :: (~>) ((~>) b ((~>) a b)) ((~>) b ((~>) (t a) b)) Source #
Instances
| SFoldable t => SingI (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) Source # | |
| SuppressUnusedWarnings (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (FoldlSym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) (a6989586621680416596 :: b ~> (a ~> b)) Source # | |
data FoldlSym1 (a6989586621680416596 :: (~>) b ((~>) a b)) :: (~>) b ((~>) (t a) b) Source #
Instances
| SFoldable t => SingI1 (FoldlSym1 :: (b ~> (a ~> b)) -> TyFun b (t a ~> b) -> Type) Source # | |
| (SFoldable t, SingI d) => SingI (FoldlSym1 d :: TyFun b (t a ~> b) -> Type) Source # | |
| SuppressUnusedWarnings (FoldlSym1 a6989586621680416596 :: TyFun b (t a ~> b) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (FoldlSym1 a6989586621680416596 :: TyFun b (t a ~> b) -> Type) (a6989586621680416597 :: b) Source # | |
data FoldlSym2 (a6989586621680416596 :: (~>) b ((~>) a b)) (a6989586621680416597 :: b) :: (~>) (t a) b Source #
Instances
| (SFoldable t, SingI d) => SingI1 (FoldlSym2 d :: b -> TyFun (t a) b -> Type) Source # | |
| SFoldable t => SingI2 (FoldlSym2 :: (b ~> (a ~> b)) -> b -> TyFun (t a) b -> Type) Source # | |
| (SFoldable t, SingI d1, SingI d2) => SingI (FoldlSym2 d1 d2 :: TyFun (t a) b -> Type) Source # | |
| SuppressUnusedWarnings (FoldlSym2 a6989586621680416596 a6989586621680416597 :: TyFun (t a) b -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (FoldlSym2 a6989586621680416596 a6989586621680416597 :: TyFun (t a) b -> Type) (a6989586621680416598 :: t a) Source # | |
type family FoldlSym3 (a6989586621680416596 :: (~>) b ((~>) a b)) (a6989586621680416597 :: b) (a6989586621680416598 :: t a) :: b where ... Source #
data Foldl'Sym0 :: (~>) ((~>) b ((~>) a b)) ((~>) b ((~>) (t a) b)) Source #
Instances
| SFoldable t => SingI (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods sing :: Sing Foldl'Sym0 Source # | |
| SuppressUnusedWarnings (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) (a6989586621680416603 :: b ~> (a ~> b)) Source # | |
Defined in Data.Foldable.Singletons | |
data Foldl'Sym1 (a6989586621680416603 :: (~>) b ((~>) a b)) :: (~>) b ((~>) (t a) b) Source #
Instances
| SFoldable t => SingI1 (Foldl'Sym1 :: (b ~> (a ~> b)) -> TyFun b (t a ~> b) -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
| (SFoldable t, SingI d) => SingI (Foldl'Sym1 d :: TyFun b (t a ~> b) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods sing :: Sing (Foldl'Sym1 d) Source # | |
| SuppressUnusedWarnings (Foldl'Sym1 a6989586621680416603 :: TyFun b (t a ~> b) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (Foldl'Sym1 a6989586621680416603 :: TyFun b (t a ~> b) -> Type) (a6989586621680416604 :: b) Source # | |
Defined in Data.Foldable.Singletons type Apply (Foldl'Sym1 a6989586621680416603 :: TyFun b (t a ~> b) -> Type) (a6989586621680416604 :: b) = Foldl'Sym2 a6989586621680416603 a6989586621680416604 :: TyFun (t a) b -> Type | |
data Foldl'Sym2 (a6989586621680416603 :: (~>) b ((~>) a b)) (a6989586621680416604 :: b) :: (~>) (t a) b Source #
Instances
| (SFoldable t, SingI d) => SingI1 (Foldl'Sym2 d :: b -> TyFun (t a) b -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
| SFoldable t => SingI2 (Foldl'Sym2 :: (b ~> (a ~> b)) -> b -> TyFun (t a) b -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
| (SFoldable t, SingI d1, SingI d2) => SingI (Foldl'Sym2 d1 d2 :: TyFun (t a) b -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods sing :: Sing (Foldl'Sym2 d1 d2) Source # | |
| SuppressUnusedWarnings (Foldl'Sym2 a6989586621680416603 a6989586621680416604 :: TyFun (t a) b -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (Foldl'Sym2 a6989586621680416603 a6989586621680416604 :: TyFun (t a) b -> Type) (a6989586621680416605 :: t a) Source # | |
Defined in Data.Foldable.Singletons type Apply (Foldl'Sym2 a6989586621680416603 a6989586621680416604 :: TyFun (t a) b -> Type) (a6989586621680416605 :: t a) = Foldl' a6989586621680416603 a6989586621680416604 a6989586621680416605 | |
type family Foldl'Sym3 (a6989586621680416603 :: (~>) b ((~>) a b)) (a6989586621680416604 :: b) (a6989586621680416605 :: t a) :: b where ... Source #
Equations
| Foldl'Sym3 a6989586621680416603 a6989586621680416604 a6989586621680416605 = Foldl' a6989586621680416603 a6989586621680416604 a6989586621680416605 |
data Foldr1Sym0 :: (~>) ((~>) a ((~>) a a)) ((~>) (t a) a) Source #
Instances
| SFoldable t => SingI (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods sing :: Sing Foldr1Sym0 Source # | |
| SuppressUnusedWarnings (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (Foldr1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) (a6989586621680416609 :: a ~> (a ~> a)) Source # | |
Defined in Data.Foldable.Singletons | |
data Foldr1Sym1 (a6989586621680416609 :: (~>) a ((~>) a a)) :: (~>) (t a) a Source #
Instances
| SFoldable t => SingI1 (Foldr1Sym1 :: (a ~> (a ~> a)) -> TyFun (t a) a -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
| (SFoldable t, SingI d) => SingI (Foldr1Sym1 d :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods sing :: Sing (Foldr1Sym1 d) Source # | |
| SuppressUnusedWarnings (Foldr1Sym1 a6989586621680416609 :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (Foldr1Sym1 a6989586621680416609 :: TyFun (t a) a -> Type) (a6989586621680416610 :: t a) Source # | |
Defined in Data.Foldable.Singletons type Apply (Foldr1Sym1 a6989586621680416609 :: TyFun (t a) a -> Type) (a6989586621680416610 :: t a) = Foldr1 a6989586621680416609 a6989586621680416610 | |
type family Foldr1Sym2 (a6989586621680416609 :: (~>) a ((~>) a a)) (a6989586621680416610 :: t a) :: a where ... Source #
Equations
| Foldr1Sym2 a6989586621680416609 a6989586621680416610 = Foldr1 a6989586621680416609 a6989586621680416610 |
data Foldl1Sym0 :: (~>) ((~>) a ((~>) a a)) ((~>) (t a) a) Source #
Instances
| SFoldable t => SingI (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods sing :: Sing Foldl1Sym0 Source # | |
| SuppressUnusedWarnings (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (Foldl1Sym0 :: TyFun (a ~> (a ~> a)) (t a ~> a) -> Type) (a6989586621680416614 :: a ~> (a ~> a)) Source # | |
Defined in Data.Foldable.Singletons | |
data Foldl1Sym1 (a6989586621680416614 :: (~>) a ((~>) a a)) :: (~>) (t a) a Source #
Instances
| SFoldable t => SingI1 (Foldl1Sym1 :: (a ~> (a ~> a)) -> TyFun (t a) a -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
| (SFoldable t, SingI d) => SingI (Foldl1Sym1 d :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods sing :: Sing (Foldl1Sym1 d) Source # | |
| SuppressUnusedWarnings (Foldl1Sym1 a6989586621680416614 :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (Foldl1Sym1 a6989586621680416614 :: TyFun (t a) a -> Type) (a6989586621680416615 :: t a) Source # | |
Defined in Data.Foldable.Singletons type Apply (Foldl1Sym1 a6989586621680416614 :: TyFun (t a) a -> Type) (a6989586621680416615 :: t a) = Foldl1 a6989586621680416614 a6989586621680416615 | |
type family Foldl1Sym2 (a6989586621680416614 :: (~>) a ((~>) a a)) (a6989586621680416615 :: t a) :: a where ... Source #
Equations
| Foldl1Sym2 a6989586621680416614 a6989586621680416615 = Foldl1 a6989586621680416614 a6989586621680416615 |
data ToListSym0 :: (~>) (t a) [a] Source #
Instances
| SFoldable t => SingI (ToListSym0 :: TyFun (t a) [a] -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods sing :: Sing ToListSym0 Source # | |
| SuppressUnusedWarnings (ToListSym0 :: TyFun (t a) [a] -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (ToListSym0 :: TyFun (t a) [a] -> Type) (a6989586621680416618 :: t a) Source # | |
Defined in Data.Foldable.Singletons type Apply (ToListSym0 :: TyFun (t a) [a] -> Type) (a6989586621680416618 :: t a) = ToList a6989586621680416618 | |
type family ToListSym1 (a6989586621680416618 :: t a) :: [a] where ... Source #
Equations
| ToListSym1 a6989586621680416618 = ToList a6989586621680416618 |
data NullSym0 :: (~>) (t a) Bool Source #
Instances
| SFoldable t => SingI (NullSym0 :: TyFun (t a) Bool -> Type) Source # | |
| SuppressUnusedWarnings (NullSym0 :: TyFun (t a) Bool -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (NullSym0 :: TyFun (t a) Bool -> Type) (a6989586621680416621 :: t a) Source # | |
data LengthSym0 :: (~>) (t a) Natural Source #
Instances
| SFoldable t => SingI (LengthSym0 :: TyFun (t a) Natural -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods sing :: Sing LengthSym0 Source # | |
| SuppressUnusedWarnings (LengthSym0 :: TyFun (t a) Natural -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (LengthSym0 :: TyFun (t a) Natural -> Type) (a6989586621680416624 :: t a) Source # | |
Defined in Data.Foldable.Singletons | |
type family LengthSym1 (a6989586621680416624 :: t a) :: Natural where ... Source #
Equations
| LengthSym1 a6989586621680416624 = Length a6989586621680416624 |
data ElemSym0 :: (~>) a ((~>) (t a) Bool) Source #
Instances
| (SFoldable t, SEq a) => SingI (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) Source # | |
| SuppressUnusedWarnings (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680416628 :: a) Source # | |
data ElemSym1 (a6989586621680416628 :: a) :: (~>) (t a) Bool Source #
Instances
| (SFoldable t, SEq a) => SingI1 (ElemSym1 :: a -> TyFun (t a) Bool -> Type) Source # | |
| (SFoldable t, SEq a, SingI d) => SingI (ElemSym1 d :: TyFun (t a) Bool -> Type) Source # | |
| SuppressUnusedWarnings (ElemSym1 a6989586621680416628 :: TyFun (t a) Bool -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (ElemSym1 a6989586621680416628 :: TyFun (t a) Bool -> Type) (a6989586621680416629 :: t a) Source # | |
type family ElemSym2 (a6989586621680416628 :: a) (a6989586621680416629 :: t a) :: Bool where ... Source #
data MaximumSym0 :: (~>) (t a) a Source #
Instances
| (SFoldable t, SOrd a) => SingI (MaximumSym0 :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods sing :: Sing MaximumSym0 Source # | |
| SuppressUnusedWarnings (MaximumSym0 :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (MaximumSym0 :: TyFun (t a) a -> Type) (a6989586621680416632 :: t a) Source # | |
Defined in Data.Foldable.Singletons type Apply (MaximumSym0 :: TyFun (t a) a -> Type) (a6989586621680416632 :: t a) = Maximum a6989586621680416632 | |
type family MaximumSym1 (a6989586621680416632 :: t a) :: a where ... Source #
Equations
| MaximumSym1 a6989586621680416632 = Maximum a6989586621680416632 |
data MinimumSym0 :: (~>) (t a) a Source #
Instances
| (SFoldable t, SOrd a) => SingI (MinimumSym0 :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods sing :: Sing MinimumSym0 Source # | |
| SuppressUnusedWarnings (MinimumSym0 :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (MinimumSym0 :: TyFun (t a) a -> Type) (a6989586621680416635 :: t a) Source # | |
Defined in Data.Foldable.Singletons type Apply (MinimumSym0 :: TyFun (t a) a -> Type) (a6989586621680416635 :: t a) = Minimum a6989586621680416635 | |
type family MinimumSym1 (a6989586621680416635 :: t a) :: a where ... Source #
Equations
| MinimumSym1 a6989586621680416635 = Minimum a6989586621680416635 |
data SumSym0 :: (~>) (t a) a Source #
Instances
| (SFoldable t, SNum a) => SingI (SumSym0 :: TyFun (t a) a -> Type) Source # | |
| SuppressUnusedWarnings (SumSym0 :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (SumSym0 :: TyFun (t a) a -> Type) (a6989586621680416638 :: t a) Source # | |
data ProductSym0 :: (~>) (t a) a Source #
Instances
| (SFoldable t, SNum a) => SingI (ProductSym0 :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods sing :: Sing ProductSym0 Source # | |
| SuppressUnusedWarnings (ProductSym0 :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (ProductSym0 :: TyFun (t a) a -> Type) (a6989586621680416641 :: t a) Source # | |
Defined in Data.Foldable.Singletons type Apply (ProductSym0 :: TyFun (t a) a -> Type) (a6989586621680416641 :: t a) = Product a6989586621680416641 | |
type family ProductSym1 (a6989586621680416641 :: t a) :: a where ... Source #
Equations
| ProductSym1 a6989586621680416641 = Product a6989586621680416641 |
data FoldrMSym0 :: (~>) ((~>) a ((~>) b (m b))) ((~>) b ((~>) (t a) (m b))) Source #
Instances
| (SFoldable t, SMonad m) => SingI (FoldrMSym0 :: TyFun (a ~> (b ~> m b)) (b ~> (t a ~> m b)) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods sing :: Sing FoldrMSym0 Source # | |
| SuppressUnusedWarnings (FoldrMSym0 :: TyFun (a ~> (b ~> m b)) (b ~> (t a ~> m b)) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (FoldrMSym0 :: TyFun (a ~> (b ~> m b)) (b ~> (t a ~> m b)) -> Type) (a6989586621680416556 :: a ~> (b ~> m b)) Source # | |
Defined in Data.Foldable.Singletons | |
data FoldrMSym1 (a6989586621680416556 :: (~>) a ((~>) b (m b))) :: (~>) b ((~>) (t a) (m b)) Source #
Instances
| (SFoldable t, SMonad m) => SingI1 (FoldrMSym1 :: (a ~> (b ~> m b)) -> TyFun b (t a ~> m b) -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
| (SFoldable t, SMonad m, SingI d) => SingI (FoldrMSym1 d :: TyFun b (t a ~> m b) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods sing :: Sing (FoldrMSym1 d) Source # | |
| SuppressUnusedWarnings (FoldrMSym1 a6989586621680416556 :: TyFun b (t a ~> m b) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (FoldrMSym1 a6989586621680416556 :: TyFun b (t a ~> m b) -> Type) (a6989586621680416557 :: b) Source # | |
Defined in Data.Foldable.Singletons type Apply (FoldrMSym1 a6989586621680416556 :: TyFun b (t a ~> m b) -> Type) (a6989586621680416557 :: b) = FoldrMSym2 a6989586621680416556 a6989586621680416557 :: TyFun (t a) (m b) -> Type | |
data FoldrMSym2 (a6989586621680416556 :: (~>) a ((~>) b (m b))) (a6989586621680416557 :: b) :: (~>) (t a) (m b) Source #
Instances
| (SFoldable t, SMonad m, SingI d) => SingI1 (FoldrMSym2 d :: b -> TyFun (t a) (m b) -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
| (SFoldable t, SMonad m) => SingI2 (FoldrMSym2 :: (a ~> (b ~> m b)) -> b -> TyFun (t a) (m b) -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
| (SFoldable t, SMonad m, SingI d1, SingI d2) => SingI (FoldrMSym2 d1 d2 :: TyFun (t a) (m b) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods sing :: Sing (FoldrMSym2 d1 d2) Source # | |
| SuppressUnusedWarnings (FoldrMSym2 a6989586621680416556 a6989586621680416557 :: TyFun (t a) (m b) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (FoldrMSym2 a6989586621680416556 a6989586621680416557 :: TyFun (t a) (m b) -> Type) (a6989586621680416558 :: t a) Source # | |
Defined in Data.Foldable.Singletons type Apply (FoldrMSym2 a6989586621680416556 a6989586621680416557 :: TyFun (t a) (m b) -> Type) (a6989586621680416558 :: t a) = FoldrM a6989586621680416556 a6989586621680416557 a6989586621680416558 | |
type family FoldrMSym3 (a6989586621680416556 :: (~>) a ((~>) b (m b))) (a6989586621680416557 :: b) (a6989586621680416558 :: t a) :: m b where ... Source #
Equations
| FoldrMSym3 a6989586621680416556 a6989586621680416557 a6989586621680416558 = FoldrM a6989586621680416556 a6989586621680416557 a6989586621680416558 |
data FoldlMSym0 :: (~>) ((~>) b ((~>) a (m b))) ((~>) b ((~>) (t a) (m b))) Source #
Instances
| (SFoldable t, SMonad m) => SingI (FoldlMSym0 :: TyFun (b ~> (a ~> m b)) (b ~> (t a ~> m b)) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods sing :: Sing FoldlMSym0 Source # | |
| SuppressUnusedWarnings (FoldlMSym0 :: TyFun (b ~> (a ~> m b)) (b ~> (t a ~> m b)) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (FoldlMSym0 :: TyFun (b ~> (a ~> m b)) (b ~> (t a ~> m b)) -> Type) (a6989586621680416538 :: b ~> (a ~> m b)) Source # | |
Defined in Data.Foldable.Singletons | |
data FoldlMSym1 (a6989586621680416538 :: (~>) b ((~>) a (m b))) :: (~>) b ((~>) (t a) (m b)) Source #
Instances
| (SFoldable t, SMonad m) => SingI1 (FoldlMSym1 :: (b ~> (a ~> m b)) -> TyFun b (t a ~> m b) -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
| (SFoldable t, SMonad m, SingI d) => SingI (FoldlMSym1 d :: TyFun b (t a ~> m b) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods sing :: Sing (FoldlMSym1 d) Source # | |
| SuppressUnusedWarnings (FoldlMSym1 a6989586621680416538 :: TyFun b (t a ~> m b) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (FoldlMSym1 a6989586621680416538 :: TyFun b (t a ~> m b) -> Type) (a6989586621680416539 :: b) Source # | |
Defined in Data.Foldable.Singletons type Apply (FoldlMSym1 a6989586621680416538 :: TyFun b (t a ~> m b) -> Type) (a6989586621680416539 :: b) = FoldlMSym2 a6989586621680416538 a6989586621680416539 :: TyFun (t a) (m b) -> Type | |
data FoldlMSym2 (a6989586621680416538 :: (~>) b ((~>) a (m b))) (a6989586621680416539 :: b) :: (~>) (t a) (m b) Source #
Instances
| (SFoldable t, SMonad m, SingI d) => SingI1 (FoldlMSym2 d :: b -> TyFun (t a) (m b) -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
| (SFoldable t, SMonad m) => SingI2 (FoldlMSym2 :: (b ~> (a ~> m b)) -> b -> TyFun (t a) (m b) -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
| (SFoldable t, SMonad m, SingI d1, SingI d2) => SingI (FoldlMSym2 d1 d2 :: TyFun (t a) (m b) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods sing :: Sing (FoldlMSym2 d1 d2) Source # | |
| SuppressUnusedWarnings (FoldlMSym2 a6989586621680416538 a6989586621680416539 :: TyFun (t a) (m b) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (FoldlMSym2 a6989586621680416538 a6989586621680416539 :: TyFun (t a) (m b) -> Type) (a6989586621680416540 :: t a) Source # | |
Defined in Data.Foldable.Singletons type Apply (FoldlMSym2 a6989586621680416538 a6989586621680416539 :: TyFun (t a) (m b) -> Type) (a6989586621680416540 :: t a) = FoldlM a6989586621680416538 a6989586621680416539 a6989586621680416540 | |
type family FoldlMSym3 (a6989586621680416538 :: (~>) b ((~>) a (m b))) (a6989586621680416539 :: b) (a6989586621680416540 :: t a) :: m b where ... Source #
Equations
| FoldlMSym3 a6989586621680416538 a6989586621680416539 a6989586621680416540 = FoldlM a6989586621680416538 a6989586621680416539 a6989586621680416540 |
data Traverse_Sym0 :: (~>) ((~>) a (f b)) ((~>) (t a) (f ())) Source #
Instances
| (SFoldable t, SApplicative f) => SingI (Traverse_Sym0 :: TyFun (a ~> f b) (t a ~> f ()) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods sing :: Sing Traverse_Sym0 Source # | |
| SuppressUnusedWarnings (Traverse_Sym0 :: TyFun (a ~> f b) (t a ~> f ()) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (Traverse_Sym0 :: TyFun (a ~> f b) (t a ~> f ()) -> Type) (a6989586621680416530 :: a ~> f b) Source # | |
Defined in Data.Foldable.Singletons type Apply (Traverse_Sym0 :: TyFun (a ~> f b) (t a ~> f ()) -> Type) (a6989586621680416530 :: a ~> f b) = Traverse_Sym1 a6989586621680416530 :: TyFun (t a) (f ()) -> Type | |
data Traverse_Sym1 (a6989586621680416530 :: (~>) a (f b)) :: (~>) (t a) (f ()) Source #
Instances
| (SFoldable t, SApplicative f) => SingI1 (Traverse_Sym1 :: (a ~> f b) -> TyFun (t a) (f ()) -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
| (SFoldable t, SApplicative f, SingI d) => SingI (Traverse_Sym1 d :: TyFun (t a) (f ()) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods sing :: Sing (Traverse_Sym1 d) Source # | |
| SuppressUnusedWarnings (Traverse_Sym1 a6989586621680416530 :: TyFun (t a) (f ()) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (Traverse_Sym1 a6989586621680416530 :: TyFun (t a) (f ()) -> Type) (a6989586621680416531 :: t a) Source # | |
Defined in Data.Foldable.Singletons type Apply (Traverse_Sym1 a6989586621680416530 :: TyFun (t a) (f ()) -> Type) (a6989586621680416531 :: t a) = Traverse_ a6989586621680416530 a6989586621680416531 | |
type family Traverse_Sym2 (a6989586621680416530 :: (~>) a (f b)) (a6989586621680416531 :: t a) :: f () where ... Source #
Equations
| Traverse_Sym2 a6989586621680416530 a6989586621680416531 = Traverse_ a6989586621680416530 a6989586621680416531 |
data For_Sym0 :: (~>) (t a) ((~>) ((~>) a (f b)) (f ())) Source #
Instances
| (SFoldable t, SApplicative f) => SingI (For_Sym0 :: TyFun (t a) ((a ~> f b) ~> f ()) -> Type) Source # | |
| SuppressUnusedWarnings (For_Sym0 :: TyFun (t a) ((a ~> f b) ~> f ()) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (For_Sym0 :: TyFun (t a) ((a ~> f b) ~> f ()) -> Type) (a6989586621680416521 :: t a) Source # | |
data For_Sym1 (a6989586621680416521 :: t a) :: (~>) ((~>) a (f b)) (f ()) Source #
Instances
| (SFoldable t, SApplicative f) => SingI1 (For_Sym1 :: t a -> TyFun (a ~> f b) (f ()) -> Type) Source # | |
| (SFoldable t, SApplicative f, SingI d) => SingI (For_Sym1 d :: TyFun (a ~> f b) (f ()) -> Type) Source # | |
| SuppressUnusedWarnings (For_Sym1 a6989586621680416521 :: TyFun (a ~> f b) (f ()) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (For_Sym1 a6989586621680416521 :: TyFun (a ~> f b) (f ()) -> Type) (a6989586621680416522 :: a ~> f b) Source # | |
type family For_Sym2 (a6989586621680416521 :: t a) (a6989586621680416522 :: (~>) a (f b)) :: f () where ... Source #
data SequenceA_Sym0 :: (~>) (t (f a)) (f ()) Source #
Instances
| (SFoldable t, SApplicative f) => SingI (SequenceA_Sym0 :: TyFun (t (f a)) (f ()) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods | |
| SuppressUnusedWarnings (SequenceA_Sym0 :: TyFun (t (f a)) (f ()) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (SequenceA_Sym0 :: TyFun (t (f a)) (f ()) -> Type) (a6989586621680416492 :: t (f a)) Source # | |
Defined in Data.Foldable.Singletons type Apply (SequenceA_Sym0 :: TyFun (t (f a)) (f ()) -> Type) (a6989586621680416492 :: t (f a)) = SequenceA_ a6989586621680416492 | |
type family SequenceA_Sym1 (a6989586621680416492 :: t (f a)) :: f () where ... Source #
Equations
| SequenceA_Sym1 a6989586621680416492 = SequenceA_ a6989586621680416492 |
data AsumSym0 :: (~>) (t (f a)) (f a) Source #
Instances
| (SFoldable t, SAlternative f) => SingI (AsumSym0 :: TyFun (t (f a)) (f a) -> Type) Source # | |
| SuppressUnusedWarnings (AsumSym0 :: TyFun (t (f a)) (f a) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (AsumSym0 :: TyFun (t (f a)) (f a) -> Type) (a6989586621680416480 :: t (f a)) Source # | |
data MapM_Sym0 :: (~>) ((~>) a (m b)) ((~>) (t a) (m ())) Source #
Instances
| (SFoldable t, SMonad m) => SingI (MapM_Sym0 :: TyFun (a ~> m b) (t a ~> m ()) -> Type) Source # | |
| SuppressUnusedWarnings (MapM_Sym0 :: TyFun (a ~> m b) (t a ~> m ()) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (MapM_Sym0 :: TyFun (a ~> m b) (t a ~> m ()) -> Type) (a6989586621680416510 :: a ~> m b) Source # | |
data MapM_Sym1 (a6989586621680416510 :: (~>) a (m b)) :: (~>) (t a) (m ()) Source #
Instances
| (SFoldable t, SMonad m) => SingI1 (MapM_Sym1 :: (a ~> m b) -> TyFun (t a) (m ()) -> Type) Source # | |
| (SFoldable t, SMonad m, SingI d) => SingI (MapM_Sym1 d :: TyFun (t a) (m ()) -> Type) Source # | |
| SuppressUnusedWarnings (MapM_Sym1 a6989586621680416510 :: TyFun (t a) (m ()) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (MapM_Sym1 a6989586621680416510 :: TyFun (t a) (m ()) -> Type) (a6989586621680416511 :: t a) Source # | |
type family MapM_Sym2 (a6989586621680416510 :: (~>) a (m b)) (a6989586621680416511 :: t a) :: m () where ... Source #
data ForM_Sym0 :: (~>) (t a) ((~>) ((~>) a (m b)) (m ())) Source #
Instances
| (SFoldable t, SMonad m) => SingI (ForM_Sym0 :: TyFun (t a) ((a ~> m b) ~> m ()) -> Type) Source # | |
| SuppressUnusedWarnings (ForM_Sym0 :: TyFun (t a) ((a ~> m b) ~> m ()) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (ForM_Sym0 :: TyFun (t a) ((a ~> m b) ~> m ()) -> Type) (a6989586621680416501 :: t a) Source # | |
data ForM_Sym1 (a6989586621680416501 :: t a) :: (~>) ((~>) a (m b)) (m ()) Source #
Instances
| (SFoldable t, SMonad m) => SingI1 (ForM_Sym1 :: t a -> TyFun (a ~> m b) (m ()) -> Type) Source # | |
| (SFoldable t, SMonad m, SingI d) => SingI (ForM_Sym1 d :: TyFun (a ~> m b) (m ()) -> Type) Source # | |
| SuppressUnusedWarnings (ForM_Sym1 a6989586621680416501 :: TyFun (a ~> m b) (m ()) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (ForM_Sym1 a6989586621680416501 :: TyFun (a ~> m b) (m ()) -> Type) (a6989586621680416502 :: a ~> m b) Source # | |
type family ForM_Sym2 (a6989586621680416501 :: t a) (a6989586621680416502 :: (~>) a (m b)) :: m () where ... Source #
data Sequence_Sym0 :: (~>) (t (m a)) (m ()) Source #
Instances
| (SFoldable t, SMonad m) => SingI (Sequence_Sym0 :: TyFun (t (m a)) (m ()) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods sing :: Sing Sequence_Sym0 Source # | |
| SuppressUnusedWarnings (Sequence_Sym0 :: TyFun (t (m a)) (m ()) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (Sequence_Sym0 :: TyFun (t (m a)) (m ()) -> Type) (a6989586621680416486 :: t (m a)) Source # | |
Defined in Data.Foldable.Singletons type Apply (Sequence_Sym0 :: TyFun (t (m a)) (m ()) -> Type) (a6989586621680416486 :: t (m a)) = Sequence_ a6989586621680416486 | |
type family Sequence_Sym1 (a6989586621680416486 :: t (m a)) :: m () where ... Source #
Equations
| Sequence_Sym1 a6989586621680416486 = Sequence_ a6989586621680416486 |
data MsumSym0 :: (~>) (t (m a)) (m a) Source #
Instances
| (SFoldable t, SMonadPlus m) => SingI (MsumSym0 :: TyFun (t (m a)) (m a) -> Type) Source # | |
| SuppressUnusedWarnings (MsumSym0 :: TyFun (t (m a)) (m a) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (MsumSym0 :: TyFun (t (m a)) (m a) -> Type) (a6989586621680416474 :: t (m a)) Source # | |
data ConcatSym0 :: (~>) (t [a]) [a] Source #
Instances
| SFoldable t => SingI (ConcatSym0 :: TyFun (t [a]) [a] -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods sing :: Sing ConcatSym0 Source # | |
| SuppressUnusedWarnings (ConcatSym0 :: TyFun (t [a]) [a] -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (ConcatSym0 :: TyFun (t [a]) [a] -> Type) (a6989586621680416463 :: t [a]) Source # | |
Defined in Data.Foldable.Singletons type Apply (ConcatSym0 :: TyFun (t [a]) [a] -> Type) (a6989586621680416463 :: t [a]) = Concat a6989586621680416463 | |
type family ConcatSym1 (a6989586621680416463 :: t [a]) :: [a] where ... Source #
Equations
| ConcatSym1 a6989586621680416463 = Concat a6989586621680416463 |
data ConcatMapSym0 :: (~>) ((~>) a [b]) ((~>) (t a) [b]) Source #
Instances
| SFoldable t => SingI (ConcatMapSym0 :: TyFun (a ~> [b]) (t a ~> [b]) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods sing :: Sing ConcatMapSym0 Source # | |
| SuppressUnusedWarnings (ConcatMapSym0 :: TyFun (a ~> [b]) (t a ~> [b]) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (ConcatMapSym0 :: TyFun (a ~> [b]) (t a ~> [b]) -> Type) (a6989586621680416452 :: a ~> [b]) Source # | |
Defined in Data.Foldable.Singletons type Apply (ConcatMapSym0 :: TyFun (a ~> [b]) (t a ~> [b]) -> Type) (a6989586621680416452 :: a ~> [b]) = ConcatMapSym1 a6989586621680416452 :: TyFun (t a) [b] -> Type | |
data ConcatMapSym1 (a6989586621680416452 :: (~>) a [b]) :: (~>) (t a) [b] Source #
Instances
| SFoldable t => SingI1 (ConcatMapSym1 :: (a ~> [b]) -> TyFun (t a) [b] -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
| (SFoldable t, SingI d) => SingI (ConcatMapSym1 d :: TyFun (t a) [b] -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods sing :: Sing (ConcatMapSym1 d) Source # | |
| SuppressUnusedWarnings (ConcatMapSym1 a6989586621680416452 :: TyFun (t a) [b] -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (ConcatMapSym1 a6989586621680416452 :: TyFun (t a) [b] -> Type) (a6989586621680416453 :: t a) Source # | |
Defined in Data.Foldable.Singletons type Apply (ConcatMapSym1 a6989586621680416452 :: TyFun (t a) [b] -> Type) (a6989586621680416453 :: t a) = ConcatMap a6989586621680416452 a6989586621680416453 | |
type family ConcatMapSym2 (a6989586621680416452 :: (~>) a [b]) (a6989586621680416453 :: t a) :: [b] where ... Source #
Equations
| ConcatMapSym2 a6989586621680416452 a6989586621680416453 = ConcatMap a6989586621680416452 a6989586621680416453 |
data AndSym0 :: (~>) (t Bool) Bool Source #
Instances
| SFoldable t => SingI (AndSym0 :: TyFun (t Bool) Bool -> Type) Source # | |
| SuppressUnusedWarnings (AndSym0 :: TyFun (t Bool) Bool -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (AndSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680416447 :: t Bool) Source # | |
data OrSym0 :: (~>) (t Bool) Bool Source #
Instances
| SFoldable t => SingI (OrSym0 :: TyFun (t Bool) Bool -> Type) Source # | |
| SuppressUnusedWarnings (OrSym0 :: TyFun (t Bool) Bool -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (OrSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680416441 :: t Bool) Source # | |
data AnySym0 :: (~>) ((~>) a Bool) ((~>) (t a) Bool) Source #
Instances
| SFoldable t => SingI (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) Source # | |
| SuppressUnusedWarnings (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) (a6989586621680416433 :: a ~> Bool) Source # | |
data AnySym1 (a6989586621680416433 :: (~>) a Bool) :: (~>) (t a) Bool Source #
Instances
| SFoldable t => SingI1 (AnySym1 :: (a ~> Bool) -> TyFun (t a) Bool -> Type) Source # | |
| (SFoldable t, SingI d) => SingI (AnySym1 d :: TyFun (t a) Bool -> Type) Source # | |
| SuppressUnusedWarnings (AnySym1 a6989586621680416433 :: TyFun (t a) Bool -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (AnySym1 a6989586621680416433 :: TyFun (t a) Bool -> Type) (a6989586621680416434 :: t a) Source # | |
type family AnySym2 (a6989586621680416433 :: (~>) a Bool) (a6989586621680416434 :: t a) :: Bool where ... Source #
data AllSym0 :: (~>) ((~>) a Bool) ((~>) (t a) Bool) Source #
Instances
| SFoldable t => SingI (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) Source # | |
| SuppressUnusedWarnings (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) (a6989586621680416424 :: a ~> Bool) Source # | |
data AllSym1 (a6989586621680416424 :: (~>) a Bool) :: (~>) (t a) Bool Source #
Instances
| SFoldable t => SingI1 (AllSym1 :: (a ~> Bool) -> TyFun (t a) Bool -> Type) Source # | |
| (SFoldable t, SingI d) => SingI (AllSym1 d :: TyFun (t a) Bool -> Type) Source # | |
| SuppressUnusedWarnings (AllSym1 a6989586621680416424 :: TyFun (t a) Bool -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (AllSym1 a6989586621680416424 :: TyFun (t a) Bool -> Type) (a6989586621680416425 :: t a) Source # | |
type family AllSym2 (a6989586621680416424 :: (~>) a Bool) (a6989586621680416425 :: t a) :: Bool where ... Source #
data MaximumBySym0 :: (~>) ((~>) a ((~>) a Ordering)) ((~>) (t a) a) Source #
Instances
| SFoldable t => SingI (MaximumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods sing :: Sing MaximumBySym0 Source # | |
| SuppressUnusedWarnings (MaximumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (MaximumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) (a6989586621680416404 :: a ~> (a ~> Ordering)) Source # | |
Defined in Data.Foldable.Singletons | |
data MaximumBySym1 (a6989586621680416404 :: (~>) a ((~>) a Ordering)) :: (~>) (t a) a Source #
Instances
| SFoldable t => SingI1 (MaximumBySym1 :: (a ~> (a ~> Ordering)) -> TyFun (t a) a -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
| (SFoldable t, SingI d) => SingI (MaximumBySym1 d :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods sing :: Sing (MaximumBySym1 d) Source # | |
| SuppressUnusedWarnings (MaximumBySym1 a6989586621680416404 :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (MaximumBySym1 a6989586621680416404 :: TyFun (t a) a -> Type) (a6989586621680416405 :: t a) Source # | |
Defined in Data.Foldable.Singletons type Apply (MaximumBySym1 a6989586621680416404 :: TyFun (t a) a -> Type) (a6989586621680416405 :: t a) = MaximumBy a6989586621680416404 a6989586621680416405 | |
type family MaximumBySym2 (a6989586621680416404 :: (~>) a ((~>) a Ordering)) (a6989586621680416405 :: t a) :: a where ... Source #
Equations
| MaximumBySym2 a6989586621680416404 a6989586621680416405 = MaximumBy a6989586621680416404 a6989586621680416405 |
data MinimumBySym0 :: (~>) ((~>) a ((~>) a Ordering)) ((~>) (t a) a) Source #
Instances
| SFoldable t => SingI (MinimumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods sing :: Sing MinimumBySym0 Source # | |
| SuppressUnusedWarnings (MinimumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (MinimumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) (a6989586621680416384 :: a ~> (a ~> Ordering)) Source # | |
Defined in Data.Foldable.Singletons | |
data MinimumBySym1 (a6989586621680416384 :: (~>) a ((~>) a Ordering)) :: (~>) (t a) a Source #
Instances
| SFoldable t => SingI1 (MinimumBySym1 :: (a ~> (a ~> Ordering)) -> TyFun (t a) a -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
| (SFoldable t, SingI d) => SingI (MinimumBySym1 d :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods sing :: Sing (MinimumBySym1 d) Source # | |
| SuppressUnusedWarnings (MinimumBySym1 a6989586621680416384 :: TyFun (t a) a -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (MinimumBySym1 a6989586621680416384 :: TyFun (t a) a -> Type) (a6989586621680416385 :: t a) Source # | |
Defined in Data.Foldable.Singletons type Apply (MinimumBySym1 a6989586621680416384 :: TyFun (t a) a -> Type) (a6989586621680416385 :: t a) = MinimumBy a6989586621680416384 a6989586621680416385 | |
type family MinimumBySym2 (a6989586621680416384 :: (~>) a ((~>) a Ordering)) (a6989586621680416385 :: t a) :: a where ... Source #
Equations
| MinimumBySym2 a6989586621680416384 a6989586621680416385 = MinimumBy a6989586621680416384 a6989586621680416385 |
data NotElemSym0 :: (~>) a ((~>) (t a) Bool) Source #
Instances
| (SFoldable t, SEq a) => SingI (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods sing :: Sing NotElemSym0 Source # | |
| SuppressUnusedWarnings (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680416375 :: a) Source # | |
Defined in Data.Foldable.Singletons type Apply (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680416375 :: a) = NotElemSym1 a6989586621680416375 :: TyFun (t a) Bool -> Type | |
data NotElemSym1 (a6989586621680416375 :: a) :: (~>) (t a) Bool Source #
Instances
| (SFoldable t, SEq a) => SingI1 (NotElemSym1 :: a -> TyFun (t a) Bool -> Type) Source # | |
Defined in Data.Foldable.Singletons | |
| (SFoldable t, SEq a, SingI d) => SingI (NotElemSym1 d :: TyFun (t a) Bool -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods sing :: Sing (NotElemSym1 d) Source # | |
| SuppressUnusedWarnings (NotElemSym1 a6989586621680416375 :: TyFun (t a) Bool -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (NotElemSym1 a6989586621680416375 :: TyFun (t a) Bool -> Type) (a6989586621680416376 :: t a) Source # | |
Defined in Data.Foldable.Singletons | |
type family NotElemSym2 (a6989586621680416375 :: a) (a6989586621680416376 :: t a) :: Bool where ... Source #
Equations
| NotElemSym2 a6989586621680416375 a6989586621680416376 = NotElem a6989586621680416375 a6989586621680416376 |
data FindSym0 :: (~>) ((~>) a Bool) ((~>) (t a) (Maybe a)) Source #
Instances
| SFoldable t => SingI (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) Source # | |
| SuppressUnusedWarnings (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) (a6989586621680416357 :: a ~> Bool) Source # | |
data FindSym1 (a6989586621680416357 :: (~>) a Bool) :: (~>) (t a) (Maybe a) Source #
Instances
| SFoldable t => SingI1 (FindSym1 :: (a ~> Bool) -> TyFun (t a) (Maybe a) -> Type) Source # | |
| (SFoldable t, SingI d) => SingI (FindSym1 d :: TyFun (t a) (Maybe a) -> Type) Source # | |
| SuppressUnusedWarnings (FindSym1 a6989586621680416357 :: TyFun (t a) (Maybe a) -> Type) Source # | |
Defined in Data.Foldable.Singletons Methods suppressUnusedWarnings :: () Source # | |
| type Apply (FindSym1 a6989586621680416357 :: TyFun (t a) (Maybe a) -> Type) (a6989586621680416358 :: t a) Source # | |