[XSL-LIST Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message] Re: How is memory allocated in recursive XSLT template
Hi Dimitre,
Thank you for your input and advice. On 5/2/07, Dimitre Novatchev <dnovatchev@xxxxxxxxx> wrote: I want just to add something to this very interesting discussion. Very briefly described, a DVC algorithm typically processes two or more (shorter) parts of the input list (recursively!) and then combines the results. Thus, processing a list of 1 000 000 (1M) elements with DVC will require a maximum call-stack depth of only 19 (~ log2(1000000) ), Ah Logarithms, taught in school but I've forgotten them :-( , time to brush up. But the max call-stack depth limit is very interesting. One can read more about DVC algorithms for example in Robert Sedgewick's book "Algorithms in C++".
Most of the functions of FXSL, which are defined to process long lists, have a DVC equivalent.
A lot of valuable things were taught in school , I wish I had saved my books , now I don't even remember what books were used. I've gotta track them down somehow. -- Cheers, Dimitre Novatchev
|
PURCHASE STYLUS STUDIO ONLINE TODAY!Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced! Download The World's Best XML IDE!Accelerate XML development with our award-winning XML IDE - Download a free trial today! Subscribe in XML format
|