Re: Questions concerning "Simple Components"

[Jeremiah <jeremiah.breeden@gmail.com>]

On Wednesday, November 4, 2015 at 4:09:56 AM UTC-5, Dmitry A. Kazakov wrote:
> > That said, I could be misunderstanding some of the terminology. 
> > Can anyone add some clarity to what exactly the Width parameter does?
> 
> Width is the number of pairs in the bucket. Depending on the tree
> (definite/indefinite) a bucket contains either the pairs as-is or
> references to the pairs allocated elsewhere. The persistent B-tree buckets
> have the size to fit into one block for optimal I/O.
That makes sense.  Thank you!

> > I really like the concept of Generic_External_B_Tree which use persistent
> > storage to save data.  One thing I am trying to get a better handle on is
> > a better way to handle the Root node address returned from
> > Get_Root_Address.  I need this value to create the tree in a later
> > application invocation.  I know I could just save it in another file or
> > possibly add a root address value to all my tree nodes, but both of those
> > methods seem wasteful.  What methods do yall use to store the root node
> > address?
> 
> The persistent memory pool the tree resides in has a root index reserved in
> particular for this purpose. The tree root address can be kept there. See:
> Get_Root_Index, Set_Root_Index.
> 
> http://www.dmitry-kazakov.de/ada/components.htm#Persistent.Memory_Pools.Set_Root_Index
> 
> There are 16 independent values you can store there. Note that the root
> address may change on tree update. After you have updated the tree before
> committing the pool, get the root address and store it into one of the root
> index values.

Gotcha.  Sorry that I missed that.  I appreciate the response!