Hoogle Search

Within LTS Haskell 24.66 (ghc-9.10.3)

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

Exact lookup

1. insertInforming :: Ord key => key -> val -> LRU key val -> (LRU key val, Maybe (key, val))

   lrucache	Data.Cache.LRU.Internal

   Same as insert, but also returns element which was dropped from cache, if any.

2. msBlankBeforeBlockquote :: MarkdownSettings -> Bool

   markdown	Text.Markdown

   If True, a blank line is required before the start of a blockquote. Standard markdown syntax does not require a blank line before a blockquote, but it is all too easy for a > to end up at the beginning of a line by accident. Default: True Since 0.1.5

3. ListIndexOutOfOrder :: Word -> Word -> MMarkErr

   mmark	Text.MMark

   The index in an ordered list is out of order, first number is the actual index we ran into, the second number is the expected index

4. parFor :: forall (iv :: Type -> Type) p . ParFuture iv p => InclusiveRange -> (Int -> p ()) -> p ()

   monad-par-extras	Control.Monad.Par.Combinator

   Parallel for-loop over an inclusive range. Semantically equivalent to

   parFor (InclusiveRange n m) f = forM_ [n..m] f
   

   except that the implementation will split the work into an unspecified number of subtasks in an attempt to gain parallelism. The exact number of subtasks is chosen at runtime, and is probably a small multiple of the available number of processors. Strictly speaking the semantics of parFor depends on the number of processors, and its behaviour is therefore not deterministic. However, a good rule of thumb is to not have any interdependencies between the elements; if this rule is followed then parFor has deterministic semantics. One easy way to follow this rule is to only use put or put_ in f, never get.

5. class MonadParallel m => MonadFork (m :: Type -> Type)

   monad-parallel	Control.Monad.Parallel

   Class of monads that can fork a parallel computation.

6. package natural-transformation

   A natural transformation package. A natural transformation transforms a container f a into another container g a. Natural transformations act as functor morphisms in category theory. The naming of ~>, :~> and $$ were taken, with permission, from Edward Kmett's indexed package.

7. class Transformation (f :: k -> Type) (g :: k -> Type) t | t -> f g

   natural-transformation	Control.Natural

   A (natural) transformation is inside t, and contains f and g (typically Functors). The order of arguments allows the use of GeneralizedNewtypeDeriving to wrap a :~>, but maintain the Transformation constraint. Thus, # can be used on abstract data types.

8. package netlib-comfort-array

   Helper modules for comfort-array wrappers to BLAS and LAPACK Netlib is a collection of packages for efficient numeric linear algebra. Most prominent parts of Netlib are BLAS and LAPACK. These packages contain functions for matrix computations, solution of simultaneous linear equations and eigenvalue problems. This package provides definitions shared by the packages blas-comfort-array and lapack-comfort-array.

9. holdFor :: forall t s e (m :: Type -> Type) a . (HasTime t s, Monoid e) => t -> Wire s e m (Event a) a

   netwire	Control.Wire.Interval

   Hold each event occurrence for the given time period. Inhibits when no event occurred for the given amount of time. New occurrences override old occurrences, even when they are still held.

   • Depends: now.
   • Inhibits: when no event occurred for the given amount of time.

10. WalkForEachType :: WalkingOrder

    pandoc-lua-marshal	Text.Pandoc.Lua.Marshal.Filter

    Process each type separately, traversing the tree bottom-up (leaves to root) for each type.

Page 1494 of many | Previous | Next