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.3 required=5.0 tests=BAYES_00,HK_NAME_MR_MRS,
	INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII
X-Google-Thread: fac41,9a0ff0bffdf63657
X-Google-Attributes: gidfac41,public
X-Google-Thread: 1108a1,9a0ff0bffdf63657
X-Google-Attributes: gid1108a1,public
X-Google-Thread: f43e6,9a0ff0bffdf63657
X-Google-Attributes: gidf43e6,public
X-Google-Thread: 103376,4b06f8f15f01a568
X-Google-Attributes: gid103376,public
From: Mr Ada <mrada@catalina-inter.net>
Subject: Re: Why C++ is successful
Date: 1998/08/15
Message-ID: <35D59E3F.22B93993@catalina-inter.net>#1/1
X-Deja-AN: 381418440
Content-Transfer-Encoding: 8bit
References: <dewar.902415458@merv> <6qfhri$gs7$1@nnrp1.dejanews.com>
 <Pine.BSF.3.96.980807124210.21259B-100000@shell5.ba.best.com>
 <35cb8058.645630787@news.ne.mediaone.net> <dewar.902578088@merv>
 <slrn6sopmg.4fg.jdege@jdege.visi.com> <rfzpddz3s2.fsf@bnp-eng.remcomp.com>
 <902934874.2099.0.nnrp-10.c246a717@news.demon.co.uk> <dewar.903074236@merv>
 <6r1e1a$mj$1@platane.wanadoo.fr>
Content-Type: text/plain; charset=iso-8859-1
X-Complaints-To: We Care <abuse@newsread.com>
X-Trace: newsread.com 903192201 207.105.234.242 (Sat,
 15 Aug 1998 10:43:21 EDT)
Organization: "A" Willow Ware
MIME-Version: 1.0
NNTP-Posting-Date: Sat, 15 Aug 1998 10:43:21 EDT
Newsgroups: comp.lang.eiffel,comp.object,comp.software-eng,comp.lang.ada
Date: 1998-08-15T00:00:00+00:00
List-Id: <comp.lang.ada>

Jean-Pierre Rosen wrote:

> Robert Dewar a �crit dans le message ...
> >2) to write finite state machines encoding the state into the PC. Yes, some
> >people prefer case statements for this purpose, but many people prefer the
> >use of labels and gotos as the most obvious translation of labeled states
> >with arrows between them.
>
> I agree with this one,
>
> >For example, I find the following perfectly clear:
> >
> >   <<sort>> for J in 1 .. N - 1 loop
> >       if D (J) > D (J + 1) then
> >   Swap (D(J), D(J + 1));
> >          goto Sort;
> >       end if;
> >
> But not on this one, since:
> loop
>    Inner: for J in 1 .. N - 1 loop
>        if D (J) > D (J + 1) then
>           Swap (D(J), D(J + 1));
>           exit Inner;
>        end if;
> end loop;
> reflects the intent better (at least to my taste).

All right!  How about this

for J in 1 .. N - 1 loop

  exit when (D (J) <= D (J+1);

  Swap (D (J), D (J+1));
end loop;