Hoogle Search

Within LTS Haskell 24.10 (ghc-9.10.2)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

package polyparse

A variety of alternative parser combinator libraries. This version, 1.13 is a Non-Maintainer Upload (NMU). Report issues to the Hackage Trustees issue tracker. A variety of alternative parser combinator libraries, including the original HuttonMeijer set. The Poly sets have features like good error reporting, arbitrary token type, running state, lazy parsing, and so on. Finally, Text.Parse is a proposed replacement for the standard Read class, for better deserialisation of Haskell values from Strings.
package prelude-compat

Provide Prelude and Data.List with fixed content across GHC versions This package allows you to write warning-free code that compiles with versions of base before and after AMP and FTP, that is, base before and beginning with 4.8, respectively, and GHC before and beginning with 7.10, respectively. It serves three purposes:
- Prevent you from name clashes of FTP-Prelude with locally defined functions having names like <*>, join, foldMap.
- Prevent you from redundant import warnings if you manually import Data.Monoid or Control.Applicative.
- Fix list functions to the list type, contrarily to the aim of the FTP. This way you are saved from length (2,1) == 1 and maximum (2,1) == 1, until you import Data.Foldable.
You should add
```
import Prelude2010
import Prelude ()
```
to your modules. This way, you must change all affected modules. If you want to avoid this you may try the prelude2010 package or if you already import Prelude explicitly, you may try to add
```
Default-Extensions: CPP, NoImplicitPrelude
CPP-Options: -DPrelude=Prelude2010
```
to your Cabal file. In my opinion, this is the wrong way round. The presented Prelude2010 module should have been the one for GHC-7.10 and the Prelude with added and generalized list functions should have been an additional PreludeFTP, preferably exported by a separate package like all other alternate Prelude projects. But the purpose of the FTP was to save some import statements at the expense of blowing up the Foldable class and prevent simple ways to write code that works with GHC version before and starting with GHC-7.10 and that does not provoke warnings. Related packages:
- 'base-compat': The opposite approach - Make future function definitions available in older GHC versions.
- haskell2010: Defines the Prelude for Haskell 2010. Unfortunately, haskell2010 is not available anymore since GHC-7.10, because of the AMP.
- 'numeric-prelude': It is intended to provide a refined numeric class hierarchy but it also provides a non-numeric subset of the Prelude that is more stable than the one of base.
package quickcheck-assertions

HUnit like assertions for QuickCheck Library with convenient assertions for QuickCheck properties like in HUnit
package quickcheck-io

Use HUnit assertions as QuickCheck properties This package provides an orphan instance that allows you to use HUnit assertions as QuickCheck properties.
package quickcheck-unicode

Generator and shrink functions for testing Unicode-related software. Generator and shrink functions for testing Unicode-related software.
package random-bytestring

Efficient generation of random bytestrings This package is deprecated. Please, use genByteString from the random package (version >=1.2) instead. Efficient generation of random bytestrings. The implementation populates uninitialized memory with uniformily distributed random 64 bit words (and 8 bit words for remaining bytes at the end of the bytestring). Random words are generated using the PRNG from the mwc-random package or the pcg-random package. It is also possible to use a custom PRNG by providing an instance for the RandomWords type class and using the function generate from the module Data.ByteString.Random.Internal. The generated byte strings are suitable for statistical applications. They are not suitable for cryptographic applications.
package rebase

A more progressive alternative to the "base" package This package is intended for those who are tired of keeping long lists of dependencies to the same essential libraries in each package as well as the endless imports of the same APIs all over again. It also supports the modern tendencies in the language. . To solve those problems this package does the following: . * Reexport the original APIs under the "Rebase" namespace. . * Export all the possible non-conflicting symbols from the "Rebase.Prelude" module. . * Give priority to the modern practices in the conflicting cases. . The policy behind the package is only to reexport the non-ambiguous and non-controversial APIs, which the community has obviously settled on. The package is intended to rapidly evolve with the contribution from the community, with the missing features being added with pull-requests. . If you don't need the "Rebase" namespace and want to import modules from the reexported packages as they are check out the "rerebase" package which simply reexports the original symbols in the original namespace. Thus it simply lets you depend on all the de-facto default packages, by yourself having to maintain only the dependency on "rerebase". Also it comes packed with a prelude as rich as here.
package ref-tf

A type class for monads with references using type families. Contains a MonadRef type class that abstracts over the details of manipulating references, allowing one to write code that can operate in either the ST monad or the IO monad.
package rhine

Functional Reactive Programming with type-level clocks Rhine is a library for synchronous and asynchronous Functional Reactive Programming (FRP). It separates the aspects of clocking, scheduling and resampling from each other, and ensures clock-safety on the type level. Signal processing units can be annotated by clocks, which hold the information when data will be input, processed and output. Different components of the signal network will become active at different times, or work at different rates. To schedule the components and allow them to communicate, several standard scheduling and resampling solutions are implemented. Own schedules and resampling buffers can be implemented in a reusable fashion. A (synchronous) program outputting "Hello World!" every tenth of a second looks like this: flow $ constMCl (putStrLn "Hello World!") @@ (waitClock :: Millisecond 100)
package scanner

Fast non-backtracking incremental combinator parsing for bytestrings Parser combinator library designed to be fast. It doesn't support backtracking.

Page 70 of many | Previous | Next