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.
mapState :: ((a, s) -> (b, s)) -> State s a -> State s brev-state Control.Monad.RevState No documentation available.
mapStateT :: (m (a, s) -> n (b, s)) -> StateT s m a -> StateT s n brev-state Control.Monad.RevState No documentation available.
mapState :: ((a, s) -> (b, s)) -> State s a -> State s brev-state Control.Monad.Trans.RevState No documentation available.
mapStateT :: (m (a, s) -> n (b, s)) -> StateT s m a -> StateT s n brev-state Control.Monad.Trans.RevState No documentation available.
mappings :: RichEnv -> Mappingsrichenv RichEnv Mappings from one existing environment variable name to another.
mappingsToValues :: Environment -> Mappings -> Valuesrichenv RichEnv.Setters Takes an environment variable list and all the name mappings and prepares a set of environment variables according to the RichEnv rules.
>>> mappingsToValues [("FOO", "bar"), ("SOME", "thing")] (Mappings $ HM.fromList [("OTHER", "FOO")]) Values {unValues = fromList [("OTHER","bar")]}mappings :: RichEnv -> Mappingsrichenv RichEnv.Types Mappings from one existing environment variable name to another.
mapIter :: MonadIO m => (Iterator -> m a) -> Iterator -> m [a]rocksdb-haskell Database.RocksDB.Iterator Map a function over an iterator, advancing the iterator forward and returning the value. The iterator should be put in the right position prior to calling the function. Note that this function accumulates the result strictly, ie. it reads all values into memory until the iterator is exhausted. This is most likely not what you want for large ranges. You may consider using conduits instead, for an example see: https://gist.github.com/adc8ec348f03483446a5
-
rope-utf16-splay Data.SplayTree No documentation available.
mapWithPos :: (Measured v a, Measured w b) => (v -> a -> b) -> SplayTree v a -> SplayTree w brope-utf16-splay Data.SplayTree No documentation available.