Hoogle Search
Within LTS Haskell 24.66 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
module Control.Moffy.
NoThreadId No documentation available.
validateCollection :: forall (m :: Type -> Type) . MonadIO m => Collection -> Action m DocumentmongoDB Database.MongoDB.Admin Validate the given collection, scanning the data and indexes for correctness. This operation takes a while.
-
mongoDB Database.MongoDB.Connection Wraps network's PortNumber Used to ease compatibility between older and newer network versions.
module Database.MongoDB.
GridFS MongoDB GridFS implementation
upsertedId :: Upserted -> ObjectIdmongoDB Database.MongoDB.Query No documentation available.
-
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)
-
This module provides a HashMap variant which uses the value's Monoid instance to accumulate conflicting entries when merging Maps. While some functions mirroring those of HashMap are provided here for convenience, more specialized needs will likely want to use either the Newtype or Wrapped instances to manipulate the underlying Map.
-
monoidal-containers Data.HashMap.Monoidal A HashMap with monoidal accumulation
MonoidalHashMap :: HashMap k a -> MonoidalHashMap k amonoidal-containers Data.HashMap.Monoidal No documentation available.
getMonoidalHashMap :: MonoidalHashMap k a -> HashMap k amonoidal-containers Data.HashMap.Monoidal No documentation available.