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-Thread: 103376,703c4f68db81387d
X-Google-Thread: 109fba,703c4f68db81387d
X-Google-Thread: 115aec,703c4f68db81387d
X-Google-Thread: f43e6,703c4f68db81387d
X-Google-Attributes: gid103376,gid109fba,gid115aec,gidf43e6,public
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news1.google.com!news1.google.com!newsread.com!newsprint.newsread.com!newsfeed.stueberl.de!peernews3.colt.net!colt.net!fr.colt.net!rain.fr!news.wanadoo.fr!news.wanadoo.fr!not-for-mail
Sender: obry@PASCAL
Newsgroups: comp.lang.ada,comp.lang.c++,comp.realtime,comp.software-eng
Subject: Re: Teaching new tricks to an old dog (C++ -->Ada)
References: <4229bad9$0$1019$afc38c87@news.optusnet.com.au>
 <1110032222.447846.167060@g14g2000cwa.googlegroups.com>
 <871xau9nlh.fsf@insalien.org>
 <3SjWd.103128$Vf.3969241@news000.worldonline.dk>
 <87r7iu85lf.fsf@insalien.org> <1110052142.832650@athnrd02>
 <d0dkq6$781$1@titan.btinternet.com>
 <1110284070.410136.205090@o13g2000cwo.googlegroups.com>
 <395uqaF5rhu2mU1@individual.net> <112rs0bdr2aftdf@corp.supernews.com>
From: Pascal Obry <pascal@obry.org>
Date: 08 Mar 2005 19:46:41 +0100
Message-ID: <ufyz6gelq.fsf@obry.org>
Organization: Home - http://www.obry.net
User-Agent: Gnus/5.09 (Gnus v5.9.0) Emacs/21.3
MIME-Version: 1.0
Content-Type: text/plain; charset=us-ascii
NNTP-Posting-Date: 08 Mar 2005 19:46:43 CET
NNTP-Posting-Host: 82.120.22.91
X-Trace: 1110307603 news.wanadoo.fr 1214 82.120.22.91:2523
X-Complaints-To: abuse@wanadoo.fr
Xref: g2news1.google.com comp.lang.ada:8871 comp.lang.c++:44635
 comp.realtime:1071 comp.software-eng:4624
Date: 2005-03-08T19:46:43+01:00
List-Id: <comp.lang.ada>


CTips <ctips@bestweb.net> writes:

> Free? Well, lets look at one particular issue:  pointers to arbitrary
> locations. In C, its a common idiom to do the following:
>     foo(int * p)
>     {
>        int * z;
>        for( i ... ) {
>          ... p[i]...;
>        }
>        z = p;
>     }
> 
>     ...
>     foo( &x[lo] );
>     ...
> 
> Now, how can *any* language check to see that p[i] is within bounds?

Good you asked! Let's code this example in Ada (using Ada and
not C/C++ style, in Ada for the above example we do not need a pointer):

   type T is array (Positive range <>) of Integer;

   procedure Foo (P : in out T) is
      Z : Positive;
   begin
      for I in P'Range loop
         ... P(i)...;
        --  Here P(i) is always within the bounds, no check needed.        
      end loop;
      Z := P'First;
   end Foo;

   ...

   Foo (X (Lo .. X'Last));

> Bullsh*t. In several ways, of which two are:

Given your assumption about maybe you just don't know Ada.

Pascal.

-- 

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