From: "Tarjei T. Jensen" <tarjei@online.no>
Subject: Re: Strings Fixed, Bounded, and Counted. Performance Inquiry.
Date: Sun, 2 Nov 2003 11:42:02 +0100
Date: 2003-11-02T11:42:02+01:00 [thread overview]
Message-ID: <acUpb.4227$mf2.56395@news4.e.nsc.no> (raw)
In-Reply-To: uu15ud2fb.fsf@nasa.gov
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,
prev parent reply other threads:[~2003-11-02 10:42 UTC|newest]
Thread overview: 8+ messages / expand[flat|nested] mbox.gz Atom feed top
2003-10-24 20:18 Strings Fixed, Bounded, and Counted. Performance Inquiry Freejack
2003-10-24 20:28 ` Marin David Condic
2003-10-25 0:46 ` Jeffrey Carter
2003-10-25 21:24 ` Marin David Condic
2003-10-27 17:18 ` Stephen Leake
2003-10-27 19:15 ` Freejack
2003-10-27 19:31 ` Stephen Leake
2003-11-02 10:42 ` Tarjei T. Jensen [this message]
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox