Biggest Delphi bottleneck?
- From: "Peter Morris [Droopy eyes software]" <pete@xxxxxxxxxxxxxxxxxxxxxx>
- Date: Wed, 28 Jun 2006 18:41:30 +0100
I think the replacement memory manager was a great idea, and I know someone
who has recompiled a very large D7 project into D2006 and noted a
"significant speed increase" but not timed it so I can't say how big
"significant" is.
I remember when writing FastStrings I decided to try to write a POS routine
that worked better for my specific purposes (multiple finds for faster
replacement). However, despite how many times it was called in a loop it
hardly gave me any increase in speed at all. This was because 99.9% of the
bottleneck in StringReplace was in the reallocation of the result string
each time it was changed. If you improve something that takes only 0.01% of
the total time, you can only speed up your app by a maximum of 0.01%
So it leads me to ask the following question. Any opinions as to the
current biggest bottleneck in Delphi?
Pete
.
- Follow-Ups:
- Re: Biggest Delphi bottleneck?
- From: Charles Appel
- Re: Biggest Delphi bottleneck?
- From: Thaddy
- Re: Biggest Delphi bottleneck?
- From: John Jacobson
- Re: Biggest Delphi bottleneck?
- From: Jouni Turunen
- Re: Biggest Delphi bottleneck?
- Prev by Date: Re: Tough problem...
- Next by Date: Re: Biggest Delphi bottleneck?
- Previous by thread: Fastcode CompareText B&V 1.5.3
- Next by thread: Re: Biggest Delphi bottleneck?
- Index(es):