Re: Reserve_Capacity for Unbounded_String?

["Randy Brukardt" <randy@rrsoftware.com>]

"Robert A Duff" <bobduff@shell01.TheWorld.com> wrote in message
news:wccmyxl5plh.fsf@shell01.TheWorld.com...
> "Randy Brukardt" <randy@rrsoftware.com> writes:
>
> > So I stand by my original statement. Anyone that depends on the
performance
> > characteristics of a particular implementation (of anything!) is an
idiot
> > and will be burned in the future.
>
> I really don't think you mean that literally!
>
> I mean, the Ada language standard does not require that "X := X + 1"
> take less than 100 years to execute.  Programmers _must_ trust that
> language implementers make reasonably efficient choices.  In fact,
> in Ada, I write things like "X := X + 1" all the time, trusting that it
> compiles into a single machine instruction, or close to that.

Perhaps; I was thinking of predefined libraries more than basic stuff like
"X := X + 1;". But I think you really do have to test whether something is
fast enough; you can never *assume* that it will be. Vendors don't
intentionally make things slow, but what you think is slow might not be for
a given implementation's model. Also see my answer to your other note.

                                      Randy.