W3C home > Mailing lists > Public > public-qt-comments@w3.org > September 2003

RE: ORA-FO-UNORDERED 15.1.15 fn:unordered

From: Oliver Becker <obecker@informatik.hu-berlin.de>
Date: Thu, 25 Sep 2003 14:25:38 +0200 (MEST)
Message-Id: <200309251225.h8PCPcU5026891@mail.informatik.hu-berlin.de>
To: public-qt-comments@w3.org

> It is a function! It returns a permutation of its input.

It seems my misunderstanding comes from the expectation that a function
is always well-defined, or at least determinate in a way that if a = b 
then f(a) = f(b)
Obviously that's not the case for fn:unordered

> It's only difference from other functions is in its motivation: it exists in
> order to be optimized.

I'm not sure if I'm the only one with this problem of understanding.
An explanatory note would be of great benefit.

Thanks for the enlightenment,

|  ob|do        Dipl.Inf. Oliver Becker                             |
|  --+--        E-Mail: obecker@informatik.hu-berlin.de             |
|  op|qo        WWW:    http://www.informatik.hu-berlin.de/~obecker |
Received on Thursday, 25 September 2003 08:25:40 UTC

This archive was generated by hypermail 2.4.0 : Friday, 17 January 2020 16:56:49 UTC