[XSL-LIST Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message] Re: how to estimate speed of a transformation
That's clear and obvious. What kinds of expressions and when are 'cached' in each of the available processors? don't know:-) For example, for each node in a sequence, will computing following-sibling::*[name()=name(following-sibling::*[1])][2] There's no need to make it so complicated: even something as simple as following-sibling::*[1] there is no requirement that a processor _has_ to just calculate one node, the semantics of the expression would suggest that all following siblings be found and then that node set is sorted in to document order, and the first taken. probably all systems special case at least literal integer values for [] and stop processing the initial path once the required node is found, but without forcing some particular processing model it's hard to see how the spec could mandate that. Stylesheets can be long and sophisticated. If it becomes too slow, is it a bug in the algorithm or in the processor? I agree that this is a problem, but it's not clear if there is an obvios solution for it. David -- http://www.dcarlisle.demon.co.uk/matthew ________________________________________________________________________ This e-mail has been scanned for all viruses by Star Internet. The service is powered by MessageLabs. For more information on a proactive anti-virus service working around the clock, around the globe, visit: http://www.star.net.uk ________________________________________________________________________ XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
|
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
|