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.9 required=5.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,794c64d1f9164710
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2002-02-25 07:19:36 PST
Path: 
 archiver1.google.com!news1.google.com!sn-xit-02!sn-post-01!supernews.com!corp.supernews.com!not-for-mail
From: "Matthew Heaney" <mheaney@on2.com>
Newsgroups: comp.lang.ada
Subject: Re: functions, packages & characters
Date: Fri, 22 Feb 2002 20:10:25 -0500
Organization: Posted via Supernews, http://www.supernews.com
Message-ID: <u7klg886r837b7@corp.supernews.com>
References: <mailman.1014282062.23400.comp.lang.ada@ada.eu.org>
 <20020221130715.12738.00000034@mb-bg.aol.com> <3C753C66.8020509@mail.com>
 <u7b1g6cooeo49@corp.supernews.com> <u7b4d1bmd1f7ef@corp.supernews.com>
 <u7bcro6je1h519@corp.supernews.com> <a55iip$4s7$1@nh.pace.co.uk>
X-Priority: 3
X-MSMail-Priority: Normal
X-Newsreader: Microsoft Outlook Express 6.00.2600.0000
X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2600.0000
X-Complaints-To: newsabuse@supernews.com
Xref: archiver1.google.com comp.lang.ada:20371
Date: 2002-02-22T20:10:25-05:00
List-Id: <comp.lang.ada>


"Marin David Condic" <dont.bother.mcondic.auntie.spam@[acm.org> wrote in
message news:a55iip$4s7$1@nh.pace.co.uk...
> I've never looked into the underlying implementation of Unbounded_String
in
> any Ada compiler, so I have no clue as to how naturally (in)efficient they
> may be. I'm guessing a typical implementation is going to be some
collection
> of memory blocks strung together with pointers and some counters. Would
> "Append" require some huge overhead?

Often you (re)allocate the internal buffer in powers of 2, so it would
require only a few iterations to acquire an adequately-sized buffer.