Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. type (:><:) = Bin2D

   histogram-fill	Data.Histogram.Bin.Bin2D

   Type alias for Bin2D

2. (:#:) :: a -> b -> Fragment a b

   hledger-web	Hledger.Web.Import

   No documentation available.

3. pattern (:.) :: Stringy s => Char -> s -> s

   hpp	Hpp.StringSig

   No documentation available.

4. data a :*: b

   hw-prim	HaskellWorks.Data.Product

   No documentation available.

5. (:*:) :: a -> b -> (:*:) a b

   hw-prim	HaskellWorks.Data.Product

   No documentation available.

6. class (e :: Effect) :> (es :: [Effect])

   hyperbole	Web.Hyperbole

   A constraint that requires that a particular effect e is a member of the type-level list es. This is used to parameterize an Eff computation over an arbitrary list of effects, so long as e is somewhere in the list. For example, a computation that only needs access to a mutable value of type Integer would have the following type:

   State Integer :> es => Eff es ()
   

7. data a :+ b

   identicon	Graphics.Identicon

   The (:+) type operator is used to attach Consumers to Identicon, thus adding layers to it and exhausting the bytes that are available for identicon generation. An example of identicon that can be generated from 16 byte hash is shown below:

   type Icon = Identicon 16 :+ Consumer 5 :+ Consumer 5 :+ Consumer 6
   

   The identicon above has three layers.

8. (:+) :: a -> b -> (:+) a b

   identicon	Graphics.Identicon

   No documentation available.

9. (:<->:) :: a b c -> a c b -> Bijection (a :: Type -> Type -> Type) b c

   invertible	Control.Invertible.Monoidal

   No documentation available.

10. (:<->:) :: a b c -> a c b -> Bijection (a :: Type -> Type -> Type) b c

    invertible	Data.Invertible.Bijection

    No documentation available.

Page 55 of many | Previous | Next