- delete
Delete the value from an entry associated with the given key. If the value If
the value is present,
- get
Find a value in the tree, given its key. If the key is not found, it will throw
a KeyNotFoundExcepti
- hasKey
Checks if the given key exists.
- insert
Insert an entry in the B-tree. We will replace the value if the provided key
already exists in the B
- browse
Creates a cursor starting at the beginning of the tree, for a given revision
- browseFrom
Creates a cursor starting on the given key
- browseKeys
Creates a cursor starting at the beginning of the tree
- getValueSerializer
- isAllowDuplicates
- setKeySerializer
- setValueSerializer
- close
Close the B-tree, cleaning up all the data structure