Hoogle Search
Within LTS Haskell 24.40 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
unSourceMap :: SourceMap -> Map SourcePos (Seq Text, Seq Text)commonmark Commonmark.SourceMap No documentation available.
unWithSourceMap :: WithSourceMap a -> State (Maybe Text, SourceMap) acommonmark Commonmark.SourceMap No documentation available.
getMap :: Config -> IO (HashMap Name Value)configurator Data.Configurator Fetch the HashMap that maps names to values.
foldMap :: (Contiguous arr, Element arr a, Monoid m) => (a -> m) -> arr a -> mcontiguous Data.Primitive.Contiguous Monoidal fold over the element of an array.
foldMap' :: (Contiguous arr, Element arr a, Monoid m) => (a -> m) -> arr a -> mcontiguous Data.Primitive.Contiguous Strict monoidal fold over the elements of an array.
foldlMap' :: (Contiguous arr, Element arr a, Monoid m) => (a -> m) -> arr a -> mcontiguous Data.Primitive.Contiguous Strict left monoidal fold over the elements of an array.
ifoldlMap' :: (Contiguous arr, Element arr a, Monoid m) => (Int -> a -> m) -> arr a -> mcontiguous Data.Primitive.Contiguous Strict monoidal fold over the elements of an array.
ifoldlMap1' :: (Contiguous arr, Element arr a, Semigroup m) => (Int -> a -> m) -> arr a -> mcontiguous Data.Primitive.Contiguous Strict monoidal fold over the elements of an array.
-
contiguous Data.Primitive.Contiguous Map over the elements of an array with the index.
-
contiguous Data.Primitive.Contiguous Map strictly over the elements of an array with the index. Note that because a new array must be created, the resulting array type can be different than the original.