|
> Correct me if I am wrong but isn't a bound > call faster than a dynamic call? Talking about performance in vague terms like this is extremely counter-productive. What runs fast on my machine, with my data set and my library list may not perform well in your environment. While it is true that in general a bound call is faster than a dynamic call, you may be quite surprised at the performance of a dynamic call where the called program shares the ODP, leaves the files open and returns with LR off. You get a performance hit on the first call, but subsequent calls execute very quickly. In many ways, breaking your code into sub-programs is easier from an architectural standpoint than it is to turn it into bound modules. --buck.
As an Amazon Associate we earn from qualifying purchases.
This mailing list archive is Copyright 1997-2024 by midrange.com and David Gibbs as a compilation work. Use of the archive is restricted to research of a business or technical nature. Any other uses are prohibited. Full details are available on our policy page. If you have questions about this, please contact [javascript protected email address].
Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.