map -package:containers -package:aeson -package:case-insensitive -package:charset -package:dense-linear-algebra -package:basement -package:imports -is:exact -package:amazonka-core -package:invertible -package:pipes -package:incipit-base package:psqueues
O(n) Modify every value in the queue.
O(n) Modify every value in the queue.
O(n) Modify every value in the queue.
O(n) Maps a function over the values and priorities of the
queue. The function f must be monotonic with respect to the
priorities. I.e. if x < y, then fst (f k x v) < fst
(f k y v). The precondition is not checked. If f
is not monotonic, then the result will be invalid.
O(n) Maps a function over the values and priorities of the
queue. The function f must be monotonic with respect to the
priorities. I.e. if x < y, then fst (f k x v) < fst
(f k y v). The precondition is not checked. If f
is not monotonic, then the result will be invalid.
O(n) Maps a function over the values and priorities of the
queue. The function f must be monotonic with respect to the
priorities. I.e. if x < y, then fst (f k x v) < fst
(f k y v). The precondition is not checked. If f
is not monotonic, then the result will be invalid.