Hoogle Search
Within LTS Haskell 24.67 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
Short description Please see the README on GitHub at https://github.com/lehins/mempack#readme
-
Support for using mergeful from persistent-based databases Support for using mergeful from persistent-based databases
-
Support for using mergeless from persistent-based databases Support for using mergeless from persistent-based databases
-
An implementation of a Merkle tree and merkle tree proofs of inclusion An implementation of a Merkle tree and merkle tree proofs of inclusion
-
Generate high quality pseudorandom numbers using a SIMD Fast Mersenne Twister The Mersenne twister is a pseudorandom number generator developed by Makoto Matsumoto and Takuji Nishimura that is based on a matrix linear recurrence over a finite binary field. It provides for fast generation of very high quality pseudorandom numbers This library uses SFMT, the SIMD-oriented Fast Mersenne Twister, a variant of Mersenne Twister that is much faster than the original. It is designed to be fast when it runs on 128-bit SIMD. It can be compiled with either SSE2 and PowerPC AltiVec support, to take advantage of these instructions.
cabal install -fuse_sse2
On an x86 system, for performance win. By default the period of the function is 2^19937-1, however, you can compile in other defaults. Note that this algorithm on its own is not cryptographically secure. For more information about the algorithm and implementation, see the SFMT homepage, http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt.html and, Mutsuo Saito and Makoto Matsumoto, /SIMD-oriented Fast Mersenne Twister: a 128-bit Pseudorandom Number Generator/, in the Proceedings of MCQMC2006, here: http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/ARTICLES/sfmt.pdf -
High-performance application metric tracking A port of Coda Hale's excellent metrics library for the JVM https://github.com/codahale/metrics For motivation about why you might want to track application metrics, check Coda's talk: http://www.youtube.com/watch?v=czes-oa0yik Interesting portions of this package's documentation were also appropriated from the metrics library's documentation: http://metrics.codahale.com
-
Tiny QuickCheck test library with minimal dependencies A tiny (1 module, <500 lines) property-based (and unit) testing library with minimal dependencies. Instead of reinventing the wheel (https://xkcd.com/927), we use a RSpec/HSpec-like DSL and run tests with QuickCheck. For many use-cases, microspec is a drop-in replacement for hspec.
import Test.Microspec main :: IO () main = microspec $ do describe "replicate" $ do it "doubles with 2" $ replicate 2 'x' === "xx" it "creates a list of the right size" $ \(Positive n) -> length (replicate n 'x') === n describe "reverse" $ do it "reverse . reverse === id" $ \l -> reverse (reverse l) === (l :: [Int]) describe "tail" $ it "length is -1" $ \(NonEmpty l) -> length (tail l :: [Int]) === length l - 1 describe "solve the halting problem" $ pending
-
Send mime-mail messages via Amazon SES Hackage documentation generation is not reliable. For up to date documentation, please see: http://www.stackage.org/package/mime-mail-ses.
-
A Haskell bundle of the Minisat SAT solver A Haskell bundle of the Minisat SAT solver
-
High-level Haskell bindings for the MiniSat SAT solver. This package provides high-level Haskell bindings for the well-known MiniSat satisfiability solver. It solves the boolean satisfiability problem, i.e., the input is a boolean formula, and the output is a list of all satisfying assignments. MiniSat is a fully automated, well-optimized general-purpose SAT solver written by Niklas Een and Niklas Sorensson, and further modified by Takahisa Toda. Unlike other similar Haskell packages, we provide a convenient high-level interface to the SAT solver, hiding the complexity of the underlying C implementation. It can be easily integrated into other programs as an efficient turn-key solution to many search problems. To illustrate the use of the library, two example programs are included in the "examples" directory; one program solves Sudoku puzzles, and the other solves a 3-dimensional block packing problem. These programs can be built manually, or by invoking Cabal with the '--enable-benchmarks' option.