Safe Haskell | None |
---|---|
Language | Haskell2010 |
Algorithms related to looking up key-value pairs in an impure B+-tree.
Synopsis
- lookupRec :: forall m height key val. (AllocReaderM m, Key key, Value val) => key -> Height height -> NodeId height key val -> m (Maybe val)
- lookup :: forall m key val. (AllocReaderM m, Key key, Value val) => key -> Tree key val -> m (Maybe val)
- lookupMin :: (AllocReaderM m, Key key, Value val) => Tree key val -> m (Maybe (key, val))
- lookupMax :: (AllocReaderM m, Key key, Value val) => Tree key val -> m (Maybe (key, val))
Documentation
lookupRec :: forall m height key val. (AllocReaderM m, Key key, Value val) => key -> Height height -> NodeId height key val -> m (Maybe val) Source #
lookup :: forall m key val. (AllocReaderM m, Key key, Value val) => key -> Tree key val -> m (Maybe val) Source #
Lookup a value in an impure B+-tree.