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: dewar@merv.cs.nyu.edu (Robert Dewar)
Subject: Re: GNAT: Performance of String functions
Date: 1997/07/21
Message-ID: <dewar.869494470@merv>#1/1
X-Deja-AN: 257983654
References: <dewar.869405750@merv> <EDnEIw.6ME.0.-s@inmet.camb.inmet.com>
Organization: New York University
Newsgroups: comp.lang.ada
Date: 1997-07-21T00:00:00+00:00
List-Id: <comp.lang.ada>


Tucker says

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

This seems a perfectly reasonable space/time tradeoff (obviously the
above approach can end up using more space, but can save considerable
time). Possibly a good alternative is to provide user control over
this tradeoff.

Another good idea for unbounded strings is to implement automatic
garbage collection for just this type. That's also somehting we have
looked at in some detail.