W3C home > Mailing lists > Public > www-xml-schema-comments@w3.org > July to September 2007

[Bug 2947] Datatypes 2006-02-17 WD: what makes an order trivial?

From: <bugzilla@wiggum.w3.org>
Date: Thu, 20 Sep 2007 18:04:52 +0000
To: www-xml-schema-comments@w3.org
Message-Id: <E1IYQOS-0003LO-P5@wiggum.w3.org>


------- Comment #7 from davep@iit.edu  2007-09-20 18:04 -------
(In reply to comment #5)

> A wording proposal for this issue is attached

>   3 remove or recast the places where the spec currently 
>     says that an order relation is specified for all value 
>     spaces, to say that an order relation is specified for
>     some value spaces and not for others.

Inasmuch as the proposal now only gives a specification of an order relation
for the value spaces of those datatypes which accept an order-requiring
constraining facet, we should remove the fancy determination of the ordered
facet for unions, instead making it false for all unions.

Also, we should not say in 2.1 in the definition of datatype that each datatype
has "a small collection of functions, relations, and procedures associated with
the datatype.  Included are equality and order relations on the value space"
since not all datatypes will have an associated order relation.

When we decided to uniformly give each datatype an order, the trivial order if
none other was specified, I searched to find all places where we said not all
datatypes had an order.  Now we need to search to find all the places where we
say or use the fact that all datatypes do have an order, possibly trivial.
Received on Thursday, 20 September 2007 18:04:54 UTC

This archive was generated by hypermail 2.3.1 : Wednesday, 7 January 2015 14:50:06 UTC