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=0.2 required=5.0 tests=BAYES_00,INVALID_MSGID,
	REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,751584f55705ddb7
X-Google-Attributes: gid103376,public
From: ncohen@watson.ibm.com (Norman H. Cohen)
Subject: Re: Side-effect arithmetic again [was: Ada ... in embedded systems]
Date: 1996/03/19
Message-ID: <4in8ko$klb@watnews1.watson.ibm.com>#1/1
X-Deja-AN: 143289268
distribution: world
references: <RALW.96Mar8113005@vulcan.gecm.com>
 <314B33CE.64EE@escmail.orl.mmc.com> <4i6efq$dd9@dfw.dfw.net>
 <4iif6g$o5o@fred.netinfo.com.au> <4ik5bm$ogg@dayuc.dayton.saic.com>
 <dewar.827181191@schonberg>
organization: IBM T.J. Watson Research Center
reply-to: ncohen@watson.ibm.com
newsgroups: comp.lang.ada
Date: 1996-03-19T00:00:00+00:00
List-Id: <comp.lang.ada>

In article <dewar.827181191@schonberg>, dewar@cs.nyu.edu (Robert Dewar)
writes: 

|> Direction := Direction + 1;
|>
|> seems OK. Yes, I know yu can find complex cases, but in well written
|> code, complex stuff is minimized anyway, and for example nearly all
|> incmrenets in the GNAT source are of simple variables.

And for the rare exception, you can write: 

   declare
      X: Integer renames Extraordinary_Long_Array_Name(Complex_Index_Value_Expression).Absurdly_Long_Component_Name;
   begin
      X := X + 1;
   end;

I find x++ convenient, but it's hardly worth bloating Ada with another
feature.

--
Norman H. Cohen    ncohen@watson.ibm.com