RunRev vs RealBasic (Richard Gaskin)

[Richard Gaskin]

Michael D Mays wrote:
 >>> All I know is what Dar posted here, but it sounded really tasty.
 >>> Apparently he made a suggestion to Scott Raney about ways to
 >>> optimize operations in which a string of a given length is used
 >>> to replace a substring of the same length within a larger chunk.
 >>> In previous versions a very generalized approach was used for all
 >>> replacement operations, requiring that the data be copied during the
 >>> replacement, which can be computationally expensive with large
 >>> chunks.
 >>> Since the data being inserted is the same length as the data being
 >>> removed the handle size doesn't change, allowing the operation to
 >>> work in-place, without copying.
 >>> IIRC, Raney reported that the new method should improve speed by
 >>> roughly 4000 times for those cases.
 >>> Dar - got the details for us?
 >>
 >> Found the Bugzilla notes:
 >> <http://support.runrev.com/bugdatabase/show_bug.cgi?id=586>

> Yes 4000 times faster, once you take your shoes off.
> 
> One char, 4 char and 8 char replacement is fast.
> 
> on mouseUp
>   repeat with i = 1 to 1000000
>     put "1234567890" after dd
>   end repeat
>   put 9999990 into a
>   get the long seconds
>   put "a" into char a of dd
>   put "abcd" into char a to a+3 of dd
>   put "abcdefgh" into char a to a+7 of dd
>   put the long seconds - it
> end mouseUp

For clarity, I should admit that I'd accidentally misquoted Scott 
Raney's claim from the Bugzilla report:  it's *only* 1000 times faster, 
not 4000 times.

What does "once you take your shoes off" mean in this context?


-- 
  Richard Gaskin
  Fourth World Media Corporation
  ___________________________________________________________
  Ambassador at FourthWorld.com       http://www.FourthWorld.com