[XSL-LIST Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message] Re: Tree Comparing Algorithm
On 03.02.2020 21:10, Vasu Chakkera vasucv@xxxxxxxxx wrote:
Thanks both. Martin's solution sort of worked, but it only gave me 21 children, but I had around 21000 nodes in the xml. I am not sure to what depth the comparisonB is happening.
I have tested my code now on a large files, it seems to process lots of nodes judging by the output to the console and the length of processing, but it doesn't seem to use streaming when I look at the memory consumption (600MB of input needed more than 2GB of memory), even if Saxon nowhere shows any -t message that input trees were built. Michael's comment on the way streaming is implemented in Saxon suggests that the whole attempt is futile, even if the code somehow manages to get by the streamability analysis.
|
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
|