Hoogle Search
Within LTS Haskell 24.27 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
ghc-lib-parser Language.Haskell.Syntax.Type No documentation available.
mapEither :: (Ord b, Ord c) => (a -> Either b c) -> MaxQueue a -> (MaxQueue b, MaxQueue c)pqueue Data.PQueue.Max Maps a function over the elements of the queue, and separates the Left and Right values.
mapMaybe :: Ord b => (a -> Maybe b) -> MaxQueue a -> MaxQueue bpqueue Data.PQueue.Max Maps a function over the elements of the queue, and collects the Just values.
mapU :: (a -> b) -> MaxQueue a -> MaxQueue bpqueue Data.PQueue.Max Assumes that the function it is given is monotonic, and applies this function to every element of the priority queue. Does not check the precondition.
mapEither :: (Ord b, Ord c) => (a -> Either b c) -> MinQueue a -> (MinQueue b, MinQueue c)pqueue Data.PQueue.Min mapMaybe :: Ord b => (a -> Maybe b) -> MinQueue a -> MinQueue bpqueue Data.PQueue.Min Map elements and collect the Just results.
mapU :: (a -> b) -> MinQueue a -> MinQueue bpqueue Data.PQueue.Min Assumes that the function it is given is (weakly) monotonic, and applies this function to every element of the priority queue, as in fmap. If the function is not monotonic, the result is undefined.
mapEither :: Ord k => (a -> Either b c) -> MaxPQueue k a -> (MaxPQueue k b, MaxPQueue k c)pqueue Data.PQueue.Prio.Max -
pqueue Data.PQueue.Prio.Max mapKeys :: Ord k' => (k -> k') -> MaxPQueue k a -> MaxPQueue k' apqueue Data.PQueue.Prio.Max Map a function over all values in the queue.