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,FREEMAIL_FROM
	autolearn=ham autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,8623fab5750cd6aa
X-Google-Attributes: gid103376,public
Path: 
 g2news1.google.com!news1.google.com!news.glorb.com!cyclone1.gnilink.net!spamkiller2.gnilink.net!gnilink.net!nwrdny02.gnilink.net.POSTED!0e8a908a!not-for-mail
From: Hyman Rosen <hyrosen@mail.com>
User-Agent: Mozilla Thunderbird 0.7a (Windows/20040614)
X-Accept-Language: en-us, en
MIME-Version: 1.0
Newsgroups: comp.lang.ada
Subject: Re: Ada BIND was: Improving Ada's image - Was: 7E7 Flight Controls
 Electronics
References: <AN7zc.23810$wi2.16596@nwrdny01.gnilink.net>
 <mailman.108.1087258143.391.comp.lang.ada@ada-france.org>
 <sa4isdttufl.fsf@snoopy.apana.org.au>
 <aBHzc.1408$w07.84@newsread2.news.pas.earthlink.net>
In-Reply-To: <aBHzc.1408$w07.84@newsread2.news.pas.earthlink.net>
Content-Type: text/plain; charset=us-ascii; format=flowed
Content-Transfer-Encoding: 7bit
Message-ID: <SsKzc.29921$mz.6084@nwrdny02.gnilink.net>
Date: Tue, 15 Jun 2004 22:09:54 GMT
NNTP-Posting-Host: 68.161.84.150
X-Complaints-To: abuse@verizon.net
X-Trace: nwrdny02.gnilink.net 1087337394 68.161.84.150 (Tue,
 15 Jun 2004 18:09:54 EDT)
NNTP-Posting-Date: Tue, 15 Jun 2004 18:09:54 EDT
Xref: g2news1.google.com comp.lang.ada:1539
Date: 2004-06-15T22:09:54+00:00
List-Id: <comp.lang.ada>

Jeffrey Carter wrote:
> Brian May wrote:
>> Perhaps I am showing my ignorance, but do you read a string of
>> undefined length into an Ada program?
> All the time:
>    X : String := PragmARC.Get_Line;

That's not much of an answer. That's like saying that I can
generate the proof of the Riemann Hypothesis like this:
     with AdvancedMath; useAdvancedMath;
     procedure GenProof is begin Prove(Theorems.RH); end GenProof;

Obviously it's the inmplementation of the procedure that's of
interest, and presumably it does what we always see described
in c.l.a, which is to read a fixed size buffer and then return
that buffer concatenated with a recursive call if the first
read fills the buffer completely.

That's just copying and pasting bits together like you would do
anywhere else, except that Ada does the array manipulation as a
built-in operation.