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,f51e93dacd9c7fca
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2002-06-16 13:08:01 PST
Path: 
 archiver1.google.com!news1.google.com!newsfeed.stanford.edu!news-spur1.maxwell.syr.edu!news.maxwell.syr.edu!opentransit.net!wanadoo.fr!not-for-mail
From: Pascal Obry <p.obry@wanadoo.fr>
Newsgroups: comp.lang.ada
Subject: Re: status of Ada STL?
Date: 16 Jun 2002 22:01:26 +0200
Organization: Home - http://perso.wanadoo.fr/pascal.obry
Message-ID: <ulm9f0z8p.fsf@wanadoo.fr>
References: <bebbba07.0206132321.23d72ac8@posting.google.com>
 <aedgoc$to7$1@news.iucc.ac.il>
 <bebbba07.0206151051.1c25cf1e@posting.google.com> <uu1o31wbb.fsf@wanadoo.fr>
 <bebbba07.0206161023.6073fd3a@posting.google.com>
NNTP-Posting-Host: avelizy-103-1-4-124.abo.wanadoo.fr
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
X-Trace: wanadoo.fr 1024257958 6132 80.11.102.124 (16 Jun 2002 20:05:58 GMT)
X-Complaints-To: abuse@wanadoo.fr
NNTP-Posting-Date: 16 Jun 2002 20:05:58 GMT
User-Agent: Gnus/5.09 (Gnus v5.9.0) Emacs/21.2.90
Xref: archiver1.google.com comp.lang.ada:26086
Date: 2002-06-16T20:05:58+00:00
List-Id: <comp.lang.ada>


18k11tm001@sneakemail.com (Russ) writes:

> I really don't understand the objection to my proposal. 

I've read them all. I see nothing here that will make Ada read better. You
have 7 rules, all of them are very minor points and in each time your proposal
seems just more confusing to me.

I don't know if you have a more extensive description for your changes ? Do
you have examples ?

Let's try a simple one :

Here is the Ada version:

   procedure Dummy is

      subtype My_Int is Integer range 1 .. 1_024;

      procedure Proc (C : out My_Int; A, B : in My_Int := 1) is
         I : constant Integer := 9;
      begin
         if A = 12 then
            C := A + B + I;
         end if;

         C := C * (A + 2 * B);
      end Proc;

      R : My_Int;

   begin
      Proc (A => 2, B => 8, C => R);
   end Dummy;

Here is the Ada-F version :

   procedure Dummy is

      subtype My_Int is Integer range 1 : 1_024;

      procedure Proc (C : out My_Int; A, B = 1 : in My_Int) is
         I = 9 : constant Integer;
      begin
         if A == 12 then
            C = A + B + I
         end if;

         C *= (A + 2 * B)
      end Proc;

      R : My_Int;

   begin
      Proc (A = 2, B = 8, C = R)
   end Dummy

(I have not use rule 1 nor 7)

Are you still saying that Ada-F is looking better than Ada ?

One very nasty effect is "A, B = 1 : in My_Int" it looks like only B is
set to 1.

Pascal.

-- 

--|------------------------------------------------------
--| Pascal Obry                           Team-Ada Member
--| 45, rue Gabriel Peri - 78114 Magny Les Hameaux FRANCE
--|------------------------------------------------------
--|         http://perso.wanadoo.fr/pascal.obry
--| "The best way to travel is by means of imagination"
--|
--| gpg --keyserver wwwkeys.pgp.net --recv-key C1082595