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,
	MSGID_RANDY autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,c32f6f0b23106020
X-Google-Attributes: gid103376,public
From: Robert Dewar <robert_dewar@my-deja.com>
Subject: Re: Large strings in ADA
Date: 2000/04/17
Message-ID: <8df23t$hil$1@nnrp1.deja.com>#1/1
X-Deja-AN: 612209733
References: <38FA3003.A38D7B51@xpress.se>
X-Http-Proxy: 1.0 x32.deja.com:80 (Squid/1.1.22) for client 205.232.38.14
Organization: Deja.com - Before you buy.
X-Article-Creation-Date: Mon Apr 17 13:04:04 2000 GMT
X-MyDeja-Info: XMYDJUIDrobert_dewar
Newsgroups: comp.lang.ada
X-Http-User-Agent: Mozilla/4.61 [en] (OS/2; I)
Date: 2000-04-17T00:00:00+00:00
List-Id: <comp.lang.ada>

In article <38FA3003.A38D7B51@xpress.se>,
  Johan Groth <jgroth@xpress.se> wrote:

> What is the fasted way to do that in ADA? Just for comparison
> a similar program in C takes about one second.
> Can anyone help me?

Well there is no such thing as a similar program in C, since
C has no support for strings as such. So that means you have
a low level program in C that represents strings as arrays
of characters, and does its own manipulations to get the
effect of string processing. DO the same in Ada and you will
get comparable performance.


Sent via Deja.com http://www.deja.com/
Before you buy.