rootKey
or, if none is found, construct a new empty root node
with minData*2 as the size of the maxData value to the
Node's constructors.(lower,upper].begin to end exclusive.begin to end exclusive.NodeStore.org.sdsai.dsds.NodeStore for the given key.Proxy.BTree.clear() and deletes the root node key.PagedList.clear() and then delete the
empty head node.NodeFunction.call(Node) on each.Operation.delete() has not been called on it.NodeStore.PagedListLocation.getIndex().BTreeLocation wrapped in an iterator.BTreeLocation wrapped in an iterator.BTree.rootKey used to create this tree.NodeStore that stores and returns streams of data.IONodeStore accesses Node data.NodeStore.NodeStore.NodeStore.BTreeLocation.hasNext() is true.NodeStore.Node objects arranged as a tree with no
back links.NodeStore
which is included in a TransactionalNodeStore.Node
but also includes some meta information about
where in the page of data represented by a Node in
PagedList.NodeStore.Map.entrySet() and BTree.put(K, V)s each elment.NodeStore and restructures
the BTree.TransactionalNodeStore.SubTx.buildTx(TransactionalNodeStore) returns.NodeStore.NodeStore.TransactionalNodeStores.