Re: finding out distinct node/values

Doesn't this solution require the <name> elements to be ordered by
<name>'s text?

And, please, hit me over the head: where is the second (hidden?) loop
that would make this O(n^2)?

-W

On Wed, Feb 10, 2010 at 6:11 PM, Andrew Welch <andrew.j.welch@xxxxxxxxx>
wrote:
>
> Hi,
>
> > <xsl:stylesheet version="1.0"
> >  xmlns:xsl="http://www.w3.org/1999/XSL/Transform" >
> >  <xsl:template match="/">.
> >    <xsl:for-each select="/table/rows/row/name">
> >      <xsl:if test="not(. = preceding::name)">
> >        <xsl:copy-of select="."/>
>
> While this is perfectly fine, it's worth being aware that its On^2....
> in other words, as n (the number of elements that are selected)
> increases by 1, it will have to check every other element in the
> set.... which means it will perform badly for large values of n.
>
>
> --
> Andrew Welch
> http://andrewjwelch.com
> Kernow: http://kernowforsaxon.sf.net/