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,38fc011071df5a27 X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2003-05-29 19:41:45 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!logbridge.uoregon.edu!arclight.uoregon.edu!wn13feed!wn12feed!wn14feed!worldnet.att.net!204.127.198.204!attbi_feed4!attbi.com!sccrnsc04.POSTED!not-for-mail From: "Mark A. Biggar" User-Agent: Mozilla/5.0 (Windows; U; Windows NT 5.1; en-US; rv:1.3.1) Gecko/20030425 X-Accept-Language: en-us, en MIME-Version: 1.0 Newsgroups: comp.lang.ada Subject: Re: Ideas for Ada 200X References: <6a90b886.0305262344.1d558079@posting.google.com> <3ED41344.7090105@spam.com> <3ED46D81.FF62C34F@0.0> <3ED46E07.4340CABC@0.0> <3ED4F3FD.A0EF7079@alfred-hilscher.de> <3ED4ECFC.5060000@cogeco.ca> In-Reply-To: Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit Message-ID: NNTP-Posting-Host: 12.235.88.213 X-Complaints-To: abuse@attbi.com X-Trace: sccrnsc04 1054262315 12.235.88.213 (Fri, 30 May 2003 02:38:35 GMT) NNTP-Posting-Date: Fri, 30 May 2003 02:38:35 GMT Organization: AT&T Broadband Date: Fri, 30 May 2003 02:38:35 GMT Xref: archiver1.google.com comp.lang.ada:38030 Date: 2003-05-30T02:38:35+00:00 List-Id: Robert A Duff wrote: > Wesley Groleau writes: > > >>>Well, I like the idea of an increment operation, and my reasoning has >>>nothing to do with typing. The problem is code duplication: you have to >>>write "I" twice in "I := I + 1;". No big deal if it's just "I", but it >>>could be a complicated name, so the reader has to careful compare the >>>text, and also worry about whether the name has side effects. >> >>What kind of entity is able to have side-effects AND to be incremented? > > > I'm thinking of something like: > > Some_Array[Get_Next_Position] := Some_Array[Get_Next_Position] + 1; > > where Get_Next_Position is a function that increments the current > position and returns it. You can say "so don't do that", but it's > allowed in Ada, and when I read the code, I have to think about whether > this sort of thing is going on. Even that case isn't too bad, but if you have a really long expression you can always use (using your example): declare x: same_as_Some_Array_element_type renames Some_Array[Get_Next_Position]; begin x := x + 1; end; This of course doesn't work if your expression has side-effects or contains the exaluation of a non-pure function (like your example). But note that even the += assignment operator in C++ doesn't work correctly in that case either.