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.3 required=5.0 tests=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: John English Subject: Re: Wanted: Ada STL. Reward: Ada's Future Date: 1999/02/05 Message-ID: <36BAEEA5.A01CACEA@bton.ac.uk>#1/1 X-Deja-AN: 441041518 Content-Transfer-Encoding: 7bit References: <790f4q$3l@bgtnsc01.worldnet.att.net> <36B856E4.D921C1D@bton.ac.uk> X-Accept-Language: en Content-Type: text/plain; charset=us-ascii Organization: University of Brighton Mime-Version: 1.0 Newsgroups: comp.lang.ada Date: 1999-02-05T00:00:00+00:00 List-Id: Ehud Lamm wrote: > If I understood the original question on this thred - it was about SOME > libray LIKE the C++ STL for Ada. Supplying things like sets and lists. We > started by dicussing which of these featurees are really needed, but soon > slipped to discussing proting the STL. We somehow missed the obvious > question which is "Can we do something better or functionally equivalent, > but different - in Ada." Don't forget the algorithms that the STL provides. Data structures would be nice to have, but I don't want to have to (re)write algorithms to sort/search/count/permute/partition those data structures. > This, to my mind, show that STL won the day. It is strange, since it is > one of the more complex libraries I saw, and most C++ programmers are > either afraid of using it - or simply don't know how. True! ----------------------------------------------------------------- John English | mailto:je@brighton.ac.uk Senior Lecturer | http://www.it.bton.ac.uk/staff/je Dept. of Computing | ** NON-PROFIT CD FOR CS STUDENTS ** University of Brighton | -- see http://burks.bton.ac.uk -----------------------------------------------------------------