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

Data.Traversable.Singletons

Contents

Defunctionalization symbols

Description

Defines the promoted and singled versions of the Traversable type class.

Synopsis

class PTraversable (t :: Type -> Type) where
- type Traverse (arg :: a ~> f b) (arg1 :: t a) :: f (t b)
- type SequenceA (arg :: t (f a)) :: f (t a)
- type MapM (arg :: a ~> m b) (arg1 :: t a) :: m (t b)
- type Sequence (arg :: t (m a)) :: m (t a)
class (SFunctor t, SFoldable t) => STraversable (t :: Type -> Type) where
- sTraverse :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: t a). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply (TraverseSym0 :: TyFun (a ~> f b) (t a ~> f (t b)) -> Type) t1) t2)
- sSequenceA :: forall (f :: Type -> Type) a (t1 :: t (f a)). SApplicative f => Sing t1 -> Sing (Apply (SequenceASym0 :: TyFun (t (f a)) (f (t a)) -> Type) t1)
- sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: t a). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (MapMSym0 :: TyFun (a ~> m b) (t a ~> m (t b)) -> Type) t1) t2)
- sSequence :: forall (m :: Type -> Type) a (t1 :: t (m a)). SMonad m => Sing t1 -> Sing (Apply (SequenceSym0 :: TyFun (t (m a)) (m (t a)) -> Type) t1)
type family For (a1 :: t a) (a2 :: a ~> f b) :: f (t b) where ...
sFor :: forall (t1 :: Type -> Type) a (f :: Type -> Type) b (t2 :: t1 a) (t3 :: a ~> f b). (STraversable t1, SApplicative f) => Sing t2 -> Sing t3 -> Sing (Apply (Apply (ForSym0 :: TyFun (t1 a) ((a ~> f b) ~> f (t1 b)) -> Type) t2) t3)
type family ForM (a1 :: t a) (a2 :: a ~> m b) :: m (t b) where ...
sForM :: forall (t1 :: Type -> Type) a (m :: Type -> Type) b (t2 :: t1 a) (t3 :: a ~> m b). (STraversable t1, SMonad m) => Sing t2 -> Sing t3 -> Sing (Apply (Apply (ForMSym0 :: TyFun (t1 a) ((a ~> m b) ~> m (t1 b)) -> Type) t2) t3)
type family MapAccumL (a1 :: a ~> (b ~> (a, c))) (a2 :: a) (a3 :: t b) :: (a, t c) where ...
sMapAccumL :: forall (t1 :: Type -> Type) a b c (t2 :: a ~> (b ~> (a, c))) (t3 :: a) (t4 :: t1 b). STraversable t1 => Sing t2 -> Sing t3 -> Sing t4 -> Sing (Apply (Apply (Apply (MapAccumLSym0 :: TyFun (a ~> (b ~> (a, c))) (a ~> (t1 b ~> (a, t1 c))) -> Type) t2) t3) t4)
type family MapAccumR (a1 :: a ~> (b ~> (a, c))) (a2 :: a) (a3 :: t b) :: (a, t c) where ...
sMapAccumR :: forall a b c (t1 :: Type -> Type) (t2 :: a ~> (b ~> (a, c))) (t3 :: a) (t4 :: t1 b). STraversable t1 => Sing t2 -> Sing t3 -> Sing t4 -> Sing (Apply (Apply (Apply (MapAccumRSym0 :: TyFun (a ~> (b ~> (a, c))) (a ~> (t1 b ~> (a, t1 c))) -> Type) t2) t3) t4)
type family FmapDefault (a1 :: a ~> b) (a2 :: t a) :: t b where ...
sFmapDefault :: forall (t1 :: Type -> Type) a b (t2 :: a ~> b) (t3 :: t1 a). STraversable t1 => Sing t2 -> Sing t3 -> Sing (Apply (Apply (FmapDefaultSym0 :: TyFun (a ~> b) (t1 a ~> t1 b) -> Type) t2) t3)
type family FoldMapDefault (a1 :: a ~> m) (a2 :: t a) :: m where ...
sFoldMapDefault :: forall (t1 :: Type -> Type) m a (t2 :: a ~> m) (t3 :: t1 a). (STraversable t1, SMonoid m) => Sing t2 -> Sing t3 -> Sing (Apply (Apply (FoldMapDefaultSym0 :: TyFun (a ~> m) (t1 a ~> m) -> Type) t2) t3)
data TraverseSym0 (a1 :: TyFun (a ~> f b) (t a ~> f (t b)))
data TraverseSym1 (a6989586621680733986 :: a ~> f b) (b1 :: TyFun (t a) (f (t b)))
type family TraverseSym2 (a6989586621680733986 :: a ~> f b) (a6989586621680733987 :: t a) :: f (t b) where ...
data SequenceASym0 (a1 :: TyFun (t (f a)) (f (t a)))
type family SequenceASym1 (a6989586621680733990 :: t (f a)) :: f (t a) where ...
data MapMSym0 (a1 :: TyFun (a ~> m b) (t a ~> m (t b)))
data MapMSym1 (a6989586621680733994 :: a ~> m b) (b1 :: TyFun (t a) (m (t b)))
type family MapMSym2 (a6989586621680733994 :: a ~> m b) (a6989586621680733995 :: t a) :: m (t b) where ...
data SequenceSym0 (a1 :: TyFun (t (m a)) (m (t a)))
type family SequenceSym1 (a6989586621680733998 :: t (m a)) :: m (t a) where ...
data ForSym0 (a1 :: TyFun (t a) ((a ~> f b) ~> f (t b)))
data ForSym1 (a6989586621680741302 :: t a) (b1 :: TyFun (a ~> f b) (f (t b)))
type family ForSym2 (a6989586621680741302 :: t a) (a6989586621680741303 :: a ~> f b) :: f (t b) where ...
data ForMSym0 (a1 :: TyFun (t a) ((a ~> m b) ~> m (t b)))
data ForMSym1 (a6989586621680741291 :: t a) (b1 :: TyFun (a ~> m b) (m (t b)))
type family ForMSym2 (a6989586621680741291 :: t a) (a6989586621680741292 :: a ~> m b) :: m (t b) where ...
data MapAccumLSym0 (a1 :: TyFun (a ~> (b ~> (a, c))) (a ~> (t b ~> (a, t c))))
data MapAccumLSym1 (a6989586621680741278 :: a ~> (b ~> (a, c))) (b1 :: TyFun a (t b ~> (a, t c)))
data MapAccumLSym2 (a6989586621680741278 :: a ~> (b ~> (a, c))) (a6989586621680741279 :: a) (c1 :: TyFun (t b) (a, t c))
type family MapAccumLSym3 (a6989586621680741278 :: a ~> (b ~> (a, c))) (a6989586621680741279 :: a) (a6989586621680741280 :: t b) :: (a, t c) where ...
data MapAccumRSym0 (a1 :: TyFun (a ~> (b ~> (a, c))) (a ~> (t b ~> (a, t c))))
data MapAccumRSym1 (a6989586621680741268 :: a ~> (b ~> (a, c))) (b1 :: TyFun a (t b ~> (a, t c)))
data MapAccumRSym2 (a6989586621680741268 :: a ~> (b ~> (a, c))) (a6989586621680741269 :: a) (c1 :: TyFun (t b) (a, t c))
type family MapAccumRSym3 (a6989586621680741268 :: a ~> (b ~> (a, c))) (a6989586621680741269 :: a) (a6989586621680741270 :: t b) :: (a, t c) where ...
data FmapDefaultSym0 (a1 :: TyFun (a ~> b) (t a ~> t b))
data FmapDefaultSym1 (a6989586621680741254 :: a ~> b) (b1 :: TyFun (t a) (t b))
type family FmapDefaultSym2 (a6989586621680741254 :: a ~> b) (a6989586621680741255 :: t a) :: t b where ...
data FoldMapDefaultSym0 (a1 :: TyFun (a ~> m) (t a ~> m))
data FoldMapDefaultSym1 (a6989586621680741235 :: a ~> m) (b :: TyFun (t a) m)
type family FoldMapDefaultSym2 (a6989586621680741235 :: a ~> m) (a6989586621680741236 :: t a) :: m where ...

Documentation

class PTraversable (t :: Type -> Type) Source #

Associated Types

type Traverse (arg :: a ~> f b) (arg1 :: t a) :: f (t b) Source #

type Traverse (arg :: a ~> f b) (arg1 :: t a) = Apply (Apply (Traverse_6989586621680734001Sym0 :: TyFun (a ~> f b) (t a ~> f (t b)) -> Type) arg) arg1

type SequenceA (arg :: t (f a)) :: f (t a) Source #

type SequenceA (arg :: t (f a)) = Apply (SequenceA_6989586621680734013Sym0 :: TyFun (t (f a)) (f (t a)) -> Type) arg

type MapM (arg :: a ~> m b) (arg1 :: t a) :: m (t b) Source #

type MapM (arg :: a ~> m b) (arg1 :: t a) = Apply (Apply (MapM_6989586621680734023Sym0 :: TyFun (a ~> m b) (t a ~> m (t b)) -> Type) arg) arg1

type Sequence (arg :: t (m a)) :: m (t a) Source #

type Sequence (arg :: t (m a)) = Apply (Sequence_6989586621680734037Sym0 :: TyFun (t (m a)) (m (t a)) -> Type) arg

Instances

Instances details

PTraversable Identity Source #

Instance details

Defined in Data.Traversable.Singletons

Associated Types

type Traverse (a2 :: a1 ~> f b) (a3 :: Identity a1)
Instance details Defined in Data.Traversable.Singletons type Traverse (a2 :: a1 ~> f b) (a3 :: Identity a1)
type SequenceA (arg :: Identity (f a))
Instance details Defined in Data.Traversable.Singletons type SequenceA (arg :: Identity (f a))
type MapM (arg1 :: a ~> m b) (arg2 :: Identity a)
Instance details Defined in Data.Traversable.Singletons type MapM (arg1 :: a ~> m b) (arg2 :: Identity a)
type Sequence (arg :: Identity (m a))
Instance details Defined in Data.Traversable.Singletons type Sequence (arg :: Identity (m a))

PTraversable First Source #

Instance details

Defined in Data.Traversable.Singletons

Associated Types

type Traverse (a2 :: a1 ~> f b) (a3 :: First a1)
Instance details Defined in Data.Traversable.Singletons type Traverse (a2 :: a1 ~> f b) (a3 :: First a1)
type SequenceA (arg :: First (f a))
Instance details Defined in Data.Traversable.Singletons type SequenceA (arg :: First (f a))
type MapM (arg1 :: a ~> m b) (arg2 :: First a)
Instance details Defined in Data.Traversable.Singletons type MapM (arg1 :: a ~> m b) (arg2 :: First a)
type Sequence (arg :: First (m a))
Instance details Defined in Data.Traversable.Singletons type Sequence (arg :: First (m a))

PTraversable Last Source #

Instance details

Defined in Data.Traversable.Singletons

Associated Types

type Traverse (a2 :: a1 ~> f b) (a3 :: Last a1)
Instance details Defined in Data.Traversable.Singletons type Traverse (a2 :: a1 ~> f b) (a3 :: Last a1)
type SequenceA (arg :: Last (f a))
Instance details Defined in Data.Traversable.Singletons type SequenceA (arg :: Last (f a))
type MapM (arg1 :: a ~> m b) (arg2 :: Last a)
Instance details Defined in Data.Traversable.Singletons type MapM (arg1 :: a ~> m b) (arg2 :: Last a)
type Sequence (arg :: Last (m a))
Instance details Defined in Data.Traversable.Singletons type Sequence (arg :: Last (m a))

PTraversable First Source #

Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type Traverse (a2 :: a1 ~> f b) (a3 :: First a1)
Instance details Defined in Data.Semigroup.Singletons type Traverse (a2 :: a1 ~> f b) (a3 :: First a1)
type SequenceA (arg :: First (f a))
Instance details Defined in Data.Semigroup.Singletons type SequenceA (arg :: First (f a))
type MapM (arg :: a ~> m b) (arg1 :: First a)
Instance details Defined in Data.Semigroup.Singletons type MapM (arg :: a ~> m b) (arg1 :: First a)
type Sequence (arg :: First (m a))
Instance details Defined in Data.Semigroup.Singletons type Sequence (arg :: First (m a))

PTraversable Last Source #

Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type Traverse (a2 :: a1 ~> f b) (a3 :: Last a1)
Instance details Defined in Data.Semigroup.Singletons type Traverse (a2 :: a1 ~> f b) (a3 :: Last a1)
type SequenceA (arg :: Last (f a))
Instance details Defined in Data.Semigroup.Singletons type SequenceA (arg :: Last (f a))
type MapM (arg :: a ~> m b) (arg1 :: Last a)
Instance details Defined in Data.Semigroup.Singletons type MapM (arg :: a ~> m b) (arg1 :: Last a)
type Sequence (arg :: Last (m a))
Instance details Defined in Data.Semigroup.Singletons type Sequence (arg :: Last (m a))

PTraversable Max Source #

Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type Traverse (a2 :: a1 ~> f b) (a3 :: Max a1)
Instance details Defined in Data.Semigroup.Singletons type Traverse (a2 :: a1 ~> f b) (a3 :: Max a1)
type SequenceA (arg :: Max (f a))
Instance details Defined in Data.Semigroup.Singletons type SequenceA (arg :: Max (f a))
type MapM (arg :: a ~> m b) (arg1 :: Max a)
Instance details Defined in Data.Semigroup.Singletons type MapM (arg :: a ~> m b) (arg1 :: Max a)
type Sequence (arg :: Max (m a))
Instance details Defined in Data.Semigroup.Singletons type Sequence (arg :: Max (m a))

PTraversable Min Source #

Instance details

Defined in Data.Semigroup.Singletons

Associated Types

type Traverse (a2 :: a1 ~> f b) (a3 :: Min a1)
Instance details Defined in Data.Semigroup.Singletons type Traverse (a2 :: a1 ~> f b) (a3 :: Min a1)
type SequenceA (arg :: Min (f a))
Instance details Defined in Data.Semigroup.Singletons type SequenceA (arg :: Min (f a))
type MapM (arg :: a ~> m b) (arg1 :: Min a)
Instance details Defined in Data.Semigroup.Singletons type MapM (arg :: a ~> m b) (arg1 :: Min a)
type Sequence (arg :: Min (m a))
Instance details Defined in Data.Semigroup.Singletons type Sequence (arg :: Min (m a))

PTraversable Dual Source #

Instance details

Defined in Data.Traversable.Singletons

Associated Types

type Traverse (a2 :: a1 ~> f b) (a3 :: Dual a1)
Instance details Defined in Data.Traversable.Singletons type Traverse (a2 :: a1 ~> f b) (a3 :: Dual a1)
type SequenceA (arg :: Dual (f a))
Instance details Defined in Data.Traversable.Singletons type SequenceA (arg :: Dual (f a))
type MapM (arg1 :: a ~> m b) (arg2 :: Dual a)
Instance details Defined in Data.Traversable.Singletons type MapM (arg1 :: a ~> m b) (arg2 :: Dual a)
type Sequence (arg :: Dual (m a))
Instance details Defined in Data.Traversable.Singletons type Sequence (arg :: Dual (m a))

PTraversable Product Source #

Instance details

Defined in Data.Traversable.Singletons

Associated Types

type Traverse (a2 :: a1 ~> f b) (a3 :: Product a1)
Instance details Defined in Data.Traversable.Singletons type Traverse (a2 :: a1 ~> f b) (a3 :: Product a1)
type SequenceA (arg :: Product (f a))
Instance details Defined in Data.Traversable.Singletons type SequenceA (arg :: Product (f a))
type MapM (arg1 :: a ~> m b) (arg2 :: Product a)
Instance details Defined in Data.Traversable.Singletons type MapM (arg1 :: a ~> m b) (arg2 :: Product a)
type Sequence (arg :: Product (m a))
Instance details Defined in Data.Traversable.Singletons type Sequence (arg :: Product (m a))

PTraversable Sum Source #

Instance details

Defined in Data.Traversable.Singletons

Associated Types

type Traverse (a2 :: a1 ~> f b) (a3 :: Sum a1)
Instance details Defined in Data.Traversable.Singletons type Traverse (a2 :: a1 ~> f b) (a3 :: Sum a1)
type SequenceA (arg :: Sum (f a))
Instance details Defined in Data.Traversable.Singletons type SequenceA (arg :: Sum (f a))
type MapM (arg1 :: a ~> m b) (arg2 :: Sum a)
Instance details Defined in Data.Traversable.Singletons type MapM (arg1 :: a ~> m b) (arg2 :: Sum a)
type Sequence (arg :: Sum (m a))
Instance details Defined in Data.Traversable.Singletons type Sequence (arg :: Sum (m a))

PTraversable NonEmpty Source #

Instance details

Defined in Data.Traversable.Singletons

Associated Types

type Traverse (a2 :: a1 ~> f b) (a3 :: NonEmpty a1)
Instance details Defined in Data.Traversable.Singletons type Traverse (a2 :: a1 ~> f b) (a3 :: NonEmpty a1)
type SequenceA (arg :: NonEmpty (f a))
Instance details Defined in Data.Traversable.Singletons type SequenceA (arg :: NonEmpty (f a))
type MapM (arg1 :: a ~> m b) (arg2 :: NonEmpty a)
Instance details Defined in Data.Traversable.Singletons type MapM (arg1 :: a ~> m b) (arg2 :: NonEmpty a)
type Sequence (arg :: NonEmpty (m a))
Instance details Defined in Data.Traversable.Singletons type Sequence (arg :: NonEmpty (m a))

PTraversable Maybe Source #

Instance details

Defined in Data.Traversable.Singletons

Associated Types

type Traverse (a2 :: a1 ~> f b) (a3 :: Maybe a1)
Instance details Defined in Data.Traversable.Singletons type Traverse (a2 :: a1 ~> f b) (a3 :: Maybe a1)
type SequenceA (arg :: Maybe (f a))
Instance details Defined in Data.Traversable.Singletons type SequenceA (arg :: Maybe (f a))
type MapM (arg1 :: a ~> m b) (arg2 :: Maybe a)
Instance details Defined in Data.Traversable.Singletons type MapM (arg1 :: a ~> m b) (arg2 :: Maybe a)
type Sequence (arg :: Maybe (m a))
Instance details Defined in Data.Traversable.Singletons type Sequence (arg :: Maybe (m a))

PTraversable [] Source #

Instance details

Defined in Data.Traversable.Singletons

Associated Types

type Traverse (a2 :: a1 ~> f b) (a3 :: [a1])
Instance details Defined in Data.Traversable.Singletons type Traverse (a2 :: a1 ~> f b) (a3 :: [a1])
type SequenceA (arg :: [f a])
Instance details Defined in Data.Traversable.Singletons type SequenceA (arg :: [f a])
type MapM (arg1 :: a ~> m b) (arg2 :: [a])
Instance details Defined in Data.Traversable.Singletons type MapM (arg1 :: a ~> m b) (arg2 :: [a])
type Sequence (arg :: [m a])
Instance details Defined in Data.Traversable.Singletons type Sequence (arg :: [m a])

PTraversable (Either a) Source #

Instance details

Defined in Data.Traversable.Singletons

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

Instance details

Defined in Data.Traversable.Singletons

Associated Types

type Traverse (a2 :: a1 ~> f b) (a3 :: Proxy a1)
Instance details Defined in Data.Traversable.Singletons type Traverse (a2 :: a1 ~> f b) (a3 :: Proxy a1)
type SequenceA (a2 :: Proxy (f a1))
Instance details Defined in Data.Traversable.Singletons type SequenceA (a2 :: Proxy (f a1))
type MapM (a2 :: a1 ~> m b) (a3 :: Proxy a1)
Instance details Defined in Data.Traversable.Singletons type MapM (a2 :: a1 ~> m b) (a3 :: Proxy a1)
type Sequence (a2 :: Proxy (m a1))
Instance details Defined in Data.Traversable.Singletons type Sequence (a2 :: Proxy (m a1))

PTraversable (Arg a) Source #

Instance details

Defined in Data.Semigroup.Singletons

PTraversable ((,) a) Source #

Instance details

Defined in Data.Traversable.Singletons

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

Instance details

Defined in Data.Traversable.Singletons

PTraversable (Product f g) Source #

Instance details

Defined in Data.Functor.Product.Singletons

PTraversable (Sum f g) Source #

Instance details

Defined in Data.Functor.Sum.Singletons

PTraversable (Compose f g) Source #

Instance details

Defined in Data.Functor.Compose.Singletons

class (SFunctor t, SFoldable t) => STraversable (t :: Type -> Type) where Source #

Minimal complete definition

Nothing

Methods

sTraverse :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: t a). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply (TraverseSym0 :: TyFun (a ~> f b) (t a ~> f (t b)) -> Type) t1) t2) Source #

default sTraverse :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: t a). (Apply (Apply (TraverseSym0 :: TyFun (a ~> f b) (t a ~> f (t b)) -> Type) t1) t2 ~ Apply (Apply (Traverse_6989586621680734001Sym0 :: TyFun (a ~> f b) (t a ~> f (t b)) -> Type) t1) t2, SApplicative f) => Sing t1 -> Sing t2 -> Sing (Apply (Apply (TraverseSym0 :: TyFun (a ~> f b) (t a ~> f (t b)) -> Type) t1) t2) Source #

sSequenceA :: forall (f :: Type -> Type) a (t1 :: t (f a)). SApplicative f => Sing t1 -> Sing (Apply (SequenceASym0 :: TyFun (t (f a)) (f (t a)) -> Type) t1) Source #

default sSequenceA :: forall (f :: Type -> Type) a (t1 :: t (f a)). (Apply (SequenceASym0 :: TyFun (t (f a)) (f (t a)) -> Type) t1 ~ Apply (SequenceA_6989586621680734013Sym0 :: TyFun (t (f a)) (f (t a)) -> Type) t1, SApplicative f) => Sing t1 -> Sing (Apply (SequenceASym0 :: TyFun (t (f a)) (f (t a)) -> Type) t1) Source #

sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: t a). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (MapMSym0 :: TyFun (a ~> m b) (t a ~> m (t b)) -> Type) t1) t2) Source #

default sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: t a). (Apply (Apply (MapMSym0 :: TyFun (a ~> m b) (t a ~> m (t b)) -> Type) t1) t2 ~ Apply (Apply (MapM_6989586621680734023Sym0 :: TyFun (a ~> m b) (t a ~> m (t b)) -> Type) t1) t2, SMonad m) => Sing t1 -> Sing t2 -> Sing (Apply (Apply (MapMSym0 :: TyFun (a ~> m b) (t a ~> m (t b)) -> Type) t1) t2) Source #

sSequence :: forall (m :: Type -> Type) a (t1 :: t (m a)). SMonad m => Sing t1 -> Sing (Apply (SequenceSym0 :: TyFun (t (m a)) (m (t a)) -> Type) t1) Source #

default sSequence :: forall (m :: Type -> Type) a (t1 :: t (m a)). (Apply (SequenceSym0 :: TyFun (t (m a)) (m (t a)) -> Type) t1 ~ Apply (Sequence_6989586621680734037Sym0 :: TyFun (t (m a)) (m (t a)) -> Type) t1, SMonad m) => Sing t1 -> Sing (Apply (SequenceSym0 :: TyFun (t (m a)) (m (t a)) -> Type) t1) Source #

Instances

Instances details

STraversable Identity Source #
Instance details Defined in Data.Traversable.Singletons Methods sTraverse :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: Identity a). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply (TraverseSym0 :: TyFun (a ~> f b) (Identity a ~> f (Identity b)) -> Type) t1) t2) Source # sSequenceA :: forall (f :: Type -> Type) a (t1 :: Identity (f a)). SApplicative f => Sing t1 -> Sing (Apply (SequenceASym0 :: TyFun (Identity (f a)) (f (Identity a)) -> Type) t1) Source # sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: Identity a). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (MapMSym0 :: TyFun (a ~> m b) (Identity a ~> m (Identity b)) -> Type) t1) t2) Source # sSequence :: forall (m :: Type -> Type) a (t1 :: Identity (m a)). SMonad m => Sing t1 -> Sing (Apply (SequenceSym0 :: TyFun (Identity (m a)) (m (Identity a)) -> Type) t1) Source #
STraversable First Source #
Instance details Defined in Data.Traversable.Singletons Methods sTraverse :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: First a). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply (TraverseSym0 :: TyFun (a ~> f b) (First a ~> f (First b)) -> Type) t1) t2) Source # sSequenceA :: forall (f :: Type -> Type) a (t1 :: First (f a)). SApplicative f => Sing t1 -> Sing (Apply (SequenceASym0 :: TyFun (First (f a)) (f (First a)) -> Type) t1) Source # sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: First a). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (MapMSym0 :: TyFun (a ~> m b) (First a ~> m (First b)) -> Type) t1) t2) Source # sSequence :: forall (m :: Type -> Type) a (t1 :: First (m a)). SMonad m => Sing t1 -> Sing (Apply (SequenceSym0 :: TyFun (First (m a)) (m (First a)) -> Type) t1) Source #
STraversable Last Source #
Instance details Defined in Data.Traversable.Singletons Methods sTraverse :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: Last a). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply (TraverseSym0 :: TyFun (a ~> f b) (Last a ~> f (Last b)) -> Type) t1) t2) Source # sSequenceA :: forall (f :: Type -> Type) a (t1 :: Last (f a)). SApplicative f => Sing t1 -> Sing (Apply (SequenceASym0 :: TyFun (Last (f a)) (f (Last a)) -> Type) t1) Source # sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: Last a). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (MapMSym0 :: TyFun (a ~> m b) (Last a ~> m (Last b)) -> Type) t1) t2) Source # sSequence :: forall (m :: Type -> Type) a (t1 :: Last (m a)). SMonad m => Sing t1 -> Sing (Apply (SequenceSym0 :: TyFun (Last (m a)) (m (Last a)) -> Type) t1) Source #
STraversable First Source #
Instance details Defined in Data.Semigroup.Singletons Methods sTraverse :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: First a). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply (TraverseSym0 :: TyFun (a ~> f b) (First a ~> f (First b)) -> Type) t1) t2) Source # sSequenceA :: forall (f :: Type -> Type) a (t1 :: First (f a)). SApplicative f => Sing t1 -> Sing (Apply (SequenceASym0 :: TyFun (First (f a)) (f (First a)) -> Type) t1) Source # sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: First a). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (MapMSym0 :: TyFun (a ~> m b) (First a ~> m (First b)) -> Type) t1) t2) Source # sSequence :: forall (m :: Type -> Type) a (t1 :: First (m a)). SMonad m => Sing t1 -> Sing (Apply (SequenceSym0 :: TyFun (First (m a)) (m (First a)) -> Type) t1) Source #
STraversable Last Source #
Instance details Defined in Data.Semigroup.Singletons Methods sTraverse :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: Last a). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply (TraverseSym0 :: TyFun (a ~> f b) (Last a ~> f (Last b)) -> Type) t1) t2) Source # sSequenceA :: forall (f :: Type -> Type) a (t1 :: Last (f a)). SApplicative f => Sing t1 -> Sing (Apply (SequenceASym0 :: TyFun (Last (f a)) (f (Last a)) -> Type) t1) Source # sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: Last a). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (MapMSym0 :: TyFun (a ~> m b) (Last a ~> m (Last b)) -> Type) t1) t2) Source # sSequence :: forall (m :: Type -> Type) a (t1 :: Last (m a)). SMonad m => Sing t1 -> Sing (Apply (SequenceSym0 :: TyFun (Last (m a)) (m (Last a)) -> Type) t1) Source #
STraversable Max Source #
Instance details Defined in Data.Semigroup.Singletons Methods sTraverse :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: Max a). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply (TraverseSym0 :: TyFun (a ~> f b) (Max a ~> f (Max b)) -> Type) t1) t2) Source # sSequenceA :: forall (f :: Type -> Type) a (t1 :: Max (f a)). SApplicative f => Sing t1 -> Sing (Apply (SequenceASym0 :: TyFun (Max (f a)) (f (Max a)) -> Type) t1) Source # sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: Max a). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (MapMSym0 :: TyFun (a ~> m b) (Max a ~> m (Max b)) -> Type) t1) t2) Source # sSequence :: forall (m :: Type -> Type) a (t1 :: Max (m a)). SMonad m => Sing t1 -> Sing (Apply (SequenceSym0 :: TyFun (Max (m a)) (m (Max a)) -> Type) t1) Source #
STraversable Min Source #
Instance details Defined in Data.Semigroup.Singletons Methods sTraverse :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: Min a). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply (TraverseSym0 :: TyFun (a ~> f b) (Min a ~> f (Min b)) -> Type) t1) t2) Source # sSequenceA :: forall (f :: Type -> Type) a (t1 :: Min (f a)). SApplicative f => Sing t1 -> Sing (Apply (SequenceASym0 :: TyFun (Min (f a)) (f (Min a)) -> Type) t1) Source # sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: Min a). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (MapMSym0 :: TyFun (a ~> m b) (Min a ~> m (Min b)) -> Type) t1) t2) Source # sSequence :: forall (m :: Type -> Type) a (t1 :: Min (m a)). SMonad m => Sing t1 -> Sing (Apply (SequenceSym0 :: TyFun (Min (m a)) (m (Min a)) -> Type) t1) Source #
STraversable Dual Source #
Instance details Defined in Data.Traversable.Singletons Methods sTraverse :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: Dual a). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply (TraverseSym0 :: TyFun (a ~> f b) (Dual a ~> f (Dual b)) -> Type) t1) t2) Source # sSequenceA :: forall (f :: Type -> Type) a (t1 :: Dual (f a)). SApplicative f => Sing t1 -> Sing (Apply (SequenceASym0 :: TyFun (Dual (f a)) (f (Dual a)) -> Type) t1) Source # sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: Dual a). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (MapMSym0 :: TyFun (a ~> m b) (Dual a ~> m (Dual b)) -> Type) t1) t2) Source # sSequence :: forall (m :: Type -> Type) a (t1 :: Dual (m a)). SMonad m => Sing t1 -> Sing (Apply (SequenceSym0 :: TyFun (Dual (m a)) (m (Dual a)) -> Type) t1) Source #
STraversable Product Source #
Instance details Defined in Data.Traversable.Singletons Methods sTraverse :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: Product a). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply (TraverseSym0 :: TyFun (a ~> f b) (Product a ~> f (Product b)) -> Type) t1) t2) Source # sSequenceA :: forall (f :: Type -> Type) a (t1 :: Product (f a)). SApplicative f => Sing t1 -> Sing (Apply (SequenceASym0 :: TyFun (Product (f a)) (f (Product a)) -> Type) t1) Source # sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: Product a). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (MapMSym0 :: TyFun (a ~> m b) (Product a ~> m (Product b)) -> Type) t1) t2) Source # sSequence :: forall (m :: Type -> Type) a (t1 :: Product (m a)). SMonad m => Sing t1 -> Sing (Apply (SequenceSym0 :: TyFun (Product (m a)) (m (Product a)) -> Type) t1) Source #
STraversable Sum Source #
Instance details Defined in Data.Traversable.Singletons Methods sTraverse :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: Sum a). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply (TraverseSym0 :: TyFun (a ~> f b) (Sum a ~> f (Sum b)) -> Type) t1) t2) Source # sSequenceA :: forall (f :: Type -> Type) a (t1 :: Sum (f a)). SApplicative f => Sing t1 -> Sing (Apply (SequenceASym0 :: TyFun (Sum (f a)) (f (Sum a)) -> Type) t1) Source # sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: Sum a). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (MapMSym0 :: TyFun (a ~> m b) (Sum a ~> m (Sum b)) -> Type) t1) t2) Source # sSequence :: forall (m :: Type -> Type) a (t1 :: Sum (m a)). SMonad m => Sing t1 -> Sing (Apply (SequenceSym0 :: TyFun (Sum (m a)) (m (Sum a)) -> Type) t1) Source #
STraversable NonEmpty Source #
Instance details Defined in Data.Traversable.Singletons Methods sTraverse :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: NonEmpty a). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply (TraverseSym0 :: TyFun (a ~> f b) (NonEmpty a ~> f (NonEmpty b)) -> Type) t1) t2) Source # sSequenceA :: forall (f :: Type -> Type) a (t1 :: NonEmpty (f a)). SApplicative f => Sing t1 -> Sing (Apply (SequenceASym0 :: TyFun (NonEmpty (f a)) (f (NonEmpty a)) -> Type) t1) Source # sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: NonEmpty a). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (MapMSym0 :: TyFun (a ~> m b) (NonEmpty a ~> m (NonEmpty b)) -> Type) t1) t2) Source # sSequence :: forall (m :: Type -> Type) a (t1 :: NonEmpty (m a)). SMonad m => Sing t1 -> Sing (Apply (SequenceSym0 :: TyFun (NonEmpty (m a)) (m (NonEmpty a)) -> Type) t1) Source #
STraversable Maybe Source #
Instance details Defined in Data.Traversable.Singletons Methods sTraverse :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: Maybe a). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply (TraverseSym0 :: TyFun (a ~> f b) (Maybe a ~> f (Maybe b)) -> Type) t1) t2) Source # sSequenceA :: forall (f :: Type -> Type) a (t1 :: Maybe (f a)). SApplicative f => Sing t1 -> Sing (Apply (SequenceASym0 :: TyFun (Maybe (f a)) (f (Maybe a)) -> Type) t1) Source # sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: Maybe a). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (MapMSym0 :: TyFun (a ~> m b) (Maybe a ~> m (Maybe b)) -> Type) t1) t2) Source # sSequence :: forall (m :: Type -> Type) a (t1 :: Maybe (m a)). SMonad m => Sing t1 -> Sing (Apply (SequenceSym0 :: TyFun (Maybe (m a)) (m (Maybe a)) -> Type) t1) Source #
STraversable [] Source #
Instance details Defined in Data.Traversable.Singletons Methods sTraverse :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: [a]). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply (TraverseSym0 :: TyFun (a ~> f b) ([a] ~> f [b]) -> Type) t1) t2) Source # sSequenceA :: forall (f :: Type -> Type) a (t1 :: [f a]). SApplicative f => Sing t1 -> Sing (Apply (SequenceASym0 :: TyFun [f a] (f [a]) -> Type) t1) Source # sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: [a]). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (MapMSym0 :: TyFun (a ~> m b) ([a] ~> m [b]) -> Type) t1) t2) Source # sSequence :: forall (m :: Type -> Type) a (t1 :: [m a]). SMonad m => Sing t1 -> Sing (Apply (SequenceSym0 :: TyFun [m a] (m [a]) -> Type) t1) Source #
STraversable (Either a) Source #
Instance details Defined in Data.Traversable.Singletons Methods sTraverse :: forall a0 (f :: Type -> Type) b (t1 :: a0 ~> f b) (t2 :: Either a a0). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply (TraverseSym0 :: TyFun (a ~> f b) (Either a a ~> f (Either a b)) -> Type) t1) t2) Source # sSequenceA :: forall (f :: Type -> Type) a0 (t1 :: Either a (f a0)). SApplicative f => Sing t1 -> Sing (Apply (SequenceASym0 :: TyFun (Either a (f a)) (f (Either a a)) -> Type) t1) Source # sMapM :: forall a0 (m :: Type -> Type) b (t1 :: a0 ~> m b) (t2 :: Either a a0). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (MapMSym0 :: TyFun (a ~> m b) (Either a a ~> m (Either a b)) -> Type) t1) t2) Source # sSequence :: forall (m :: Type -> Type) a0 (t1 :: Either a (m a0)). SMonad m => Sing t1 -> Sing (Apply (SequenceSym0 :: TyFun (Either a (m a)) (m (Either a a)) -> Type) t1) Source #
STraversable (Proxy :: Type -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods sTraverse :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: Proxy a). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply (TraverseSym0 :: TyFun (a ~> f b) (Proxy a ~> f (Proxy b)) -> Type) t1) t2) Source # sSequenceA :: forall (f :: Type -> Type) a (t1 :: Proxy (f a)). SApplicative f => Sing t1 -> Sing (Apply (SequenceASym0 :: TyFun (Proxy (f a)) (f (Proxy a)) -> Type) t1) Source # sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: Proxy a). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (MapMSym0 :: TyFun (a ~> m b) (Proxy a ~> m (Proxy b)) -> Type) t1) t2) Source # sSequence :: forall (m :: Type -> Type) a (t1 :: Proxy (m a)). SMonad m => Sing t1 -> Sing (Apply (SequenceSym0 :: TyFun (Proxy (m a)) (m (Proxy a)) -> Type) t1) Source #
STraversable (Arg a) Source #
Instance details Defined in Data.Semigroup.Singletons Methods sTraverse :: forall a0 (f :: Type -> Type) b (t1 :: a0 ~> f b) (t2 :: Arg a a0). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply (TraverseSym0 :: TyFun (a ~> f b) (Arg a a ~> f (Arg a b)) -> Type) t1) t2) Source # sSequenceA :: forall (f :: Type -> Type) a0 (t1 :: Arg a (f a0)). SApplicative f => Sing t1 -> Sing (Apply (SequenceASym0 :: TyFun (Arg a (f a)) (f (Arg a a)) -> Type) t1) Source # sMapM :: forall a0 (m :: Type -> Type) b (t1 :: a0 ~> m b) (t2 :: Arg a a0). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (MapMSym0 :: TyFun (a ~> m b) (Arg a a ~> m (Arg a b)) -> Type) t1) t2) Source # sSequence :: forall (m :: Type -> Type) a0 (t1 :: Arg a (m a0)). SMonad m => Sing t1 -> Sing (Apply (SequenceSym0 :: TyFun (Arg a (m a)) (m (Arg a a)) -> Type) t1) Source #
STraversable ((,) a) Source #
Instance details Defined in Data.Traversable.Singletons Methods sTraverse :: forall a0 (f :: Type -> Type) b (t1 :: a0 ~> f b) (t2 :: (a, a0)). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply (TraverseSym0 :: TyFun (a ~> f b) ((a, a) ~> f (a, b)) -> Type) t1) t2) Source # sSequenceA :: forall (f :: Type -> Type) a0 (t1 :: (a, f a0)). SApplicative f => Sing t1 -> Sing (Apply (SequenceASym0 :: TyFun (a, f a) (f (a, a)) -> Type) t1) Source # sMapM :: forall a0 (m :: Type -> Type) b (t1 :: a0 ~> m b) (t2 :: (a, a0)). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (MapMSym0 :: TyFun (a ~> m b) ((a, a) ~> m (a, b)) -> Type) t1) t2) Source # sSequence :: forall (m :: Type -> Type) a0 (t1 :: (a, m a0)). SMonad m => Sing t1 -> Sing (Apply (SequenceSym0 :: TyFun (a, m a) (m (a, a)) -> Type) t1) Source #
STraversable (Const m :: Type -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods sTraverse :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: Const m a). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply (TraverseSym0 :: TyFun (a ~> f b) (Const m a ~> f (Const m b)) -> Type) t1) t2) Source # sSequenceA :: forall (f :: Type -> Type) a (t1 :: Const m (f a)). SApplicative f => Sing t1 -> Sing (Apply (SequenceASym0 :: TyFun (Const m (f a)) (f (Const m a)) -> Type) t1) Source # sMapM :: forall a (m0 :: Type -> Type) b (t1 :: a ~> m0 b) (t2 :: Const m a). SMonad m0 => Sing t1 -> Sing t2 -> Sing (Apply (Apply (MapMSym0 :: TyFun (a ~> m b) (Const m a ~> m (Const m b)) -> Type) t1) t2) Source # sSequence :: forall (m0 :: Type -> Type) a (t1 :: Const m (m0 a)). SMonad m0 => Sing t1 -> Sing (Apply (SequenceSym0 :: TyFun (Const m (m a)) (m (Const m a)) -> Type) t1) Source #
(STraversable f, STraversable g) => STraversable (Product f g) Source #
Instance details Defined in Data.Functor.Product.Singletons Methods sTraverse :: forall a (f0 :: Type -> Type) b (t1 :: a ~> f0 b) (t2 :: Product f g a). SApplicative f0 => Sing t1 -> Sing t2 -> Sing (Apply (Apply (TraverseSym0 :: TyFun (a ~> f b) (Product f g a ~> f (Product f g b)) -> Type) t1) t2) Source # sSequenceA :: forall (f0 :: Type -> Type) a (t1 :: Product f g (f0 a)). SApplicative f0 => Sing t1 -> Sing (Apply (SequenceASym0 :: TyFun (Product f g (f a)) (f (Product f g a)) -> Type) t1) Source # sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: Product f g a). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (MapMSym0 :: TyFun (a ~> m b) (Product f g a ~> m (Product f g b)) -> Type) t1) t2) Source # sSequence :: forall (m :: Type -> Type) a (t1 :: Product f g (m a)). SMonad m => Sing t1 -> Sing (Apply (SequenceSym0 :: TyFun (Product f g (m a)) (m (Product f g a)) -> Type) t1) Source #
(STraversable f, STraversable g) => STraversable (Sum f g) Source #
Instance details Defined in Data.Functor.Sum.Singletons Methods sTraverse :: forall a (f0 :: Type -> Type) b (t1 :: a ~> f0 b) (t2 :: Sum f g a). SApplicative f0 => Sing t1 -> Sing t2 -> Sing (Apply (Apply (TraverseSym0 :: TyFun (a ~> f b) (Sum f g a ~> f (Sum f g b)) -> Type) t1) t2) Source # sSequenceA :: forall (f0 :: Type -> Type) a (t1 :: Sum f g (f0 a)). SApplicative f0 => Sing t1 -> Sing (Apply (SequenceASym0 :: TyFun (Sum f g (f a)) (f (Sum f g a)) -> Type) t1) Source # sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: Sum f g a). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (MapMSym0 :: TyFun (a ~> m b) (Sum f g a ~> m (Sum f g b)) -> Type) t1) t2) Source # sSequence :: forall (m :: Type -> Type) a (t1 :: Sum f g (m a)). SMonad m => Sing t1 -> Sing (Apply (SequenceSym0 :: TyFun (Sum f g (m a)) (m (Sum f g a)) -> Type) t1) Source #
(STraversable f, STraversable g) => STraversable (Compose f g) Source #
Instance details Defined in Data.Functor.Compose.Singletons Methods sTraverse :: forall a (f0 :: Type -> Type) b (t1 :: a ~> f0 b) (t2 :: Compose f g a). SApplicative f0 => Sing t1 -> Sing t2 -> Sing (Apply (Apply (TraverseSym0 :: TyFun (a ~> f b) (Compose f g a ~> f (Compose f g b)) -> Type) t1) t2) Source # sSequenceA :: forall (f0 :: Type -> Type) a (t1 :: Compose f g (f0 a)). SApplicative f0 => Sing t1 -> Sing (Apply (SequenceASym0 :: TyFun (Compose f g (f a)) (f (Compose f g a)) -> Type) t1) Source # sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: Compose f g a). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply (MapMSym0 :: TyFun (a ~> m b) (Compose f g a ~> m (Compose f g b)) -> Type) t1) t2) Source # sSequence :: forall (m :: Type -> Type) a (t1 :: Compose f g (m a)). SMonad m => Sing t1 -> Sing (Apply (SequenceSym0 :: TyFun (Compose f g (m a)) (m (Compose f g a)) -> Type) t1) Source #

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

Equations

For (a_6989586621680741295 :: t a) (a_6989586621680741297 :: a ~> f b) = Apply (Apply (Apply (FlipSym0 :: TyFun ((a ~> f b) ~> (t a ~> f (t b))) (t a ~> ((a ~> f b) ~> f (t b))) -> Type) (TraverseSym0 :: TyFun (a ~> f b) (t a ~> f (t b)) -> Type)) a_6989586621680741295) a_6989586621680741297

sFor :: forall (t1 :: Type -> Type) a (f :: Type -> Type) b (t2 :: t1 a) (t3 :: a ~> f b). (STraversable t1, SApplicative f) => Sing t2 -> Sing t3 -> Sing (Apply (Apply (ForSym0 :: TyFun (t1 a) ((a ~> f b) ~> f (t1 b)) -> Type) t2) t3) Source #

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

Equations

ForM (a_6989586621680741284 :: t a) (a_6989586621680741286 :: a ~> m b) = Apply (Apply (Apply (FlipSym0 :: TyFun ((a ~> m b) ~> (t a ~> m (t b))) (t a ~> ((a ~> m b) ~> m (t b))) -> Type) (MapMSym0 :: TyFun (a ~> m b) (t a ~> m (t b)) -> Type)) a_6989586621680741284) a_6989586621680741286

sForM :: forall (t1 :: Type -> Type) a (m :: Type -> Type) b (t2 :: t1 a) (t3 :: a ~> m b). (STraversable t1, SMonad m) => Sing t2 -> Sing t3 -> Sing (Apply (Apply (ForMSym0 :: TyFun (t1 a) ((a ~> m b) ~> m (t1 b)) -> Type) t2) t3) Source #

type family MapAccumL (a1 :: a ~> (b ~> (a, c))) (a2 :: a) (a3 :: t b) :: (a, t c) where ... Source #

Equations

MapAccumL (f :: a ~> (b ~> (a, c))) (s :: a) (t2 :: t1 b) = Apply (Apply (RunStateLSym0 :: TyFun (StateL a (t1 c)) (a ~> (a, t1 c)) -> Type) (Apply (Apply (TraverseSym0 :: TyFun (b ~> StateL a c) (t1 b ~> StateL a (t1 c)) -> Type) (Apply (Apply ((.@#@$) :: TyFun ((a ~> (a, c)) ~> StateL a c) ((b ~> (a ~> (a, c))) ~> (b ~> StateL a c)) -> Type) (StateLSym0 :: TyFun (a ~> (a, c)) (StateL a c) -> Type)) (Apply (FlipSym0 :: TyFun (a ~> (b ~> (a, c))) (b ~> (a ~> (a, c))) -> Type) f))) t2)) s

sMapAccumL :: forall (t1 :: Type -> Type) a b c (t2 :: a ~> (b ~> (a, c))) (t3 :: a) (t4 :: t1 b). STraversable t1 => Sing t2 -> Sing t3 -> Sing t4 -> Sing (Apply (Apply (Apply (MapAccumLSym0 :: TyFun (a ~> (b ~> (a, c))) (a ~> (t1 b ~> (a, t1 c))) -> Type) t2) t3) t4) Source #

type family MapAccumR (a1 :: a ~> (b ~> (a, c))) (a2 :: a) (a3 :: t b) :: (a, t c) where ... Source #

Equations

MapAccumR (f :: k1 ~> (a ~> (k1, b))) (s :: k1) (t2 :: t1 a) = Apply (Apply (RunStateRSym0 :: TyFun (StateR k1 (t1 b)) (k1 ~> (k1, t1 b)) -> Type) (Apply (Apply (TraverseSym0 :: TyFun (a ~> StateR k1 b) (t1 a ~> StateR k1 (t1 b)) -> Type) (Apply (Apply ((.@#@$) :: TyFun ((k1 ~> (k1, b)) ~> StateR k1 b) ((a ~> (k1 ~> (k1, b))) ~> (a ~> StateR k1 b)) -> Type) (StateRSym0 :: TyFun (k1 ~> (k1, b)) (StateR k1 b) -> Type)) (Apply (FlipSym0 :: TyFun (k1 ~> (a ~> (k1, b))) (a ~> (k1 ~> (k1, b))) -> Type) f))) t2)) s

sMapAccumR :: forall a b c (t1 :: Type -> Type) (t2 :: a ~> (b ~> (a, c))) (t3 :: a) (t4 :: t1 b). STraversable t1 => Sing t2 -> Sing t3 -> Sing t4 -> Sing (Apply (Apply (Apply (MapAccumRSym0 :: TyFun (a ~> (b ~> (a, c))) (a ~> (t1 b ~> (a, t1 c))) -> Type) t2) t3) t4) Source #

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

Equations

FmapDefault (f :: a ~> b) (x :: t a) = Case_6989586621680741260 t a b f x (Let6989586621680741258Scrutinee_6989586621680740895Sym5 t a b f x)

sFmapDefault :: forall (t1 :: Type -> Type) a b (t2 :: a ~> b) (t3 :: t1 a). STraversable t1 => Sing t2 -> Sing t3 -> Sing (Apply (Apply (FmapDefaultSym0 :: TyFun (a ~> b) (t1 a ~> t1 b) -> Type) t2) t3) Source #

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

Equations

FoldMapDefault (f :: a ~> m) (x :: t a) = Case_6989586621680741247 t m a f x (Let6989586621680741245Scrutinee_6989586621680740898Sym5 t m a f x)

sFoldMapDefault :: forall (t1 :: Type -> Type) m a (t2 :: a ~> m) (t3 :: t1 a). (STraversable t1, SMonoid m) => Sing t2 -> Sing t3 -> Sing (Apply (Apply (FoldMapDefaultSym0 :: TyFun (a ~> m) (t1 a ~> m) -> Type) t2) t3) Source #

Defunctionalization symbols

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

Instances

Instances details

(STraversable t, SApplicative f) => SingI (TraverseSym0 :: TyFun (a ~> f b) (t a ~> f (t b)) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing (TraverseSym0 :: TyFun (a ~> f b) (t a ~> f (t b)) -> Type) #
SuppressUnusedWarnings (TraverseSym0 :: TyFun (a ~> f b) (t a ~> f (t b)) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (TraverseSym0 :: TyFun (a ~> f b) (t a ~> f (t b)) -> Type) (a6989586621680733986 :: a ~> f b) Source #
Instance details Defined in Data.Traversable.Singletons type Apply (TraverseSym0 :: TyFun (a ~> f b) (t a ~> f (t b)) -> Type) (a6989586621680733986 :: a ~> f b) = TraverseSym1 a6989586621680733986 :: TyFun (t a) (f (t b)) -> Type

data TraverseSym1 (a6989586621680733986 :: a ~> f b) (b1 :: TyFun (t a) (f (t b))) Source #

Instances

Instances details

(STraversable t, SApplicative f) => SingI1 (TraverseSym1 :: (a ~> f b) -> TyFun (t a) (f (t b)) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods liftSing :: forall (x :: a ~> f b). Sing x -> Sing (TraverseSym1 x :: TyFun (t a) (f (t b)) -> Type) #
(STraversable t, SApplicative f, SingI d) => SingI (TraverseSym1 d :: TyFun (t a) (f (t b)) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing (TraverseSym1 d :: TyFun (t a) (f (t b)) -> Type) #
SuppressUnusedWarnings (TraverseSym1 a6989586621680733986 :: TyFun (t a) (f (t b)) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (TraverseSym1 a6989586621680733986 :: TyFun (t a) (f (t b)) -> Type) (a6989586621680733987 :: t a) Source #
Instance details Defined in Data.Traversable.Singletons type Apply (TraverseSym1 a6989586621680733986 :: TyFun (t a) (f (t b)) -> Type) (a6989586621680733987 :: t a) = Traverse a6989586621680733986 a6989586621680733987

type family TraverseSym2 (a6989586621680733986 :: a ~> f b) (a6989586621680733987 :: t a) :: f (t b) where ... Source #

Equations

TraverseSym2 (a6989586621680733986 :: a ~> f b) (a6989586621680733987 :: t a) = Traverse a6989586621680733986 a6989586621680733987

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

Instances

Instances details

(STraversable t, SApplicative f) => SingI (SequenceASym0 :: TyFun (t (f a)) (f (t a)) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing (SequenceASym0 :: TyFun (t (f a)) (f (t a)) -> Type) #
SuppressUnusedWarnings (SequenceASym0 :: TyFun (t (f a)) (f (t a)) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (SequenceASym0 :: TyFun (t (f a)) (f (t a)) -> Type) (a6989586621680733990 :: t (f a)) Source #
Instance details Defined in Data.Traversable.Singletons type Apply (SequenceASym0 :: TyFun (t (f a)) (f (t a)) -> Type) (a6989586621680733990 :: t (f a)) = SequenceA a6989586621680733990

type family SequenceASym1 (a6989586621680733990 :: t (f a)) :: f (t a) where ... Source #

Equations

SequenceASym1 (a6989586621680733990 :: t (f a)) = SequenceA a6989586621680733990

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

Instances

Instances details

(STraversable t, SMonad m) => SingI (MapMSym0 :: TyFun (a ~> m b) (t a ~> m (t b)) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing (MapMSym0 :: TyFun (a ~> m b) (t a ~> m (t b)) -> Type) #
SuppressUnusedWarnings (MapMSym0 :: TyFun (a ~> m b) (t a ~> m (t b)) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (MapMSym0 :: TyFun (a ~> m b) (t a ~> m (t b)) -> Type) (a6989586621680733994 :: a ~> m b) Source #
Instance details Defined in Data.Traversable.Singletons type Apply (MapMSym0 :: TyFun (a ~> m b) (t a ~> m (t b)) -> Type) (a6989586621680733994 :: a ~> m b) = MapMSym1 a6989586621680733994 :: TyFun (t a) (m (t b)) -> Type

data MapMSym1 (a6989586621680733994 :: a ~> m b) (b1 :: TyFun (t a) (m (t b))) Source #

Instances

Instances details

(STraversable t, SMonad m) => SingI1 (MapMSym1 :: (a ~> m b) -> TyFun (t a) (m (t b)) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods liftSing :: forall (x :: a ~> m b). Sing x -> Sing (MapMSym1 x :: TyFun (t a) (m (t b)) -> Type) #
(STraversable t, SMonad m, SingI d) => SingI (MapMSym1 d :: TyFun (t a) (m (t b)) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing (MapMSym1 d :: TyFun (t a) (m (t b)) -> Type) #
SuppressUnusedWarnings (MapMSym1 a6989586621680733994 :: TyFun (t a) (m (t b)) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (MapMSym1 a6989586621680733994 :: TyFun (t a) (m (t b)) -> Type) (a6989586621680733995 :: t a) Source #
Instance details Defined in Data.Traversable.Singletons type Apply (MapMSym1 a6989586621680733994 :: TyFun (t a) (m (t b)) -> Type) (a6989586621680733995 :: t a) = MapM a6989586621680733994 a6989586621680733995

type family MapMSym2 (a6989586621680733994 :: a ~> m b) (a6989586621680733995 :: t a) :: m (t b) where ... Source #

Equations

MapMSym2 (a6989586621680733994 :: a ~> m b) (a6989586621680733995 :: t a) = MapM a6989586621680733994 a6989586621680733995

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

Instances

Instances details

(STraversable t, SMonad m) => SingI (SequenceSym0 :: TyFun (t (m a)) (m (t a)) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing (SequenceSym0 :: TyFun (t (m a)) (m (t a)) -> Type) #
SuppressUnusedWarnings (SequenceSym0 :: TyFun (t (m a)) (m (t a)) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (SequenceSym0 :: TyFun (t (m a)) (m (t a)) -> Type) (a6989586621680733998 :: t (m a)) Source #
Instance details Defined in Data.Traversable.Singletons type Apply (SequenceSym0 :: TyFun (t (m a)) (m (t a)) -> Type) (a6989586621680733998 :: t (m a)) = Sequence a6989586621680733998

type family SequenceSym1 (a6989586621680733998 :: t (m a)) :: m (t a) where ... Source #

Equations

SequenceSym1 (a6989586621680733998 :: t (m a)) = Sequence a6989586621680733998

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

Instances

Instances details

(STraversable t, SApplicative f) => SingI (ForSym0 :: TyFun (t a) ((a ~> f b) ~> f (t b)) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing (ForSym0 :: TyFun (t a) ((a ~> f b) ~> f (t b)) -> Type) #
SuppressUnusedWarnings (ForSym0 :: TyFun (t a) ((a ~> f b) ~> f (t b)) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (ForSym0 :: TyFun (t a) ((a ~> f b) ~> f (t b)) -> Type) (a6989586621680741302 :: t a) Source #
Instance details Defined in Data.Traversable.Singletons type Apply (ForSym0 :: TyFun (t a) ((a ~> f b) ~> f (t b)) -> Type) (a6989586621680741302 :: t a) = ForSym1 a6989586621680741302 :: TyFun (a ~> f b) (f (t b)) -> Type

data ForSym1 (a6989586621680741302 :: t a) (b1 :: TyFun (a ~> f b) (f (t b))) Source #

Instances

Instances details

(STraversable t, SApplicative f) => SingI1 (ForSym1 :: t a -> TyFun (a ~> f b) (f (t b)) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods liftSing :: forall (x :: t a). Sing x -> Sing (ForSym1 x :: TyFun (a ~> f b) (f (t b)) -> Type) #
(STraversable t, SApplicative f, SingI d) => SingI (ForSym1 d :: TyFun (a ~> f b) (f (t b)) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing (ForSym1 d :: TyFun (a ~> f b) (f (t b)) -> Type) #
SuppressUnusedWarnings (ForSym1 a6989586621680741302 :: TyFun (a ~> f b) (f (t b)) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (ForSym1 a6989586621680741302 :: TyFun (a ~> f b) (f (t b)) -> Type) (a6989586621680741303 :: a ~> f b) Source #
Instance details Defined in Data.Traversable.Singletons type Apply (ForSym1 a6989586621680741302 :: TyFun (a ~> f b) (f (t b)) -> Type) (a6989586621680741303 :: a ~> f b) = For a6989586621680741302 a6989586621680741303

type family ForSym2 (a6989586621680741302 :: t a) (a6989586621680741303 :: a ~> f b) :: f (t b) where ... Source #

Equations

ForSym2 (a6989586621680741302 :: t a) (a6989586621680741303 :: a ~> f b) = For a6989586621680741302 a6989586621680741303

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

Instances

Instances details

(STraversable t, SMonad m) => SingI (ForMSym0 :: TyFun (t a) ((a ~> m b) ~> m (t b)) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing (ForMSym0 :: TyFun (t a) ((a ~> m b) ~> m (t b)) -> Type) #
SuppressUnusedWarnings (ForMSym0 :: TyFun (t a) ((a ~> m b) ~> m (t b)) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (ForMSym0 :: TyFun (t a) ((a ~> m b) ~> m (t b)) -> Type) (a6989586621680741291 :: t a) Source #
Instance details Defined in Data.Traversable.Singletons type Apply (ForMSym0 :: TyFun (t a) ((a ~> m b) ~> m (t b)) -> Type) (a6989586621680741291 :: t a) = ForMSym1 a6989586621680741291 :: TyFun (a ~> m b) (m (t b)) -> Type

data ForMSym1 (a6989586621680741291 :: t a) (b1 :: TyFun (a ~> m b) (m (t b))) Source #

Instances

Instances details

(STraversable t, SMonad m) => SingI1 (ForMSym1 :: t a -> TyFun (a ~> m b) (m (t b)) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods liftSing :: forall (x :: t a). Sing x -> Sing (ForMSym1 x :: TyFun (a ~> m b) (m (t b)) -> Type) #
(STraversable t, SMonad m, SingI d) => SingI (ForMSym1 d :: TyFun (a ~> m b) (m (t b)) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing (ForMSym1 d :: TyFun (a ~> m b) (m (t b)) -> Type) #
SuppressUnusedWarnings (ForMSym1 a6989586621680741291 :: TyFun (a ~> m b) (m (t b)) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (ForMSym1 a6989586621680741291 :: TyFun (a ~> m b) (m (t b)) -> Type) (a6989586621680741292 :: a ~> m b) Source #
Instance details Defined in Data.Traversable.Singletons type Apply (ForMSym1 a6989586621680741291 :: TyFun (a ~> m b) (m (t b)) -> Type) (a6989586621680741292 :: a ~> m b) = ForM a6989586621680741291 a6989586621680741292

type family ForMSym2 (a6989586621680741291 :: t a) (a6989586621680741292 :: a ~> m b) :: m (t b) where ... Source #

Equations

ForMSym2 (a6989586621680741291 :: t a) (a6989586621680741292 :: a ~> m b) = ForM a6989586621680741291 a6989586621680741292

data MapAccumLSym0 (a1 :: TyFun (a ~> (b ~> (a, c))) (a ~> (t b ~> (a, t c)))) Source #

Instances

Instances details

STraversable t => SingI (MapAccumLSym0 :: TyFun (a ~> (b ~> (a, c))) (a ~> (t b ~> (a, t c))) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing (MapAccumLSym0 :: TyFun (a ~> (b ~> (a, c))) (a ~> (t b ~> (a, t c))) -> Type) #
SuppressUnusedWarnings (MapAccumLSym0 :: TyFun (a ~> (b ~> (a, c))) (a ~> (t b ~> (a, t c))) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (MapAccumLSym0 :: TyFun (a ~> (b ~> (a, c))) (a ~> (t b ~> (a, t c))) -> Type) (a6989586621680741278 :: a ~> (b ~> (a, c))) Source #
Instance details Defined in Data.Traversable.Singletons type Apply (MapAccumLSym0 :: TyFun (a ~> (b ~> (a, c))) (a ~> (t b ~> (a, t c))) -> Type) (a6989586621680741278 :: a ~> (b ~> (a, c))) = MapAccumLSym1 a6989586621680741278 :: TyFun a (t b ~> (a, t c)) -> Type

data MapAccumLSym1 (a6989586621680741278 :: a ~> (b ~> (a, c))) (b1 :: TyFun a (t b ~> (a, t c))) Source #

Instances

Instances details

STraversable t => SingI1 (MapAccumLSym1 :: (a ~> (b ~> (a, c))) -> TyFun a (t b ~> (a, t c)) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods liftSing :: forall (x :: a ~> (b ~> (a, c))). Sing x -> Sing (MapAccumLSym1 x :: TyFun a (t b ~> (a, t c)) -> Type) #
(STraversable t, SingI d) => SingI (MapAccumLSym1 d :: TyFun a (t b ~> (a, t c)) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing (MapAccumLSym1 d :: TyFun a (t b ~> (a, t c)) -> Type) #
SuppressUnusedWarnings (MapAccumLSym1 a6989586621680741278 :: TyFun a (t b ~> (a, t c)) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (MapAccumLSym1 a6989586621680741278 :: TyFun a (t b ~> (a, t c)) -> Type) (a6989586621680741279 :: a) Source #
Instance details Defined in Data.Traversable.Singletons type Apply (MapAccumLSym1 a6989586621680741278 :: TyFun a (t b ~> (a, t c)) -> Type) (a6989586621680741279 :: a) = MapAccumLSym2 a6989586621680741278 a6989586621680741279 :: TyFun (t b) (a, t c) -> Type

data MapAccumLSym2 (a6989586621680741278 :: a ~> (b ~> (a, c))) (a6989586621680741279 :: a) (c1 :: TyFun (t b) (a, t c)) Source #

Instances

Instances details

(STraversable t, SingI d) => SingI1 (MapAccumLSym2 d :: a -> TyFun (t b) (a, t c) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods liftSing :: forall (x :: a). Sing x -> Sing (MapAccumLSym2 d x :: TyFun (t b) (a, t c) -> Type) #
STraversable t => SingI2 (MapAccumLSym2 :: (a ~> (b ~> (a, c))) -> a -> TyFun (t b) (a, t c) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods liftSing2 :: forall (x :: a ~> (b ~> (a, c))) (y :: a). Sing x -> Sing y -> Sing (MapAccumLSym2 x y :: TyFun (t b) (a, t c) -> Type) #
(STraversable t, SingI d1, SingI d2) => SingI (MapAccumLSym2 d1 d2 :: TyFun (t b) (a, t c) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing (MapAccumLSym2 d1 d2 :: TyFun (t b) (a, t c) -> Type) #
SuppressUnusedWarnings (MapAccumLSym2 a6989586621680741278 a6989586621680741279 :: TyFun (t b) (a, t c) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (MapAccumLSym2 a6989586621680741278 a6989586621680741279 :: TyFun (t b) (a, t c) -> Type) (a6989586621680741280 :: t b) Source #
Instance details Defined in Data.Traversable.Singletons type Apply (MapAccumLSym2 a6989586621680741278 a6989586621680741279 :: TyFun (t b) (a, t c) -> Type) (a6989586621680741280 :: t b) = MapAccumL a6989586621680741278 a6989586621680741279 a6989586621680741280

type family MapAccumLSym3 (a6989586621680741278 :: a ~> (b ~> (a, c))) (a6989586621680741279 :: a) (a6989586621680741280 :: t b) :: (a, t c) where ... Source #

Equations

MapAccumLSym3 (a6989586621680741278 :: a ~> (b ~> (a, c))) (a6989586621680741279 :: a) (a6989586621680741280 :: t b) = MapAccumL a6989586621680741278 a6989586621680741279 a6989586621680741280

data MapAccumRSym0 (a1 :: TyFun (a ~> (b ~> (a, c))) (a ~> (t b ~> (a, t c)))) Source #

Instances

Instances details

STraversable t => SingI (MapAccumRSym0 :: TyFun (a ~> (b ~> (a, c))) (a ~> (t b ~> (a, t c))) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing (MapAccumRSym0 :: TyFun (a ~> (b ~> (a, c))) (a ~> (t b ~> (a, t c))) -> Type) #
SuppressUnusedWarnings (MapAccumRSym0 :: TyFun (a ~> (b ~> (a, c))) (a ~> (t b ~> (a, t c))) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (MapAccumRSym0 :: TyFun (a ~> (b ~> (a, c))) (a ~> (t b ~> (a, t c))) -> Type) (a6989586621680741268 :: a ~> (b ~> (a, c))) Source #
Instance details Defined in Data.Traversable.Singletons type Apply (MapAccumRSym0 :: TyFun (a ~> (b ~> (a, c))) (a ~> (t b ~> (a, t c))) -> Type) (a6989586621680741268 :: a ~> (b ~> (a, c))) = MapAccumRSym1 a6989586621680741268 :: TyFun a (t b ~> (a, t c)) -> Type

data MapAccumRSym1 (a6989586621680741268 :: a ~> (b ~> (a, c))) (b1 :: TyFun a (t b ~> (a, t c))) Source #

Instances

Instances details

STraversable t => SingI1 (MapAccumRSym1 :: (a ~> (b ~> (a, c))) -> TyFun a (t b ~> (a, t c)) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods liftSing :: forall (x :: a ~> (b ~> (a, c))). Sing x -> Sing (MapAccumRSym1 x :: TyFun a (t b ~> (a, t c)) -> Type) #
(STraversable t, SingI d) => SingI (MapAccumRSym1 d :: TyFun a (t b ~> (a, t c)) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing (MapAccumRSym1 d :: TyFun a (t b ~> (a, t c)) -> Type) #
SuppressUnusedWarnings (MapAccumRSym1 a6989586621680741268 :: TyFun a (t b ~> (a, t c)) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (MapAccumRSym1 a6989586621680741268 :: TyFun a (t b ~> (a, t c)) -> Type) (a6989586621680741269 :: a) Source #
Instance details Defined in Data.Traversable.Singletons type Apply (MapAccumRSym1 a6989586621680741268 :: TyFun a (t b ~> (a, t c)) -> Type) (a6989586621680741269 :: a) = MapAccumRSym2 a6989586621680741268 a6989586621680741269 :: TyFun (t b) (a, t c) -> Type

data MapAccumRSym2 (a6989586621680741268 :: a ~> (b ~> (a, c))) (a6989586621680741269 :: a) (c1 :: TyFun (t b) (a, t c)) Source #

Instances

Instances details

(STraversable t, SingI d) => SingI1 (MapAccumRSym2 d :: a -> TyFun (t b) (a, t c) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods liftSing :: forall (x :: a). Sing x -> Sing (MapAccumRSym2 d x :: TyFun (t b) (a, t c) -> Type) #
STraversable t => SingI2 (MapAccumRSym2 :: (a ~> (b ~> (a, c))) -> a -> TyFun (t b) (a, t c) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods liftSing2 :: forall (x :: a ~> (b ~> (a, c))) (y :: a). Sing x -> Sing y -> Sing (MapAccumRSym2 x y :: TyFun (t b) (a, t c) -> Type) #
(STraversable t, SingI d1, SingI d2) => SingI (MapAccumRSym2 d1 d2 :: TyFun (t b) (a, t c) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing (MapAccumRSym2 d1 d2 :: TyFun (t b) (a, t c) -> Type) #
SuppressUnusedWarnings (MapAccumRSym2 a6989586621680741268 a6989586621680741269 :: TyFun (t b) (a, t c) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (MapAccumRSym2 a6989586621680741268 a6989586621680741269 :: TyFun (t b) (a, t c) -> Type) (a6989586621680741270 :: t b) Source #
Instance details Defined in Data.Traversable.Singletons type Apply (MapAccumRSym2 a6989586621680741268 a6989586621680741269 :: TyFun (t b) (a, t c) -> Type) (a6989586621680741270 :: t b) = MapAccumR a6989586621680741268 a6989586621680741269 a6989586621680741270

type family MapAccumRSym3 (a6989586621680741268 :: a ~> (b ~> (a, c))) (a6989586621680741269 :: a) (a6989586621680741270 :: t b) :: (a, t c) where ... Source #

Equations

MapAccumRSym3 (a6989586621680741268 :: a ~> (b ~> (a, c))) (a6989586621680741269 :: a) (a6989586621680741270 :: t b) = MapAccumR a6989586621680741268 a6989586621680741269 a6989586621680741270

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

Instances

Instances details

STraversable t => SingI (FmapDefaultSym0 :: TyFun (a ~> b) (t a ~> t b) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing (FmapDefaultSym0 :: TyFun (a ~> b) (t a ~> t b) -> Type) #
SuppressUnusedWarnings (FmapDefaultSym0 :: TyFun (a ~> b) (t a ~> t b) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (FmapDefaultSym0 :: TyFun (a ~> b) (t a ~> t b) -> Type) (a6989586621680741254 :: a ~> b) Source #
Instance details Defined in Data.Traversable.Singletons type Apply (FmapDefaultSym0 :: TyFun (a ~> b) (t a ~> t b) -> Type) (a6989586621680741254 :: a ~> b) = FmapDefaultSym1 a6989586621680741254 :: TyFun (t a) (t b) -> Type

data FmapDefaultSym1 (a6989586621680741254 :: a ~> b) (b1 :: TyFun (t a) (t b)) Source #

Instances

Instances details

STraversable t => SingI1 (FmapDefaultSym1 :: (a ~> b) -> TyFun (t a) (t b) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods liftSing :: forall (x :: a ~> b). Sing x -> Sing (FmapDefaultSym1 x :: TyFun (t a) (t b) -> Type) #
(STraversable t, SingI d) => SingI (FmapDefaultSym1 d :: TyFun (t a) (t b) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing (FmapDefaultSym1 d :: TyFun (t a) (t b) -> Type) #
SuppressUnusedWarnings (FmapDefaultSym1 a6989586621680741254 :: TyFun (t a) (t b) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (FmapDefaultSym1 a6989586621680741254 :: TyFun (t a) (t b) -> Type) (a6989586621680741255 :: t a) Source #
Instance details Defined in Data.Traversable.Singletons type Apply (FmapDefaultSym1 a6989586621680741254 :: TyFun (t a) (t b) -> Type) (a6989586621680741255 :: t a) = FmapDefault a6989586621680741254 a6989586621680741255

type family FmapDefaultSym2 (a6989586621680741254 :: a ~> b) (a6989586621680741255 :: t a) :: t b where ... Source #

Equations

FmapDefaultSym2 (a6989586621680741254 :: a ~> b) (a6989586621680741255 :: t a) = FmapDefault a6989586621680741254 a6989586621680741255

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

Instances

Instances details

(STraversable t, SMonoid m) => SingI (FoldMapDefaultSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing (FoldMapDefaultSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) #
SuppressUnusedWarnings (FoldMapDefaultSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (FoldMapDefaultSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) (a6989586621680741235 :: a ~> m) Source #
Instance details Defined in Data.Traversable.Singletons type Apply (FoldMapDefaultSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) (a6989586621680741235 :: a ~> m) = FoldMapDefaultSym1 a6989586621680741235 :: TyFun (t a) m -> Type

data FoldMapDefaultSym1 (a6989586621680741235 :: a ~> m) (b :: TyFun (t a) m) Source #

Instances

Instances details

(STraversable t, SMonoid m) => SingI1 (FoldMapDefaultSym1 :: (a ~> m) -> TyFun (t a) m -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods liftSing :: forall (x :: a ~> m). Sing x -> Sing (FoldMapDefaultSym1 x :: TyFun (t a) m -> Type) #
(STraversable t, SMonoid m, SingI d) => SingI (FoldMapDefaultSym1 d :: TyFun (t a) m -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods sing :: Sing (FoldMapDefaultSym1 d :: TyFun (t a) m -> Type) #
SuppressUnusedWarnings (FoldMapDefaultSym1 a6989586621680741235 :: TyFun (t a) m -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (FoldMapDefaultSym1 a6989586621680741235 :: TyFun (t a) m -> Type) (a6989586621680741236 :: t a) Source #
Instance details Defined in Data.Traversable.Singletons type Apply (FoldMapDefaultSym1 a6989586621680741235 :: TyFun (t a) m -> Type) (a6989586621680741236 :: t a) = FoldMapDefault a6989586621680741235 a6989586621680741236

type family FoldMapDefaultSym2 (a6989586621680741235 :: a ~> m) (a6989586621680741236 :: t a) :: m where ... Source #

Equations

FoldMapDefaultSym2 (a6989586621680741235 :: a ~> m) (a6989586621680741236 :: t a) = FoldMapDefault a6989586621680741235 a6989586621680741236