Safe Haskell	None
Language	Haskell2010

Data.PrioHeap.Lens

Contents

Orphan instances

Synopsis

prioHeapOf :: IndexedGetting k (PrioHeap k a) s a -> s -> PrioHeap k a

Documentation

prioHeapOf :: IndexedGetting k (PrioHeap k a) s a -> s -> PrioHeap k a Source #

Construct a PrioHeap from a IndexedGetter, IndexedFold, IndexedTraversal or IndexedLens.

Orphan instances

FunctorWithIndex k (PrioHeap k) Source #
Instance details Methods imap :: (k -> a -> b) -> PrioHeap k a -> PrioHeap k b # imapped :: IndexedSetter k (PrioHeap k a) (PrioHeap k b) a b #
FoldableWithIndex k (PrioHeap k) Source #
Instance details Methods ifoldMap :: Monoid m => (k -> a -> m) -> PrioHeap k a -> m # ifolded :: IndexedFold k (PrioHeap k a) a # ifoldr :: (k -> a -> b -> b) -> b -> PrioHeap k a -> b # ifoldl :: (k -> b -> a -> b) -> b -> PrioHeap k a -> b # ifoldr' :: (k -> a -> b -> b) -> b -> PrioHeap k a -> b # ifoldl' :: (k -> b -> a -> b) -> b -> PrioHeap k a -> b #
TraversableWithIndex k (PrioHeap k) Source #
Instance details Methods itraverse :: Applicative f => (k -> a -> f b) -> PrioHeap k a -> f (PrioHeap k b) # itraversed :: IndexedTraversal k (PrioHeap k a) (PrioHeap k b) a b #
Ord k => TraverseMin k (PrioHeap k) Source #
Instance details Methods traverseMin :: IndexedTraversal' k (PrioHeap k v) v #
Ord k => TraverseMax k (PrioHeap (Down k)) Source #
Instance details Methods traverseMax :: IndexedTraversal' k (PrioHeap (Down k) v) v #
Ord k => Wrapped (PrioHeap k a) Source #
Instance details Associated Types type Unwrapped (PrioHeap k a) :: Type # Methods _Wrapped' :: Iso' (PrioHeap k a) (Unwrapped (PrioHeap k a)) #
AsEmpty (PrioHeap k a) Source #
Instance details Methods _Empty :: Prism' (PrioHeap k a) () #
(t ~ PrioHeap k' a', Ord k) => Rewrapped (PrioHeap k a) t Source #	Use `wrapping fromList`. Unwrapping returns some permutation of the list.
Instance details
c ~ d => Each (PrioHeap c a) (PrioHeap d b) a b Source #
Instance details Methods each :: Traversal (PrioHeap c a) (PrioHeap d b) a b #