Dimitre Novatchev wrote:
Hi
It should be possible to write a higher-order function
item()* zipTrees(node() tree1, node() tree2, item()* zipnodeFun(),
item()* ziparcFun())
where we do not know in advance what exactly the functions
zipnodeFun(), and ziparcFun() will be doing.
One application is tree merging, another obvious one is tree
differencing, yet another could produce the results of any binary
operation (boolean, arithmetic, bit-wise, ...) on any pair of
corresponding nodes, ..., etc. the possibilities are unlimited.
Interesting. But I can't see what zipTrees() is expected to do
exactly. Could you please explain it a bit further (for example a
simple pseudo-algorithm)? And what is the role of $zipnodeFun and
$ziparcFun? BTW "arc" is the French word for "edge" in the graph
theory, but I'm not sure it is relevant here.
Thanks.
Regards,
--drkm
___________________________________________________________________________
Yahoo! Mail réinvente le mail ! Découvrez le nouveau Yahoo! Mail et son
interface révolutionnaire.
http://fr.mail.yahoo.com
--~------------------------------------------------------------------
XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
To unsubscribe, go to: http://lists.mulberrytech.com/xsl-list/
or e-mail: <mailto:xsl-list-unsubscribe(_at_)lists(_dot_)mulberrytech(_dot_)com>
--~--