On 27 July 2010 14:34, Wolfgang Laun <wolfgang(_dot_)laun(_at_)gmail(_dot_)com>
wrote:
One input document is processed to create what is (in Java terms) a
Map<String,String>.
To transform another document, lookup of map keys for values needs to be done
repeatedly and frequently.
Each key is composed from values scattered all over the 1st document;
I think that
I'll have to use functions to collect the chunks, which may iterate
over sequences
and call other functions, and so, finally, down in one such function,
I'll have a key
and its value.
I think that a third (internal only) document with a flat structure containing
multiple <e><k/><v/></e> is the best (the only?) way of implementing this map.
Any comments welcome - I hope this isn't too abstract.
The standard key might well be enough... can you post a small complete example?
If not, just build your temporary tree and key into that.
--
Andrew Welch
http://andrewjwelch.com
Kernow: http://kernowforsaxon.sf.net/
--~------------------------------------------------------------------
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>
--~--