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,e6c9800e35ccfeee
X-Google-Attributes: gid103376,public
From: stt@houdini.camb.inmet.com (Tucker Taft)
Subject: Re: GNAT: Performance of String functions
Date: 1997/07/21
Message-ID: <EDnEIw.6ME.0.-s@inmet.camb.inmet.com>#1/1
X-Deja-AN: 257911143
Sender: news@inmet.camb.inmet.com (USENET news)
X-Nntp-Posting-Host: houdini.camb.inmet.com
References: <dewar.869405750@merv>
Organization: Intermetrics, Inc.
Newsgroups: comp.lang.ada
Date: 1997-07-21T00:00:00+00:00
List-Id: <comp.lang.ada>


Robert Dewar (dewar@merv.cs.nyu.edu) wrote:
: Tarjei said

: <<As unbounded strings are allocated on the heap there is a potential
: serious overhead in allocating and deallocating space for these strings
: as they change size. The serious overhead can include system calls to
: allocate or free space. I expect that it also include wholesale copying
: of the contents of the strings.
: >>

: Right, that is generally true, we have considered, but not yet implemented,
: a version of unbounded strings that would allocate a little growth space
: in each string value so that, for example, if you are adding one character
: at a time, you do not copy on every addition. I think this would be a
: valuable improvement.

For what it is worth, our latest AdaMagic runtime provides for
this growth, and it also avoids the heap completely for "short"
unbounded strings.

--
-Tucker Taft   stt@inmet.com   http://www.inmet.com/~stt/
Intermetrics, Inc.  Burlington, MA  USA