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.

  1. imapM_ :: (FoldableWithIndex i t, Monad m) => (i -> a -> m b) -> t a -> m ()

    diagrams-lib Diagrams.Prelude

    Run monadic actions for each target of an IndexedFold or IndexedTraversal with access to the index, discarding the results. When you don't need access to the index then mapMOf_ is more flexible in what it accepts. 

    mapM_ ≡ imapM . const

  2. imapOf :: AnIndexedSetter i s t a b -> (i -> a -> b) -> s -> t

    diagrams-lib Diagrams.Prelude

    Map with index. (Deprecated alias for iover). When you do not need access to the index, then mapOf is more liberal in what it can accept. 

    mapOf l ≡ imapOf l . const

    imapOf :: IndexedSetter i s t a b    -> (i -> a -> b) -> s -> t
imapOf :: IndexedLens i s t a b      -> (i -> a -> b) -> s -> t
imapOf :: IndexedTraversal i s t a b -> (i -> a -> b) -> s -> t

  3. imapped :: forall i (f :: Type -> Type) a b . FunctorWithIndex i f => IndexedSetter i (f a) (f b) a b

    diagrams-lib Diagrams.Prelude

    The IndexedSetter for a FunctorWithIndex. If you don't need access to the index, then mapped is more flexible in what it accepts.

  4. lmap :: Profunctor p => (a -> b) -> p b c -> p a c

    diagrams-lib Diagrams.Prelude

    Map the first argument contravariantly. 

    lmap f ≡ dimap f id

  5. lmapping :: forall (p :: Type -> Type -> Type) (q :: Type -> Type -> Type) s t a b x y . (Profunctor p, Profunctor q) => AnIso s t a b -> Iso (p a x) (q b y) (p s x) (q t y)

    diagrams-lib Diagrams.Prelude

    Lift an Iso contravariantly into the left argument of a Profunctor. 

    lmapping :: Profunctor p => Iso s t a b -> Iso (p a x) (p b y) (p s x) (p t y)
lmapping :: Profunctor p => Iso' s a -> Iso' (p a x) (p s x)

  6. rmap :: Profunctor p => (b -> c) -> p a b -> p a c

    diagrams-lib Diagrams.Prelude

    Map the second argument covariantly. 

    rmap ≡ dimap id

  7. rmapping :: forall (p :: Type -> Type -> Type) (q :: Type -> Type -> Type) s t a b x y . (Profunctor p, Profunctor q) => AnIso s t a b -> Iso (p x s) (q y t) (p x a) (q y b)

    diagrams-lib Diagrams.Prelude

    Lift an Iso covariantly into the right argument of a Profunctor. 

    rmapping :: Profunctor p => Iso s t a b -> Iso (p x s) (p y t) (p x a) (p y b)
rmapping :: Profunctor p => Iso' s a -> Iso' (p x s) (p x a)

  8. m33AffineMap :: Num n => M33 n -> V2 n -> AffineMap V3 V2 n

    diagrams-lib Diagrams.ThreeD.Projection

    Create an AffineMap from a 3x3 transformation matrix and a translation vector.

  9. m44AffineMap :: Num n => M44 n -> AffineMap V3 V2 n

    diagrams-lib Diagrams.ThreeD.Projection

    Create an AffineMap from a 4x4 homogeneous matrix, ignoring any perspective transforms.

  10. type ExtensionMap = Map MimeType [Extension]

    mime-types Network.Mime

    Maps mime types to extensions. The list of extensions is in alphabetical order.

Page 502 of many | Previous | Next