Data.BTree.Impure.Lookup

Algorithms related to looking up key-value pairs in an impure B+-tree.

Documentation

lookupRec :: forall m height key val. (AllocReaderM m, Key key, Value val) => key -> Height height -> NodeId height key val -> m (Maybe val)

lookupTree :: forall m key val. (AllocReaderM m, Key key, Value val) => key -> Tree key val -> m (Maybe val)

Lookup a value in an impure B+-tree.

lookupMinTree :: (AllocReaderM m, Key key, Value val) => Tree key val -> m (Maybe (key, val))

The minimal key of the map, returns Nothing if the map is empty.

lookupMaxTree :: (AllocReaderM m, Key key, Value val) => Tree key val -> m (Maybe (key, val))

The maximal key of the map, returns Nothing if the map is empty.