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 a6989586621680794821 f6989586621680794820 b6989586621680794822 t6989586621680794819. (~>) ((~>) a6989586621680794821 (f6989586621680794820 b6989586621680794822)) ((~>) (t6989586621680794819 a6989586621680794821) (f6989586621680794820 (t6989586621680794819 b6989586621680794822)))
  • data TraverseSym1 (arg6989586621680794831 :: (~>) a6989586621680794821 (f6989586621680794820 b6989586621680794822)) :: forall t6989586621680794819. (~>) (t6989586621680794819 a6989586621680794821) (f6989586621680794820 (t6989586621680794819 b6989586621680794822))
  • type TraverseSym2 (arg6989586621680794831 :: (~>) a6989586621680794821 (f6989586621680794820 b6989586621680794822)) (arg6989586621680794832 :: t6989586621680794819 a6989586621680794821) = Traverse arg6989586621680794831 arg6989586621680794832
  • data SequenceASym0 :: forall t6989586621680794819 f6989586621680794823 a6989586621680794824. (~>) (t6989586621680794819 (f6989586621680794823 a6989586621680794824)) (f6989586621680794823 (t6989586621680794819 a6989586621680794824))
  • type SequenceASym1 (arg6989586621680794835 :: t6989586621680794819 (f6989586621680794823 a6989586621680794824)) = SequenceA arg6989586621680794835
  • data MapMSym0 :: forall a6989586621680794826 m6989586621680794825 b6989586621680794827 t6989586621680794819. (~>) ((~>) a6989586621680794826 (m6989586621680794825 b6989586621680794827)) ((~>) (t6989586621680794819 a6989586621680794826) (m6989586621680794825 (t6989586621680794819 b6989586621680794827)))
  • data MapMSym1 (arg6989586621680794837 :: (~>) a6989586621680794826 (m6989586621680794825 b6989586621680794827)) :: forall t6989586621680794819. (~>) (t6989586621680794819 a6989586621680794826) (m6989586621680794825 (t6989586621680794819 b6989586621680794827))
  • type MapMSym2 (arg6989586621680794837 :: (~>) a6989586621680794826 (m6989586621680794825 b6989586621680794827)) (arg6989586621680794838 :: t6989586621680794819 a6989586621680794826) = MapM arg6989586621680794837 arg6989586621680794838
  • data SequenceSym0 :: forall t6989586621680794819 m6989586621680794828 a6989586621680794829. (~>) (t6989586621680794819 (m6989586621680794828 a6989586621680794829)) (m6989586621680794828 (t6989586621680794819 a6989586621680794829))
  • type SequenceSym1 (arg6989586621680794841 :: t6989586621680794819 (m6989586621680794828 a6989586621680794829)) = Sequence arg6989586621680794841
  • data ForSym0 :: forall t6989586621680800360 a6989586621680800362 f6989586621680800361 b6989586621680800363. (~>) (t6989586621680800360 a6989586621680800362) ((~>) ((~>) a6989586621680800362 (f6989586621680800361 b6989586621680800363)) (f6989586621680800361 (t6989586621680800360 b6989586621680800363)))
  • data ForSym1 (a6989586621680800887 :: t6989586621680800360 a6989586621680800362) :: forall f6989586621680800361 b6989586621680800363. (~>) ((~>) a6989586621680800362 (f6989586621680800361 b6989586621680800363)) (f6989586621680800361 (t6989586621680800360 b6989586621680800363))
  • type ForSym2 (a6989586621680800887 :: t6989586621680800360 a6989586621680800362) (a6989586621680800888 :: (~>) a6989586621680800362 (f6989586621680800361 b6989586621680800363)) = For a6989586621680800887 a6989586621680800888
  • data ForMSym0 :: forall t6989586621680800356 a6989586621680800358 m6989586621680800357 b6989586621680800359. (~>) (t6989586621680800356 a6989586621680800358) ((~>) ((~>) a6989586621680800358 (m6989586621680800357 b6989586621680800359)) (m6989586621680800357 (t6989586621680800356 b6989586621680800359)))
  • data ForMSym1 (a6989586621680800877 :: t6989586621680800356 a6989586621680800358) :: forall m6989586621680800357 b6989586621680800359. (~>) ((~>) a6989586621680800358 (m6989586621680800357 b6989586621680800359)) (m6989586621680800357 (t6989586621680800356 b6989586621680800359))
  • type ForMSym2 (a6989586621680800877 :: t6989586621680800356 a6989586621680800358) (a6989586621680800878 :: (~>) a6989586621680800358 (m6989586621680800357 b6989586621680800359)) = ForM a6989586621680800877 a6989586621680800878
  • data MapAccumLSym0 :: forall a6989586621680800353 b6989586621680800354 c6989586621680800355 t6989586621680800352. (~>) ((~>) a6989586621680800353 ((~>) b6989586621680800354 (a6989586621680800353, c6989586621680800355))) ((~>) a6989586621680800353 ((~>) (t6989586621680800352 b6989586621680800354) (a6989586621680800353, t6989586621680800352 c6989586621680800355)))
  • data MapAccumLSym1 (a6989586621680800856 :: (~>) a6989586621680800353 ((~>) b6989586621680800354 (a6989586621680800353, c6989586621680800355))) :: forall t6989586621680800352. (~>) a6989586621680800353 ((~>) (t6989586621680800352 b6989586621680800354) (a6989586621680800353, t6989586621680800352 c6989586621680800355))
  • data MapAccumLSym2 (a6989586621680800856 :: (~>) a6989586621680800353 ((~>) b6989586621680800354 (a6989586621680800353, c6989586621680800355))) (a6989586621680800857 :: a6989586621680800353) :: forall t6989586621680800352. (~>) (t6989586621680800352 b6989586621680800354) (a6989586621680800353, t6989586621680800352 c6989586621680800355)
  • type MapAccumLSym3 (a6989586621680800856 :: (~>) a6989586621680800353 ((~>) b6989586621680800354 (a6989586621680800353, c6989586621680800355))) (a6989586621680800857 :: a6989586621680800353) (a6989586621680800858 :: t6989586621680800352 b6989586621680800354) = MapAccumL a6989586621680800856 a6989586621680800857 a6989586621680800858
  • data MapAccumRSym0 :: forall a6989586621680800349 b6989586621680800350 c6989586621680800351 t6989586621680800348. (~>) ((~>) a6989586621680800349 ((~>) b6989586621680800350 (a6989586621680800349, c6989586621680800351))) ((~>) a6989586621680800349 ((~>) (t6989586621680800348 b6989586621680800350) (a6989586621680800349, t6989586621680800348 c6989586621680800351)))
  • data MapAccumRSym1 (a6989586621680800839 :: (~>) a6989586621680800349 ((~>) b6989586621680800350 (a6989586621680800349, c6989586621680800351))) :: forall t6989586621680800348. (~>) a6989586621680800349 ((~>) (t6989586621680800348 b6989586621680800350) (a6989586621680800349, t6989586621680800348 c6989586621680800351))
  • data MapAccumRSym2 (a6989586621680800839 :: (~>) a6989586621680800349 ((~>) b6989586621680800350 (a6989586621680800349, c6989586621680800351))) (a6989586621680800840 :: a6989586621680800349) :: forall t6989586621680800348. (~>) (t6989586621680800348 b6989586621680800350) (a6989586621680800349, t6989586621680800348 c6989586621680800351)
  • type MapAccumRSym3 (a6989586621680800839 :: (~>) a6989586621680800349 ((~>) b6989586621680800350 (a6989586621680800349, c6989586621680800351))) (a6989586621680800840 :: a6989586621680800349) (a6989586621680800841 :: t6989586621680800348 b6989586621680800350) = MapAccumR a6989586621680800839 a6989586621680800840 a6989586621680800841
  • data FmapDefaultSym0 :: forall a6989586621680800346 b6989586621680800347 t6989586621680800345. (~>) ((~>) a6989586621680800346 b6989586621680800347) ((~>) (t6989586621680800345 a6989586621680800346) (t6989586621680800345 b6989586621680800347))
  • data FmapDefaultSym1 (a6989586621680800826 :: (~>) a6989586621680800346 b6989586621680800347) :: forall t6989586621680800345. (~>) (t6989586621680800345 a6989586621680800346) (t6989586621680800345 b6989586621680800347)
  • type FmapDefaultSym2 (a6989586621680800826 :: (~>) a6989586621680800346 b6989586621680800347) (a6989586621680800827 :: t6989586621680800345 a6989586621680800346) = FmapDefault a6989586621680800826 a6989586621680800827
  • data FoldMapDefaultSym0 :: forall a6989586621680800344 m6989586621680800343 t6989586621680800342. (~>) ((~>) a6989586621680800344 m6989586621680800343) ((~>) (t6989586621680800342 a6989586621680800344) m6989586621680800343)
  • data FoldMapDefaultSym1 (a6989586621680800805 :: (~>) a6989586621680800344 m6989586621680800343) :: forall t6989586621680800342. (~>) (t6989586621680800342 a6989586621680800344) m6989586621680800343
  • type FoldMapDefaultSym2 (a6989586621680800805 :: (~>) a6989586621680800344 m6989586621680800343) (a6989586621680800806 :: t6989586621680800342 a6989586621680800344) = FoldMapDefault a6989586621680800805 a6989586621680800806

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

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

type SequenceA a = Apply SequenceA_6989586621680794858Sym0 a Source #

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

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

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

type Sequence a = Apply Sequence_6989586621680794883Sym0 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_6989586621680794845Sym0 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_6989586621680794858Sym0 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_6989586621680794868Sym0 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_6989586621680794883Sym0 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_6989586621680800883 a_6989586621680800885 = Apply (Apply (Apply FlipSym0 TraverseSym0) a_6989586621680800883) a_6989586621680800885 

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_6989586621680800873 a_6989586621680800875 = Apply (Apply (Apply FlipSym0 MapMSym0) a_6989586621680800873) a_6989586621680800875 

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_6989586621680800869 f s t (Let6989586621680800865Scrutinee_6989586621680800436Sym3 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_6989586621680800852 f s t (Let6989586621680800848Scrutinee_6989586621680800440Sym3 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_6989586621680800835 f x (Let6989586621680800832Scrutinee_6989586621680800444Sym2 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_6989586621680800822 f x (Let6989586621680800819Scrutinee_6989586621680800447Sym2 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 a6989586621680794821 f6989586621680794820 b6989586621680794822 t6989586621680794819. (~>) ((~>) a6989586621680794821 (f6989586621680794820 b6989586621680794822)) ((~>) (t6989586621680794819 a6989586621680794821) (f6989586621680794820 (t6989586621680794819 b6989586621680794822))) 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 (a6989586621680794821 ~> f6989586621680794820 b6989586621680794822) (t6989586621680794819 a6989586621680794821 ~> f6989586621680794820 (t6989586621680794819 b6989586621680794822)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (TraverseSym0 :: TyFun (a6989586621680794821 ~> f6989586621680794820 b6989586621680794822) (t6989586621680794819 a6989586621680794821 ~> f6989586621680794820 (t6989586621680794819 b6989586621680794822)) -> Type) (arg6989586621680794831 :: a6989586621680794821 ~> f6989586621680794820 b6989586621680794822) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (TraverseSym0 :: TyFun (a6989586621680794821 ~> f6989586621680794820 b6989586621680794822) (t6989586621680794819 a6989586621680794821 ~> f6989586621680794820 (t6989586621680794819 b6989586621680794822)) -> Type) (arg6989586621680794831 :: a6989586621680794821 ~> f6989586621680794820 b6989586621680794822) = TraverseSym1 arg6989586621680794831 t6989586621680794819 :: TyFun (t6989586621680794819 a6989586621680794821) (f6989586621680794820 (t6989586621680794819 b6989586621680794822)) -> Type

data TraverseSym1 (arg6989586621680794831 :: (~>) a6989586621680794821 (f6989586621680794820 b6989586621680794822)) :: forall t6989586621680794819. (~>) (t6989586621680794819 a6989586621680794821) (f6989586621680794820 (t6989586621680794819 b6989586621680794822)) 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 arg6989586621680794831 t6989586621680794819 :: TyFun (t6989586621680794819 a6989586621680794821) (f6989586621680794820 (t6989586621680794819 b6989586621680794822)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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

Defined in Data.Singletons.Prelude.Traversable

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

type TraverseSym2 (arg6989586621680794831 :: (~>) a6989586621680794821 (f6989586621680794820 b6989586621680794822)) (arg6989586621680794832 :: t6989586621680794819 a6989586621680794821) = Traverse arg6989586621680794831 arg6989586621680794832 Source #

data SequenceASym0 :: forall t6989586621680794819 f6989586621680794823 a6989586621680794824. (~>) (t6989586621680794819 (f6989586621680794823 a6989586621680794824)) (f6989586621680794823 (t6989586621680794819 a6989586621680794824)) 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 (t6989586621680794819 (f6989586621680794823 a6989586621680794824)) (f6989586621680794823 (t6989586621680794819 a6989586621680794824)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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

Defined in Data.Singletons.Prelude.Traversable

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

type SequenceASym1 (arg6989586621680794835 :: t6989586621680794819 (f6989586621680794823 a6989586621680794824)) = SequenceA arg6989586621680794835 Source #

data MapMSym0 :: forall a6989586621680794826 m6989586621680794825 b6989586621680794827 t6989586621680794819. (~>) ((~>) a6989586621680794826 (m6989586621680794825 b6989586621680794827)) ((~>) (t6989586621680794819 a6989586621680794826) (m6989586621680794825 (t6989586621680794819 b6989586621680794827))) 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 (a6989586621680794826 ~> m6989586621680794825 b6989586621680794827) (t6989586621680794819 a6989586621680794826 ~> m6989586621680794825 (t6989586621680794819 b6989586621680794827)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapMSym0 :: TyFun (a6989586621680794826 ~> m6989586621680794825 b6989586621680794827) (t6989586621680794819 a6989586621680794826 ~> m6989586621680794825 (t6989586621680794819 b6989586621680794827)) -> Type) (arg6989586621680794837 :: a6989586621680794826 ~> m6989586621680794825 b6989586621680794827) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapMSym0 :: TyFun (a6989586621680794826 ~> m6989586621680794825 b6989586621680794827) (t6989586621680794819 a6989586621680794826 ~> m6989586621680794825 (t6989586621680794819 b6989586621680794827)) -> Type) (arg6989586621680794837 :: a6989586621680794826 ~> m6989586621680794825 b6989586621680794827) = MapMSym1 arg6989586621680794837 t6989586621680794819 :: TyFun (t6989586621680794819 a6989586621680794826) (m6989586621680794825 (t6989586621680794819 b6989586621680794827)) -> Type

data MapMSym1 (arg6989586621680794837 :: (~>) a6989586621680794826 (m6989586621680794825 b6989586621680794827)) :: forall t6989586621680794819. (~>) (t6989586621680794819 a6989586621680794826) (m6989586621680794825 (t6989586621680794819 b6989586621680794827)) 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 arg6989586621680794837 t6989586621680794819 :: TyFun (t6989586621680794819 a6989586621680794826) (m6989586621680794825 (t6989586621680794819 b6989586621680794827)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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

Defined in Data.Singletons.Prelude.Traversable

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

type MapMSym2 (arg6989586621680794837 :: (~>) a6989586621680794826 (m6989586621680794825 b6989586621680794827)) (arg6989586621680794838 :: t6989586621680794819 a6989586621680794826) = MapM arg6989586621680794837 arg6989586621680794838 Source #

data SequenceSym0 :: forall t6989586621680794819 m6989586621680794828 a6989586621680794829. (~>) (t6989586621680794819 (m6989586621680794828 a6989586621680794829)) (m6989586621680794828 (t6989586621680794819 a6989586621680794829)) 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 (t6989586621680794819 (m6989586621680794828 a6989586621680794829)) (m6989586621680794828 (t6989586621680794819 a6989586621680794829)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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

Defined in Data.Singletons.Prelude.Traversable

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

type SequenceSym1 (arg6989586621680794841 :: t6989586621680794819 (m6989586621680794828 a6989586621680794829)) = Sequence arg6989586621680794841 Source #

data ForSym0 :: forall t6989586621680800360 a6989586621680800362 f6989586621680800361 b6989586621680800363. (~>) (t6989586621680800360 a6989586621680800362) ((~>) ((~>) a6989586621680800362 (f6989586621680800361 b6989586621680800363)) (f6989586621680800361 (t6989586621680800360 b6989586621680800363))) 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 (t6989586621680800360 a6989586621680800362) ((a6989586621680800362 ~> f6989586621680800361 b6989586621680800363) ~> f6989586621680800361 (t6989586621680800360 b6989586621680800363)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (ForSym0 :: TyFun (t6989586621680800360 a6989586621680800362) ((a6989586621680800362 ~> f6989586621680800361 b6989586621680800363) ~> f6989586621680800361 (t6989586621680800360 b6989586621680800363)) -> Type) (a6989586621680800887 :: t6989586621680800360 a6989586621680800362) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (ForSym0 :: TyFun (t6989586621680800360 a6989586621680800362) ((a6989586621680800362 ~> f6989586621680800361 b6989586621680800363) ~> f6989586621680800361 (t6989586621680800360 b6989586621680800363)) -> Type) (a6989586621680800887 :: t6989586621680800360 a6989586621680800362) = ForSym1 a6989586621680800887 f6989586621680800361 b6989586621680800363 :: TyFun (a6989586621680800362 ~> f6989586621680800361 b6989586621680800363) (f6989586621680800361 (t6989586621680800360 b6989586621680800363)) -> Type

data ForSym1 (a6989586621680800887 :: t6989586621680800360 a6989586621680800362) :: forall f6989586621680800361 b6989586621680800363. (~>) ((~>) a6989586621680800362 (f6989586621680800361 b6989586621680800363)) (f6989586621680800361 (t6989586621680800360 b6989586621680800363)) 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 a6989586621680800887 f6989586621680800361 b6989586621680800363 :: TyFun (a6989586621680800362 ~> f6989586621680800361 b6989586621680800363) (f6989586621680800361 (t6989586621680800360 b6989586621680800363)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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

Defined in Data.Singletons.Prelude.Traversable

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

type ForSym2 (a6989586621680800887 :: t6989586621680800360 a6989586621680800362) (a6989586621680800888 :: (~>) a6989586621680800362 (f6989586621680800361 b6989586621680800363)) = For a6989586621680800887 a6989586621680800888 Source #

data ForMSym0 :: forall t6989586621680800356 a6989586621680800358 m6989586621680800357 b6989586621680800359. (~>) (t6989586621680800356 a6989586621680800358) ((~>) ((~>) a6989586621680800358 (m6989586621680800357 b6989586621680800359)) (m6989586621680800357 (t6989586621680800356 b6989586621680800359))) 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 (t6989586621680800356 a6989586621680800358) ((a6989586621680800358 ~> m6989586621680800357 b6989586621680800359) ~> m6989586621680800357 (t6989586621680800356 b6989586621680800359)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (ForMSym0 :: TyFun (t6989586621680800356 a6989586621680800358) ((a6989586621680800358 ~> m6989586621680800357 b6989586621680800359) ~> m6989586621680800357 (t6989586621680800356 b6989586621680800359)) -> Type) (a6989586621680800877 :: t6989586621680800356 a6989586621680800358) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (ForMSym0 :: TyFun (t6989586621680800356 a6989586621680800358) ((a6989586621680800358 ~> m6989586621680800357 b6989586621680800359) ~> m6989586621680800357 (t6989586621680800356 b6989586621680800359)) -> Type) (a6989586621680800877 :: t6989586621680800356 a6989586621680800358) = ForMSym1 a6989586621680800877 m6989586621680800357 b6989586621680800359 :: TyFun (a6989586621680800358 ~> m6989586621680800357 b6989586621680800359) (m6989586621680800357 (t6989586621680800356 b6989586621680800359)) -> Type

data ForMSym1 (a6989586621680800877 :: t6989586621680800356 a6989586621680800358) :: forall m6989586621680800357 b6989586621680800359. (~>) ((~>) a6989586621680800358 (m6989586621680800357 b6989586621680800359)) (m6989586621680800357 (t6989586621680800356 b6989586621680800359)) 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 a6989586621680800877 m6989586621680800357 b6989586621680800359 :: TyFun (a6989586621680800358 ~> m6989586621680800357 b6989586621680800359) (m6989586621680800357 (t6989586621680800356 b6989586621680800359)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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

Defined in Data.Singletons.Prelude.Traversable

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

type ForMSym2 (a6989586621680800877 :: t6989586621680800356 a6989586621680800358) (a6989586621680800878 :: (~>) a6989586621680800358 (m6989586621680800357 b6989586621680800359)) = ForM a6989586621680800877 a6989586621680800878 Source #

data MapAccumLSym0 :: forall a6989586621680800353 b6989586621680800354 c6989586621680800355 t6989586621680800352. (~>) ((~>) a6989586621680800353 ((~>) b6989586621680800354 (a6989586621680800353, c6989586621680800355))) ((~>) a6989586621680800353 ((~>) (t6989586621680800352 b6989586621680800354) (a6989586621680800353, t6989586621680800352 c6989586621680800355))) 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 (a6989586621680800353 ~> (b6989586621680800354 ~> (a6989586621680800353, c6989586621680800355))) (a6989586621680800353 ~> (t6989586621680800352 b6989586621680800354 ~> (a6989586621680800353, t6989586621680800352 c6989586621680800355))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumLSym0 :: TyFun (a6989586621680800353 ~> (b6989586621680800354 ~> (a6989586621680800353, c6989586621680800355))) (a6989586621680800353 ~> (t6989586621680800352 b6989586621680800354 ~> (a6989586621680800353, t6989586621680800352 c6989586621680800355))) -> Type) (a6989586621680800856 :: a6989586621680800353 ~> (b6989586621680800354 ~> (a6989586621680800353, c6989586621680800355))) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumLSym0 :: TyFun (a6989586621680800353 ~> (b6989586621680800354 ~> (a6989586621680800353, c6989586621680800355))) (a6989586621680800353 ~> (t6989586621680800352 b6989586621680800354 ~> (a6989586621680800353, t6989586621680800352 c6989586621680800355))) -> Type) (a6989586621680800856 :: a6989586621680800353 ~> (b6989586621680800354 ~> (a6989586621680800353, c6989586621680800355))) = MapAccumLSym1 a6989586621680800856 t6989586621680800352 :: TyFun a6989586621680800353 (t6989586621680800352 b6989586621680800354 ~> (a6989586621680800353, t6989586621680800352 c6989586621680800355)) -> Type

data MapAccumLSym1 (a6989586621680800856 :: (~>) a6989586621680800353 ((~>) b6989586621680800354 (a6989586621680800353, c6989586621680800355))) :: forall t6989586621680800352. (~>) a6989586621680800353 ((~>) (t6989586621680800352 b6989586621680800354) (a6989586621680800353, t6989586621680800352 c6989586621680800355)) 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 a6989586621680800856 t6989586621680800352 :: TyFun a6989586621680800353 (t6989586621680800352 b6989586621680800354 ~> (a6989586621680800353, t6989586621680800352 c6989586621680800355)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumLSym1 a6989586621680800856 t6989586621680800352 :: TyFun a6989586621680800353 (t6989586621680800352 b6989586621680800354 ~> (a6989586621680800353, t6989586621680800352 c6989586621680800355)) -> Type) (a6989586621680800857 :: a6989586621680800353) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumLSym1 a6989586621680800856 t6989586621680800352 :: TyFun a6989586621680800353 (t6989586621680800352 b6989586621680800354 ~> (a6989586621680800353, t6989586621680800352 c6989586621680800355)) -> Type) (a6989586621680800857 :: a6989586621680800353) = MapAccumLSym2 a6989586621680800856 a6989586621680800857 t6989586621680800352 :: TyFun (t6989586621680800352 b6989586621680800354) (a6989586621680800353, t6989586621680800352 c6989586621680800355) -> Type

data MapAccumLSym2 (a6989586621680800856 :: (~>) a6989586621680800353 ((~>) b6989586621680800354 (a6989586621680800353, c6989586621680800355))) (a6989586621680800857 :: a6989586621680800353) :: forall t6989586621680800352. (~>) (t6989586621680800352 b6989586621680800354) (a6989586621680800353, t6989586621680800352 c6989586621680800355) 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 a6989586621680800857 a6989586621680800856 t6989586621680800352 :: TyFun (t6989586621680800352 b6989586621680800354) (a6989586621680800353, t6989586621680800352 c6989586621680800355) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumLSym2 a6989586621680800857 a6989586621680800856 t :: TyFun (t b) (a, t c) -> Type) (a6989586621680800858 :: t b) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumLSym2 a6989586621680800857 a6989586621680800856 t :: TyFun (t b) (a, t c) -> Type) (a6989586621680800858 :: t b) = MapAccumL a6989586621680800857 a6989586621680800856 a6989586621680800858

type MapAccumLSym3 (a6989586621680800856 :: (~>) a6989586621680800353 ((~>) b6989586621680800354 (a6989586621680800353, c6989586621680800355))) (a6989586621680800857 :: a6989586621680800353) (a6989586621680800858 :: t6989586621680800352 b6989586621680800354) = MapAccumL a6989586621680800856 a6989586621680800857 a6989586621680800858 Source #

data MapAccumRSym0 :: forall a6989586621680800349 b6989586621680800350 c6989586621680800351 t6989586621680800348. (~>) ((~>) a6989586621680800349 ((~>) b6989586621680800350 (a6989586621680800349, c6989586621680800351))) ((~>) a6989586621680800349 ((~>) (t6989586621680800348 b6989586621680800350) (a6989586621680800349, t6989586621680800348 c6989586621680800351))) 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 (a6989586621680800349 ~> (b6989586621680800350 ~> (a6989586621680800349, c6989586621680800351))) (a6989586621680800349 ~> (t6989586621680800348 b6989586621680800350 ~> (a6989586621680800349, t6989586621680800348 c6989586621680800351))) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumRSym0 :: TyFun (a6989586621680800349 ~> (b6989586621680800350 ~> (a6989586621680800349, c6989586621680800351))) (a6989586621680800349 ~> (t6989586621680800348 b6989586621680800350 ~> (a6989586621680800349, t6989586621680800348 c6989586621680800351))) -> Type) (a6989586621680800839 :: a6989586621680800349 ~> (b6989586621680800350 ~> (a6989586621680800349, c6989586621680800351))) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumRSym0 :: TyFun (a6989586621680800349 ~> (b6989586621680800350 ~> (a6989586621680800349, c6989586621680800351))) (a6989586621680800349 ~> (t6989586621680800348 b6989586621680800350 ~> (a6989586621680800349, t6989586621680800348 c6989586621680800351))) -> Type) (a6989586621680800839 :: a6989586621680800349 ~> (b6989586621680800350 ~> (a6989586621680800349, c6989586621680800351))) = MapAccumRSym1 a6989586621680800839 t6989586621680800348 :: TyFun a6989586621680800349 (t6989586621680800348 b6989586621680800350 ~> (a6989586621680800349, t6989586621680800348 c6989586621680800351)) -> Type

data MapAccumRSym1 (a6989586621680800839 :: (~>) a6989586621680800349 ((~>) b6989586621680800350 (a6989586621680800349, c6989586621680800351))) :: forall t6989586621680800348. (~>) a6989586621680800349 ((~>) (t6989586621680800348 b6989586621680800350) (a6989586621680800349, t6989586621680800348 c6989586621680800351)) 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 a6989586621680800839 t6989586621680800348 :: TyFun a6989586621680800349 (t6989586621680800348 b6989586621680800350 ~> (a6989586621680800349, t6989586621680800348 c6989586621680800351)) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumRSym1 a6989586621680800839 t6989586621680800348 :: TyFun a6989586621680800349 (t6989586621680800348 b6989586621680800350 ~> (a6989586621680800349, t6989586621680800348 c6989586621680800351)) -> Type) (a6989586621680800840 :: a6989586621680800349) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumRSym1 a6989586621680800839 t6989586621680800348 :: TyFun a6989586621680800349 (t6989586621680800348 b6989586621680800350 ~> (a6989586621680800349, t6989586621680800348 c6989586621680800351)) -> Type) (a6989586621680800840 :: a6989586621680800349) = MapAccumRSym2 a6989586621680800839 a6989586621680800840 t6989586621680800348 :: TyFun (t6989586621680800348 b6989586621680800350) (a6989586621680800349, t6989586621680800348 c6989586621680800351) -> Type

data MapAccumRSym2 (a6989586621680800839 :: (~>) a6989586621680800349 ((~>) b6989586621680800350 (a6989586621680800349, c6989586621680800351))) (a6989586621680800840 :: a6989586621680800349) :: forall t6989586621680800348. (~>) (t6989586621680800348 b6989586621680800350) (a6989586621680800349, t6989586621680800348 c6989586621680800351) 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 a6989586621680800840 a6989586621680800839 t6989586621680800348 :: TyFun (t6989586621680800348 b6989586621680800350) (a6989586621680800349, t6989586621680800348 c6989586621680800351) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumRSym2 a6989586621680800840 a6989586621680800839 t :: TyFun (t b) (a, t c) -> Type) (a6989586621680800841 :: t b) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (MapAccumRSym2 a6989586621680800840 a6989586621680800839 t :: TyFun (t b) (a, t c) -> Type) (a6989586621680800841 :: t b) = MapAccumR a6989586621680800840 a6989586621680800839 a6989586621680800841

type MapAccumRSym3 (a6989586621680800839 :: (~>) a6989586621680800349 ((~>) b6989586621680800350 (a6989586621680800349, c6989586621680800351))) (a6989586621680800840 :: a6989586621680800349) (a6989586621680800841 :: t6989586621680800348 b6989586621680800350) = MapAccumR a6989586621680800839 a6989586621680800840 a6989586621680800841 Source #

data FmapDefaultSym0 :: forall a6989586621680800346 b6989586621680800347 t6989586621680800345. (~>) ((~>) a6989586621680800346 b6989586621680800347) ((~>) (t6989586621680800345 a6989586621680800346) (t6989586621680800345 b6989586621680800347)) 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 (a6989586621680800346 ~> b6989586621680800347) (t6989586621680800345 a6989586621680800346 ~> t6989586621680800345 b6989586621680800347) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (FmapDefaultSym0 :: TyFun (a6989586621680800346 ~> b6989586621680800347) (t6989586621680800345 a6989586621680800346 ~> t6989586621680800345 b6989586621680800347) -> Type) (a6989586621680800826 :: a6989586621680800346 ~> b6989586621680800347) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (FmapDefaultSym0 :: TyFun (a6989586621680800346 ~> b6989586621680800347) (t6989586621680800345 a6989586621680800346 ~> t6989586621680800345 b6989586621680800347) -> Type) (a6989586621680800826 :: a6989586621680800346 ~> b6989586621680800347) = FmapDefaultSym1 a6989586621680800826 t6989586621680800345 :: TyFun (t6989586621680800345 a6989586621680800346) (t6989586621680800345 b6989586621680800347) -> Type

data FmapDefaultSym1 (a6989586621680800826 :: (~>) a6989586621680800346 b6989586621680800347) :: forall t6989586621680800345. (~>) (t6989586621680800345 a6989586621680800346) (t6989586621680800345 b6989586621680800347) 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 a6989586621680800826 t6989586621680800345 :: TyFun (t6989586621680800345 a6989586621680800346) (t6989586621680800345 b6989586621680800347) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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

Defined in Data.Singletons.Prelude.Traversable

type Apply (FmapDefaultSym1 a6989586621680800826 t :: TyFun (t a) (t b) -> Type) (a6989586621680800827 :: t a) = FmapDefault a6989586621680800826 a6989586621680800827

type FmapDefaultSym2 (a6989586621680800826 :: (~>) a6989586621680800346 b6989586621680800347) (a6989586621680800827 :: t6989586621680800345 a6989586621680800346) = FmapDefault a6989586621680800826 a6989586621680800827 Source #

data FoldMapDefaultSym0 :: forall a6989586621680800344 m6989586621680800343 t6989586621680800342. (~>) ((~>) a6989586621680800344 m6989586621680800343) ((~>) (t6989586621680800342 a6989586621680800344) m6989586621680800343) 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 (a6989586621680800344 ~> m6989586621680800343) (t6989586621680800342 a6989586621680800344 ~> m6989586621680800343) -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (FoldMapDefaultSym0 :: TyFun (a6989586621680800344 ~> m6989586621680800343) (t6989586621680800342 a6989586621680800344 ~> m6989586621680800343) -> Type) (a6989586621680800805 :: a6989586621680800344 ~> m6989586621680800343) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

type Apply (FoldMapDefaultSym0 :: TyFun (a6989586621680800344 ~> m6989586621680800343) (t6989586621680800342 a6989586621680800344 ~> m6989586621680800343) -> Type) (a6989586621680800805 :: a6989586621680800344 ~> m6989586621680800343) = FoldMapDefaultSym1 a6989586621680800805 t6989586621680800342 :: TyFun (t6989586621680800342 a6989586621680800344) m6989586621680800343 -> Type

data FoldMapDefaultSym1 (a6989586621680800805 :: (~>) a6989586621680800344 m6989586621680800343) :: forall t6989586621680800342. (~>) (t6989586621680800342 a6989586621680800344) m6989586621680800343 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 a6989586621680800805 t6989586621680800342 :: TyFun (t6989586621680800342 a6989586621680800344) m6989586621680800343 -> Type) Source # 
Instance details

Defined in Data.Singletons.Prelude.Traversable

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

Defined in Data.Singletons.Prelude.Traversable

type Apply (FoldMapDefaultSym1 a6989586621680800805 t :: TyFun (t a) m -> Type) (a6989586621680800806 :: t a) = FoldMapDefault a6989586621680800805 a6989586621680800806

type FoldMapDefaultSym2 (a6989586621680800805 :: (~>) a6989586621680800344 m6989586621680800343) (a6989586621680800806 :: t6989586621680800342 a6989586621680800344) = FoldMapDefault a6989586621680800805 a6989586621680800806 Source #