Hoogle Search
Within LTS Haskell 24.35 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
Interface to C file/magic library This package provides a Haskell interface to the C libmagic library. With it, you can determine the type of a file by examining its contents rather than its name. The Haskell interface provides a full-featured binding.
-
Mailtrap API library. Mailtrap API library.
-
The basic classes for the manifolds hierarchy. The basic classes for the manifolds hierarchy.
-
Markov Chains for generating random sequences with a user definable behaviour. This library can be used to generate random sequences of anything with a behaviour that is adapted to some training data. Input a marketing text or a speech and recompose it to another arbitrary text of this sort. Input a dictionary of person names and create new names. Input a sequence of notes and get out a new melody. Input a set of Haskell modules and generate ... nice idea but the result will certainly have neither correct syntax nor types. I think, it's a good thing about Haskell, that you cannot fool it so easily. The idea is very simple: The algorithm analyses your input/training data with respect to how likely an a or e follows the letters r and e. Then on recomposition it chooses subsequent letters randomly according to the frequencies found in the training data. This library is well suited for bull-shit generators.
-
Parse and evaluate math expressions with variables and functions A simple tool to evaluate math expressions as strings with support for custom functions and operators
-
Math using lists, including FFT and Wavelet This package contains standard one-dimensional mathematical transforms (FFT, Wavelet, etc.) applied to Haskell lists. Documentation including mathematical details and examples are included to facilitate use with small or moderate sized problems, and for educational purposes. The algorithms have a very consise representation in Haskell that is a direct translation of the mathematical formulations. Some of the examples use the HakellR package and the hybrid Haskell/R environment that it provides. This permits use of R statistical and graphics tools in a Haskell "playgound" that requires minimal configuration. HaskellR's Jupyter kernel for Haskell is an added bonus. The functions of this package do not depend R or HaskellR.
-
Enumerate all maximal cliques of a graph. Enumerate all maximal cliques of a graph. A clique is a set of nodes such that there is an edge between every node and every other node in the set. A maximal clique is a clique such that no node may be added while preserving the clique property.
-
Mealy machines for processing time-series and ordered data. mealy reimagines statistics as a mealy machine processing data with some form of order such as time-series data. The Mealy, with the help of a decay function specifying the relative weights of recent values versus older value, can be treated as a compression or summary of the data stream into 'current state.' Mealies are highly polymorphic, situated at a busy crossroad of theory and practice, and lend themselves to ergonmic, compact and realistic representations of a wide range of online phenomena.
Usage
>>> import Mealy
>>> fold ((,) <$> ma 0.9 <*> std 0.9) [1..100] (91.00265621044142,9.472822805289121)
-
Indices for type level lists See README
-
True folds and getters for microlens This package provides Fold and Getter that are fully compatible with lens; the downside is that this package depends on contravariant, which in its turn depends on a lot of other packages (but still less than lens). The difference between Fold and SimpleFold is that you can use e.g. takingWhile/droppingWhile and backwards on the former but not on the latter. Most functions from lens that work with Fold would work with SimpleFold as well, though. Starting from GHC 8.6, this package doesn't depend on contravariant anymore. This package is a part of the microlens family; see the readme on Github.