Hoogle Search
Within LTS Haskell 24.28 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
List monad transformer and class A List monad transformer and a List class. With standard list operations for Lists
-
Instances of numeric classes for functions and tuples Instances of numeric classes for functions and tuples. Import Data.NumInstances to get all the instances. If you want only function or only tuple instances, import Data.NumInstances.Function or Data.NumInstances.Tuple.
-
Explicitly handled object names This tiny package contains the class ObjectName, which corresponds to the general notion of explicitly handled identifiers for API objects, e.g. a texture object name in OpenGL or a buffer object name in OpenAL.
-
A binding to the OpenAL cross-platform 3D audio API A Haskell binding for the OpenAL cross-platform 3D audio API, appropriate for use with gaming applications and many other types of audio applications. On Windows, this package works well with the "OpenAL Soft" binary distribution from http://kcat.strangesoft.net/openal.html. Type 'cabal install --extra-lib-dirs=<DIR>' where <DIR> is the directory where libOpenAL32.dll.a is located (must be an absolute path). Then rename soft_oal.dll to OpenAL32.dll and put it somewhere in the PATH. I found that c:\Windows\ worked. This package has also been tested on GNU/Linux and iOS.
-
Priority Search Queue A priority search queue efficiently supports the operations of both a search tree and a priority queue. A Binding is a product of a key and a priority. Bindings can be inserted, deleted, modified and queried in logarithmic time, and the binding with the least priority can be retrieved in constant time. A queue can be built from a list of bindings, sorted by keys, in linear time.
-
Implementation of RSA, using the padding schemes of PKCS#1 v2.1. This library implements the RSA encryption and signature algorithms for arbitrarily-sized ByteStrings. While the implementations work, they are not necessarily the fastest ones on the planet. Particularly key generation. The algorithms included are based of RFC 3447, or the Public-Key Cryptography Standard for RSA, version 2.1 (a.k.a, PKCS#1 v2.1).
-
A library for manipulating infinite lists. This package implements functions, analogous to those from Data.List, to create and manipulate infinite lists: data Stream a = Cons a (Stream a). It provides alternative definitions for those Prelude functions that make sense for such streams. Note that this package has (almost) nothing to do with the work on Stream Fusion by Duncan Coutts, Roman Leshchinskiy, and Don Stewart.
-
Painless 3D graphics, no affiliation with gloss This package began as a fork of Greg Horn's not-gloss package. The dependencies have been changed so that it builds with recent ghc versions.
-
Type classes generalizing the functionality of the 'monad-par' library. The Par monad offers a parallel programming API based on dataflow programming. To use the Par monad, install the monad-par package, which includes this package as a dependency. This package is an abstract interface only. It provides a number of type clasess, but not an implementation. The type classes separate different levels of Par functionality. See the Control.Monad.Par.Class module for more details.
-
Sequence optimized for monoidal construction and folding Data structure intended for accumulating a sequence of elements for later traversal or folding. Useful for implementing all kinds of builders on top. . The benchmarks show that for the described use-case it is on average 2 times faster than DList and Seq, is on par with list when you always prepend elements and is exponentially faster than list when you append.