[XSL-LIST Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message] RE: Comparing two xml documents
Hi Lars,
Thanks! It seems so simple when I look at it now. I like the way you used the mode in selecting the elements of different documents. I don't know about the limit on 200 KB yet. I will check out the downloaded version at a later time (perhaps tomorrow). On the sort: I can see how you would do something like this when you are able to delete the elements that you have already compared, but I can't see how you would be able to avoid going through all elements in A and B another time when searching B for elements not found in A. Would this be in any way possible in pure XSL? Regards, Ragulf Pickaxe :) It seems like you could save a lot of cycles by first sorting both documents by element name; then go through both lists at once using linear recursion, [does this mean you have to convert RTFs to node-sets? I'm not sure] comparing the "next" element in each sorted document, and updating the two "next" pointers according to which "next" node compares earlier. _________________________________________________________________ Add photos to your e-mail with MSN 8. Get 2 months FREE*. http://join.msn.com/?page=features/featuredemail 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
|