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,87cbb1bfef8057e3,start
X-Google-Attributes: gid103376,public
X-Google-Thread: 101deb,53553402ebe6948f
X-Google-Attributes: gid101deb,public
From: Ken Garlington <GarlingtonKE@lmtas.lmco.com>
Subject: Re: PL/I suggestions
Date: 1996/12/03
Message-ID: <32A45C57.1275@lmtas.lmco.com>#1/1
X-Deja-AN: 202121004
references: <57rgm2$3b6$1@goanna.cs.rmit.edu.au>
content-type: text/plain; charset=us-ascii
organization: Lockheed Martin Tactical Aircraft Systems
mime-version: 1.0
newsgroups: comp.lang.pl1,comp.lang.ada
x-mailer: Mozilla 2.02 (Win95; I)
Date: 1996-12-03T00:00:00+00:00
List-Id: <comp.lang.ada>


robin wrote:
> 
> Who has wanted to do multiple precision integer arithmetic?

I believe there is a reusable Ada package available to do
arbitrary-precision integer arithmetic. It could probably
be recoded in PL/I if you wanted something that's not built into
the language. I just moved my browser from a Mac to a PC, so I
don't have the link handy; perhaps someone on comp.lang.ada
could help you out...

> Who would like to see a CARRY built-in function that returns
> 0 or 1 depending on whether the previous add yielded no carry
> or a carry, respectively?  (or some other better way,
> short of having any specified precision implemented!)
> 
> What about functions that return arrays?
> 
> I'd like to see a portable UNSPEC, that returns the bits
> the "right" way around for integers and characters, at least.

-- 
LMTAS - The Fighter Enterprise - "Our Brand Means Quality"
See http://www.lmtas.com for more information (job listings now available)