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. mkAffineMap :: (v n -> u n) -> u n -> AffineMap v u n

    diagrams-lib Diagrams.LinearMap

    Make an affine map from a linear function and a translation.

  2. toAffineMap :: forall (v :: Type -> Type) n . Transformation v n -> AffineMap v v n

    diagrams-lib Diagrams.LinearMap

    No documentation available.

  3. vmap :: LinearMappable a b => (Vn a -> Vn b) -> a -> b

    diagrams-lib Diagrams.LinearMap

    Apply a linear map to an object. If the map is not linear, behaviour will likely be wrong.

  4. data SubMap b (v :: Type -> Type) n m

    diagrams-lib Diagrams.Names

    A SubMap is a map associating names to subdiagrams. There can be multiple associations for any given name.

  5. bimap :: Bifunctor p => (a -> b) -> (c -> d) -> p a c -> p b d

    diagrams-lib Diagrams.Prelude

    Map over both arguments at the same time. 

    bimap f g ≡ first f . second g

    Examples

    >>> bimap toUpper (+1) ('j', 3)
('J',4)

    >>> bimap toUpper (+1) (Left 'j')
Left 'J'

    >>> bimap toUpper (+1) (Right 3)
Right 4

  6. bimapping :: forall (f :: Type -> Type -> Type) (g :: Type -> Type -> Type) s t a b s' t' a' b' . (Bifunctor f, Bifunctor g) => AnIso s t a b -> AnIso s' t' a' b' -> Iso (f s s') (g t t') (f a a') (g b b')

    diagrams-lib Diagrams.Prelude

    Lift two Isos into both arguments of a Bifunctor. 

    bimapping :: Bifunctor p => Iso s t a b -> Iso s' t' a' b' -> Iso (p s s') (p t t') (p a a') (p b b')
bimapping :: Bifunctor p => Iso' s a -> Iso' s' a' -> Iso' (p s s') (p a a')

  7. concatMapOf :: Getting [r] s a -> (a -> [r]) -> s -> [r]

    diagrams-lib Diagrams.Prelude

    Map a function over all the targets of a Fold of a container and concatenate the resulting lists. 

    >>> concatMapOf both (\x -> [x, x + 1]) (1,3)
[1,2,3,4]

    concatMap ≡ concatMapOf folded

    concatMapOf :: Getter s a     -> (a -> [r]) -> s -> [r]
concatMapOf :: Fold s a       -> (a -> [r]) -> s -> [r]
concatMapOf :: Lens' s a      -> (a -> [r]) -> s -> [r]
concatMapOf :: Iso' s a       -> (a -> [r]) -> s -> [r]
concatMapOf :: Traversal' s a -> (a -> [r]) -> s -> [r]

  8. contramap :: Contravariant f => (a' -> a) -> f a -> f a'

    diagrams-lib Diagrams.Prelude

    No documentation available.

  9. contramapped :: forall (f :: Type -> Type) b a . Contravariant f => Setter (f b) (f a) a b

    diagrams-lib Diagrams.Prelude

    This Setter can be used to map over all of the inputs to a Contravariant. 

    contramap ≡ over contramapped

    >>> getPredicate (over contramapped (*2) (Predicate even)) 5
True

    >>> getOp (over contramapped (*5) (Op show)) 100
"500"

    >>> Prelude.map ($ 1) $ over (mapped . _Unwrapping' Op . contramapped) (*12) [(*2),(+1),(^3)]
[24,13,1728]

  10. contramapping :: forall (f :: Type -> Type) s t a b . Contravariant f => AnIso s t a b -> Iso (f a) (f b) (f s) (f t)

    diagrams-lib Diagrams.Prelude

    Lift an Iso into a Contravariant functor. 

    contramapping :: Contravariant f => Iso s t a b -> Iso (f a) (f b) (f s) (f t)
contramapping :: Contravariant f => Iso' s a -> Iso' (f a) (f s)

Page 499 of many | Previous | Next