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.1 required=5.0 tests=AC_FROM_MANY_DOTS,BAYES_00,
	INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,effb80d4bb7716dd
X-Google-Attributes: gid103376,public
From: Jeff Carter <spam.carter.not@spam.innocon.com>
Subject: Re: Wanted: Ada STL.  Reward: Ada's Future
Date: 1999/02/01
Message-ID: <36B5C5A0.4426B904@spam.innocon.com>#1/1
X-Deja-AN: 439384545
Content-Transfer-Encoding: 7bit
References: <790f4q$3l@bgtnsc01.worldnet.att.net>
Content-Type: text/plain; charset=us-ascii
Organization: Innovative Concepts, Inc.
Mime-Version: 1.0
Newsgroups: comp.lang.ada
Date: 1999-02-01T00:00:00+00:00
List-Id: <comp.lang.ada>

Alexy V Khrabrov wrote:
> ...
> Can you please share your thoughts on the status of an Ada STL?  (Let's code
> name it Ada STL for the purpose of discussion.)  Is there anything close for
> Ada 95?  What are YOU guys using for your Ada programming?  I can't believe
> each of you has a jar with homegrown sets, linked lists, and queues, all
> implemented differently!  OK, let's start small.  Can you please tell me
> with as more URLs as possible, what exactly you use when you need
> 
> 1.  Linked lists
> 2.  Trees
> 3.  Queues
> 4.  Sets
> ...

FWIW, I use the PragmAda Reusable Components. I don't use trees; I
prefer to use skip lists when I need a balanced structure.

-- 
Jeff Carter
E-mail: carter commercial-at innocon [period | full stop] com
"We call your door-opening request a silly thing."
Monty Python & the Holy Grail