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=ham
	autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,8eff44ec1bcf8433
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2001-10-22 10:11:05 PST
Path: 
 archiver1.google.com!news1.google.com!newsfeed.stanford.edu!logbridge.uoregon.edu!news.huji.ac.il!not-for-mail
From: "Ehud Lamm" <mslamm@mscc.huji.ac.il>
Newsgroups: comp.lang.ada
Subject: Re: Container reqs
Date: Mon, 22 Oct 2001 19:02:28 +0200
Organization: The Hebrew University of Jerusalem
Message-ID: <9r1jlr$5of$1@news.huji.ac.il>
References: <9qctpn$lil$1@news.huji.ac.il>
 <3nCy7.29644$ev2.35903@www.newsranger.com> <9qfgla$7sb$3@news.huji.ac.il>
 <x7v4royhk79.fsf@smaug.pushface.org> <9qnflg$pm$1@news.huji.ac.il>
 <3BCF57C8.DE99D9C@boeing.com> <un12nod47.fsf@gsfc.nasa.gov>
 <9qpf0c$5ko$1@news.huji.ac.il> <uadyk5045.fsf@gsfc.nasa.gov>
NNTP-Posting-Host: di4-55.dialin.huji.ac.il
X-Trace: news.huji.ac.il 1003770364 5903 132.64.14.55 (22 Oct 2001 17:06:04
 GMT)
X-Complaints-To: abuse@news.huji.ac.il
NNTP-Posting-Date: Mon, 22 Oct 2001 17:06:04 +0000 (UTC)
X-Priority: 3
X-MSMail-Priority: Normal
X-Newsreader: Microsoft Outlook Express 5.00.2014.211
X-MIMEOLE: Produced By Microsoft MimeOLE V5.00.2014.211
Xref: archiver1.google.com comp.lang.ada:15034
Date: 2001-10-22T19:02:28+02:00
List-Id: <comp.lang.ada>

Stephen Leake <stephen.a.leake.1@gsfc.nasa.gov> wrote in message
news:uadyk5045.fsf@gsfc.nasa.gov...
> Perhaps you could volunteer to define the "typical most important
> cases", and I'll write example code for them, for my library. If it
> seems reasonable, I'll also try to write a "simple wrapper" package.
> Then someone else can try to do the same with each of the other
> candidate libraries. That should be a good learning exercise. It might
> also make it easier for potential users to compare the libraries:
>

I don't have the time right now to make sure something really is "typical",
or "most important", but I'll describe one the things I needed for one of my
recent examples.

1) Vector (unbounded, indexed collection) or strings (possibly Unbounded)
2) Array of Hash tables, keys into the hash are strings (we can assume,
fixed size), and the values are Sets of integers (in fact, indexes into the
vector, in (1))

(in (2), it was also an option to change "Array of.." to "hash of...")

Notice that the hash tables must be an ADT, since we need many. Most simple
packages implement hash ADOs.

I didn't need iterators. I did need to be able to update the sets, after
they are inserted to the hash tables, though it is possible to extract a
set, update it, and insert it back into the hash.

Ehud