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 a6989586621680794772 f6989586621680794771 b6989586621680794773 t6989586621680794770. (~>) ((~>) a6989586621680794772 (f6989586621680794771 b6989586621680794773)) ((~>) (t6989586621680794770 a6989586621680794772) (f6989586621680794771 (t6989586621680794770 b6989586621680794773)))
  • data TraverseSym1 (arg6989586621680794782 :: (~>) a6989586621680794772 (f6989586621680794771 b6989586621680794773)) :: forall t6989586621680794770. (~>) (t6989586621680794770 a6989586621680794772) (f6989586621680794771 (t6989586621680794770 b6989586621680794773))
  • type TraverseSym2 (arg6989586621680794782 :: (~>) a6989586621680794772 (f6989586621680794771 b6989586621680794773)) (arg6989586621680794783 :: t6989586621680794770 a6989586621680794772) = Traverse arg6989586621680794782 arg6989586621680794783
  • data SequenceASym0 :: forall t6989586621680794770 f6989586621680794774 a6989586621680794775. (~>) (t6989586621680794770 (f6989586621680794774 a6989586621680794775)) (f6989586621680794774 (t6989586621680794770 a6989586621680794775))
  • type SequenceASym1 (arg6989586621680794786 :: t6989586621680794770 (f6989586621680794774 a6989586621680794775)) = SequenceA arg6989586621680794786
  • data MapMSym0 :: forall a6989586621680794777 m6989586621680794776 b6989586621680794778 t6989586621680794770. (~>) ((~>) a6989586621680794777 (m6989586621680794776 b6989586621680794778)) ((~>) (t6989586621680794770 a6989586621680794777) (m6989586621680794776 (t6989586621680794770 b6989586621680794778)))
  • data MapMSym1 (arg6989586621680794788 :: (~>) a6989586621680794777 (m6989586621680794776 b6989586621680794778)) :: forall t6989586621680794770. (~>) (t6989586621680794770 a6989586621680794777) (m6989586621680794776 (t6989586621680794770 b6989586621680794778))
  • type MapMSym2 (arg6989586621680794788 :: (~>) a6989586621680794777 (m6989586621680794776 b6989586621680794778)) (arg6989586621680794789 :: t6989586621680794770 a6989586621680794777) = MapM arg6989586621680794788 arg6989586621680794789
  • data SequenceSym0 :: forall t6989586621680794770 m6989586621680794779 a6989586621680794780. (~>) (t6989586621680794770 (m6989586621680794779 a6989586621680794780)) (m6989586621680794779 (t6989586621680794770 a6989586621680794780))
  • type SequenceSym1 (arg6989586621680794792 :: t6989586621680794770 (m6989586621680794779 a6989586621680794780)) = Sequence arg6989586621680794792
  • data ForSym0 :: forall t6989586621680800311 a6989586621680800313 f6989586621680800312 b6989586621680800314. (~>) (t6989586621680800311 a6989586621680800313) ((~>) ((~>) a6989586621680800313 (f6989586621680800312 b6989586621680800314)) (f6989586621680800312 (t6989586621680800311 b6989586621680800314)))
  • data ForSym1 (a6989586621680800838 :: t6989586621680800311 a6989586621680800313) :: forall f6989586621680800312 b6989586621680800314. (~>) ((~>) a6989586621680800313 (f6989586621680800312 b6989586621680800314)) (f6989586621680800312 (t6989586621680800311 b6989586621680800314))
  • type ForSym2 (a6989586621680800838 :: t6989586621680800311 a6989586621680800313) (a6989586621680800839 :: (~>) a6989586621680800313 (f6989586621680800312 b6989586621680800314)) = For a6989586621680800838 a6989586621680800839
  • data ForMSym0 :: forall t6989586621680800307 a6989586621680800309 m6989586621680800308 b6989586621680800310. (~>) (t6989586621680800307 a6989586621680800309) ((~>) ((~>) a6989586621680800309 (m6989586621680800308 b6989586621680800310)) (m6989586621680800308 (t6989586621680800307 b6989586621680800310)))
  • data ForMSym1 (a6989586621680800828 :: t6989586621680800307 a6989586621680800309) :: forall m6989586621680800308 b6989586621680800310. (~>) ((~>) a6989586621680800309 (m6989586621680800308 b6989586621680800310)) (m6989586621680800308 (t6989586621680800307 b6989586621680800310))
  • type ForMSym2 (a6989586621680800828 :: t6989586621680800307 a6989586621680800309) (a6989586621680800829 :: (~>) a6989586621680800309 (m6989586621680800308 b6989586621680800310)) = ForM a6989586621680800828 a6989586621680800829
  • data MapAccumLSym0 :: forall a6989586621680800304 b6989586621680800305 c6989586621680800306 t6989586621680800303. (~>) ((~>) a6989586621680800304 ((~>) b6989586621680800305 (a6989586621680800304, c6989586621680800306))) ((~>) a6989586621680800304 ((~>) (t6989586621680800303 b6989586621680800305) (a6989586621680800304, t6989586621680800303 c6989586621680800306)))
  • data MapAccumLSym1 (a6989586621680800807 :: (~>) a6989586621680800304 ((~>) b6989586621680800305 (a6989586621680800304, c6989586621680800306))) :: forall t6989586621680800303. (~>) a6989586621680800304 ((~>) (t6989586621680800303 b6989586621680800305) (a6989586621680800304, t6989586621680800303 c6989586621680800306))
  • data MapAccumLSym2 (a6989586621680800807 :: (~>) a6989586621680800304 ((~>) b6989586621680800305 (a6989586621680800304, c6989586621680800306))) (a6989586621680800808 :: a6989586621680800304) :: forall t6989586621680800303. (~>) (t6989586621680800303 b6989586621680800305) (a6989586621680800304, t6989586621680800303 c6989586621680800306)
  • type MapAccumLSym3 (a6989586621680800807 :: (~>) a6989586621680800304 ((~>) b6989586621680800305 (a6989586621680800304, c6989586621680800306))) (a6989586621680800808 :: a6989586621680800304) (a6989586621680800809 :: t6989586621680800303 b6989586621680800305) = MapAccumL a6989586621680800807 a6989586621680800808 a6989586621680800809
  • data MapAccumRSym0 :: forall a6989586621680800300 b6989586621680800301 c6989586621680800302 t6989586621680800299. (~>) ((~>) a6989586621680800300 ((~>) b6989586621680800301 (a6989586621680800300, c6989586621680800302))) ((~>) a6989586621680800300 ((~>) (t6989586621680800299 b6989586621680800301) (a6989586621680800300, t6989586621680800299 c6989586621680800302)))
  • data MapAccumRSym1 (a6989586621680800790 :: (~>) a6989586621680800300 ((~>) b6989586621680800301 (a6989586621680800300, c6989586621680800302))) :: forall t6989586621680800299. (~>) a6989586621680800300 ((~>) (t6989586621680800299 b6989586621680800301) (a6989586621680800300, t6989586621680800299 c6989586621680800302))
  • data MapAccumRSym2 (a6989586621680800790 :: (~>) a6989586621680800300 ((~>) b6989586621680800301 (a6989586621680800300, c6989586621680800302))) (a6989586621680800791 :: a6989586621680800300) :: forall t6989586621680800299. (~>) (t6989586621680800299 b6989586621680800301) (a6989586621680800300, t6989586621680800299 c6989586621680800302)
  • type MapAccumRSym3 (a6989586621680800790 :: (~>) a6989586621680800300 ((~>) b6989586621680800301 (a6989586621680800300, c6989586621680800302))) (a6989586621680800791 :: a6989586621680800300) (a6989586621680800792 :: t6989586621680800299 b6989586621680800301) = MapAccumR a6989586621680800790 a6989586621680800791 a6989586621680800792
  • data FmapDefaultSym0 :: forall a6989586621680800297 b6989586621680800298 t6989586621680800296. (~>) ((~>) a6989586621680800297 b6989586621680800298) ((~>) (t6989586621680800296 a6989586621680800297) (t6989586621680800296 b6989586621680800298))
  • data FmapDefaultSym1 (a6989586621680800777 :: (~>) a6989586621680800297 b6989586621680800298) :: forall t6989586621680800296. (~>) (t6989586621680800296 a6989586621680800297) (t6989586621680800296 b6989586621680800298)
  • type FmapDefaultSym2 (a6989586621680800777 :: (~>) a6989586621680800297 b6989586621680800298) (a6989586621680800778 :: t6989586621680800296 a6989586621680800297) = FmapDefault a6989586621680800777 a6989586621680800778
  • data FoldMapDefaultSym0 :: forall a6989586621680800295 m6989586621680800294 t6989586621680800293. (~>) ((~>) a6989586621680800295 m6989586621680800294) ((~>) (t6989586621680800293 a6989586621680800295) m6989586621680800294)
  • data FoldMapDefaultSym1 (a6989586621680800756 :: (~>) a6989586621680800295 m6989586621680800294) :: forall t6989586621680800293. (~>) (t6989586621680800293 a6989586621680800295) m6989586621680800294
  • type FoldMapDefaultSym2 (a6989586621680800756 :: (~>) a6989586621680800295 m6989586621680800294) (a6989586621680800757 :: t6989586621680800293 a6989586621680800295) = FoldMapDefault a6989586621680800756 a6989586621680800757

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_6989586621680794796Sym0 a) a Source #

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

type SequenceA a = Apply SequenceA_6989586621680794809Sym0 a Source #

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

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

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

type Sequence a = Apply Sequence_6989586621680794834Sym0 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 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 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.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 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 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 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 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 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 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 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 (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_6989586621680794796Sym0 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_6989586621680794809Sym0 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_6989586621680794819Sym0 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_6989586621680794834Sym0 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 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 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.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 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 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 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 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 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 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 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 (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_6989586621680800834 a_6989586621680800836 = Apply (Apply (Apply FlipSym0 TraverseSym0) a_6989586621680800834) a_6989586621680800836 

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_6989586621680800824 a_6989586621680800826 = Apply (Apply (Apply FlipSym0 MapMSym0) a_6989586621680800824) a_6989586621680800826 

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_6989586621680800820 f s t (Let6989586621680800816Scrutinee_6989586621680800387Sym3 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_6989586621680800803 f s t (Let6989586621680800799Scrutinee_6989586621680800391Sym3 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_6989586621680800786 f x (Let6989586621680800783Scrutinee_6989586621680800395Sym2 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_6989586621680800773 f x (Let6989586621680800770Scrutinee_6989586621680800398Sym2 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 a6989586621680794772 f6989586621680794771 b6989586621680794773 t6989586621680794770. (~>) ((~>) a6989586621680794772 (f6989586621680794771 b6989586621680794773)) ((~>) (t6989586621680794770 a6989586621680794772) (f6989586621680794771 (t6989586621680794770 b6989586621680794773))) 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 (a6989586621680794772 ~> f6989586621680794771 b6989586621680794773) (t6989586621680794770 a6989586621680794772 ~> f6989586621680794771 (t6989586621680794770 b6989586621680794773)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (TraverseSym0 :: TyFun (a6989586621680794772 ~> f6989586621680794771 b6989586621680794773) (t6989586621680794770 a6989586621680794772 ~> f6989586621680794771 (t6989586621680794770 b6989586621680794773)) -> Type) (arg6989586621680794782 :: a6989586621680794772 ~> f6989586621680794771 b6989586621680794773) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (TraverseSym0 :: TyFun (a6989586621680794772 ~> f6989586621680794771 b6989586621680794773) (t6989586621680794770 a6989586621680794772 ~> f6989586621680794771 (t6989586621680794770 b6989586621680794773)) -> Type) (arg6989586621680794782 :: a6989586621680794772 ~> f6989586621680794771 b6989586621680794773) = TraverseSym1 arg6989586621680794782 t6989586621680794770 :: TyFun (t6989586621680794770 a6989586621680794772) (f6989586621680794771 (t6989586621680794770 b6989586621680794773)) -> Type

data TraverseSym1 (arg6989586621680794782 :: (~>) a6989586621680794772 (f6989586621680794771 b6989586621680794773)) :: forall t6989586621680794770. (~>) (t6989586621680794770 a6989586621680794772) (f6989586621680794771 (t6989586621680794770 b6989586621680794773)) 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 arg6989586621680794782 t6989586621680794770 :: TyFun (t6989586621680794770 a6989586621680794772) (f6989586621680794771 (t6989586621680794770 b6989586621680794773)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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

Defined in Data.Singletons.Prelude.Traversable

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

type TraverseSym2 (arg6989586621680794782 :: (~>) a6989586621680794772 (f6989586621680794771 b6989586621680794773)) (arg6989586621680794783 :: t6989586621680794770 a6989586621680794772) = Traverse arg6989586621680794782 arg6989586621680794783 Source #

data SequenceASym0 :: forall t6989586621680794770 f6989586621680794774 a6989586621680794775. (~>) (t6989586621680794770 (f6989586621680794774 a6989586621680794775)) (f6989586621680794774 (t6989586621680794770 a6989586621680794775)) 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 (t6989586621680794770 (f6989586621680794774 a6989586621680794775)) (f6989586621680794774 (t6989586621680794770 a6989586621680794775)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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

Defined in Data.Singletons.Prelude.Traversable

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

type SequenceASym1 (arg6989586621680794786 :: t6989586621680794770 (f6989586621680794774 a6989586621680794775)) = SequenceA arg6989586621680794786 Source #

data MapMSym0 :: forall a6989586621680794777 m6989586621680794776 b6989586621680794778 t6989586621680794770. (~>) ((~>) a6989586621680794777 (m6989586621680794776 b6989586621680794778)) ((~>) (t6989586621680794770 a6989586621680794777) (m6989586621680794776 (t6989586621680794770 b6989586621680794778))) 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 (a6989586621680794777 ~> m6989586621680794776 b6989586621680794778) (t6989586621680794770 a6989586621680794777 ~> m6989586621680794776 (t6989586621680794770 b6989586621680794778)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapMSym0 :: TyFun (a6989586621680794777 ~> m6989586621680794776 b6989586621680794778) (t6989586621680794770 a6989586621680794777 ~> m6989586621680794776 (t6989586621680794770 b6989586621680794778)) -> Type) (arg6989586621680794788 :: a6989586621680794777 ~> m6989586621680794776 b6989586621680794778) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapMSym0 :: TyFun (a6989586621680794777 ~> m6989586621680794776 b6989586621680794778) (t6989586621680794770 a6989586621680794777 ~> m6989586621680794776 (t6989586621680794770 b6989586621680794778)) -> Type) (arg6989586621680794788 :: a6989586621680794777 ~> m6989586621680794776 b6989586621680794778) = MapMSym1 arg6989586621680794788 t6989586621680794770 :: TyFun (t6989586621680794770 a6989586621680794777) (m6989586621680794776 (t6989586621680794770 b6989586621680794778)) -> Type

data MapMSym1 (arg6989586621680794788 :: (~>) a6989586621680794777 (m6989586621680794776 b6989586621680794778)) :: forall t6989586621680794770. (~>) (t6989586621680794770 a6989586621680794777) (m6989586621680794776 (t6989586621680794770 b6989586621680794778)) 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 arg6989586621680794788 t6989586621680794770 :: TyFun (t6989586621680794770 a6989586621680794777) (m6989586621680794776 (t6989586621680794770 b6989586621680794778)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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

Defined in Data.Singletons.Prelude.Traversable

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

type MapMSym2 (arg6989586621680794788 :: (~>) a6989586621680794777 (m6989586621680794776 b6989586621680794778)) (arg6989586621680794789 :: t6989586621680794770 a6989586621680794777) = MapM arg6989586621680794788 arg6989586621680794789 Source #

data SequenceSym0 :: forall t6989586621680794770 m6989586621680794779 a6989586621680794780. (~>) (t6989586621680794770 (m6989586621680794779 a6989586621680794780)) (m6989586621680794779 (t6989586621680794770 a6989586621680794780)) 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 (t6989586621680794770 (m6989586621680794779 a6989586621680794780)) (m6989586621680794779 (t6989586621680794770 a6989586621680794780)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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

Defined in Data.Singletons.Prelude.Traversable

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

type SequenceSym1 (arg6989586621680794792 :: t6989586621680794770 (m6989586621680794779 a6989586621680794780)) = Sequence arg6989586621680794792 Source #

data ForSym0 :: forall t6989586621680800311 a6989586621680800313 f6989586621680800312 b6989586621680800314. (~>) (t6989586621680800311 a6989586621680800313) ((~>) ((~>) a6989586621680800313 (f6989586621680800312 b6989586621680800314)) (f6989586621680800312 (t6989586621680800311 b6989586621680800314))) 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 (t6989586621680800311 a6989586621680800313) ((a6989586621680800313 ~> f6989586621680800312 b6989586621680800314) ~> f6989586621680800312 (t6989586621680800311 b6989586621680800314)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (ForSym0 :: TyFun (t6989586621680800311 a6989586621680800313) ((a6989586621680800313 ~> f6989586621680800312 b6989586621680800314) ~> f6989586621680800312 (t6989586621680800311 b6989586621680800314)) -> Type) (a6989586621680800838 :: t6989586621680800311 a6989586621680800313) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (ForSym0 :: TyFun (t6989586621680800311 a6989586621680800313) ((a6989586621680800313 ~> f6989586621680800312 b6989586621680800314) ~> f6989586621680800312 (t6989586621680800311 b6989586621680800314)) -> Type) (a6989586621680800838 :: t6989586621680800311 a6989586621680800313) = ForSym1 a6989586621680800838 f6989586621680800312 b6989586621680800314 :: TyFun (a6989586621680800313 ~> f6989586621680800312 b6989586621680800314) (f6989586621680800312 (t6989586621680800311 b6989586621680800314)) -> Type

data ForSym1 (a6989586621680800838 :: t6989586621680800311 a6989586621680800313) :: forall f6989586621680800312 b6989586621680800314. (~>) ((~>) a6989586621680800313 (f6989586621680800312 b6989586621680800314)) (f6989586621680800312 (t6989586621680800311 b6989586621680800314)) 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 a6989586621680800838 f6989586621680800312 b6989586621680800314 :: TyFun (a6989586621680800313 ~> f6989586621680800312 b6989586621680800314) (f6989586621680800312 (t6989586621680800311 b6989586621680800314)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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

Defined in Data.Singletons.Prelude.Traversable

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

type ForSym2 (a6989586621680800838 :: t6989586621680800311 a6989586621680800313) (a6989586621680800839 :: (~>) a6989586621680800313 (f6989586621680800312 b6989586621680800314)) = For a6989586621680800838 a6989586621680800839 Source #

data ForMSym0 :: forall t6989586621680800307 a6989586621680800309 m6989586621680800308 b6989586621680800310. (~>) (t6989586621680800307 a6989586621680800309) ((~>) ((~>) a6989586621680800309 (m6989586621680800308 b6989586621680800310)) (m6989586621680800308 (t6989586621680800307 b6989586621680800310))) 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 (t6989586621680800307 a6989586621680800309) ((a6989586621680800309 ~> m6989586621680800308 b6989586621680800310) ~> m6989586621680800308 (t6989586621680800307 b6989586621680800310)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (ForMSym0 :: TyFun (t6989586621680800307 a6989586621680800309) ((a6989586621680800309 ~> m6989586621680800308 b6989586621680800310) ~> m6989586621680800308 (t6989586621680800307 b6989586621680800310)) -> Type) (a6989586621680800828 :: t6989586621680800307 a6989586621680800309) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (ForMSym0 :: TyFun (t6989586621680800307 a6989586621680800309) ((a6989586621680800309 ~> m6989586621680800308 b6989586621680800310) ~> m6989586621680800308 (t6989586621680800307 b6989586621680800310)) -> Type) (a6989586621680800828 :: t6989586621680800307 a6989586621680800309) = ForMSym1 a6989586621680800828 m6989586621680800308 b6989586621680800310 :: TyFun (a6989586621680800309 ~> m6989586621680800308 b6989586621680800310) (m6989586621680800308 (t6989586621680800307 b6989586621680800310)) -> Type

data ForMSym1 (a6989586621680800828 :: t6989586621680800307 a6989586621680800309) :: forall m6989586621680800308 b6989586621680800310. (~>) ((~>) a6989586621680800309 (m6989586621680800308 b6989586621680800310)) (m6989586621680800308 (t6989586621680800307 b6989586621680800310)) 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 a6989586621680800828 m6989586621680800308 b6989586621680800310 :: TyFun (a6989586621680800309 ~> m6989586621680800308 b6989586621680800310) (m6989586621680800308 (t6989586621680800307 b6989586621680800310)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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

Defined in Data.Singletons.Prelude.Traversable

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

type ForMSym2 (a6989586621680800828 :: t6989586621680800307 a6989586621680800309) (a6989586621680800829 :: (~>) a6989586621680800309 (m6989586621680800308 b6989586621680800310)) = ForM a6989586621680800828 a6989586621680800829 Source #

data MapAccumLSym0 :: forall a6989586621680800304 b6989586621680800305 c6989586621680800306 t6989586621680800303. (~>) ((~>) a6989586621680800304 ((~>) b6989586621680800305 (a6989586621680800304, c6989586621680800306))) ((~>) a6989586621680800304 ((~>) (t6989586621680800303 b6989586621680800305) (a6989586621680800304, t6989586621680800303 c6989586621680800306))) 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 (a6989586621680800304 ~> (b6989586621680800305 ~> (a6989586621680800304, c6989586621680800306))) (a6989586621680800304 ~> (t6989586621680800303 b6989586621680800305 ~> (a6989586621680800304, t6989586621680800303 c6989586621680800306))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumLSym0 :: TyFun (a6989586621680800304 ~> (b6989586621680800305 ~> (a6989586621680800304, c6989586621680800306))) (a6989586621680800304 ~> (t6989586621680800303 b6989586621680800305 ~> (a6989586621680800304, t6989586621680800303 c6989586621680800306))) -> Type) (a6989586621680800807 :: a6989586621680800304 ~> (b6989586621680800305 ~> (a6989586621680800304, c6989586621680800306))) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumLSym0 :: TyFun (a6989586621680800304 ~> (b6989586621680800305 ~> (a6989586621680800304, c6989586621680800306))) (a6989586621680800304 ~> (t6989586621680800303 b6989586621680800305 ~> (a6989586621680800304, t6989586621680800303 c6989586621680800306))) -> Type) (a6989586621680800807 :: a6989586621680800304 ~> (b6989586621680800305 ~> (a6989586621680800304, c6989586621680800306))) = MapAccumLSym1 a6989586621680800807 t6989586621680800303 :: TyFun a6989586621680800304 (t6989586621680800303 b6989586621680800305 ~> (a6989586621680800304, t6989586621680800303 c6989586621680800306)) -> Type

data MapAccumLSym1 (a6989586621680800807 :: (~>) a6989586621680800304 ((~>) b6989586621680800305 (a6989586621680800304, c6989586621680800306))) :: forall t6989586621680800303. (~>) a6989586621680800304 ((~>) (t6989586621680800303 b6989586621680800305) (a6989586621680800304, t6989586621680800303 c6989586621680800306)) 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 a6989586621680800807 t6989586621680800303 :: TyFun a6989586621680800304 (t6989586621680800303 b6989586621680800305 ~> (a6989586621680800304, t6989586621680800303 c6989586621680800306)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumLSym1 a6989586621680800807 t6989586621680800303 :: TyFun a6989586621680800304 (t6989586621680800303 b6989586621680800305 ~> (a6989586621680800304, t6989586621680800303 c6989586621680800306)) -> Type) (a6989586621680800808 :: a6989586621680800304) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumLSym1 a6989586621680800807 t6989586621680800303 :: TyFun a6989586621680800304 (t6989586621680800303 b6989586621680800305 ~> (a6989586621680800304, t6989586621680800303 c6989586621680800306)) -> Type) (a6989586621680800808 :: a6989586621680800304) = MapAccumLSym2 a6989586621680800807 a6989586621680800808 t6989586621680800303 :: TyFun (t6989586621680800303 b6989586621680800305) (a6989586621680800304, t6989586621680800303 c6989586621680800306) -> Type

data MapAccumLSym2 (a6989586621680800807 :: (~>) a6989586621680800304 ((~>) b6989586621680800305 (a6989586621680800304, c6989586621680800306))) (a6989586621680800808 :: a6989586621680800304) :: forall t6989586621680800303. (~>) (t6989586621680800303 b6989586621680800305) (a6989586621680800304, t6989586621680800303 c6989586621680800306) 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 a6989586621680800808 a6989586621680800807 t6989586621680800303 :: TyFun (t6989586621680800303 b6989586621680800305) (a6989586621680800304, t6989586621680800303 c6989586621680800306) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumLSym2 a6989586621680800808 a6989586621680800807 t :: TyFun (t b) (a, t c) -> Type) (a6989586621680800809 :: t b) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumLSym2 a6989586621680800808 a6989586621680800807 t :: TyFun (t b) (a, t c) -> Type) (a6989586621680800809 :: t b) = MapAccumL a6989586621680800808 a6989586621680800807 a6989586621680800809

type MapAccumLSym3 (a6989586621680800807 :: (~>) a6989586621680800304 ((~>) b6989586621680800305 (a6989586621680800304, c6989586621680800306))) (a6989586621680800808 :: a6989586621680800304) (a6989586621680800809 :: t6989586621680800303 b6989586621680800305) = MapAccumL a6989586621680800807 a6989586621680800808 a6989586621680800809 Source #

data MapAccumRSym0 :: forall a6989586621680800300 b6989586621680800301 c6989586621680800302 t6989586621680800299. (~>) ((~>) a6989586621680800300 ((~>) b6989586621680800301 (a6989586621680800300, c6989586621680800302))) ((~>) a6989586621680800300 ((~>) (t6989586621680800299 b6989586621680800301) (a6989586621680800300, t6989586621680800299 c6989586621680800302))) 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 (a6989586621680800300 ~> (b6989586621680800301 ~> (a6989586621680800300, c6989586621680800302))) (a6989586621680800300 ~> (t6989586621680800299 b6989586621680800301 ~> (a6989586621680800300, t6989586621680800299 c6989586621680800302))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumRSym0 :: TyFun (a6989586621680800300 ~> (b6989586621680800301 ~> (a6989586621680800300, c6989586621680800302))) (a6989586621680800300 ~> (t6989586621680800299 b6989586621680800301 ~> (a6989586621680800300, t6989586621680800299 c6989586621680800302))) -> Type) (a6989586621680800790 :: a6989586621680800300 ~> (b6989586621680800301 ~> (a6989586621680800300, c6989586621680800302))) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumRSym0 :: TyFun (a6989586621680800300 ~> (b6989586621680800301 ~> (a6989586621680800300, c6989586621680800302))) (a6989586621680800300 ~> (t6989586621680800299 b6989586621680800301 ~> (a6989586621680800300, t6989586621680800299 c6989586621680800302))) -> Type) (a6989586621680800790 :: a6989586621680800300 ~> (b6989586621680800301 ~> (a6989586621680800300, c6989586621680800302))) = MapAccumRSym1 a6989586621680800790 t6989586621680800299 :: TyFun a6989586621680800300 (t6989586621680800299 b6989586621680800301 ~> (a6989586621680800300, t6989586621680800299 c6989586621680800302)) -> Type

data MapAccumRSym1 (a6989586621680800790 :: (~>) a6989586621680800300 ((~>) b6989586621680800301 (a6989586621680800300, c6989586621680800302))) :: forall t6989586621680800299. (~>) a6989586621680800300 ((~>) (t6989586621680800299 b6989586621680800301) (a6989586621680800300, t6989586621680800299 c6989586621680800302)) 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 a6989586621680800790 t6989586621680800299 :: TyFun a6989586621680800300 (t6989586621680800299 b6989586621680800301 ~> (a6989586621680800300, t6989586621680800299 c6989586621680800302)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumRSym1 a6989586621680800790 t6989586621680800299 :: TyFun a6989586621680800300 (t6989586621680800299 b6989586621680800301 ~> (a6989586621680800300, t6989586621680800299 c6989586621680800302)) -> Type) (a6989586621680800791 :: a6989586621680800300) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumRSym1 a6989586621680800790 t6989586621680800299 :: TyFun a6989586621680800300 (t6989586621680800299 b6989586621680800301 ~> (a6989586621680800300, t6989586621680800299 c6989586621680800302)) -> Type) (a6989586621680800791 :: a6989586621680800300) = MapAccumRSym2 a6989586621680800790 a6989586621680800791 t6989586621680800299 :: TyFun (t6989586621680800299 b6989586621680800301) (a6989586621680800300, t6989586621680800299 c6989586621680800302) -> Type

data MapAccumRSym2 (a6989586621680800790 :: (~>) a6989586621680800300 ((~>) b6989586621680800301 (a6989586621680800300, c6989586621680800302))) (a6989586621680800791 :: a6989586621680800300) :: forall t6989586621680800299. (~>) (t6989586621680800299 b6989586621680800301) (a6989586621680800300, t6989586621680800299 c6989586621680800302) 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 a6989586621680800791 a6989586621680800790 t6989586621680800299 :: TyFun (t6989586621680800299 b6989586621680800301) (a6989586621680800300, t6989586621680800299 c6989586621680800302) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumRSym2 a6989586621680800791 a6989586621680800790 t :: TyFun (t b) (a, t c) -> Type) (a6989586621680800792 :: t b) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumRSym2 a6989586621680800791 a6989586621680800790 t :: TyFun (t b) (a, t c) -> Type) (a6989586621680800792 :: t b) = MapAccumR a6989586621680800791 a6989586621680800790 a6989586621680800792

type MapAccumRSym3 (a6989586621680800790 :: (~>) a6989586621680800300 ((~>) b6989586621680800301 (a6989586621680800300, c6989586621680800302))) (a6989586621680800791 :: a6989586621680800300) (a6989586621680800792 :: t6989586621680800299 b6989586621680800301) = MapAccumR a6989586621680800790 a6989586621680800791 a6989586621680800792 Source #

data FmapDefaultSym0 :: forall a6989586621680800297 b6989586621680800298 t6989586621680800296. (~>) ((~>) a6989586621680800297 b6989586621680800298) ((~>) (t6989586621680800296 a6989586621680800297) (t6989586621680800296 b6989586621680800298)) 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 (a6989586621680800297 ~> b6989586621680800298) (t6989586621680800296 a6989586621680800297 ~> t6989586621680800296 b6989586621680800298) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (FmapDefaultSym0 :: TyFun (a6989586621680800297 ~> b6989586621680800298) (t6989586621680800296 a6989586621680800297 ~> t6989586621680800296 b6989586621680800298) -> Type) (a6989586621680800777 :: a6989586621680800297 ~> b6989586621680800298) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (FmapDefaultSym0 :: TyFun (a6989586621680800297 ~> b6989586621680800298) (t6989586621680800296 a6989586621680800297 ~> t6989586621680800296 b6989586621680800298) -> Type) (a6989586621680800777 :: a6989586621680800297 ~> b6989586621680800298) = FmapDefaultSym1 a6989586621680800777 t6989586621680800296 :: TyFun (t6989586621680800296 a6989586621680800297) (t6989586621680800296 b6989586621680800298) -> Type

data FmapDefaultSym1 (a6989586621680800777 :: (~>) a6989586621680800297 b6989586621680800298) :: forall t6989586621680800296. (~>) (t6989586621680800296 a6989586621680800297) (t6989586621680800296 b6989586621680800298) 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 a6989586621680800777 t6989586621680800296 :: TyFun (t6989586621680800296 a6989586621680800297) (t6989586621680800296 b6989586621680800298) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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

Defined in Data.Singletons.Prelude.Traversable

type Apply (FmapDefaultSym1 a6989586621680800777 t :: TyFun (t a) (t b) -> Type) (a6989586621680800778 :: t a) = FmapDefault a6989586621680800777 a6989586621680800778

type FmapDefaultSym2 (a6989586621680800777 :: (~>) a6989586621680800297 b6989586621680800298) (a6989586621680800778 :: t6989586621680800296 a6989586621680800297) = FmapDefault a6989586621680800777 a6989586621680800778 Source #

data FoldMapDefaultSym0 :: forall a6989586621680800295 m6989586621680800294 t6989586621680800293. (~>) ((~>) a6989586621680800295 m6989586621680800294) ((~>) (t6989586621680800293 a6989586621680800295) m6989586621680800294) 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 (a6989586621680800295 ~> m6989586621680800294) (t6989586621680800293 a6989586621680800295 ~> m6989586621680800294) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (FoldMapDefaultSym0 :: TyFun (a6989586621680800295 ~> m6989586621680800294) (t6989586621680800293 a6989586621680800295 ~> m6989586621680800294) -> Type) (a6989586621680800756 :: a6989586621680800295 ~> m6989586621680800294) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (FoldMapDefaultSym0 :: TyFun (a6989586621680800295 ~> m6989586621680800294) (t6989586621680800293 a6989586621680800295 ~> m6989586621680800294) -> Type) (a6989586621680800756 :: a6989586621680800295 ~> m6989586621680800294) = FoldMapDefaultSym1 a6989586621680800756 t6989586621680800293 :: TyFun (t6989586621680800293 a6989586621680800295) m6989586621680800294 -> Type

data FoldMapDefaultSym1 (a6989586621680800756 :: (~>) a6989586621680800295 m6989586621680800294) :: forall t6989586621680800293. (~>) (t6989586621680800293 a6989586621680800295) m6989586621680800294 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 a6989586621680800756 t6989586621680800293 :: TyFun (t6989586621680800293 a6989586621680800295) m6989586621680800294 -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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

Defined in Data.Singletons.Prelude.Traversable

type Apply (FoldMapDefaultSym1 a6989586621680800756 t :: TyFun (t a) m -> Type) (a6989586621680800757 :: t a) = FoldMapDefault a6989586621680800756 a6989586621680800757

type FoldMapDefaultSym2 (a6989586621680800756 :: (~>) a6989586621680800295 m6989586621680800294) (a6989586621680800757 :: t6989586621680800293 a6989586621680800295) = FoldMapDefault a6989586621680800756 a6989586621680800757 Source #