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,ac39a12d5faf5b14 X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2002-04-20 06:38:49 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!skynet.be!skynet.be!newsfeed00.sul.t-online.de!newsfeed01.sul.t-online.de!t-online.de!unlisys!news.snafu.de!boavista!nobody From: Michael Erdmann Newsgroups: comp.lang.ada Subject: Re: Grace and Maps (was Re: Development process in the Ada community) Date: Sat, 20 Apr 2002 15:42:00 +0200 Organization: [Posted via] Inter.net Germany GmbH Message-ID: <3CC17028.2010207@snafu.de> References: <3CB46975.90408@snafu.de> <3CBAFFEE.2080708@snafu.de> <4519e058.0204171036.6f0a7394@posting.google.com> <3CBDD795.4060706@snafu.de> <4519e058.0204180800.44fac012@posting.google.com> <3CBF0341.8020406@mail.com> <4519e058.0204190529.559a47ae@posting.google.com> NNTP-Posting-Host: tc01-n71-231.de.inter.net Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit User-Agent: Mozilla/5.0 (X11; U; Linux i686; en-US; rv:0.9.8) Gecko/20020204 X-Accept-Language: en-us To: Marin David Condic Xref: archiver1.google.com comp.lang.ada:22814 Date: 2002-04-20T15:42:00+02:00 List-Id: Marin David Condic wrote: > "Ted Dennison" wrote in message > news:4519e058.0204190529.559a47ae@posting.google.com... > >>I've actually been thinking along similar lines. What I'm wondering is >>if we should keep the list package as "Lists.Unbounded", or if we >>should just bag the whole bounded/unbounded issue and make it "Lists". >> >> >> > O.K. Let's cash in our reality checks and see if they bounce. Would it be > fair to say that *most* Ada developers and applications are some flavor of > Windows/Unix with no realtime requirement beyond "Don't run so slow as to > annoy the user..."? If that's the case, then we're looking at virtual memory > machines that probably run very fast and hence, having fixed or bounded > lists doesn't seem like it would be very important. > > If we put out a Grace.Lists and a Grace.Maps, that would certainly be a > really good start. If at a later point in time there was some kind of > groundswell indicating that there really was a need for bounded versions, > why couldn't we go with Grace.Lists.Bounded as an extension? The only reason > I can think of is that it isn't consistent with Ada.Strings. > > An interesting observation: When I write most apps for a PC in Ada, I tend > to use the standard, fixed strings only at the points where Ada defined > functions require them. (Stuff like Text_IO) The rest of the time, I just go > to Unbounded because from a programming perspective, its just so much more > convenient. In most instances, whatever performance penalties might exist > for it are so far below the noise floor that they are invisible. Is this > experience unique to me or would most Ada programmers report similar > experience? If Ada were to totally abandon fixed and bounded strings (in the > sense that they were never there - not from any sort of compatibility > perspective), would you notice or care most of the time? (Presuming you > could get them via some add-on package of your own creation if you ever > really needed them?) I have to agree on your observation, convenience is very important. In earlier days there was a lot of disussion about the yield of high level languages compared with low level methods like assembler. The discusion was around the same issue, performance, realtime behaviour, memory usage etc.... So i agree, i would be a good start which is proably covering most of our requirements. Without trying it, we will never fail, which means we will continue discussing without learning anything by testing the aproach in real life development scenarios. Regards M.Erdmann