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.3 required=5.0 tests=BAYES_00,FREEMAIL_FROM,
	INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,bd45e29f9dafca87
X-Google-Attributes: gid103376,public
From: Alexander Van Hecke <alexke@hotmail.com>
Subject: Re: bitwise comparators
Date: 2000/01/17
Message-ID: <3882FC1C.2BA8C959@hotmail.com>#1/1
X-Deja-AN: 573699796
Cache-Post-Path: marvin!root@tvd-10-67-20-018.tvd.kotnet.kuleuven.ac.be
Content-Transfer-Encoding: 7bit
References: <3880D375.7E363123@hotmail.com> <38829638.0@news.pacifier.com>
X-Accept-Language: en
Content-Type: text/plain; charset=us-ascii
X-Complaints-To: abuse@belnet.be
X-Trace: naxos.belnet.be 948108412 16387 134.58.127.3 (17 Jan 2000 11:26:52
 GMT)
Organization: KULeuvenNet
X-Cache: nntpcache 2.3.3 (see http://www.nntpcache.org/)
Mime-Version: 1.0
NNTP-Posting-Date: 17 Jan 2000 11:26:52 GMT
Newsgroups: comp.lang.ada
Date: 2000-01-17T11:26:52+00:00
List-Id: <comp.lang.ada>

> I'd also like to point out that the "while" construct you are using is
> common for 'C' or Pascal, but in Ada you could use a "loop" construct with
> "exit when"
>

thank you all for your response!
As many of you have pointed out, I could have used exit when ...
But as you probably noticed, I have a C background and I'm not that familiar
with Ada.  I think it's a nice feature of Ada that you can write 'readable'
code, but IMHO Ada takes a lot longer to learn, there are more constructs,
keywords, etc...  In a word, the language is more complicated, yet not
necessarily more powerfull (hope I don't get flamed for this :-)).   In C you'd
have one while loop, and you'd put your condition in the while expression and
that's it.  Nothing more to learn about it!
What's your opinion on this?

alex