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,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,7844279822ce7c28
X-Google-Attributes: gid103376,public
From: "Matthew Heaney" <matthew_heaney@acm.org>
Subject: Re: Newbie question : types , representation
Date: 1999/08/24
Message-ID: <37c2d548@news1.us.ibm.net>#1/1
X-Deja-AN: 516652488
Content-transfer-encoding: 7bit
References: <37BFC251.601ADF8F@village.uunet.be> <7ppdon$j3p$1@nnrp1.deja.com>
 <7ptsgn$nvp$1@nnrp1.deja.com>
X-Trace: 24 Aug 1999 17:24:24 GMT, 129.37.213.60
Organization: Global Network Services - Remote Access Mail & News Services
X-Notice: should be reported to postmaster@ibm.net
Content-Type: text/plain; charset="US-ASCII"
Mime-version: 1.0
Newsgroups: comp.lang.ada
X-Complaints-To: postmaster@ibm.net
Date: 1999-08-24T00:00:00+00:00
List-Id: <comp.lang.ada>

In article <7ptsgn$nvp$1@nnrp1.deja.com> , jdla@my-deja.com  wrote:

> But I didn't see however too much of practical answers how to do, in a ADA way
> and without spoiling to much processor cycles in converting hence and back.

What makes you think that the "Ada way" is more expensive wrt processor
cycles?  How do you know that Ada isn't faster than C?