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.1 required=5.0 tests=BAYES_00,
	PP_MIME_FAKE_ASCII_TEXT autolearn=no autolearn_force=no version=3.4.4
X-Google-Thread: 103376,8e7ac81a215f128c
X-Google-NewGroupId: yes
X-Google-Attributes: gida07f3367d7,domainid0,public,usenet
X-Google-Language: ENGLISH,ASCII
Path: 
 g2news2.google.com!news1.google.com!goblin3!goblin.stu.neva.ru!exi-transit.telstra.net!news.telstra.net!exi-spool.telstra.net!exi-reader.telstra.net!not-for-mail
From: "robin" <robin51@dodo.com.au>
Newsgroups: comp.lang.ada
References: <2419e829-6f45-4075-9005-b9876beb8aaa@r6g2000vbf.googlegroups.com>
Subject: Re: Using Red-Black Trees
Date: Sun, 14 Nov 2010 10:51:27 +1100
X-Newsreader: Microsoft Outlook Express 4.72.3110.5
X-MimeOLE: Produced By Microsoft MimeOLE V4.72.3110.3
Message-ID: <4cdf2426$0$44860$c30e37c6@exi-reader.telstra.net>
NNTP-Posting-Host: 123.3.26.198
X-Trace: 1289692199 exi-reader.telstra.net 44860 123.3.26.198:1044
Xref: g2news2.google.com comp.lang.ada:16453
Date: 2010-11-14T10:51:27+11:00
List-Id: <comp.lang.ada>

Bj�rn wrote in message <2419e829-6f45-4075-9005-b9876beb8aaa@r6g2000vbf.googlegroups.com>...
>I need a self-balancing binary search tree (for a Bentley/Ottmann
>implementation), such as the red-black tree that is now part of
>Ada.Containers. I need basic operations like insert/remove, next/prev
>and find. However, the GNAT implementation of this data structure
>seems a bit scary to me and I'm not really sure how to instantiate the
>generics and what operations to use. Would someone be able to provide
>some example of usage? And yes, I'am aware of that a lot of the other
>container implementations uses this structure. I was hoping for
>something a bit more boiled down.


For algorithms for Red-Black trees (inclding insert/delete/etc), see
"Introduction to PL/I, Algorithms, and Structured Programming".