SAXONICA

Saxon Documentation
Full Contents
About Saxon
Changes in this Release
| Version 8.9 (2007-02-12)
| Version 8.8 (2006-09-05)
| Version 8.7.3 (2006-06-13)
| Version 8.7.2 (2006-04-19)
| Version 8.7.1 (2006-04-13)
| Version 8.7 (2006-02-24)
| Version 8.6.1 (24 November 2005)
» | Version 8.6 (3 November 2005)
| Version 8.5.1 (26 August 2005)
| Version 8.5 (2 August 2005)
| Version 8.4 (4 April 2005)
| Version 8.3 (11 February 2005)
| Version 8.2 (21 December 2004)
| Version 8.1.1 (8 October 2004)
| Version 8.1 (24 September 2004)
| Version 8.0 (1 June 2004)
Conditions of Use
Using XSLT 2.0
Using XQuery
Handling Source Documents
XML Schema Processing
XPath API for Java
Saxon on .NET
Extensibility
Saxon Extensions
Sample Saxon Applications
The Saxon SQL Extension
XSLT Elements
XPath 2.0 Expression Syntax
Function Library
Standards Conformance

# Internal changes

Information about the type hierarchy is now cached in a new data structure (called `TypeHierarchy`) referenced from the `NamePool`. The aim is to improve the performance of type checking both at compile time and at run-time.

For some time (since before Saxon 6.5) Saxon has evaluated an expression such as `A < B` as `min(A) lt max(B)`. This optimization is now done as a compile-time rewrite, rather than being decided at run-time. The expansion `min(A) lt max(B)` is now used only if neither operand is known to be a singleton. In an expression such as `PRICE > 3.50`, where it is known that the second operand is a singleton, the expansion used is now `some $p in PRICE satisfies $p gt 3.50`; this gives a better chance of finishing early than the min/max comparison. An important benefit of doing these rewrites at compile time, apart from simplifying the run-time code, is that the rewritten expression is a candidate for further optimization, for example it may be possible to move the computation of `min(A)` out of a loop.

A new optimization has been introduced to ensure that a recursive function that builds a sequence by incremental append operations now has linear performance: the time taken, and the memory used, are both proportional to the length of the sequence (and to the number of recursive calls). Note that it is useful to write such functions to be tail recursive. The optimization typically operates when a function returns a result that is obtained by appending to the sequence supplied as the argument. This optimization makes use of a new sequence representation (`ShareableSequence`) that allows many sequences to share the same underlying list in memory, provided that the value of each of the sequences is a leading sublist of this underlying list.

In an expression such as `A and f:call(P)`, the call on `f:call()` is now a candidate for tail-call optimization. This is achieved by rewriting the expression `A and B` as `if (A) then B else false()`.

The `XMLChar` module, originally taken from Xerces 2.5.0, has been replaced by the version from Xerces 2.7.1. This offers improved speed of initialization. The `XML11Char` from Xerces 2.7.1 is also now included. All checking of XML names is now done using a `NameChecker` obtained from the `Configuration` object; this uses the XML 1.0 or XML 1.1 rules depending on the XML version setting.

Next