singletons-2.6: A framework for generating singleton types
Copyright(C) 2018 Ryan Scott
LicenseBSD-style (see LICENSE)
MaintainerRyan Scott
Stabilityexperimental
Portabilitynon-portable
Safe HaskellNone
LanguageHaskell2010

Data.Singletons.Prelude.Traversable

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)) (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 :: Type -> Type) where
  • 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 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 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 a b t (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 a m t (t :: (~>) a m) (t :: t a). (STraversable t, SMonoid m) => Sing t -> Sing t -> Sing (Apply (Apply FoldMapDefaultSym0 t) t :: m)
  • data TraverseSym0 :: forall a6989586621680798695 f6989586621680798694 b6989586621680798696 t6989586621680798693. (~>) ((~>) a6989586621680798695 (f6989586621680798694 b6989586621680798696)) ((~>) (t6989586621680798693 a6989586621680798695) (f6989586621680798694 (t6989586621680798693 b6989586621680798696)))
  • data TraverseSym1 (arg6989586621680798705 :: (~>) a6989586621680798695 (f6989586621680798694 b6989586621680798696)) :: forall t6989586621680798693. (~>) (t6989586621680798693 a6989586621680798695) (f6989586621680798694 (t6989586621680798693 b6989586621680798696))
  • type TraverseSym2 (arg6989586621680798705 :: (~>) a6989586621680798695 (f6989586621680798694 b6989586621680798696)) (arg6989586621680798706 :: t6989586621680798693 a6989586621680798695) = Traverse arg6989586621680798705 arg6989586621680798706
  • data SequenceASym0 :: forall t6989586621680798693 f6989586621680798697 a6989586621680798698. (~>) (t6989586621680798693 (f6989586621680798697 a6989586621680798698)) (f6989586621680798697 (t6989586621680798693 a6989586621680798698))
  • type SequenceASym1 (arg6989586621680798709 :: t6989586621680798693 (f6989586621680798697 a6989586621680798698)) = SequenceA arg6989586621680798709
  • data MapMSym0 :: forall a6989586621680798700 m6989586621680798699 b6989586621680798701 t6989586621680798693. (~>) ((~>) a6989586621680798700 (m6989586621680798699 b6989586621680798701)) ((~>) (t6989586621680798693 a6989586621680798700) (m6989586621680798699 (t6989586621680798693 b6989586621680798701)))
  • data MapMSym1 (arg6989586621680798711 :: (~>) a6989586621680798700 (m6989586621680798699 b6989586621680798701)) :: forall t6989586621680798693. (~>) (t6989586621680798693 a6989586621680798700) (m6989586621680798699 (t6989586621680798693 b6989586621680798701))
  • type MapMSym2 (arg6989586621680798711 :: (~>) a6989586621680798700 (m6989586621680798699 b6989586621680798701)) (arg6989586621680798712 :: t6989586621680798693 a6989586621680798700) = MapM arg6989586621680798711 arg6989586621680798712
  • data SequenceSym0 :: forall t6989586621680798693 m6989586621680798702 a6989586621680798703. (~>) (t6989586621680798693 (m6989586621680798702 a6989586621680798703)) (m6989586621680798702 (t6989586621680798693 a6989586621680798703))
  • type SequenceSym1 (arg6989586621680798715 :: t6989586621680798693 (m6989586621680798702 a6989586621680798703)) = Sequence arg6989586621680798715
  • data ForSym0 :: forall t6989586621680804234 a6989586621680804236 f6989586621680804235 b6989586621680804237. (~>) (t6989586621680804234 a6989586621680804236) ((~>) ((~>) a6989586621680804236 (f6989586621680804235 b6989586621680804237)) (f6989586621680804235 (t6989586621680804234 b6989586621680804237)))
  • data ForSym1 (a6989586621680804761 :: t6989586621680804234 a6989586621680804236) :: forall f6989586621680804235 b6989586621680804237. (~>) ((~>) a6989586621680804236 (f6989586621680804235 b6989586621680804237)) (f6989586621680804235 (t6989586621680804234 b6989586621680804237))
  • type ForSym2 (a6989586621680804761 :: t6989586621680804234 a6989586621680804236) (a6989586621680804762 :: (~>) a6989586621680804236 (f6989586621680804235 b6989586621680804237)) = For a6989586621680804761 a6989586621680804762
  • data ForMSym0 :: forall t6989586621680804230 a6989586621680804232 m6989586621680804231 b6989586621680804233. (~>) (t6989586621680804230 a6989586621680804232) ((~>) ((~>) a6989586621680804232 (m6989586621680804231 b6989586621680804233)) (m6989586621680804231 (t6989586621680804230 b6989586621680804233)))
  • data ForMSym1 (a6989586621680804751 :: t6989586621680804230 a6989586621680804232) :: forall m6989586621680804231 b6989586621680804233. (~>) ((~>) a6989586621680804232 (m6989586621680804231 b6989586621680804233)) (m6989586621680804231 (t6989586621680804230 b6989586621680804233))
  • type ForMSym2 (a6989586621680804751 :: t6989586621680804230 a6989586621680804232) (a6989586621680804752 :: (~>) a6989586621680804232 (m6989586621680804231 b6989586621680804233)) = ForM a6989586621680804751 a6989586621680804752
  • data MapAccumLSym0 :: forall a6989586621680804227 b6989586621680804228 c6989586621680804229 t6989586621680804226. (~>) ((~>) a6989586621680804227 ((~>) b6989586621680804228 (a6989586621680804227, c6989586621680804229))) ((~>) a6989586621680804227 ((~>) (t6989586621680804226 b6989586621680804228) (a6989586621680804227, t6989586621680804226 c6989586621680804229)))
  • data MapAccumLSym1 (a6989586621680804730 :: (~>) a6989586621680804227 ((~>) b6989586621680804228 (a6989586621680804227, c6989586621680804229))) :: forall t6989586621680804226. (~>) a6989586621680804227 ((~>) (t6989586621680804226 b6989586621680804228) (a6989586621680804227, t6989586621680804226 c6989586621680804229))
  • data MapAccumLSym2 (a6989586621680804730 :: (~>) a6989586621680804227 ((~>) b6989586621680804228 (a6989586621680804227, c6989586621680804229))) (a6989586621680804731 :: a6989586621680804227) :: forall t6989586621680804226. (~>) (t6989586621680804226 b6989586621680804228) (a6989586621680804227, t6989586621680804226 c6989586621680804229)
  • type MapAccumLSym3 (a6989586621680804730 :: (~>) a6989586621680804227 ((~>) b6989586621680804228 (a6989586621680804227, c6989586621680804229))) (a6989586621680804731 :: a6989586621680804227) (a6989586621680804732 :: t6989586621680804226 b6989586621680804228) = MapAccumL a6989586621680804730 a6989586621680804731 a6989586621680804732
  • data MapAccumRSym0 :: forall a6989586621680804223 b6989586621680804224 c6989586621680804225 t6989586621680804222. (~>) ((~>) a6989586621680804223 ((~>) b6989586621680804224 (a6989586621680804223, c6989586621680804225))) ((~>) a6989586621680804223 ((~>) (t6989586621680804222 b6989586621680804224) (a6989586621680804223, t6989586621680804222 c6989586621680804225)))
  • data MapAccumRSym1 (a6989586621680804713 :: (~>) a6989586621680804223 ((~>) b6989586621680804224 (a6989586621680804223, c6989586621680804225))) :: forall t6989586621680804222. (~>) a6989586621680804223 ((~>) (t6989586621680804222 b6989586621680804224) (a6989586621680804223, t6989586621680804222 c6989586621680804225))
  • data MapAccumRSym2 (a6989586621680804713 :: (~>) a6989586621680804223 ((~>) b6989586621680804224 (a6989586621680804223, c6989586621680804225))) (a6989586621680804714 :: a6989586621680804223) :: forall t6989586621680804222. (~>) (t6989586621680804222 b6989586621680804224) (a6989586621680804223, t6989586621680804222 c6989586621680804225)
  • type MapAccumRSym3 (a6989586621680804713 :: (~>) a6989586621680804223 ((~>) b6989586621680804224 (a6989586621680804223, c6989586621680804225))) (a6989586621680804714 :: a6989586621680804223) (a6989586621680804715 :: t6989586621680804222 b6989586621680804224) = MapAccumR a6989586621680804713 a6989586621680804714 a6989586621680804715
  • data FmapDefaultSym0 :: forall a6989586621680804220 b6989586621680804221 t6989586621680804219. (~>) ((~>) a6989586621680804220 b6989586621680804221) ((~>) (t6989586621680804219 a6989586621680804220) (t6989586621680804219 b6989586621680804221))
  • data FmapDefaultSym1 (a6989586621680804700 :: (~>) a6989586621680804220 b6989586621680804221) :: forall t6989586621680804219. (~>) (t6989586621680804219 a6989586621680804220) (t6989586621680804219 b6989586621680804221)
  • type FmapDefaultSym2 (a6989586621680804700 :: (~>) a6989586621680804220 b6989586621680804221) (a6989586621680804701 :: t6989586621680804219 a6989586621680804220) = FmapDefault a6989586621680804700 a6989586621680804701
  • data FoldMapDefaultSym0 :: forall a6989586621680804218 m6989586621680804217 t6989586621680804216. (~>) ((~>) a6989586621680804218 m6989586621680804217) ((~>) (t6989586621680804216 a6989586621680804218) m6989586621680804217)
  • data FoldMapDefaultSym1 (a6989586621680804679 :: (~>) a6989586621680804218 m6989586621680804217) :: forall t6989586621680804216. (~>) (t6989586621680804216 a6989586621680804218) m6989586621680804217
  • type FoldMapDefaultSym2 (a6989586621680804679 :: (~>) a6989586621680804218 m6989586621680804217) (a6989586621680804680 :: t6989586621680804216 a6989586621680804218) = FoldMapDefault a6989586621680804679 a6989586621680804680

Documentation

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

Associated Types

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

type Traverse a a = Apply (Apply Traverse_6989586621680798719Sym0 a) a Source #

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

type SequenceA a = Apply SequenceA_6989586621680798732Sym0 a Source #

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

type MapM a a = Apply (Apply MapM_6989586621680798742Sym0 a) a Source #

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

type Sequence a = Apply Sequence_6989586621680798757Sym0 a Source #

Instances

Instances details
PTraversable [] Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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.Singletons.Prelude.Traversable

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.Singletons.Prelude.Semigroup

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.Singletons.Prelude.Semigroup

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.Singletons.Prelude.Semigroup

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.Singletons.Prelude.Semigroup

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 Option Source # 
Instance details

Defined in Data.Singletons.Prelude.Semigroup

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 Identity Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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.Singletons.Prelude.Traversable

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.Singletons.Prelude.Traversable

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.Singletons.Prelude.Traversable

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.Singletons.Prelude.Traversable

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.Singletons.Prelude.Traversable

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.Singletons.Prelude.Traversable

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.Singletons.Prelude.Traversable

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.Singletons.Prelude.Traversable

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.Singletons.Prelude.Semigroup

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.Singletons.Prelude.Traversable

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 :: Type -> Type) 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_6989586621680798719Sym0 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_6989586621680798732Sym0 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_6989586621680798742Sym0 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_6989586621680798757Sym0 t, SMonad m) => Sing t -> Sing (Apply SequenceSym0 t :: m (t a)) Source #

Instances

Instances details
STraversable [] Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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 Maybe Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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 Min Source # 
Instance details

Defined in Data.Singletons.Prelude.Semigroup

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 Max Source # 
Instance details

Defined in Data.Singletons.Prelude.Semigroup

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 First Source # 
Instance details

Defined in Data.Singletons.Prelude.Semigroup

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.Singletons.Prelude.Semigroup

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 Option Source # 
Instance details

Defined in Data.Singletons.Prelude.Semigroup

Methods

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

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

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

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

STraversable Identity Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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.Singletons.Prelude.Traversable

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.Singletons.Prelude.Traversable

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 Dual Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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 Sum Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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 Product Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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 NonEmpty Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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 (Either a) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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 ((,) a) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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 (Arg a) Source # 
Instance details

Defined in Data.Singletons.Prelude.Semigroup

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 (Const m :: Type -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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 #

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

Equations

For a_6989586621680804757 a_6989586621680804759 = Apply (Apply (Apply FlipSym0 TraverseSym0) a_6989586621680804757) a_6989586621680804759 

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_6989586621680804747 a_6989586621680804749 = Apply (Apply (Apply FlipSym0 MapMSym0) a_6989586621680804747) a_6989586621680804749 

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 = Case_6989586621680804743 f s t (Let6989586621680804739Scrutinee_6989586621680804310Sym3 f s t) 

sMapAccumL :: 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 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 = Case_6989586621680804726 f s t (Let6989586621680804722Scrutinee_6989586621680804314Sym3 f s t) 

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_6989586621680804709 f x (Let6989586621680804706Scrutinee_6989586621680804318Sym2 f x) 

sFmapDefault :: forall a b t (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_6989586621680804696 f x (Let6989586621680804693Scrutinee_6989586621680804321Sym2 f x) 

sFoldMapDefault :: forall a m t (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 :: forall a6989586621680798695 f6989586621680798694 b6989586621680798696 t6989586621680798693. (~>) ((~>) a6989586621680798695 (f6989586621680798694 b6989586621680798696)) ((~>) (t6989586621680798693 a6989586621680798695) (f6989586621680798694 (t6989586621680798693 b6989586621680798696))) 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.Singletons.Prelude.Traversable

SuppressUnusedWarnings (TraverseSym0 :: TyFun (a6989586621680798695 ~> f6989586621680798694 b6989586621680798696) (t6989586621680798693 a6989586621680798695 ~> f6989586621680798694 (t6989586621680798693 b6989586621680798696)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (TraverseSym0 :: TyFun (a6989586621680798695 ~> f6989586621680798694 b6989586621680798696) (t6989586621680798693 a6989586621680798695 ~> f6989586621680798694 (t6989586621680798693 b6989586621680798696)) -> Type) (arg6989586621680798705 :: a6989586621680798695 ~> f6989586621680798694 b6989586621680798696) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (TraverseSym0 :: TyFun (a6989586621680798695 ~> f6989586621680798694 b6989586621680798696) (t6989586621680798693 a6989586621680798695 ~> f6989586621680798694 (t6989586621680798693 b6989586621680798696)) -> Type) (arg6989586621680798705 :: a6989586621680798695 ~> f6989586621680798694 b6989586621680798696) = TraverseSym1 arg6989586621680798705 t6989586621680798693 :: TyFun (t6989586621680798693 a6989586621680798695) (f6989586621680798694 (t6989586621680798693 b6989586621680798696)) -> Type

data TraverseSym1 (arg6989586621680798705 :: (~>) a6989586621680798695 (f6989586621680798694 b6989586621680798696)) :: forall t6989586621680798693. (~>) (t6989586621680798693 a6989586621680798695) (f6989586621680798694 (t6989586621680798693 b6989586621680798696)) Source #

Instances

Instances details
(STraversable t, SApplicative f, SingI d) => SingI (TraverseSym1 d t :: TyFun (t a) (f (t b)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

Methods

sing :: Sing (TraverseSym1 d t) Source #

SuppressUnusedWarnings (TraverseSym1 arg6989586621680798705 t6989586621680798693 :: TyFun (t6989586621680798693 a6989586621680798695) (f6989586621680798694 (t6989586621680798693 b6989586621680798696)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (TraverseSym1 arg6989586621680798705 t :: TyFun (t a) (f (t b)) -> Type) (arg6989586621680798706 :: t a) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (TraverseSym1 arg6989586621680798705 t :: TyFun (t a) (f (t b)) -> Type) (arg6989586621680798706 :: t a) = Traverse arg6989586621680798705 arg6989586621680798706

type TraverseSym2 (arg6989586621680798705 :: (~>) a6989586621680798695 (f6989586621680798694 b6989586621680798696)) (arg6989586621680798706 :: t6989586621680798693 a6989586621680798695) = Traverse arg6989586621680798705 arg6989586621680798706 Source #

data SequenceASym0 :: forall t6989586621680798693 f6989586621680798697 a6989586621680798698. (~>) (t6989586621680798693 (f6989586621680798697 a6989586621680798698)) (f6989586621680798697 (t6989586621680798693 a6989586621680798698)) Source #

Instances

Instances details
(STraversable t, SApplicative f) => SingI (SequenceASym0 :: TyFun (t (f a)) (f (t a)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

SuppressUnusedWarnings (SequenceASym0 :: TyFun (t6989586621680798693 (f6989586621680798697 a6989586621680798698)) (f6989586621680798697 (t6989586621680798693 a6989586621680798698)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (SequenceASym0 :: TyFun (t (f a)) (f (t a)) -> Type) (arg6989586621680798709 :: t (f a)) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (SequenceASym0 :: TyFun (t (f a)) (f (t a)) -> Type) (arg6989586621680798709 :: t (f a)) = SequenceA arg6989586621680798709

type SequenceASym1 (arg6989586621680798709 :: t6989586621680798693 (f6989586621680798697 a6989586621680798698)) = SequenceA arg6989586621680798709 Source #

data MapMSym0 :: forall a6989586621680798700 m6989586621680798699 b6989586621680798701 t6989586621680798693. (~>) ((~>) a6989586621680798700 (m6989586621680798699 b6989586621680798701)) ((~>) (t6989586621680798693 a6989586621680798700) (m6989586621680798699 (t6989586621680798693 b6989586621680798701))) 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.Singletons.Prelude.Traversable

SuppressUnusedWarnings (MapMSym0 :: TyFun (a6989586621680798700 ~> m6989586621680798699 b6989586621680798701) (t6989586621680798693 a6989586621680798700 ~> m6989586621680798699 (t6989586621680798693 b6989586621680798701)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapMSym0 :: TyFun (a6989586621680798700 ~> m6989586621680798699 b6989586621680798701) (t6989586621680798693 a6989586621680798700 ~> m6989586621680798699 (t6989586621680798693 b6989586621680798701)) -> Type) (arg6989586621680798711 :: a6989586621680798700 ~> m6989586621680798699 b6989586621680798701) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapMSym0 :: TyFun (a6989586621680798700 ~> m6989586621680798699 b6989586621680798701) (t6989586621680798693 a6989586621680798700 ~> m6989586621680798699 (t6989586621680798693 b6989586621680798701)) -> Type) (arg6989586621680798711 :: a6989586621680798700 ~> m6989586621680798699 b6989586621680798701) = MapMSym1 arg6989586621680798711 t6989586621680798693 :: TyFun (t6989586621680798693 a6989586621680798700) (m6989586621680798699 (t6989586621680798693 b6989586621680798701)) -> Type

data MapMSym1 (arg6989586621680798711 :: (~>) a6989586621680798700 (m6989586621680798699 b6989586621680798701)) :: forall t6989586621680798693. (~>) (t6989586621680798693 a6989586621680798700) (m6989586621680798699 (t6989586621680798693 b6989586621680798701)) Source #

Instances

Instances details
(STraversable t, SMonad m, SingI d) => SingI (MapMSym1 d t :: TyFun (t a) (m (t b)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

Methods

sing :: Sing (MapMSym1 d t) Source #

SuppressUnusedWarnings (MapMSym1 arg6989586621680798711 t6989586621680798693 :: TyFun (t6989586621680798693 a6989586621680798700) (m6989586621680798699 (t6989586621680798693 b6989586621680798701)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapMSym1 arg6989586621680798711 t :: TyFun (t a) (m (t b)) -> Type) (arg6989586621680798712 :: t a) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapMSym1 arg6989586621680798711 t :: TyFun (t a) (m (t b)) -> Type) (arg6989586621680798712 :: t a) = MapM arg6989586621680798711 arg6989586621680798712

type MapMSym2 (arg6989586621680798711 :: (~>) a6989586621680798700 (m6989586621680798699 b6989586621680798701)) (arg6989586621680798712 :: t6989586621680798693 a6989586621680798700) = MapM arg6989586621680798711 arg6989586621680798712 Source #

data SequenceSym0 :: forall t6989586621680798693 m6989586621680798702 a6989586621680798703. (~>) (t6989586621680798693 (m6989586621680798702 a6989586621680798703)) (m6989586621680798702 (t6989586621680798693 a6989586621680798703)) Source #

Instances

Instances details
(STraversable t, SMonad m) => SingI (SequenceSym0 :: TyFun (t (m a)) (m (t a)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

SuppressUnusedWarnings (SequenceSym0 :: TyFun (t6989586621680798693 (m6989586621680798702 a6989586621680798703)) (m6989586621680798702 (t6989586621680798693 a6989586621680798703)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (SequenceSym0 :: TyFun (t (m a)) (m (t a)) -> Type) (arg6989586621680798715 :: t (m a)) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (SequenceSym0 :: TyFun (t (m a)) (m (t a)) -> Type) (arg6989586621680798715 :: t (m a)) = Sequence arg6989586621680798715

type SequenceSym1 (arg6989586621680798715 :: t6989586621680798693 (m6989586621680798702 a6989586621680798703)) = Sequence arg6989586621680798715 Source #

data ForSym0 :: forall t6989586621680804234 a6989586621680804236 f6989586621680804235 b6989586621680804237. (~>) (t6989586621680804234 a6989586621680804236) ((~>) ((~>) a6989586621680804236 (f6989586621680804235 b6989586621680804237)) (f6989586621680804235 (t6989586621680804234 b6989586621680804237))) 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.Singletons.Prelude.Traversable

SuppressUnusedWarnings (ForSym0 :: TyFun (t6989586621680804234 a6989586621680804236) ((a6989586621680804236 ~> f6989586621680804235 b6989586621680804237) ~> f6989586621680804235 (t6989586621680804234 b6989586621680804237)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (ForSym0 :: TyFun (t6989586621680804234 a6989586621680804236) ((a6989586621680804236 ~> f6989586621680804235 b6989586621680804237) ~> f6989586621680804235 (t6989586621680804234 b6989586621680804237)) -> Type) (a6989586621680804761 :: t6989586621680804234 a6989586621680804236) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (ForSym0 :: TyFun (t6989586621680804234 a6989586621680804236) ((a6989586621680804236 ~> f6989586621680804235 b6989586621680804237) ~> f6989586621680804235 (t6989586621680804234 b6989586621680804237)) -> Type) (a6989586621680804761 :: t6989586621680804234 a6989586621680804236) = ForSym1 a6989586621680804761 f6989586621680804235 b6989586621680804237 :: TyFun (a6989586621680804236 ~> f6989586621680804235 b6989586621680804237) (f6989586621680804235 (t6989586621680804234 b6989586621680804237)) -> Type

data ForSym1 (a6989586621680804761 :: t6989586621680804234 a6989586621680804236) :: forall f6989586621680804235 b6989586621680804237. (~>) ((~>) a6989586621680804236 (f6989586621680804235 b6989586621680804237)) (f6989586621680804235 (t6989586621680804234 b6989586621680804237)) Source #

Instances

Instances details
(STraversable t, SApplicative f, SingI d) => SingI (ForSym1 d f b :: TyFun (a ~> f b) (f (t b)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

Methods

sing :: Sing (ForSym1 d f b) Source #

SuppressUnusedWarnings (ForSym1 a6989586621680804761 f6989586621680804235 b6989586621680804237 :: TyFun (a6989586621680804236 ~> f6989586621680804235 b6989586621680804237) (f6989586621680804235 (t6989586621680804234 b6989586621680804237)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (ForSym1 a6989586621680804761 f b :: TyFun (a ~> f b) (f (t b)) -> Type) (a6989586621680804762 :: a ~> f b) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (ForSym1 a6989586621680804761 f b :: TyFun (a ~> f b) (f (t b)) -> Type) (a6989586621680804762 :: a ~> f b) = For a6989586621680804761 a6989586621680804762

type ForSym2 (a6989586621680804761 :: t6989586621680804234 a6989586621680804236) (a6989586621680804762 :: (~>) a6989586621680804236 (f6989586621680804235 b6989586621680804237)) = For a6989586621680804761 a6989586621680804762 Source #

data ForMSym0 :: forall t6989586621680804230 a6989586621680804232 m6989586621680804231 b6989586621680804233. (~>) (t6989586621680804230 a6989586621680804232) ((~>) ((~>) a6989586621680804232 (m6989586621680804231 b6989586621680804233)) (m6989586621680804231 (t6989586621680804230 b6989586621680804233))) 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.Singletons.Prelude.Traversable

SuppressUnusedWarnings (ForMSym0 :: TyFun (t6989586621680804230 a6989586621680804232) ((a6989586621680804232 ~> m6989586621680804231 b6989586621680804233) ~> m6989586621680804231 (t6989586621680804230 b6989586621680804233)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (ForMSym0 :: TyFun (t6989586621680804230 a6989586621680804232) ((a6989586621680804232 ~> m6989586621680804231 b6989586621680804233) ~> m6989586621680804231 (t6989586621680804230 b6989586621680804233)) -> Type) (a6989586621680804751 :: t6989586621680804230 a6989586621680804232) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (ForMSym0 :: TyFun (t6989586621680804230 a6989586621680804232) ((a6989586621680804232 ~> m6989586621680804231 b6989586621680804233) ~> m6989586621680804231 (t6989586621680804230 b6989586621680804233)) -> Type) (a6989586621680804751 :: t6989586621680804230 a6989586621680804232) = ForMSym1 a6989586621680804751 m6989586621680804231 b6989586621680804233 :: TyFun (a6989586621680804232 ~> m6989586621680804231 b6989586621680804233) (m6989586621680804231 (t6989586621680804230 b6989586621680804233)) -> Type

data ForMSym1 (a6989586621680804751 :: t6989586621680804230 a6989586621680804232) :: forall m6989586621680804231 b6989586621680804233. (~>) ((~>) a6989586621680804232 (m6989586621680804231 b6989586621680804233)) (m6989586621680804231 (t6989586621680804230 b6989586621680804233)) Source #

Instances

Instances details
(STraversable t, SMonad m, SingI d) => SingI (ForMSym1 d m b :: TyFun (a ~> m b) (m (t b)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

Methods

sing :: Sing (ForMSym1 d m b) Source #

SuppressUnusedWarnings (ForMSym1 a6989586621680804751 m6989586621680804231 b6989586621680804233 :: TyFun (a6989586621680804232 ~> m6989586621680804231 b6989586621680804233) (m6989586621680804231 (t6989586621680804230 b6989586621680804233)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (ForMSym1 a6989586621680804751 m b :: TyFun (a ~> m b) (m (t b)) -> Type) (a6989586621680804752 :: a ~> m b) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (ForMSym1 a6989586621680804751 m b :: TyFun (a ~> m b) (m (t b)) -> Type) (a6989586621680804752 :: a ~> m b) = ForM a6989586621680804751 a6989586621680804752

type ForMSym2 (a6989586621680804751 :: t6989586621680804230 a6989586621680804232) (a6989586621680804752 :: (~>) a6989586621680804232 (m6989586621680804231 b6989586621680804233)) = ForM a6989586621680804751 a6989586621680804752 Source #

data MapAccumLSym0 :: forall a6989586621680804227 b6989586621680804228 c6989586621680804229 t6989586621680804226. (~>) ((~>) a6989586621680804227 ((~>) b6989586621680804228 (a6989586621680804227, c6989586621680804229))) ((~>) a6989586621680804227 ((~>) (t6989586621680804226 b6989586621680804228) (a6989586621680804227, t6989586621680804226 c6989586621680804229))) 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.Singletons.Prelude.Traversable

SuppressUnusedWarnings (MapAccumLSym0 :: TyFun (a6989586621680804227 ~> (b6989586621680804228 ~> (a6989586621680804227, c6989586621680804229))) (a6989586621680804227 ~> (t6989586621680804226 b6989586621680804228 ~> (a6989586621680804227, t6989586621680804226 c6989586621680804229))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumLSym0 :: TyFun (a6989586621680804227 ~> (b6989586621680804228 ~> (a6989586621680804227, c6989586621680804229))) (a6989586621680804227 ~> (t6989586621680804226 b6989586621680804228 ~> (a6989586621680804227, t6989586621680804226 c6989586621680804229))) -> Type) (a6989586621680804730 :: a6989586621680804227 ~> (b6989586621680804228 ~> (a6989586621680804227, c6989586621680804229))) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumLSym0 :: TyFun (a6989586621680804227 ~> (b6989586621680804228 ~> (a6989586621680804227, c6989586621680804229))) (a6989586621680804227 ~> (t6989586621680804226 b6989586621680804228 ~> (a6989586621680804227, t6989586621680804226 c6989586621680804229))) -> Type) (a6989586621680804730 :: a6989586621680804227 ~> (b6989586621680804228 ~> (a6989586621680804227, c6989586621680804229))) = MapAccumLSym1 a6989586621680804730 t6989586621680804226 :: TyFun a6989586621680804227 (t6989586621680804226 b6989586621680804228 ~> (a6989586621680804227, t6989586621680804226 c6989586621680804229)) -> Type

data MapAccumLSym1 (a6989586621680804730 :: (~>) a6989586621680804227 ((~>) b6989586621680804228 (a6989586621680804227, c6989586621680804229))) :: forall t6989586621680804226. (~>) a6989586621680804227 ((~>) (t6989586621680804226 b6989586621680804228) (a6989586621680804227, t6989586621680804226 c6989586621680804229)) Source #

Instances

Instances details
(STraversable t, SingI d) => SingI (MapAccumLSym1 d t :: TyFun a (t b ~> (a, t c)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

Methods

sing :: Sing (MapAccumLSym1 d t) Source #

SuppressUnusedWarnings (MapAccumLSym1 a6989586621680804730 t6989586621680804226 :: TyFun a6989586621680804227 (t6989586621680804226 b6989586621680804228 ~> (a6989586621680804227, t6989586621680804226 c6989586621680804229)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumLSym1 a6989586621680804730 t6989586621680804226 :: TyFun a6989586621680804227 (t6989586621680804226 b6989586621680804228 ~> (a6989586621680804227, t6989586621680804226 c6989586621680804229)) -> Type) (a6989586621680804731 :: a6989586621680804227) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumLSym1 a6989586621680804730 t6989586621680804226 :: TyFun a6989586621680804227 (t6989586621680804226 b6989586621680804228 ~> (a6989586621680804227, t6989586621680804226 c6989586621680804229)) -> Type) (a6989586621680804731 :: a6989586621680804227) = MapAccumLSym2 a6989586621680804730 a6989586621680804731 t6989586621680804226 :: TyFun (t6989586621680804226 b6989586621680804228) (a6989586621680804227, t6989586621680804226 c6989586621680804229) -> Type

data MapAccumLSym2 (a6989586621680804730 :: (~>) a6989586621680804227 ((~>) b6989586621680804228 (a6989586621680804227, c6989586621680804229))) (a6989586621680804731 :: a6989586621680804227) :: forall t6989586621680804226. (~>) (t6989586621680804226 b6989586621680804228) (a6989586621680804227, t6989586621680804226 c6989586621680804229) Source #

Instances

Instances details
(STraversable t, SingI d1, SingI d2) => SingI (MapAccumLSym2 d1 d2 t :: TyFun (t b) (a, t c) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

Methods

sing :: Sing (MapAccumLSym2 d1 d2 t) Source #

SuppressUnusedWarnings (MapAccumLSym2 a6989586621680804731 a6989586621680804730 t6989586621680804226 :: TyFun (t6989586621680804226 b6989586621680804228) (a6989586621680804227, t6989586621680804226 c6989586621680804229) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumLSym2 a6989586621680804731 a6989586621680804730 t :: TyFun (t b) (a, t c) -> Type) (a6989586621680804732 :: t b) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumLSym2 a6989586621680804731 a6989586621680804730 t :: TyFun (t b) (a, t c) -> Type) (a6989586621680804732 :: t b) = MapAccumL a6989586621680804731 a6989586621680804730 a6989586621680804732

type MapAccumLSym3 (a6989586621680804730 :: (~>) a6989586621680804227 ((~>) b6989586621680804228 (a6989586621680804227, c6989586621680804229))) (a6989586621680804731 :: a6989586621680804227) (a6989586621680804732 :: t6989586621680804226 b6989586621680804228) = MapAccumL a6989586621680804730 a6989586621680804731 a6989586621680804732 Source #

data MapAccumRSym0 :: forall a6989586621680804223 b6989586621680804224 c6989586621680804225 t6989586621680804222. (~>) ((~>) a6989586621680804223 ((~>) b6989586621680804224 (a6989586621680804223, c6989586621680804225))) ((~>) a6989586621680804223 ((~>) (t6989586621680804222 b6989586621680804224) (a6989586621680804223, t6989586621680804222 c6989586621680804225))) 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.Singletons.Prelude.Traversable

SuppressUnusedWarnings (MapAccumRSym0 :: TyFun (a6989586621680804223 ~> (b6989586621680804224 ~> (a6989586621680804223, c6989586621680804225))) (a6989586621680804223 ~> (t6989586621680804222 b6989586621680804224 ~> (a6989586621680804223, t6989586621680804222 c6989586621680804225))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumRSym0 :: TyFun (a6989586621680804223 ~> (b6989586621680804224 ~> (a6989586621680804223, c6989586621680804225))) (a6989586621680804223 ~> (t6989586621680804222 b6989586621680804224 ~> (a6989586621680804223, t6989586621680804222 c6989586621680804225))) -> Type) (a6989586621680804713 :: a6989586621680804223 ~> (b6989586621680804224 ~> (a6989586621680804223, c6989586621680804225))) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumRSym0 :: TyFun (a6989586621680804223 ~> (b6989586621680804224 ~> (a6989586621680804223, c6989586621680804225))) (a6989586621680804223 ~> (t6989586621680804222 b6989586621680804224 ~> (a6989586621680804223, t6989586621680804222 c6989586621680804225))) -> Type) (a6989586621680804713 :: a6989586621680804223 ~> (b6989586621680804224 ~> (a6989586621680804223, c6989586621680804225))) = MapAccumRSym1 a6989586621680804713 t6989586621680804222 :: TyFun a6989586621680804223 (t6989586621680804222 b6989586621680804224 ~> (a6989586621680804223, t6989586621680804222 c6989586621680804225)) -> Type

data MapAccumRSym1 (a6989586621680804713 :: (~>) a6989586621680804223 ((~>) b6989586621680804224 (a6989586621680804223, c6989586621680804225))) :: forall t6989586621680804222. (~>) a6989586621680804223 ((~>) (t6989586621680804222 b6989586621680804224) (a6989586621680804223, t6989586621680804222 c6989586621680804225)) Source #

Instances

Instances details
(STraversable t, SingI d) => SingI (MapAccumRSym1 d t :: TyFun a (t b ~> (a, t c)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

Methods

sing :: Sing (MapAccumRSym1 d t) Source #

SuppressUnusedWarnings (MapAccumRSym1 a6989586621680804713 t6989586621680804222 :: TyFun a6989586621680804223 (t6989586621680804222 b6989586621680804224 ~> (a6989586621680804223, t6989586621680804222 c6989586621680804225)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumRSym1 a6989586621680804713 t6989586621680804222 :: TyFun a6989586621680804223 (t6989586621680804222 b6989586621680804224 ~> (a6989586621680804223, t6989586621680804222 c6989586621680804225)) -> Type) (a6989586621680804714 :: a6989586621680804223) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumRSym1 a6989586621680804713 t6989586621680804222 :: TyFun a6989586621680804223 (t6989586621680804222 b6989586621680804224 ~> (a6989586621680804223, t6989586621680804222 c6989586621680804225)) -> Type) (a6989586621680804714 :: a6989586621680804223) = MapAccumRSym2 a6989586621680804713 a6989586621680804714 t6989586621680804222 :: TyFun (t6989586621680804222 b6989586621680804224) (a6989586621680804223, t6989586621680804222 c6989586621680804225) -> Type

data MapAccumRSym2 (a6989586621680804713 :: (~>) a6989586621680804223 ((~>) b6989586621680804224 (a6989586621680804223, c6989586621680804225))) (a6989586621680804714 :: a6989586621680804223) :: forall t6989586621680804222. (~>) (t6989586621680804222 b6989586621680804224) (a6989586621680804223, t6989586621680804222 c6989586621680804225) Source #

Instances

Instances details
(STraversable t, SingI d1, SingI d2) => SingI (MapAccumRSym2 d1 d2 t :: TyFun (t b) (a, t c) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

Methods

sing :: Sing (MapAccumRSym2 d1 d2 t) Source #

SuppressUnusedWarnings (MapAccumRSym2 a6989586621680804714 a6989586621680804713 t6989586621680804222 :: TyFun (t6989586621680804222 b6989586621680804224) (a6989586621680804223, t6989586621680804222 c6989586621680804225) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumRSym2 a6989586621680804714 a6989586621680804713 t :: TyFun (t b) (a, t c) -> Type) (a6989586621680804715 :: t b) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumRSym2 a6989586621680804714 a6989586621680804713 t :: TyFun (t b) (a, t c) -> Type) (a6989586621680804715 :: t b) = MapAccumR a6989586621680804714 a6989586621680804713 a6989586621680804715

type MapAccumRSym3 (a6989586621680804713 :: (~>) a6989586621680804223 ((~>) b6989586621680804224 (a6989586621680804223, c6989586621680804225))) (a6989586621680804714 :: a6989586621680804223) (a6989586621680804715 :: t6989586621680804222 b6989586621680804224) = MapAccumR a6989586621680804713 a6989586621680804714 a6989586621680804715 Source #

data FmapDefaultSym0 :: forall a6989586621680804220 b6989586621680804221 t6989586621680804219. (~>) ((~>) a6989586621680804220 b6989586621680804221) ((~>) (t6989586621680804219 a6989586621680804220) (t6989586621680804219 b6989586621680804221)) Source #

Instances

Instances details
STraversable t => SingI (FmapDefaultSym0 :: TyFun (a ~> b) (t a ~> t b) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

SuppressUnusedWarnings (FmapDefaultSym0 :: TyFun (a6989586621680804220 ~> b6989586621680804221) (t6989586621680804219 a6989586621680804220 ~> t6989586621680804219 b6989586621680804221) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (FmapDefaultSym0 :: TyFun (a6989586621680804220 ~> b6989586621680804221) (t6989586621680804219 a6989586621680804220 ~> t6989586621680804219 b6989586621680804221) -> Type) (a6989586621680804700 :: a6989586621680804220 ~> b6989586621680804221) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (FmapDefaultSym0 :: TyFun (a6989586621680804220 ~> b6989586621680804221) (t6989586621680804219 a6989586621680804220 ~> t6989586621680804219 b6989586621680804221) -> Type) (a6989586621680804700 :: a6989586621680804220 ~> b6989586621680804221) = FmapDefaultSym1 a6989586621680804700 t6989586621680804219 :: TyFun (t6989586621680804219 a6989586621680804220) (t6989586621680804219 b6989586621680804221) -> Type

data FmapDefaultSym1 (a6989586621680804700 :: (~>) a6989586621680804220 b6989586621680804221) :: forall t6989586621680804219. (~>) (t6989586621680804219 a6989586621680804220) (t6989586621680804219 b6989586621680804221) Source #

Instances

Instances details
(STraversable t, SingI d) => SingI (FmapDefaultSym1 d t :: TyFun (t a) (t b) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

Methods

sing :: Sing (FmapDefaultSym1 d t) Source #

SuppressUnusedWarnings (FmapDefaultSym1 a6989586621680804700 t6989586621680804219 :: TyFun (t6989586621680804219 a6989586621680804220) (t6989586621680804219 b6989586621680804221) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (FmapDefaultSym1 a6989586621680804700 t :: TyFun (t a) (t b) -> Type) (a6989586621680804701 :: t a) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (FmapDefaultSym1 a6989586621680804700 t :: TyFun (t a) (t b) -> Type) (a6989586621680804701 :: t a) = FmapDefault a6989586621680804700 a6989586621680804701

type FmapDefaultSym2 (a6989586621680804700 :: (~>) a6989586621680804220 b6989586621680804221) (a6989586621680804701 :: t6989586621680804219 a6989586621680804220) = FmapDefault a6989586621680804700 a6989586621680804701 Source #

data FoldMapDefaultSym0 :: forall a6989586621680804218 m6989586621680804217 t6989586621680804216. (~>) ((~>) a6989586621680804218 m6989586621680804217) ((~>) (t6989586621680804216 a6989586621680804218) m6989586621680804217) Source #

Instances

Instances details
(STraversable t, SMonoid m) => SingI (FoldMapDefaultSym0 :: TyFun (a ~> m) (t a ~> m) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

SuppressUnusedWarnings (FoldMapDefaultSym0 :: TyFun (a6989586621680804218 ~> m6989586621680804217) (t6989586621680804216 a6989586621680804218 ~> m6989586621680804217) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (FoldMapDefaultSym0 :: TyFun (a6989586621680804218 ~> m6989586621680804217) (t6989586621680804216 a6989586621680804218 ~> m6989586621680804217) -> Type) (a6989586621680804679 :: a6989586621680804218 ~> m6989586621680804217) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (FoldMapDefaultSym0 :: TyFun (a6989586621680804218 ~> m6989586621680804217) (t6989586621680804216 a6989586621680804218 ~> m6989586621680804217) -> Type) (a6989586621680804679 :: a6989586621680804218 ~> m6989586621680804217) = FoldMapDefaultSym1 a6989586621680804679 t6989586621680804216 :: TyFun (t6989586621680804216 a6989586621680804218) m6989586621680804217 -> Type

data FoldMapDefaultSym1 (a6989586621680804679 :: (~>) a6989586621680804218 m6989586621680804217) :: forall t6989586621680804216. (~>) (t6989586621680804216 a6989586621680804218) m6989586621680804217 Source #

Instances

Instances details
(STraversable t, SMonoid m, SingI d) => SingI (FoldMapDefaultSym1 d t :: TyFun (t a) m -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

SuppressUnusedWarnings (FoldMapDefaultSym1 a6989586621680804679 t6989586621680804216 :: TyFun (t6989586621680804216 a6989586621680804218) m6989586621680804217 -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (FoldMapDefaultSym1 a6989586621680804679 t :: TyFun (t a) m -> Type) (a6989586621680804680 :: t a) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (FoldMapDefaultSym1 a6989586621680804679 t :: TyFun (t a) m -> Type) (a6989586621680804680 :: t a) = FoldMapDefault a6989586621680804679 a6989586621680804680

type FoldMapDefaultSym2 (a6989586621680804679 :: (~>) a6989586621680804218 m6989586621680804217) (a6989586621680804680 :: t6989586621680804216 a6989586621680804218) = FoldMapDefault a6989586621680804679 a6989586621680804680 Source #