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-16 11:49:16 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!news-spur1.maxwell.syr.edu!news.maxwell.syr.edu!hammer.uoregon.edu!skates!not-for-mail From: Stephen Leake Newsgroups: comp.lang.ada Subject: Re: Container reqs Date: 16 Oct 2001 14:47:42 -0400 Organization: NASA Goddard Space Flight Center Message-ID: References: <9qctpn$lil$1@news.huji.ac.il> <9qevpn$8k$1@nh.pace.co.uk> NNTP-Posting-Host: anarres.gsfc.nasa.gov Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii X-Trace: skates.gsfc.nasa.gov 1003258173 4249 128.183.220.71 (16 Oct 2001 18:49:33 GMT) X-Complaints-To: dscoggin@cne-odin.gsfc.nasa.gov NNTP-Posting-Date: 16 Oct 2001 18:49:33 GMT User-Agent: Gnus/5.0808 (Gnus v5.8.8) Emacs/20.7 Xref: archiver1.google.com comp.lang.ada:14725 Date: 2001-10-16T18:49:33+00:00 List-Id: "Marin David Condic" writes: > What would be wrong with starting with a simple set of data structures that > got 90% of the work done and then expanding the requirements as experience > demands? > > For example: Why not produce a set of packages that supports a) a > homogeneous bi-directional list and b) a homogeneous map? I'll concede to > the need for a static & dynamic version of each. That would be what gets > called in the technical papers "A Good Start"(tm). I agree. My set of components does not currently provide a "homogenous map". At least, I don't think it does - I'm not sure you define that the same way I do. So, how about you download my components, add a homogeneous map, and then somebody else can add what they want. I know, someone will chime in with "Why start with Stephe's instead of the Booch Components?". Well, that is exactly the question we need to be discussing now. Several people have put together what they consider "A Good Start". The question is, is there enough consensus for any one of these to convince the rest of us to jump on board, and integrate our stuff into it (instead of the other way around). > It probably should have a handful of sorting & searching algorithms > for arrays as well. (Anything else you want to sort & search on a > regular basis?) > > My feeling is that if the scope were kept to something simple and functional > for a large majority of uses, it is more likely to get implemented and used. > Packages with more options, more parameters, different behaviors, > heterogeneous content, sufficient OO-ness, less used structures, etc. can > all be added later. Perhaps you could vote on the several that are out there, indicating which one most closely fits _your_ needs. Then everyone else could do the same. Some data would be useful here. -- -- Stephe