|
![](/i/fill.gif) |
Rudy Velthuis wrote:
>
<snip>
Nifty basic :-)
>
> A language like Inprise Borland Object Pascal and the component library VCL
> uses assembler in time-critical parts (sorting, string functions) or in
> parts, where a call couldn't easily be faked using high level Pascal
> (because something like non-standard stack handling is required).
I know this about the Delphi environment, and that they used it partly
in OOP pascal.
> I've
> however seen one example, where optimized Pascal code was *faster* than the
> original hand-optimized assembler routine. This was also a string function.
> It was the improved algorithm which did the trick.
Show me that pascal code, please.
--
//Spider
( spi### [at] bahnhof se ) [ http://www.bahnhof.se/~spider/ ]
#declare life = rand(seed(42))*sqrt(-1);
Post a reply to this message
|
![](/i/fill.gif) |