Differences between version 4 and revision by previous author of MuenchianMethod.
Other diffs: Previous Major Revision, Previous Revision, or view the Annotated Edit History
| Newer page: | version 4 | Last edited on Sunday, October 26, 2003 7:39:12 am | by AristotlePagaltzis | Revert |
| Older page: | version 3 | Last edited on Friday, August 22, 2003 10:42:33 am | by DavidHallett | Revert |
@@ -1,11 +1,11 @@
-The [
MuenchianMethod]
is a technique in [XSLT], which could probably also be applied to other data-centric [FunctionalLanguages]
.
+The MuenchianMethod is a technique in [XSLT], which could probably also be applied to other data-centric Category:FunctionalProgrammingLanguages
.
-In [XSLT] a common problem is how to fire an action exactly for each class of element seen. This is difficult in [XSLT] because it is a purely functional language and ``
remembering''
that you've already seen an element of a class is impossible. There are certain highly recursive methods to solve the problem but these are incredibly inefficient, because (somewhat unusually for a functional language) XSLT is optimised not for recursion but application of templates
to nodes in the [XML] tree.
+In [XSLT] a common problem is how to fire an action exactly once
for each class of element seen. This is difficult in [XSLT] because it is a purely functional language and "
remembering"
that you've already seen an element of a class is impossible. There are certain highly recursive methods to solve the problem but these are incredibly inefficient, because (somewhat unusually for a functional language) [
XSLT]
is optimised not for recursion but for
application of [Template]s
to nodes in the [XML] tree.
-The [
MuenchianMethod]
avoids this problem using a key defined to classify elements into a class. Keys in XSLT are like indexes in SQL-
--they are efficient.
+The MuenchianMethod avoids this problem using a key defined to classify elements into a class. Keys in [
XSLT]
are like indexes in SQL -- they are efficient. A good introduction to the MuenchianMethod can be [found on the web | http://www.jenitennison.com/xslt/grouping/index.xml]
.
-The
following creates a key called kName based on the name of each node. The template then matches only those nodes which are the first node in the key with that name.
+As an example, the
following code
creates a key called kName based on the name of each node. The template then matches only those nodes which are the first node in the key with that name.
...
<xsl:key name="kName" match="*" use="name()"/>
...
@@ -18,6 +18,4 @@
Element name: <xsl:value-of select="name()"/>
<xsl:apply-templates/>
</xsl:template>
...
-
-A good introduction to the [MuenchianMethod]: [http://www.jenitennison.com/xslt/grouping/index.xml]
