On Fri, 27 Jul 2001, Lars Martin wrote:
Our solution is based on the treediff module which is (was?) part of
the Apache/Crimson package. So the licence is Apache-like. We did
some bugfixing and extended this package to support Lexus / XUpdate.
I have looking for this package, you're right: it's not part of the
current version. I found it in an old package version but I didn't manage
to byte compile it. In the treediff directory, the file package.html
references a white paper named An efficient new differencing algorithm
for structured hierarchical data but he link is dead.
Would someone have this document or know where can i find it?
xupdate:swap firstNode=XPath secondNode=XPath/
and
xupdate:move fromNode=XPath toNode=XPath position=before|after/
or
xupdate:move-before firstNode=XPath toNode=XPath/
xupdate:move-after firstNode=XPath toNode=XPath/
this look good
Another idea instead of move is to add something like a from attribute
to append, insert-before and insert-after
--
Sylvain Thenault
LOGILAB
--
Post a message: mailto:[EMAIL PROTECTED]
Unsubscribe:mailto:[EMAIL PROTECTED]
Contact adminstrator: mailto:[EMAIL PROTECTED]
Read archived messages: http://archive.xmldb.org/
--