Re: Can solve the N-queens - but can't count!

["Jonathan Borden" <jborden@xxxxxxxxxxxx>]

James Clark wrote:
>
>If XSLT allowed you do anything with result tree fragments that you can
>do with source node sets, then you would in effect be able to do
>multi-pass processing in XSLT:

    Yes this is the idea. Of course this can be done today using javascript
and Microsoft's extensions transformNode and transformNodeToObject. Having
this nice ability within the spec will reduce the need to go outside the
spec for many applications.
    As Oren Ben-Kiki has demonstrated, multiple passes can be in certain
cases hacked using result strings and string manipulation. The ability to
use result sets as node sets will keep implementations clean and in the node
domain rather than the string domain. By this argument, the processing
complexity may indeed be much less than alternate yet allowed mechanisms. Is
the implementation complexity really that much greater?

Jonathan Borden
http://jabr.ne.mediaone.net






 XSL-List info and archive:  http://www.mulberrytech.com/xsl/xsl-list