| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Data.BTree.Primitives.Leaf
Documentation
splitLeafManyPred :: Key key => (a -> Bool) -> (Map key val -> a) -> Map key val -> Maybe (Index key a) Source #
Split a leaf many times until the predicate is satisfied.
This function ensures that the for each returned leaf, the predicate is
satisfied, or returns Nothing when it can't be satisfied.
splitLeafMany :: Key key => Int -> (Map key val -> a) -> Map key val -> Index key a Source #
Split a leaf many times.
This function ensures that the for each returned leaf, the amount of items maxLeafItems (and= minLeafItems, except when the original leaf had less than minLeafItems items.