Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. cmapIf :: forall w (m :: Type -> Type) cp cx cy . (Get w m cx, Get w m cp, Members w m cx, Set w m cy) => (cp -> Bool) -> (cx -> cy) -> SystemT w m ()

   apecs	Apecs.System

   Conditional cmap, that first tests whether the argument satisfies some property. The entity needs to have both a cx and cp component.

2. cmapM :: forall w (m :: Type -> Type) cx cy . (Get w m cx, Set w m cy, Members w m cx) => (cx -> SystemT w m cy) -> SystemT w m ()

   apecs	Apecs.System

   Monadically iterates over all entites with a cx, and writes their cy.

3. cmapM_ :: forall w (m :: Type -> Type) c . (Get w m c, Members w m c) => (c -> SystemT w m ()) -> SystemT w m ()

   apecs	Apecs.System

   Monadically iterates over all entites with a cx

4. makeMapComponents :: [Name] -> Q [Dec]

   apecs	Apecs.TH

   Creates Component instances with Map stores

5. makeMapComponentsFor :: Name -> [Name] -> Q [Dec]

   apecs	Apecs.TH

   No documentation available.

6. DMap :: HashMap Text DefaultValue -> DefaultValue

   avro	Data.Avro.Schema.Schema

   Dynamically enforced monomorphic type

7. btmap1 :: (FunctorB (b f), FunctorT b) => (forall (a :: k) . () => f a -> g a) -> b f f -> b g g

   barbies	Barbies.Bi

   A version of btmap specialized to a single argument.

8. gbmapDefault :: CanDeriveFunctorB b f g => (forall (a :: k) . () => f a -> g a) -> b f -> b g

   barbies	Barbies.Internal

   Default implementation of bmap based on Generic.

9. gmap :: forall (x :: k1) . GFunctor n f g repbf repbg => Proxy n -> (forall (a :: k) . () => f a -> g a) -> repbf x -> repbg x

   barbies	Barbies.Internal

   No documentation available.

10. bfoldMap :: (TraversableB b, Monoid m) => (forall (a :: k) . () => f a -> m) -> b f -> m

    barbies	Data.Functor.Barbie

    Map each element to a monoid, and combine the results.

Page 977 of many | Previous | Next