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,2d76c4749a82ef0b X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2003-11-04 12:43:50 PST Path: archiver1.google.com!news2.google.com!news.maxwell.syr.edu!news.tele.dk!news.tele.dk!small.news.tele.dk!newsfeed1.e.nsc.no!nsc.no!nextra.com!news4.e.nsc.no.POSTED!53ab2750!not-for-mail From: "Tarjei T. Jensen" Newsgroups: comp.lang.ada References: Subject: Re: Strings Fixed, Bounded, and Counted. Performance Inquiry. MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 7bit X-Priority: 3 X-MSMail-Priority: Normal X-Newsreader: Microsoft Outlook Express 6.00.2800.1106 X-MIMEOLE: Produced By Microsoft MimeOLE V6.00.2800.1106 Message-ID: NNTP-Posting-Host: 130.67.226.238 X-Complaints-To: news-abuse@telenor.net NNTP-Posting-Date: Tue, 04 Nov 2003 21:43:50 MET X-Trace: news4.ulv.nextra.no 1067978630 130.67.226.238 Date: Sun, 2 Nov 2003 11:42:02 +0100 Xref: archiver1.google.com comp.lang.ada:2058 Date: 2003-11-02T11:42:02+01:00 List-Id: Stephen Leake wrote: > Depends on what you are doing. Copying the strings character by > character is the same speed for either construct. Block copy is faster > with a count on most machines. But most algorithms for processing > strings operate character by character, so it doesn't really matter. I don't buy that. There is a lot of character by character processing because there is no access to the length of the string. BTW. Counted strings was on the Want List for Ada95. greetings,