On Tue, Aug 31, 2010 at 11:57 PM, Mike <[email protected]> wrote: > I can't reply to this properly, since I'm mobile at the moment, but I would > like to make a note about a few things. > > First, the child nodes in a RELOAD document are not sorted in any way. The > nodes will be present in the order they were added, unless they are added in > a different order (AddBefore, etc). This is because node order is important, > and context-sensitive. > > A serialized document will always have the same order as the memory document > that created it, and vice-versa (unless it is modified, of course)
> > reloadtest uses these facts to validate that the serialization and > deserialization routines work correctly. > > It will not, however, compare two trees that have the same nodes, but in a > different order (rightly so, since the trees are not the same) That means my original implementation was almost right. Heh, thanks for the clarification Mike. _______________________________________________ Ohrrpgce mailing list [email protected] http://lists.motherhamster.org/listinfo.cgi/ohrrpgce-motherhamster.org
