Subject: Re: [xsl] Two versions of sum over node list by recursion--why and how does seco From: "Dimitre Novatchev" <dnovatchev@xxxxxxxxx> Date: Wed, 6 Sep 2006 05:42:23 -0700 |
Is your hope founded on knowledge of someone working on such an implementation?
The fact is *I* am not aware of anyone doing this, which doesn't mean anyone is not doing this.
-- Cheers, Dimitre Novatchev --------------------------------------- Truly great madness cannot be achieved without significant intelligence. --------------------------------------- To invent, you need a good imagination and a pile of junk
>>For Dimitre, it can also be written as a divide and conquer >>sum(empty-list)=0 >>sum(item)=item >>sum(list)=sum(even-position-items)+ sum(odd-position-items) >> >>David > > >What is becoming important with this is that not in the so distant >future (I hope) an XSLT processor will calculate: > > sum(even-position-items) >and > sum(odd-position-items) > >in two different threads on two processors so that the total >calculation will be approx. twice as fast. > >Parallelization is something very natural in functional programming, >while it can be very difficult to achieve with imperative programming. > >
_________________________________________________________________ Be the first to hear what's new at MSN - sign up to our free newsletters! http://www.msn.co.uk/newsletters
Current Thread |
---|
|
<- Previous | Index | Next -> |
---|---|---|
Re: [xsl] Two versions of sum over , Colin Adams | Thread | Re: [xsl] Two versions of sum over , andrew welch |
RE: [xsl] Migration from XSLT1.0 to, Michael Kay | Date | RE: Re: [xsl] Petri net to BPEL mod, cknell |
Month |