Hoogle Search

Within LTS Haskell 24.35 (ghc-9.10.3)

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

package apecs-gloss

Simple gloss renderer for apecs Simple 2D gloss-based rendering for apecs. Intended for prototyping.
package apply-merge

Lift a binary, non-decreasing function onto ordered lists and order the output Please see the README on GitHub at https://github.com/pgujjula/apply-merge#readme
package approximate-equality

Newtype wrappers for approximate equality The purpose of this module is to provide newtype wrappers that allow one to effectively override the equality operator of a value so that it is approximate rather than exact. The wrappers use type annotations to specify the tolerance; the Digits type constructor has been provided for specifying the tolerance using type-level natural numbers. Instances for all of the classes in the numerical hierarchy have been provided for the wrappers, so the wrapped values can mostly be used in the same way as the original values. (In fact, most of the time one doesn't even have to wrap the starting values, since expressions such as (1+sqrt 2/3) are automatically wrapped thanks to the fromIntegral method of the Num typeclass.) See the documentation for Data.Eq.Approximate for more detailed information on how to use this package. New in version 1.1: Added explicit Show constraints to the Show instances, as the Num class in the newest version of GHC (wisely) no longer includes Show as a constraint.
package array-memoize

Memoization combinators using arrays for finite sub-domains of functions Memoization combinators are great for providing high-performance Haskell programs, but they can be even faster if memoization is performed on a finite, discrete domain since an array can then be used to store results. This package provides various combinators for doing just this, including also combinators for quanitzing and discretizing Float/Double-valued functions. Example:
```
fib' :: (Int -> Int) -> Int -> Int
fib' _ 0 = 1
fib' _ 1 = 1
fib' rec n = rec (n - 1) + rec (n - 2)
fib :: Int -> Int
fib = arrayMemoFix (0, 1000) fib'
```
package arrow-extras

Extra functions for Control.Arrow Extra functions for Control.Arrow
package async-extra

Useful concurrent combinators Various concurrent combinators
package async-pool

A modified version of async that supports worker groups and many-to-many task dependencies This library modifies the async package to allow for task pooling and many-to-many dependencies between tasks.
package atom-basic

Basic Atom feed construction atom-basic provides a relatively type-safe RFC4287 Atom feed that can be used to generate feed or entry XML using the types of any Haskell XML library. Please see the Web.Atom module documentation for more information.
package attoparsec-base64

Fetch only base64 characters, erroring in the attoparsec monad on failure Fetch only base64 characters, erroring in the attoparsec monad on failure
package autodocodec-openapi3

Autodocodec interpreters for openapi3 Autodocodec interpreters for openapi3

Page 275 of many | Previous | Next