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,FREEMAIL_FROM
	autolearn=ham autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,4f316de357ae35e9
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2002-08-26 11:45:30 PST
Path: 
 archiver1.google.com!news1.google.com!newsfeed.stanford.edu!logbridge.uoregon.edu!msunews!not-for-mail
From: "Chad R. Meiners" <crmeiners@hotmail.com>
Newsgroups: comp.lang.ada
Subject: Re: FAQ and string functions
Date: Mon, 26 Aug 2002 14:40:11 -0400
Organization: Michigan State University
Message-ID: <akdsv9$1j26$1@msunews.cl.msu.edu>
References: <20020730093206.A8550@videoproject.kiev.ua>
 <4519e058.0207300548.15eeb65c@posting.google.com>
 <20020731104643.C1083@videoproject.kiev.ua>
 <4519e058.0208010629.5e6182ca@posting.google.com>
 <20020801194720.Q1080@videoproject.kiev.ua>
 <4519e058.0208020605.5ab7e092@posting.google.com>
 <3D4AAF63.72782659@san.rr.com> <3D4B2382.7030209@telepath.com>
 <3D4B2ACD.FDA29B9A@san.rr.com> <3D4B401E.3060802@telepath.com>
 <3D4B4477.500088B@san.rr.com> <slrnaksiv8.oo.lutz@taranis.iks-jena.de>
 <3D4EA1AC.80D17170@s <wccofc6b66u.fsf@shell01.TheWorld.com>
 <uofc518w0.fsf@gsfc.nasa.gov> <wccd6s5y09r.fsf@shell01.TheWorld.com>
NNTP-Posting-Host: schubert.cse.msu.edu
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
Xref: archiver1.google.com comp.lang.ada:28425
Date: 2002-08-26T14:40:11-04:00
List-Id: <comp.lang.ada>


"Robert A Duff" <bobduff@shell01.TheWorld.com> wrote in message
news:wccd6s5y09r.fsf@shell01.TheWorld.com...
> Not necessarily:
>
>     procedure P(X: String) is
>         Y: String_Ptr := new String'(1..X'Length);
>     begin
>         Y.all := X; -- How fast is this?
>
> The amount of data copied is probably a run-time calculated value (not
> "easily visible in the source"), and is different for each call to P.
> In fact, one call to P might take a million times longer than another.

Yes, but the time bound on the assignment is blatantly visible; thus your
"Not necessarily" doesn't hold for this example.