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. SubMap :: Map Name [Subdiagram b v n m] -> SubMap b (v :: Type -> Type) n m

   diagrams-core	Diagrams.Core

   No documentation available.

2. subMap :: forall (v :: Type -> Type) m n b . (Metric v, Semigroup m, OrderedField n) => Lens' (QDiagram b v n m) (SubMap b v n m)

   diagrams-core	Diagrams.Core

   Lens onto the SubMap of a QDiagram (i.e. an association from names to subdiagrams).

3. type HasLinearMap (v :: Type -> Type) = (HasBasis v, Traversable v)

   diagrams-core	Diagrams.Core.Transform

   HasLinearMap is a constraint synonym, just to help shorten some of the ridiculously long constraint sets.

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

   diagrams-core	Diagrams.Core.Types

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

5. SubMap :: Map Name [Subdiagram b v n m] -> SubMap b (v :: Type -> Type) n m

   diagrams-core	Diagrams.Core.Types

   No documentation available.

6. subMap :: forall (v :: Type -> Type) m n b . (Metric v, Semigroup m, OrderedField n) => Lens' (QDiagram b v n m) (SubMap b v n m)

   diagrams-core	Diagrams.Core.Types

   Lens onto the SubMap of a QDiagram (i.e. an association from names to subdiagrams).

7. module Control.Distributed.Process.Internal.BiMultiMap

   This is an implementation of bidirectional multimaps.

8. data BiMultiMap a b v

   distributed-process	Control.Distributed.Process.Internal.BiMultiMap

   A bidirectional multimaps BiMultiMap a b v is a set of triplets of type (a, b, v). It is possible to lookup values by using either a or b as keys.

9. data Bimap (c :: a -> Exp a') (d :: b -> Exp b') (e :: f a b) (g :: f a' b')

   first-class-families	Fcf

   Type-level bimap.

   Example

   >>> data Example where Ex :: a -> Example  -- Hide the type of examples to avoid brittleness in different GHC versions
   
   >>> :kind! Ex (Eval (Bimap ((+) 1) (Flip (-) 1) '(2, 4)) :: (Natural, Natural))
   Ex (Eval (Bimap ((+) 1) (Flip (-) 1) '(2, 4)) :: (Natural, Natural)) :: Example
   = Ex '(3, 3)
   

10. data ConcatMap (c :: a -> Exp [b]) (d :: t a) (e :: [b])

    first-class-families	Fcf

    Map a function and concatenate the results. This is FoldMap specialized to the list monoid.

Page 518 of many | Previous | Next