From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00
	autolearn=unavailable autolearn_force=no version=3.4.4
Path: 
 eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!news.eternal-september.org!mx02.eternal-september.org!feeder.eternal-september.org!news.swapon.de!fu-berlin.de!uni-berlin.de!individual.net!not-for-mail
From: Niklas Holsti <niklas.holsti@tidorum.invalid>
Newsgroups: comp.lang.ada
Subject: Re: Questions concerning "Simple Components"
Date: Wed, 4 Nov 2015 10:33:41 +0200
Organization: Tidorum Ltd
Message-ID: <d9tu72F86b7U1@mid.individual.net>
References: <59c99dce-9cc6-4aba-9c5e-a5dd22ef7fea@googlegroups.com>
Mime-Version: 1.0
Content-Type: text/plain; charset=windows-1252; format=flowed
Content-Transfer-Encoding: 7bit
X-Trace: individual.net XTpAHhgLNsjFDPHwXiYB7wF0Ks2YtUh0qiVXG49NmH1SDC/a2O
Cancel-Lock: sha1:qYaTrd6GV92NOaFKdcRD0OI3KRU=
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.8; rv:38.0)
 Gecko/20100101 Thunderbird/38.3.0
In-Reply-To: <59c99dce-9cc6-4aba-9c5e-a5dd22ef7fea@googlegroups.com>
Xref: news.eternal-september.org comp.lang.ada:28207
Date: 2015-11-04T10:33:41+02:00
List-Id: <comp.lang.ada>

On 15-11-04 04:16 , Jeremiah wrote:
> I really like a lot of the items found in the Simple Components
> library, but had a few questions on their usage.  Specifically:
>
> Generic_B_Trees have a generic package parameter "Width" which has
> the following description from the website: "Width is the size of the
> bucket of key-value pairs allocated per tree node;"
>
> This doesn't make a lot of sense to me.  I'm sure I am just missing
> something simple, but what is the "bucket" being referenced?  Is it
> terminology for how many key value pairs can be created before more
> memory has to be allocated?  The "per tree node" part also throws me
> off a little bit because on a binary tree, I would expect only one
> key/value pair per node.

B-trees are _not_ generally binary trees; the branching factor is 
typically much larger than 2. See https://en.wikipedia.org/wiki/B-tree.

I'm not familiar with the Simple Components, but the description of 
"Width"  sounds as if it sets the maximum number of key-and-value pairs 
that can be stored in one leaf node of the B-tree. The internal nodes 
also have multiple keys per node, but the corresponding values are 
pointers to child nodes, so perhaps there is a different parameter to 
set the number of key-and-pointer pairs in internal nodes.

Hopefully Dmitry will follow with a better explanation...

-- 
Niklas Holsti
Tidorum Ltd
niklas holsti tidorum fi
       .      @       .