This is the mail archive of the
xsl-list@mulberrytech.com
mailing list .
Re: Best way to handle multiple string replacements?
- To: xsl-list at mulberrytech dot com
- Subject: Re: Best way to handle multiple string replacements?
- From: Sebastian Rahtz <sebastian dot rahtz at computing-services dot oxford dot ac dot uk>
- Date: Tue, 6 Jun 2000 13:40:35 +0100 (BST)
- Cc: w dot hedley at auckland dot ac dot nz
- References: <393BE859.CE102032@auckland.ac.nz><3.0.6.32.20000606125951.012a8320@NTServer>
- Reply-To: xsl-list at mulberrytech dot com
I am full of admiration for Jeni's ingenuity, but I wonder whether a
simpler approach might not be to build a lookup table of character
positions and their expansions (using XSL keys), and then cycle over
the text letter by letter seeing if there is a replacement?
If you work by cycling through the replacements, surely
<foo:char>$</foo:char>
and
<foo:replace>$\mathbb{P}$</foo:replace>
will fight? the $ in the second fragment might end up escaped
sebastian
XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list