Hoogle Search
Within LTS Haskell 24.38 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
mapMonotonic :: Ord b => (a -> b) -> Heap a -> Heap bheaps Data.Heap O(n). Map a monotone increasing function over the heap. Provides a better constant factor for performance than map, but no checking is performed that the function provided is monotone increasing. Misuse of this function can cause a Heap to violate the heap property.
>>> mapMonotonic (+1) (fromList [1,2,3]) fromList [2,3,4] >>> mapMonotonic (*2) (fromList [1,2,3]) fromList [2,4,6]
map' :: Map' f ss => (forall (s :: k) . () => t s -> t' (f s)) -> PL t ss -> PL t' (S' f ss)hetero-parameter-list Data.HeteroParList No documentation available.
-
hetero-parameter-list Data.HeteroParList No documentation available.
mapAnnotation :: (a -> b) -> Node a tag text -> Node b tag texthexpat Text.XML.Expat.Annotated Modify this node's annotation and all its children recursively if it's an element, otherwise no-op.
mapAnnotation :: (a -> b) -> Node a tag text -> Node b tag texthexpat Text.XML.Expat.Extended Modify this node's annotation and all its children recursively if it's an element, otherwise no-op.
mapDocumentAnnotation :: (a -> b) -> Document a tag text -> Document b tag texthexpat Text.XML.Expat.Extended Modify the annotation of every node in the document recursively.
mapAllTags :: NodeClass n c => (tag -> tag') -> n c tag text -> n c tag' texthexpat Text.XML.Expat.Internal.NodeClass Map all tags (both tag names and attribute names) recursively.
-
hexpat Text.XML.Expat.Internal.NodeClass Change a node recursively from one container type to another, with a specified function to convert the container type.
-
hexpat Text.XML.Expat.Internal.NodeClass Change a list of nodes recursively from one container type to another, with a specified function to convert the container type.
mapDBT :: (DBState n -> DBState m) -> (m (a, DBState m) -> n (b, DBState n)) -> DBT m a -> DBT n bhpqtypes Database.PostgreSQL.PQTypes Transform the underlying monad.