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

Data.Traversable.Singletons

Contents

Defunctionalization symbols

Description

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

Synopsis

class PTraversable t where
- type Traverse (arg :: (~>) a (f b)) (arg :: t a) :: f (t b)
- type SequenceA (arg :: t (f a)) :: f (t a)
- type MapM (arg :: (~>) a (m b)) (arg :: t a) :: m (t b)
- type Sequence (arg :: t (m a)) :: m (t a)
class (SFunctor t, SFoldable t) => STraversable t where
- sTraverse :: forall a f b (t :: (~>) a (f b)) (t :: t a). SApplicative f => Sing t -> Sing t -> Sing (Apply (Apply TraverseSym0 t) t :: f (t b))
- sSequenceA :: forall f a (t :: t (f a)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t :: f (t a))
- sMapM :: forall a m b (t :: (~>) a (m b)) (t :: t a). SMonad m => Sing t -> Sing t -> Sing (Apply (Apply MapMSym0 t) t :: m (t b))
- sSequence :: forall m a (t :: t (m a)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t :: m (t a))
type family For (a :: t a) (a :: (~>) a (f b)) :: f (t b) where ...
sFor :: forall t a f b (t :: t a) (t :: (~>) a (f b)). (STraversable t, SApplicative f) => Sing t -> Sing t -> Sing (Apply (Apply ForSym0 t) t :: f (t b))
type family ForM (a :: t a) (a :: (~>) a (m b)) :: m (t b) where ...
sForM :: forall t a m b (t :: t a) (t :: (~>) a (m b)). (STraversable t, SMonad m) => Sing t -> Sing t -> Sing (Apply (Apply ForMSym0 t) t :: m (t b))
type family MapAccumL (a :: (~>) a ((~>) b (a, c))) (a :: a) (a :: t b) :: (a, t c) where ...
sMapAccumL :: forall t a b c (t :: (~>) a ((~>) b (a, c))) (t :: a) (t :: t b). STraversable t => Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply MapAccumLSym0 t) t) t :: (a, t c))
type family MapAccumR (a :: (~>) a ((~>) b (a, c))) (a :: a) (a :: t b) :: (a, t c) where ...
sMapAccumR :: forall a b c t (t :: (~>) a ((~>) b (a, c))) (t :: a) (t :: t b). STraversable t => Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply MapAccumRSym0 t) t) t :: (a, t c))
type family FmapDefault (a :: (~>) a b) (a :: t a) :: t b where ...
sFmapDefault :: forall t a b (t :: (~>) a b) (t :: t a). STraversable t => Sing t -> Sing t -> Sing (Apply (Apply FmapDefaultSym0 t) t :: t b)
type family FoldMapDefault (a :: (~>) a m) (a :: t a) :: m where ...
sFoldMapDefault :: forall t m a (t :: (~>) a m) (t :: t a). (STraversable t, SMonoid m) => Sing t -> Sing t -> Sing (Apply (Apply FoldMapDefaultSym0 t) t :: m)
data TraverseSym0 :: (~>) ((~>) a (f b)) ((~>) (t a) (f (t b)))
data TraverseSym1 (a6989586621680777174 :: (~>) a (f b)) :: (~>) (t a) (f (t b))
type family TraverseSym2 (a6989586621680777174 :: (~>) a (f b)) (a6989586621680777175 :: t a) :: f (t b) where ...
data SequenceASym0 :: (~>) (t (f a)) (f (t a))
type family SequenceASym1 (a6989586621680777178 :: t (f a)) :: f (t a) where ...
data MapMSym0 :: (~>) ((~>) a (m b)) ((~>) (t a) (m (t b)))
data MapMSym1 (a6989586621680777182 :: (~>) a (m b)) :: (~>) (t a) (m (t b))
type family MapMSym2 (a6989586621680777182 :: (~>) a (m b)) (a6989586621680777183 :: t a) :: m (t b) where ...
data SequenceSym0 :: (~>) (t (m a)) (m (t a))
type family SequenceSym1 (a6989586621680777186 :: t (m a)) :: m (t a) where ...
data ForSym0 :: (~>) (t a) ((~>) ((~>) a (f b)) (f (t b)))
data ForSym1 (a6989586621680784618 :: t a) :: (~>) ((~>) a (f b)) (f (t b))
type family ForSym2 (a6989586621680784618 :: t a) (a6989586621680784619 :: (~>) a (f b)) :: f (t b) where ...
data ForMSym0 :: (~>) (t a) ((~>) ((~>) a (m b)) (m (t b)))
data ForMSym1 (a6989586621680784607 :: t a) :: (~>) ((~>) a (m b)) (m (t b))
type family ForMSym2 (a6989586621680784607 :: t a) (a6989586621680784608 :: (~>) a (m b)) :: m (t b) where ...
data MapAccumLSym0 :: (~>) ((~>) a ((~>) b (a, c))) ((~>) a ((~>) (t b) (a, t c)))
data MapAccumLSym1 (a6989586621680784594 :: (~>) a ((~>) b (a, c))) :: (~>) a ((~>) (t b) (a, t c))
data MapAccumLSym2 (a6989586621680784594 :: (~>) a ((~>) b (a, c))) (a6989586621680784595 :: a) :: (~>) (t b) (a, t c)
type family MapAccumLSym3 (a6989586621680784594 :: (~>) a ((~>) b (a, c))) (a6989586621680784595 :: a) (a6989586621680784596 :: t b) :: (a, t c) where ...
data MapAccumRSym0 :: (~>) ((~>) a ((~>) b (a, c))) ((~>) a ((~>) (t b) (a, t c)))
data MapAccumRSym1 (a6989586621680784584 :: (~>) a ((~>) b (a, c))) :: (~>) a ((~>) (t b) (a, t c))
data MapAccumRSym2 (a6989586621680784584 :: (~>) a ((~>) b (a, c))) (a6989586621680784585 :: a) :: (~>) (t b) (a, t c)
type family MapAccumRSym3 (a6989586621680784584 :: (~>) a ((~>) b (a, c))) (a6989586621680784585 :: a) (a6989586621680784586 :: t b) :: (a, t c) where ...
data FmapDefaultSym0 :: (~>) ((~>) a b) ((~>) (t a) (t b))
data FmapDefaultSym1 (a6989586621680784570 :: (~>) a b) :: (~>) (t a) (t b)
type family FmapDefaultSym2 (a6989586621680784570 :: (~>) a b) (a6989586621680784571 :: t a) :: t b where ...
data FoldMapDefaultSym0 :: (~>) ((~>) a m) ((~>) (t a) m)
data FoldMapDefaultSym1 (a6989586621680784551 :: (~>) a m) :: (~>) (t a) m
type family FoldMapDefaultSym2 (a6989586621680784551 :: (~>) a m) (a6989586621680784552 :: t a) :: m where ...

Documentation

class PTraversable t Source #

Associated Types

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

type Traverse a a = Apply (Apply Traverse_6989586621680777189Sym0 a) a

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

type SequenceA a = Apply SequenceA_6989586621680777201Sym0 a

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

type MapM a a = Apply (Apply MapM_6989586621680777211Sym0 a) a

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

type Sequence a = Apply Sequence_6989586621680777225Sym0 a

Instances

Instances details

PTraversable Identity Source #
Instance details Defined in Data.Traversable.Singletons Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #
PTraversable First Source #
Instance details Defined in Data.Traversable.Singletons Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #
PTraversable Last Source #
Instance details Defined in Data.Traversable.Singletons Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #
PTraversable First Source #
Instance details Defined in Data.Semigroup.Singletons Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #
PTraversable Last Source #
Instance details Defined in Data.Semigroup.Singletons Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #
PTraversable Max Source #
Instance details Defined in Data.Semigroup.Singletons Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #
PTraversable Min Source #
Instance details Defined in Data.Semigroup.Singletons Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #
PTraversable Dual Source #
Instance details Defined in Data.Traversable.Singletons Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #
PTraversable Product Source #
Instance details Defined in Data.Traversable.Singletons Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #
PTraversable Sum Source #
Instance details Defined in Data.Traversable.Singletons Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #
PTraversable NonEmpty Source #
Instance details Defined in Data.Traversable.Singletons Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #
PTraversable Maybe Source #
Instance details Defined in Data.Traversable.Singletons Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #
PTraversable [] Source #
Instance details Defined in Data.Traversable.Singletons Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #
PTraversable (Either a) Source #
Instance details Defined in Data.Traversable.Singletons Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #
PTraversable (Proxy :: Type -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #
PTraversable (Arg a) Source #
Instance details Defined in Data.Semigroup.Singletons Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #
PTraversable ((,) a) Source #
Instance details Defined in Data.Traversable.Singletons Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #
PTraversable (Const m :: Type -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #
PTraversable (Product f g) Source #
Instance details Defined in Data.Functor.Product.Singletons Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #
PTraversable (Sum f g) Source #
Instance details Defined in Data.Functor.Sum.Singletons Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #
PTraversable (Compose f g) Source #
Instance details Defined in Data.Functor.Compose.Singletons Associated Types type Traverse arg arg :: f (t b) Source # type SequenceA arg :: f (t a) Source # type MapM arg arg :: m (t b) Source # type Sequence arg :: m (t a) Source #

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

Minimal complete definition

Nothing

Methods

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

default sTraverse :: forall a f b (t :: (~>) a (f b)) (t :: t a). ((Apply (Apply TraverseSym0 t) t :: f (t b)) ~ Apply (Apply Traverse_6989586621680777189Sym0 t) t, SApplicative f) => Sing t -> Sing t -> Sing (Apply (Apply TraverseSym0 t) t :: f (t b)) Source #

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

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

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

default sMapM :: forall a m b (t :: (~>) a (m b)) (t :: t a). ((Apply (Apply MapMSym0 t) t :: m (t b)) ~ Apply (Apply MapM_6989586621680777211Sym0 t) t, SMonad m) => Sing t -> Sing t -> Sing (Apply (Apply MapMSym0 t) t :: m (t b)) Source #

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

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

Instances

Instances details

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

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

Equations

For a_6989586621680784611 a_6989586621680784613 = Apply (Apply (Apply FlipSym0 TraverseSym0) a_6989586621680784611) a_6989586621680784613

sFor :: forall t a f b (t :: t a) (t :: (~>) a (f b)). (STraversable t, SApplicative f) => Sing t -> Sing t -> Sing (Apply (Apply ForSym0 t) t :: f (t b)) Source #

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

Equations

ForM a_6989586621680784600 a_6989586621680784602 = Apply (Apply (Apply FlipSym0 MapMSym0) a_6989586621680784600) a_6989586621680784602

sForM :: forall t a m b (t :: t a) (t :: (~>) a (m b)). (STraversable t, SMonad m) => Sing t -> Sing t -> Sing (Apply (Apply ForMSym0 t) t :: m (t b)) Source #

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

Equations

MapAccumL f s t = Apply (Apply RunStateLSym0 (Apply (Apply TraverseSym0 (Apply (Apply (.@#@$) StateLSym0) (Apply FlipSym0 f))) t)) s

sMapAccumL :: forall t a b c (t :: (~>) a ((~>) b (a, c))) (t :: a) (t :: t b). STraversable t => Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply MapAccumLSym0 t) t) t :: (a, t c)) Source #

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

Equations

MapAccumR f s t = Apply (Apply RunStateRSym0 (Apply (Apply TraverseSym0 (Apply (Apply (.@#@$) StateRSym0) (Apply FlipSym0 f))) t)) s

sMapAccumR :: forall a b c t (t :: (~>) a ((~>) b (a, c))) (t :: a) (t :: t b). STraversable t => Sing t -> Sing t -> Sing t -> Sing (Apply (Apply (Apply MapAccumRSym0 t) t) t :: (a, t c)) Source #

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

Equations

FmapDefault f x = Case_6989586621680784576 f x (Let6989586621680784574Scrutinee_6989586621680784188Sym2 f x)

sFmapDefault :: forall t a b (t :: (~>) a b) (t :: t a). STraversable t => Sing t -> Sing t -> Sing (Apply (Apply FmapDefaultSym0 t) t :: t b) Source #

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

Equations

FoldMapDefault f x = Case_6989586621680784563 f x (Let6989586621680784561Scrutinee_6989586621680784191Sym2 f x)

sFoldMapDefault :: forall t m a (t :: (~>) a m) (t :: t a). (STraversable t, SMonoid m) => Sing t -> Sing t -> Sing (Apply (Apply FoldMapDefaultSym0 t) t :: m) Source #

Defunctionalization symbols

data TraverseSym0 :: (~>) ((~>) 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
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) (a6989586621680777174 :: a ~> f b) Source #
Instance details Defined in Data.Traversable.Singletons type Apply (TraverseSym0 :: TyFun (a ~> f b) (t a ~> f (t b)) -> Type) (a6989586621680777174 :: a ~> f b) = TraverseSym1 a6989586621680777174 :: TyFun (t a) (f (t b)) -> Type

data TraverseSym1 (a6989586621680777174 :: (~>) a (f b)) :: (~>) (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 :: k1). Sing x -> Sing (TraverseSym1 x)
(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)
SuppressUnusedWarnings (TraverseSym1 a6989586621680777174 :: TyFun (t a) (f (t b)) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (TraverseSym1 a6989586621680777174 :: TyFun (t a) (f (t b)) -> Type) (a6989586621680777175 :: t a) Source #
Instance details Defined in Data.Traversable.Singletons type Apply (TraverseSym1 a6989586621680777174 :: TyFun (t a) (f (t b)) -> Type) (a6989586621680777175 :: t a) = Traverse a6989586621680777174 a6989586621680777175

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

Equations

TraverseSym2 a6989586621680777174 a6989586621680777175 = Traverse a6989586621680777174 a6989586621680777175

data SequenceASym0 :: (~>) (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
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) (a6989586621680777178 :: t (f a)) Source #
Instance details Defined in Data.Traversable.Singletons type Apply (SequenceASym0 :: TyFun (t (f a)) (f (t a)) -> Type) (a6989586621680777178 :: t (f a)) = SequenceA a6989586621680777178

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

Equations

SequenceASym1 a6989586621680777178 = SequenceA a6989586621680777178

data MapMSym0 :: (~>) ((~>) 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
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) (a6989586621680777182 :: a ~> m b) Source #
Instance details Defined in Data.Traversable.Singletons type Apply (MapMSym0 :: TyFun (a ~> m b) (t a ~> m (t b)) -> Type) (a6989586621680777182 :: a ~> m b) = MapMSym1 a6989586621680777182 :: TyFun (t a) (m (t b)) -> Type

data MapMSym1 (a6989586621680777182 :: (~>) a (m b)) :: (~>) (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 :: k1). Sing x -> Sing (MapMSym1 x)
(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)
SuppressUnusedWarnings (MapMSym1 a6989586621680777182 :: TyFun (t a) (m (t b)) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (MapMSym1 a6989586621680777182 :: TyFun (t a) (m (t b)) -> Type) (a6989586621680777183 :: t a) Source #
Instance details Defined in Data.Traversable.Singletons type Apply (MapMSym1 a6989586621680777182 :: TyFun (t a) (m (t b)) -> Type) (a6989586621680777183 :: t a) = MapM a6989586621680777182 a6989586621680777183

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

Equations

MapMSym2 a6989586621680777182 a6989586621680777183 = MapM a6989586621680777182 a6989586621680777183

data SequenceSym0 :: (~>) (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
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) (a6989586621680777186 :: t (m a)) Source #
Instance details Defined in Data.Traversable.Singletons type Apply (SequenceSym0 :: TyFun (t (m a)) (m (t a)) -> Type) (a6989586621680777186 :: t (m a)) = Sequence a6989586621680777186

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

Equations

SequenceSym1 a6989586621680777186 = Sequence a6989586621680777186

data ForSym0 :: (~>) (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
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) (a6989586621680784618 :: t a) Source #
Instance details Defined in Data.Traversable.Singletons type Apply (ForSym0 :: TyFun (t a) ((a ~> f b) ~> f (t b)) -> Type) (a6989586621680784618 :: t a) = ForSym1 a6989586621680784618 :: TyFun (a ~> f b) (f (t b)) -> Type

data ForSym1 (a6989586621680784618 :: t a) :: (~>) ((~>) 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 :: k1). Sing x -> Sing (ForSym1 x)
(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)
SuppressUnusedWarnings (ForSym1 a6989586621680784618 :: TyFun (a ~> f b) (f (t b)) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (ForSym1 a6989586621680784618 :: TyFun (a ~> f b) (f (t b)) -> Type) (a6989586621680784619 :: a ~> f b) Source #
Instance details Defined in Data.Traversable.Singletons type Apply (ForSym1 a6989586621680784618 :: TyFun (a ~> f b) (f (t b)) -> Type) (a6989586621680784619 :: a ~> f b) = For a6989586621680784618 a6989586621680784619

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

Equations

ForSym2 a6989586621680784618 a6989586621680784619 = For a6989586621680784618 a6989586621680784619

data ForMSym0 :: (~>) (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
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) (a6989586621680784607 :: t a) Source #
Instance details Defined in Data.Traversable.Singletons type Apply (ForMSym0 :: TyFun (t a) ((a ~> m b) ~> m (t b)) -> Type) (a6989586621680784607 :: t a) = ForMSym1 a6989586621680784607 :: TyFun (a ~> m b) (m (t b)) -> Type

data ForMSym1 (a6989586621680784607 :: t a) :: (~>) ((~>) 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 :: k1). Sing x -> Sing (ForMSym1 x)
(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)
SuppressUnusedWarnings (ForMSym1 a6989586621680784607 :: TyFun (a ~> m b) (m (t b)) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (ForMSym1 a6989586621680784607 :: TyFun (a ~> m b) (m (t b)) -> Type) (a6989586621680784608 :: a ~> m b) Source #
Instance details Defined in Data.Traversable.Singletons type Apply (ForMSym1 a6989586621680784607 :: TyFun (a ~> m b) (m (t b)) -> Type) (a6989586621680784608 :: a ~> m b) = ForM a6989586621680784607 a6989586621680784608

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

Equations

ForMSym2 a6989586621680784607 a6989586621680784608 = ForM a6989586621680784607 a6989586621680784608

data MapAccumLSym0 :: (~>) ((~>) 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
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) (a6989586621680784594 :: 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) (a6989586621680784594 :: a ~> (b ~> (a, c))) = MapAccumLSym1 a6989586621680784594 :: TyFun a (t b ~> (a, t c)) -> Type

data MapAccumLSym1 (a6989586621680784594 :: (~>) a ((~>) b (a, c))) :: (~>) 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 :: k1). Sing x -> Sing (MapAccumLSym1 x)
(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)
SuppressUnusedWarnings (MapAccumLSym1 a6989586621680784594 :: TyFun a (t b ~> (a, t c)) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (MapAccumLSym1 a6989586621680784594 :: TyFun a (t b ~> (a, t c)) -> Type) (a6989586621680784595 :: a) Source #
Instance details Defined in Data.Traversable.Singletons type Apply (MapAccumLSym1 a6989586621680784594 :: TyFun a (t b ~> (a, t c)) -> Type) (a6989586621680784595 :: a) = MapAccumLSym2 a6989586621680784594 a6989586621680784595 :: TyFun (t b) (a, t c) -> Type

data MapAccumLSym2 (a6989586621680784594 :: (~>) a ((~>) b (a, c))) (a6989586621680784595 :: a) :: (~>) (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 :: k1). Sing x -> Sing (MapAccumLSym2 d x)
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 :: k1) (y :: k2). Sing x -> Sing y -> Sing (MapAccumLSym2 x y)
(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)
SuppressUnusedWarnings (MapAccumLSym2 a6989586621680784594 a6989586621680784595 :: TyFun (t b) (a, t c) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (MapAccumLSym2 a6989586621680784594 a6989586621680784595 :: TyFun (t b) (a, t c) -> Type) (a6989586621680784596 :: t b) Source #
Instance details Defined in Data.Traversable.Singletons type Apply (MapAccumLSym2 a6989586621680784594 a6989586621680784595 :: TyFun (t b) (a, t c) -> Type) (a6989586621680784596 :: t b) = MapAccumL a6989586621680784594 a6989586621680784595 a6989586621680784596

type family MapAccumLSym3 (a6989586621680784594 :: (~>) a ((~>) b (a, c))) (a6989586621680784595 :: a) (a6989586621680784596 :: t b) :: (a, t c) where ... Source #

Equations

MapAccumLSym3 a6989586621680784594 a6989586621680784595 a6989586621680784596 = MapAccumL a6989586621680784594 a6989586621680784595 a6989586621680784596

data MapAccumRSym0 :: (~>) ((~>) 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
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) (a6989586621680784584 :: 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) (a6989586621680784584 :: a ~> (b ~> (a, c))) = MapAccumRSym1 a6989586621680784584 :: TyFun a (t b ~> (a, t c)) -> Type

data MapAccumRSym1 (a6989586621680784584 :: (~>) a ((~>) b (a, c))) :: (~>) 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 :: k1). Sing x -> Sing (MapAccumRSym1 x)
(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)
SuppressUnusedWarnings (MapAccumRSym1 a6989586621680784584 :: TyFun a (t b ~> (a, t c)) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (MapAccumRSym1 a6989586621680784584 :: TyFun a (t b ~> (a, t c)) -> Type) (a6989586621680784585 :: a) Source #
Instance details Defined in Data.Traversable.Singletons type Apply (MapAccumRSym1 a6989586621680784584 :: TyFun a (t b ~> (a, t c)) -> Type) (a6989586621680784585 :: a) = MapAccumRSym2 a6989586621680784584 a6989586621680784585 :: TyFun (t b) (a, t c) -> Type

data MapAccumRSym2 (a6989586621680784584 :: (~>) a ((~>) b (a, c))) (a6989586621680784585 :: a) :: (~>) (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 :: k1). Sing x -> Sing (MapAccumRSym2 d x)
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 :: k1) (y :: k2). Sing x -> Sing y -> Sing (MapAccumRSym2 x y)
(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)
SuppressUnusedWarnings (MapAccumRSym2 a6989586621680784584 a6989586621680784585 :: TyFun (t b) (a, t c) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (MapAccumRSym2 a6989586621680784584 a6989586621680784585 :: TyFun (t b) (a, t c) -> Type) (a6989586621680784586 :: t b) Source #
Instance details Defined in Data.Traversable.Singletons type Apply (MapAccumRSym2 a6989586621680784584 a6989586621680784585 :: TyFun (t b) (a, t c) -> Type) (a6989586621680784586 :: t b) = MapAccumR a6989586621680784584 a6989586621680784585 a6989586621680784586

type family MapAccumRSym3 (a6989586621680784584 :: (~>) a ((~>) b (a, c))) (a6989586621680784585 :: a) (a6989586621680784586 :: t b) :: (a, t c) where ... Source #

Equations

MapAccumRSym3 a6989586621680784584 a6989586621680784585 a6989586621680784586 = MapAccumR a6989586621680784584 a6989586621680784585 a6989586621680784586

data FmapDefaultSym0 :: (~>) ((~>) 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
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) (a6989586621680784570 :: a ~> b) Source #
Instance details Defined in Data.Traversable.Singletons type Apply (FmapDefaultSym0 :: TyFun (a ~> b) (t a ~> t b) -> Type) (a6989586621680784570 :: a ~> b) = FmapDefaultSym1 a6989586621680784570 :: TyFun (t a) (t b) -> Type

data FmapDefaultSym1 (a6989586621680784570 :: (~>) a b) :: (~>) (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 :: k1). Sing x -> Sing (FmapDefaultSym1 x)
(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)
SuppressUnusedWarnings (FmapDefaultSym1 a6989586621680784570 :: TyFun (t a) (t b) -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (FmapDefaultSym1 a6989586621680784570 :: TyFun (t a) (t b) -> Type) (a6989586621680784571 :: t a) Source #
Instance details Defined in Data.Traversable.Singletons type Apply (FmapDefaultSym1 a6989586621680784570 :: TyFun (t a) (t b) -> Type) (a6989586621680784571 :: t a) = FmapDefault a6989586621680784570 a6989586621680784571

type family FmapDefaultSym2 (a6989586621680784570 :: (~>) a b) (a6989586621680784571 :: t a) :: t b where ... Source #

Equations

FmapDefaultSym2 a6989586621680784570 a6989586621680784571 = FmapDefault a6989586621680784570 a6989586621680784571

data FoldMapDefaultSym0 :: (~>) ((~>) 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
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) (a6989586621680784551 :: a ~> m) Source #
Instance details Defined in Data.Traversable.Singletons type Apply (FoldMapDefaultSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) (a6989586621680784551 :: a ~> m) = FoldMapDefaultSym1 a6989586621680784551 :: TyFun (t a) m -> Type

data FoldMapDefaultSym1 (a6989586621680784551 :: (~>) a m) :: (~>) (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 :: k1). Sing x -> Sing (FoldMapDefaultSym1 x)
(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)
SuppressUnusedWarnings (FoldMapDefaultSym1 a6989586621680784551 :: TyFun (t a) m -> Type) Source #
Instance details Defined in Data.Traversable.Singletons Methods suppressUnusedWarnings :: () #
type Apply (FoldMapDefaultSym1 a6989586621680784551 :: TyFun (t a) m -> Type) (a6989586621680784552 :: t a) Source #
Instance details Defined in Data.Traversable.Singletons type Apply (FoldMapDefaultSym1 a6989586621680784551 :: TyFun (t a) m -> Type) (a6989586621680784552 :: t a) = FoldMapDefault a6989586621680784551 a6989586621680784552

type family FoldMapDefaultSym2 (a6989586621680784551 :: (~>) a m) (a6989586621680784552 :: t a) :: m where ... Source #

Equations

FoldMapDefaultSym2 a6989586621680784551 a6989586621680784552 = FoldMapDefault a6989586621680784551 a6989586621680784552