Hoogle Search
Within LTS Haskell 24.34 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
Common types for sampling. Common types for implementing Markov Chain Monte Carlo (MCMC) algorithms. An instance of an MCMC problem can be characterized by the following:
- A target distribution over some parameter space
- A parameter space for a Markov chain to wander over
- A transition operator to drive the Markov chain
-
Law-abiding lenses for Aeson, using microlens Law-abiding lenses for Aeson, using microlens.
-
A library that can be used for multiple Ord a => a -> b transformations. A library that can be used as a case ... of construction replacement for various cases. Since the 0.2.0.0 version also uses the cuckoo hashtables in the respective module. Since the 0.3.0.0 version the hashing functionality moved to the separate package mmsyn2-hashable.
-
Fast type-safe modular arithmetic Modular arithmetic, promoting moduli to the type level, with an emphasis on performance. Originally part of the arithmoi package.
-
Monadic Functional Reactive Programming Please see the README on GitHub at https://github.com/YoshikuniJujo/moffy#readme
-
A new, simple, composable concurrency abstraction. A monad m is said to allow scheduling if you can pass a number of actions m a to it, and those can be executed at the same time concurrently. You can observe the result of the actions after some time: Some actions will complete first, and the results of these are returned then as a list NonEmpty a. Other actions are still running, and for these you will receive continuations of type m a, which you can further run or schedule to completion as you like.
-
Driver (client) for MongoDB, a free, scalable, fast, document DBMS This package lets you connect to MongoDB servers and update/query their data. Please see the example in Database.MongoDB and the tutorial from the homepage. For information about MongoDB itself, see www.mongodb.org.
-
Containers with monoidal accumulation Containers with merging via monoidal accumulation. The Monoid instances provided by the containers and unordered-containers packages merge structures in a left-biased manner instead of using the underlying monoidal structure of the value. This package wraps the types provided by these packages, but provides Monoid instances implemented in terms of the value type's mappend. For instance, the Monoid Map instance looks like,
instance (Ord k, Semigroup a) => Monoid (MonoidalMap k a)
-
A multimap. This is a simple implementation of a multimap, based on Data.Map.
- v1.1 ! had its arguments flipped. Fixed. Also added fromMap.
- v1.2 Added Data.SetMap, renamed Multimap to Data.MultiMap. Fixed the type of delete. Derive instances for Data and Typeable.
- v1.2.1 Fixed typos in the documentation.
-
Abstactions and concrete implementations of mutable containers See docs and README at http://www.stackage.org/package/mutable-containers