An implementation of B trees. The core operations on B trees
(lookup, iterate, put and del) are generic in the actual
implementation of nodes, via the BTreePage and
BTreeMutPage. This allows for a simpler code for the
high-level functions, as well as specialised, high-performance
implementations for the nodes.
The trait, implemented by Txn and MutTxn, for treating the
4064 bytes after the header of root pages as pointers to B trees
(well, actually Option of pointers to databases, where None is
encoded by 0).
Types that can be stored on disk. This trait may be used in
conjunction with Sized in order to determine the on-disk size,
or with UnsizedStorable when special arrangements are needed.