> I'll add it to the to do list, the creation of a new CanonicalNodeComparator
> implementation.
Actually, I think this misses the point. If you can express a subtree
in cononical form, then you can do a secure hash on it. This opens the
door to digital signatures.
Basically what is needed is the ability to recreate the same secure
hash, by feeding the same connonical form to the hash algorithm.
It is the secure hash which is the thing that is signed. So you need
to test if the document fragment has the same hash.
Bill
_______________________________________________
dom4j-user mailing list
[EMAIL PROTECTED]
http://lists.sourceforge.net/lists/listinfo/dom4j-user
