From: Norman Walsh <Norman.Walsh@Sun.COM>

Date: Tue, 26 Oct 2004 15:54:41 -0400

To: Elliotte Rusty Harold <elharo@metalab.unc.edu>

Cc: www-tag@w3.org

Message-id: <87lldti7b2.fsf@nwalsh.com>

Date: Tue, 26 Oct 2004 15:54:41 -0400

To: Elliotte Rusty Harold <elharo@metalab.unc.edu>

Cc: www-tag@w3.org

Message-id: <87lldti7b2.fsf@nwalsh.com>

/ Elliotte Rusty Harold <elharo@metalab.unc.edu> was heard to say: | The finding states: | | Unordered lists (such as the [attributes] property) are compared | pairwise but without respect to order. In other words, two unordered | lists "A" and "B" are the same if and only if there exists a set of | pairs of items, one from each list, such that the two items in each | pair are equal and no item from "A" or "B" appears in more than one | pair. It follows that they can only be the same if they are the same | length. | | I don't think this is quite correct. I agree with the intent but the | wording seems off. In particular given set (A, B, C, D) and set (1, 2, | 3, 4) I think the set of pairs {(A, 1)} could satisfy this if A and 1 | are equal even though B, C, D do not equal any of 2, 3, 4. To fix this | I think you need the additional constraint that every item from A and | B appears in exactly one pair rather than " no item from "A" or "B" | appears in more than one pair." Indeed. Thanks. Be seeing you, norm -- Norman.Walsh@Sun.COM / XML Standards Architect / Sun Microsystems, Inc. NOTICE: This email message is for the sole use of the intended recipient(s) and may contain confidential and privileged information. Any unauthorized review, use, disclosure or distribution is prohibited. If you are not the intended recipient, please contact the sender by reply email and destroy all copies of the original message.Received on Tuesday, 26 October 2004 19:54:47 UTC

*
This archive was generated by hypermail 2.3.1
: Wednesday, 7 January 2015 15:32:43 UTC
*