[Home] [By Thread] [By Date] [Recent Entries]
Jethro Borsje wrote:
This sounds all very logical. I think option 5 is the best way to go at It sounds to me that it will be way easier if you try to track the user action and record his selection, instead of finding it per the selected text/xml (what if parts of your xml are equal?). Once I find the location of the selection deep-equal() already does this 'iteration' for you. It deep-equals all nodes of the tree recursively and when they are indeed equal, it will return true. Applying deep-equal to every node in your code would be very inefficient. I don't think it is the best approach for what you need. If you need to find a particular node by means of a node as input, you *could* use deep-equal, but when the input is stringized, it will be problematic. I am not sure if using XSLT for finding the selected nodes is the right approach at all.
|

Cart



