From: Robert Dewar <robert_dewar@my-deja.com>
Subject: Re: Large strings in ADA
Date: 2000/04/17
Date: 2000-04-17T00:00:00+00:00 [thread overview]
Message-ID: <8df273$hrh$1@nnrp1.deja.com> (raw)
In-Reply-To: 38FA3003.A38D7B51@xpress.se
In article <38FA3003.A38D7B51@xpress.se>,
Johan Groth <jgroth@xpress.se> wrote:
> Hello,
> I'm trying to write a program that converts a couple of types
to strings
> and are concatenated into one large string that is at the
moment a
> unbounded_string but when the string gets about 50KB big it
takes longer
> and longer to append to it.
By the way, the use of gigantic contiguous strings is almost
always a very bad data structure choice, and if you are
interested in efficiency, you should probably start by
rethinking your data structures and using a more effective
data structure.
Since C has rather poor data structuring abilities compared
to Ada, it is not unusual to "spin your own" in C, but in
Ada there is certainly a better way of doing things.
Sent via Deja.com http://www.deja.com/
Before you buy.
next prev parent reply other threads:[~2000-04-17 0:00 UTC|newest]
Thread overview: 14+ messages / expand[flat|nested] mbox.gz Atom feed top
2000-04-16 0:00 Large strings in ADA Johan Groth
2000-04-16 0:00 ` David Starner
2000-04-17 0:00 ` Robert Dewar [this message]
2000-04-17 0:00 ` Florian Weimer
2000-04-17 0:00 ` Dale Stanbrough
2000-04-17 0:00 ` tmoran
2000-04-17 0:00 ` Johan Groth
2000-04-17 0:00 ` Florian Weimer
2000-04-17 0:00 ` tmoran
2000-04-18 0:00 ` tmoran
2000-04-22 0:00 ` Johan Groth
2000-04-17 0:00 ` Robert Dewar
2000-04-17 0:00 ` David Starner
2000-04-17 0:00 ` Robert Dewar
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox