Re: Using Red-Black Trees

["John B. Matthews" <nospam@nospam.invalid>]

In article <4CE0F407.6090101@gmail.com>,
 Stephane Carrez <Stephane.Carrez@gmail.com> wrote:

> > There's a Red-Black Tree in Ada.Containers?!  Can someone tell me 
> > where to find it in the ARM?
> 
> GNAT uses the Red-Black tree for the implementation of ordered maps 
> and sets.
> 
> You should use Ada.Containers.Ordered_Maps instead.  Instantiation is 
> similar to the Hashed_Maps but you should need to specify the 
> comparison operator "<".
> 
> See http://www.adaic.org/standards/05rm/html/RM-A-18-6.html
> (Likewise for the Indefinite_Ordered_* packages)

Here's a simple example that uses an instance of Ordered_Maps to examine 
collisions that would occur in an instance of Hashed_Maps:

<http://home.roadrunner.com/~jbmatthews/jumble.html#sec2>

-- 
John B. Matthews
trashgod at gmail dot com
<http://sites.google.com/site/drjohnbmatthews>