Lists Home |
Date Index |
- From: "Mark D. Anderson" <email@example.com>
- To: <firstname.lastname@example.org>
- Date: Sun, 20 Dec 1998 16:08:37 -0800
Suppose I want the "diff" between two xml files.
I can imagine a few approaches:
just use "diff"
first do s/\>/\>\nUNIQUE/g to put the tags on separate lines,
then use "diff", then restore by s/\nUNIQUE//g
surely there must be some CS work on algorithms for finding
the least cost path between two trees, expressed as a sequence
of operations? the simplest is with just the operations of
add/delete of subtrees, but move and copy are interesting too.
xml-dev: A list for W3C XML Developers. To post, mailto:email@example.com
Archived as: http://www.lists.ic.ac.uk/hypermail/xml-dev/
To (un)subscribe, mailto:firstname.lastname@example.org the following message;
To subscribe to the digests, mailto:email@example.com the following message;
List coordinator, Henry Rzepa (mailto:firstname.lastname@example.org)