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,f24b55bcdf15c088 X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2001-03-06 10:20:11 PST Newsgroups: comp.lang.ada Path: supernews.google.com!sn-xit-03!supernews.com!nntp.cs.ubc.ca!news-spur1.maxwell.syr.edu!news.maxwell.syr.edu!news-was.dfn.de!nntp-out.monmouth.com!newspeer.monmouth.com!nntp.msen.com!uunet!ash.uu.net!world!bobduff From: Robert A Duff Subject: Re: Ada95 tutorials with sample code. Sender: bobduff@world.std.com (Robert A Duff) Message-ID: Date: Tue, 6 Mar 2001 18:19:01 GMT References: <3AA44F83.87CB23B7@acm.org> <3AA48DE9.A0650F21@emw.ericsson.se> <5F7p6.123$54.82@www.newsranger.com> Organization: The World Public Access UNIX, Brookline, MA X-Newsreader: Gnus v5.3/Emacs 19.34 Xref: supernews.google.com comp.lang.ada:5473 Date: 2001-03-06T18:19:01+00:00 List-Id: Ted Dennison writes: > The common example used is Ada.Strings.Unbounded.To_Unbounded_String. Even I > have to admit this looks stupid. However, I'd claim that the stupidity is > entirely a result of stupid naming on the designers part. They quite easily > could have named the routine Ada.Strings.Unbounded.To, ... Is this supposed to be an example of a name that works well both with and without use clauses? Yikes. >...rather than repeating the > names of two parent packages in the subprogram's identifier. I think it's repeating the name of a *type*, not packages. - Bob