>I suspect that Rick's anticipated performance gain includes allocation of memory external to VFP's housekeeping so you can process quickly with persistent pointers and minimal re-reading of start positions or error check or other overhead,
>Correct. It's the only way to fly.
Chen agrees with the concept of shelling out to C/C++ before returning results to VFP. He pointed me to this antique link
http://www.dfpug.de/konf/konf_1995/oop/SessionE-C%2B%2B.htm ... note reference to the mighty Pentium 90 running Windows NT ;-)
Another example of a gain in performance from the LCK is in number crunching. A perfect number is defined as a number N that is equal to the sum of all of its divisors. The first part of this VFP program calculates the perfect numbers below 1000 in 13 seconds on my Pentium 90 under NT. The second part uses the LCK and gets the same results in less than 1 second.
"... They ne'er cared for us
yet: suffer us to famish, and their store-houses
crammed with grain; make edicts for usury, to
support usurers; repeal daily any wholesome act
established against the rich, and provide more
piercing statutes daily, to chain up and restrain
the poor. If the wars eat us not up, they will; and
there's all the love they bear us."
-- Shakespeare: Coriolanus, Act 1, scene 1
