haskey-btree-0.2.0.0: B+-tree implementation in Haskell.

Safe HaskellNone
LanguageHaskell2010

Data.BTree.Impure.Delete

Description

Algorithms related to deletion from an impure B+-tree.

Synopsis

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.

deleteRec :: forall height key val m. (AllocM m, Key key, Value val) => key -> Height height -> NodeId height key val -> m (Node height key val) Source #

deleteTree :: (AllocM m, Key key, Value val) => key -> Tree key val -> m (Tree key val) Source #

Delete a node from the tree.