Re: Large strings in ADA

[Dale Stanbrough <dale@cs.rmit.edu.au>]

Johan Groth wrote:

> The code looks like below. I need to concatenate about 2.5MB of data.
> What is the fasted way to do that in ADA? Just for comparison a similar
> program in C takes about one second. 

There can't be a similar program in C, because C does not have controlled
types. Each time you append to your unbounded_string, you could be (and 
most likely are) destroying the entire contents, and reallocating the
unbounded_string all over again.

Perhaps you should try duplicating the -exact- C semantics. Presumably 
you have a -very- large char buffer into which the items are copied.

Alternatively, if you know of an upper bound for the length of the
string, you could instantiate a Bounded_String package.


Dale