Defines an interface for a type that represents an index into a memory-mapped complete balanced binary tree.
The operations that we define mostly help with finding parents or common ancestors in the tree structure.
This type is usually u32 or u64, and these operations are usually performed using bit-twiddling tricks. Coding against this API means that people reading ORAM code don’t necessarily have to understand all the bit-twiddling tricks.
Iterator type over the sequence of parents of a TreeIndex
Trait representing a type that can represent a tree index in a balanced binary tree, using the numbering where the root is 1, and nodes are labelled consecutively level by level, using lexicographic order within a level.