This is the mail archive of the
xsl-list@mulberrytech.com
mailing list .
RE: Saxon VS XT
- To: <xsl-list at mulberrytech dot com>
- Subject: RE: Saxon VS XT
- From: "Paulo Gaspar" <paulo dot gaspar at krankikom dot de>
- Date: Mon, 7 Aug 2000 17:37:18 +0200
- Reply-To: xsl-list at mulberrytech dot com
An very simple hash table is implemented in the previous version of the
"XSL ISAPI Filter" from Microsoft. It is used by a simple XSLT cache.
It is C++ but very easy to convert to anything else (it is so tiny).
Maybe it is still present in the "XSL ISAPI Filter 2.0". I am not sure
(no time to check today) but you can download it and check it from this
huge URL:
http://msdn.microsoft.com/downloads/default.asp?URL=/code/sample.asp?url=/ms
dn-files/027/000/552/msdncompositedoc.xml
Have fun,
Paulo Gaspar
> -----Original Message-----
> From: owner-xsl-list@mulberrytech.com
> [mailto:owner-xsl-list@mulberrytech.com]On Behalf Of Joshua Allen
> Sent: Monday, August 07, 2000 07:45
> To: 'xsl-list@mulberrytech.com'
> Subject: RE: Saxon VS XT
>
>
> > not necessary and hashes are difficult in C? I haven't done
> > keys in xslt but I can see that they are usefull and in C
>
> I agree 100%. Some languages provide built-in hashing.
> However, it is not hard to write your own, and usually
> is the way to get best performance for a particular problem.
>
> Cheers,
> -J
>
>
> XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
>
XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list