Safe Haskell	None
Language	Haskell2010

Data.Heap.Mutable.ModelD

Synopsis

data Heap s p = Heap {
- heapRaw :: !(RawHeap s p)
- heapCurrentSize :: !(MutVar s Int)
}
new :: (PrimMonad m, Monoid p) => Int -> m (Heap (PrimState m) p)
unsafePush :: (Ord p, Monoid p, PrimMonad m) => p -> Int -> Heap (PrimState m) p -> m ()
push :: (Ord p, Monoid p, PrimMonad m) => p -> Int -> Heap (PrimState m) p -> m ()
pushList :: (Ord p, PrimMonad m, Monoid p) => [(p, Int)] -> Heap (PrimState m) p -> m ()
popAll :: (Ord p, PrimMonad m) => Heap (PrimState m) p -> m [(p, Int)]
pop :: (PrimMonad m, Ord p) => Heap (PrimState m) p -> m (Maybe (p, Int))

Documentation

Constructors

Heap
Fields heapRaw :: !(RawHeap s p) heapCurrentSize :: !(MutVar s Int)

Arguments

Arguments

Does not check to see if the provided element is within the bounds accepted by the Heap.

Arguments