[Home] [By Thread] [By Date] [Recent Entries]
In my XML Pantry, I have shared some XSLT 3.0 hash and check functions I
wrote: Fletcher checksum and MD5. The latter is very inefficient on
large strings. But the Fletcher checksums are very performant.
https://github.com/Arithmeticus/XML-Pantry/tree/master/hash-and-check Joel On 2026-10-12 19:18, Steve Ball steve.ball@xxxxxxxxxxxxxx wrote: A few years ago I implemented a hash algorithm for XPath/XSLT using XPath 2.0 features (i.e. it uses the string-to-codepoints() function). It also uses some large (prime) numbers, such as 2^50, so you would need to run it on a 64-bit machine.
|

Cart



