Hoogle Search
Within LTS Haskell 24.46 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
conduit-concurrent-map Data.Conduit.ConcurrentMap concurrentMapM_ with the number of threads set to getNumCapabilities. Useful when f is CPU-bound. If f is IO-bound, you probably want to use concurrentMapM_ with explicitly given amount of threads instead.
hashMapDoc :: HashMap Name Value -> Docconfigurator-export Data.Configurator.Export Convert a HashMap of keys and Values into a Doc, from the pretty package. This allows more fine-grained control over printing it. Expects keys to be in the format exported from a Config using getMap. "foo.bar.baz.x" is "x" in group "baz" in group "bar" in group "foo", etc.
hashMapDoc' :: ConfStyle -> HashMap Name Value -> Docconfigurator-export Data.Configurator.Export Convert a HashMap of keys and Values into a Doc, from the pretty package. This allows more fine-grained control over printing it. Takes a ConfStyle with the rendering style. Expects keys to be in the format exported from a Config using getMap. "foo.bar.baz.x" is "x" in group "baz" in group "bar" in group "foo", etc.
renderHashMap :: HashMap Name Value -> Stringconfigurator-export Data.Configurator.Export Render/pretty print the contents of a HashMap of keys and Values to a String.
renderHashMap' :: ConfStyle -> HashMap Name Value -> Stringconfigurator-export Data.Configurator.Export Render/pretty print the contents of a HashMap of keys and Values to a String, providing a ConfStyle with the rendering style.
class
InputMappableParsing (m :: Type -> Type -> Type)construct Construct.Classes A subclass of InputParsing for parsers that can switch the input stream type
contramap :: Contravariant f => (a' -> a) -> f a -> f a'contra-tracer Control.Tracer No documentation available.
contramapM :: Monad m => (a -> m b) -> Tracer m b -> Tracer m acontra-tracer Control.Tracer A contravariant transformation of a tracer using a Kleisli arrow.
fmap :: Functor f => (a -> b) -> f a -> f bcontrol-monad-free Control.Monad.Free fmap is used to apply a function of type (a -> b) to a value of type f a, where f is a functor, to produce a value of type f b. Note that for any type constructor with more than one parameter (e.g., Either), only the last type parameter can be modified with fmap (e.g., b in `Either a b`). Some type constructors with two parameters or more have a Bifunctor instance that allows both the last and the penultimate parameters to be mapped over.
Examples
Convert from a Maybe Int to a Maybe String using show:>>> fmap show Nothing Nothing >>> fmap show (Just 3) Just "3"
Convert from an Either Int Int to an Either Int String using show:>>> fmap show (Left 17) Left 17 >>> fmap show (Right 17) Right "17"
Double each element of a list:>>> fmap (*2) [1,2,3] [2,4,6]
Apply even to the second element of a pair:>>> fmap even (2,2) (2,True)
It may seem surprising that the function is only applied to the last element of the tuple compared to the list example above which applies it to every element in the list. To understand, remember that tuples are type constructors with multiple type parameters: a tuple of 3 elements (a,b,c) can also be written (,,) a b c and its Functor instance is defined for Functor ((,,) a b) (i.e., only the third parameter is free to be mapped over with fmap). It explains why fmap can be used with tuples containing values of different types as in the following example:>>> fmap even ("hello", 1.0, 4) ("hello",1.0,True)type
OrderedMapRow a = OMap a acsv-conduit Data.CSV.Conduit An OrderedMapRow is a dictionary based on Ordered where column names are keys and row's individual cell values are the values of the OMap. Unlike MapRow, OrderedMapRow preserves the insertion ordering of columns. OrderedMapRow is a reasonable default in most cases.