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.
-
Extensible fake file system for testing. See https://gitlab.com/igrep/haskell-fakefs#readme.
-
Faktory Worker for Haskell Haskell client and worker process for the Faktory background job server.
Architecture overview
| +--------------------+ | | | | | Faktory | | | Server | | +---------->>>>| +>>>>--------+ | | | | | | | | | | | | +--------------------+ | | +-----------------+ +-------------------+ | | | | | | | Client | | Worker | | | pushes | | pulls | | | jobs | | jobs | | | | | | | | | | | | +-----------------+ +-------------------+
- Client - an API any process can use to push jobs to the Faktory server.
- Worker - a process that pulls jobs from Faktory and executes them.
- Server - the Faktory daemon which stores background jobs in queues to be processed by Workers.
-
Property-based testing with internal integrated shrinking This library provides property based testing with support for internal integrated shrinking: integrated in the sense of Hedgehog, meaning that there is no need to write a separate shrinker and generator; and internal in the sense of Hypothesis, meaning that this works well even across monadic bind. However, the actual techniques that power falsify are quite different from both of these two libraries. Most users will probably want to use the integration with tasty, and use Test.Tasty.Falsify as their main entrypoint into the library. The Test.Falsify.Interactive module can be used to experiment with the library in ghci.
-
Integer-to-digits conversion. Convert an integer to digits and back. This library is both asymptotically (O(n^1.4) vs. O(n^2)) and practically (2x-40x for typical inputs) faster than Data.Digits.
-
Non IEEE-754 compliant compile-time floating-point optimisations The Numeric.FastMath module brings into scope many unsafe RULES for Floats and Doubles that can greatly improve run time performance. It is roughly equivalent to gcc's -ffast-math compiler flag. Optimisation (at least -O1) must be enabled for any RULES to take effect. These rules are unsafe because they don't strictly adhere to the IEEE-754 regulations and may subtly change the results of your numeric computations. See the README on github for more details.
-
Family of families: featherweight defunctionalization Promote regular type families to first-class, without polluting the type namespace. See README.
-
Low-level interface to FFTW (Fast Fourier Transform) FFTW claims to be the fastest Fourier Transform in the West. This is a low-level interface to libfftw. We re-use the type classes from netlib-ffi. See also package fft.
-
Basic file IO operations via 'OsPath' Basic file IO operations like Prelude, but for OsPath.
-
A cache system associating values to files. A cache system, that works by associating computation results with file names. When the files are modified, the cache entries are discarded.
-
Library to process and search large files or a collection of files Library to process and search large files or a collection of files