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=-0.3 required=5.0 tests=BAYES_00,
	REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4
X-Google-Thread: a07f3367d7,8e7ac81a215f128c
X-Google-Attributes: gida07f3367d7,public,usenet
X-Google-NewGroupId: yes
X-Google-Language: ENGLISH,ASCII
Path: 
 g2news1.google.com!news3.google.com!feeder.news-service.com!xlned.com!feeder7.xlned.com!news2.euro.net!newsfeed.freenet.ag!news.netcologne.de!ramfeed1.netcologne.de!newsfeed.arcor.de!newsspool3.arcor-online.net!news.arcor.de.POSTED!not-for-mail
From: "Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>
Subject: Re: Using Red-Black Trees
Newsgroups: comp.lang.ada
User-Agent: 40tude_Dialog/2.0.15.1
MIME-Version: 1.0
Content-Type: text/plain; charset="iso-8859-1"
Content-Transfer-Encoding: 8bit
Reply-To: mailbox@dmitry-kazakov.de
Organization: cbb software GmbH
References: <2419e829-6f45-4075-9005-b9876beb8aaa@r6g2000vbf.googlegroups.com>
 <ibn1i4$h1k$1@tornado.tornevall.net>
 <d0a5feac-74a7-470e-b6f2-b12031386b1f@k3g2000vbp.googlegroups.com>
Date: Sun, 14 Nov 2010 09:37:55 +0100
Message-ID: <7p813js2z0ey.19c1newmd99jo$.dlg@40tude.net>
NNTP-Posting-Date: 14 Nov 2010 09:37:55 CET
NNTP-Posting-Host: ac7df783.newsspool1.arcor-online.net
X-Trace: 
 DXC=AMO7O1hXX;eJ00P1S40fZgic==]BZ:afn4Fo<]lROoRa<`=YMgDjhgbXeEk@>I_9Lh[6LHn;2LCVn[<mhadbfdUkEbLSCI5g5Mc>7VGemO?6Vd
X-Complaints-To: usenet-abuse@arcor.de
Xref: g2news1.google.com comp.lang.ada:15486
Date: 2010-11-14T09:37:55+01:00
List-Id: <comp.lang.ada>

On Sun, 14 Nov 2010 00:20:06 -0800 (PST), Bj�rn wrote:

>> Are you sure you need a tree? Skip lists serve the same function, are just as
>> fast as balanced trees for searching, and faster than the typical tree
>> implementations for insert and delete.
> 
> I am not as familiar with skip lists as with trees. Although I would
> expect both of them to work as they seem to have similar properties
> and performance. 

Hmm, if you are not familiar with them, how do you know if you need some?
Why not a map, a kd-tree, a suffix-tree and so on?

> When the rest of my implementation is finished I hope
> to make a little comparison of which one that performs best for my
> application.

I would not care. I mean that in most cases performance does not play very
sufficient role (OK, assuming that we don't make stupid mistakes like
O(n**2) sorting of a 10**9 list). Cleaner design is usually more important.

-- 
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de