This is the mail archive of the
xsl-list@mulberrytech.com
mailing list .
RE: [sly] Minimum value
- From: Dimitre Novatchev <dnovatchev at yahoo dot com>
- To: xsl-list at lists dot mulberrytech dot com
- Date: Fri, 20 Sep 2002 22:03:54 -0700 (PDT)
- Subject: [xsl] RE: [sly] Minimum value
- Reply-to: xsl-list at lists dot mulberrytech dot com
--- "Avula, Raj" <RAvula at firstam dot com> wrote:
> That's really great!
> I was really thinking of writing recursive templates to this.
>
>
> Thanks,
> Raja..
>
>
> -----Original Message-----
> From: Marrow [mailto:marrow@marrowsoft.com]
> Sent: Friday, September 20, 2002 2:17 PM
> To: xsl-list@lists.mulberrytech.com
> Subject: RE: [xsl] Minimum value
>
>
> Hi,
>
> Try...
>
> <xsl:value-of select="//value[not(. > //value)]"/>
>
> (replace the // with the full path as required)
Yes, it is great that XPath has the power to specify the minimum of a
node-set just in one expression.
However, this often comes at a price. In this case the time complexity
(speed-related) is O(n^2), which is better not used in
industrial-strength applications.
You can use a generic "minimum" template from the FXSL library (O(n)),
or you can code your own recursive named template with the same linear
complexity.
The FXSL "minimum" template allows a "less-than" function to be passed
as a parameter, thus it implements finding the minimum over any set
that has an ordering relation "<=".
=====
Cheers,
Dimitre Novatchev.
http://fxsl.sourceforge.net/ -- the home of FXSL
__________________________________________________
Do you Yahoo!?
New DSL Internet Access from SBC & Yahoo!
http://sbc.yahoo.com
XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list