Hoogle Search
Within LTS Haskell 24.34 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
A collection of tools for processing PDF files. Low level tools for processing PDF files. Level of abstraction: cross reference, trailer, indirect object, object The API is based on random access input streams, and is designed to be memory efficient. We don't need to parse the entire PDF file and store it in memory when you need just one page or two. Usually it is also leads to time efficiency, but we don't try optimize performance by e.g. maintaining xref or object cache. Higher level layers should take care of it. The library is low level. It may mean that you need to be familiar with PDF file internals to actually use it.
-
Peano numbers Lazy unary natural numbers.
-
Run jobs on a limited number of threads and support data dependencies The motivation for this package was to run computations on multiple cores that need to write intermediate results to disk. The functions restrict the number of simultaneously running jobs to a user given number or to the number of capabilities the Haskell program was started with, i.e. the number after the RTS option -N. There are some flavors of this functionality:
- Control.Concurrent.PooledIO.Independent: run independent actions without results in parallel
- Control.Concurrent.PooledIO.Final: run independent actions with a final result in parallel
- Control.Concurrent.PooledIO.InOrder: run jobs in parallel with data dependencies like make -j n
- lazyio: interleave IO actions in a single thread
- async: start threads and wait for their results, forward exceptions, but do not throttle concurrency with respect to number of available cores
- parallel-tasks:
- parallel-io:
- threadPool:
- threads-pool:
- cio:
- Control-Engine:
- taskpool, async-pool:
-
type Possibly a = Either String a A surprisingly useful type synonym for Either in which the Left diagnostic is a String, i.e, type Possibly a = Either String a
-
Encoders and decoders for the PostgreSQL's binary format An API for dealing with PostgreSQL's binary data format. . It can be used to implement performant bindings to Postgres. E.g., hasql is based on this library. . It supports all Postgres versions starting from 8.3 and is tested against 8.3, 9.3 and 9.5 with the integer_datetimes setting off and on.
-
Haskell client library for http://prometheus.io. Haskell client library for http://prometheus.io.
-
Experimental abstractions for operations on pointers Collection of experimental abstractions over pointer operations.
-
Quasi-unique identifiers for QuickCheck Quasi-unique identifiers for QuickCheck. For the most up-to-date documentation, please view the following page: https://github.com/jonathanknowles/quickcheck-quid/blob/main/README.md
-
Random number generation Random number generation based on modeling random variables in two complementary ways: first, by the parameters of standard mathematical distributions and, second, by an abstract type (RVar) which can be composed and manipulated monadically and sampled in either monadic or "pure" styles. The primary purpose of this library is to support defining and sampling a wide variety of high quality random variables. Quality is prioritized over speed, but performance is an important goal too. In my testing, I have found it capable of speed comparable to other Haskell libraries, but still a fair bit slower than straight C implementations of the same algorithms.
-
Like Data.Dynamic/Data.Typeable but with support for rank-1 polymorphic types Data.Typeable and Data.Dynamic only support monomorphic types. In this package we provide similar functionality but with support for rank-1 polymorphic types.