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,f868292008c639ce
X-Google-Attributes: gid103376,public
From: Ted Dennison <dennison@telepath.com>
Subject: Re: C vs. Ada - strings
Date: 2000/05/05
Message-ID: <8euis3$qqj$1@nnrp1.deja.com>#1/1
X-Deja-AN: 619570599
References: <390F0D93.F835FAD9@ftw.rsc.raytheon.com>
 <87k8h9v1iy.fsf@deneb.cygnus.argh.org>
X-Http-Proxy: 1.0 x34.deja.com:80 (Squid/1.1.22) for client 204.48.27.130
Organization: Deja.com - Before you buy.
X-Article-Creation-Date: Fri May 05 13:38:14 2000 GMT
X-MyDeja-Info: XMYDJUIDtedennison
Newsgroups: comp.lang.ada
X-Http-User-Agent: Mozilla/4.7 [en] (WinNT; I)
Date: 2000-05-05T00:00:00+00:00
List-Id: <comp.lang.ada>

In article <87k8h9v1iy.fsf@deneb.cygnus.argh.org>,
  Florian Weimer <fw-usenet@deneb.cygnus.argh.org> wrote:

> I have only worked with the GNAT implementation of the standard Ada
> strings, and two things annoy me particularly: First, the bounded
> strings tend to increase code size and compile time considerably.  The
> string package Gautier mentioned could be used as a replacement in
> places where this is a concern, and perhaps the bounded strings can be
> implemented on top of it, reducing code bloat.

I went away from bounded strings in OpenToken for just that reason.
You'd think that they'd be similar in speed to using stack-allocated
strings with an associated length variable. But in Gnat at least that is
not even close to true. It almost seemed as if every simple operation
was causing the whole string to get copied.

--
T.E.D.

http://www.telepath.com/~dennison/Ted/TED.html


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