Hoogle Search
Within LTS Haskell 24.36 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
Library to provide the behaviour similar to quantum states superposition. Has three modules with similar functionality. The functions provide the somewhat generalized way to round the numbers based on some data.
package
quickcheck-arbitrary-adt Generic typeclasses for generating arbitrary ADTs Improve arbitrary value generation for ADTs
-
Testing group class instances with QuickCheck QuickCheck support for testing instances of type classes defined in the groups library.
package
quickcheck-higherorder QuickCheck extension for higher-order properties Enhancements for property-based testing of higher-order properties.
- Associate types to their representations with the Constructible class.
- Testable' class, variant of Testable with an improved instance for (->).
- Representation of higher-order functions (via test-fun).
- Testable equality TestEq.
- Explicit testable type of Equation.
package
quickcheck-monoid-subclasses Testing monoid subclass instances with QuickCheck QuickCheck support for testing instances of type classes defined in the monoid-subclasses library.
-
QuickLZ compression for ByteStrings This package provides a high level binding to the QuickLZ compression library for ByteStrings, under the GPLv2 license. QuickLZ is fast and compresses very well. Check out the home page: http://quicklz.com This package includes the QuickLZ 1.5.0 source code, at compression level 1 and streaming mode disabled. The versioning scheme for this package is unusual. QuickLZ tries to be as fast as possible, and will break backwards compatibility to achieve it in newer versions. This versioning scheme reflects the QuickLZ versioning scheme: the first three digits of version w.x.y.z are the quicklz version, with the z component (and any further needed ones) being updates to this package, not quicklz itself.
-
Generic deriving of Read/Show with no record labels. Please see the README on GitHub at https://github.com/jacobstanley/quiet#readme
-
Divide without division Generate routines for integer division, employing arithmetic and bitwise operations only, which are 2.5x-3.5x faster than quot. Divisors must be known in compile-time and be positive.
-
Notify Honeybadger about exceptions. Ratel notifies Honeybadger about exceptions.
-
Binding for the rdtsc machine instruction This module provides the function rdtsc for accessing the rdtsc machine register on modern IA-32 processors. This is a 64-bit counter which counts the number of processor cycles since the machine has been powered up. Using this instruction, you can make very precise time measurements which are independent of the actual CPU frequency. But note that you can get strange results sometimes on a superscalar processor. Also note that the Haskell foreign function interface imposes some additional overheads. On my machine, it takes about 950 cycles to call this function twice and to compute the difference, whereas in C the overhead is only about 88 cycles.