Hoogle Search
Within LTS Haskell 24.4 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
Utilities for showing string-like things. Utilities for showing string-like things.
-
Optics construction using TemplateHaskell This package is part of the optics package family. It provides machinery to construct optics using TemplateHaskell. See the template-haskell-optics package for optics to work with template-haskell types.
-
Data structures for describing changes to other data structures. Data structures for describing changes to other data structures. In this library, a patch is something which can be applied, analogous to a function, and which distinguishes returning the argument it was provided from returning something else.
-
A regexp (regex) library on top of pcre-light you can actually use. A PCRE-based regular expressions library with support for multiple matches and replacements. Based on pcre-light. Takes and returns convertible strings everywhere. Includes a QuasiQuoter for regexps that does compile time checking.
-
Binding between SQL database values and haskell records. This package contains types to represent table constraints and interfaces to bind between SQL database values and Haskell records.
-
Backend for the persistent library using postgresql. Based on the postgresql-simple package
-
Provides a quasi-quoter for raw SQL for persistent Please see README and API docs at http://www.stackage.org/package/persistent.
-
Attoparsec and Pipes integration. Utilities to run Attoparsec parsers on Pipes input streams. See the changelog.md file in the source distribution to learn about any important changes between version.
-
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.
-
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.
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 addDefault-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.