| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Data.BTree.Impure.Internal.Delete
Description
Algorithms related to deletion from an impure B+-tree.
- nodeNeedsMerge :: Node height key val -> Bool
- mergeNodes :: (AllocM m, Key key, Value val) => Height height -> Node height key val -> key -> Node height key val -> m (Index key (Node height key val))
- deleteRec :: forall height key val m. (AllocM m, Key key, Value val) => key -> Height height -> NodeId height key val -> m (Node height key val)
- delete :: (AllocM m, Key key, Value val) => key -> Tree key val -> m (Tree key val)
Documentation
nodeNeedsMerge :: Node height key val -> Bool Source #
Check whether a node needs to be merged.
mergeNodes :: (AllocM m, Key key, Value val) => Height height -> Node height key val -> key -> Node height key val -> m (Index key (Node height key val)) Source #
Merge two nodes.