Re: Counting level of nodes beneath current (in XPATH)

Play the video

Subject: Re: Counting level of nodes beneath current (in XPATH)
From: "Ragulf Pickaxe" <jawxml@xxxxxxxxxxx>
Date: Tue, 11 Jan 2005 14:36:03 +0000

> The solution is not near what I hoped as it seems to be very slow.

Speed's all relative, it took 300 years to solve Fermat's last theorem.
Why is everyone in such a rush these days:-)

The mathematicians' bosses do not stand behind them, looking over their shoulders, asking how much longer it takes for a solution, perhaps? :-)

David

Thank you for the other solution. I was actually starting myself on generating such a two-pass solution, so I am glad that this seems okay to other people as well.

I am very happy for the answers on this list - I learn something new every time I struggle with XSL. Ragulf Pickaxe :-)

_________________________________________________________________ Don't just search. Find. Check out the new MSN Search! http://search.msn.click-url.com/go/onm00200636ave/direct/01/

Current Thread
RE: Counting level of nodes beneath current (in XPATH), (continued) Ragulf Pickaxe - 11 Jan 2005 12:39:55 -0000 David Carlisle - 11 Jan 2005 13:09:25 -0000 Ragulf Pickaxe - 11 Jan 2005 13:34:20 -0000 David Carlisle - 11 Jan 2005 13:53:49 -0000 Ragulf Pickaxe - 11 Jan 2005 14:37:19 -0000 <= Andrew Welch - 11 Jan 2005 12:22:50 -0000 Ragulf Pickaxe - 11 Jan 2005 12:48:51 -0000

<- Previous	Index	Next ->
Re: Counting level of nodes b, David Carlisle	Thread	RE: Counting level of nodes b, Andrew Welch
Re: msxml apostrophe encoding, Geert Josten	Date	Re: Restrict Mixed Content, Edgar Steven
	Month

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

RSS 2.0
Atom 0.3

XML Editor - Download a 15 Day Free Trial Now >

See What's New in Stylus Studio >

Buy Stylus Studio - XML Editor - Now >