W3C home > Mailing lists > Public > public-qt-comments@w3.org > July 2013

[Bug 22839] New: [XP3.1] Ordering on binary types

From: <bugzilla@jessica.w3.org>
Date: Tue, 30 Jul 2013 19:33:26 +0000
To: public-qt-comments@w3.org
Message-ID: <bug-22839-523@http.www.w3.org/Bugs/Public/>

            Bug ID: 22839
           Summary: [XP3.1] Ordering on binary types
    Classification: Unclassified
           Product: XPath / XQuery / XSLT
           Version: Working drafts
          Hardware: PC
                OS: All
            Status: NEW
          Severity: normal
          Priority: P2
         Component: XPath 3.1
          Assignee: jonathan.robie@gmail.com
          Reporter: mike@saxonica.com
        QA Contact: public-qt-comments@w3.org

The types xs:hexBinary and xs:base64Binary are currently unordered (that is,
the operators le/ge/lt/gt are not defined). It is clearly possible to define an
ordering for these types.

Making the types ordered is desirable for three reasons:

(a) orthogonality: it's an arbitrary restriction and we shouldn't have
arbitrary restrictions.

(b) a new function collation-key() is being introduced under the maps proposal.
At present this only supports equality matching, but there are obvious use
cases for ordered collation keys. Collation keys are often binary (e.g. in the
UCA algorithm for generating collation keys; this will generate a requirement
for ordering of binary values

(c) an EXPath initiative is currently defining a library of functions for
handling binary data. It is possible for such a community initiative to define
new functions, but not to define new operators. The existence of such a
function library will make use of the binary data types more popular, and
generate a demand for doing magnitude comparisons.

You are receiving this mail because:
You are the QA Contact for the bug.
Received on Tuesday, 30 July 2013 19:33:28 UTC

This archive was generated by hypermail 2.4.0 : Friday, 17 January 2020 16:57:43 UTC