| Safe Haskell | Safe-Inferred |
|---|---|
| Language | GHC2021 |
KMerge.LoserTree
Synopsis
- data MutableLoserTree s a
- newLoserTree :: forall a m. (PrimMonad m, Ord a) => NonEmpty a -> m (MutableLoserTree (PrimState m) a, a)
- replace :: forall a m. (PrimMonad m, Ord a) => MutableLoserTree (PrimState m) a -> a -> m a
- remove :: forall a m. (PrimMonad m, Ord a) => MutableLoserTree (PrimState m) a -> m (Maybe a)
Documentation
data MutableLoserTree s a Source #
Mutable Loser Tree.
newLoserTree :: forall a m. (PrimMonad m, Ord a) => NonEmpty a -> m (MutableLoserTree (PrimState m) a, a) Source #
Create new MutableLoserTree.
The second half of a pair is the winner value (only losers are stored in the tree).