- From: Elliotte Rusty Harold <elharo@metalab.unc.edu>
- Date: Tue, 26 Oct 2004 15:24:43 -0400
- To: Norman Walsh <Norman.Walsh@Sun.COM>
- Cc: www-tag@w3.org
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."
--
Elliotte Rusty Harold
elharo@metalab.unc.edu
Effective XML (Addison-Wesley, 2003)
http://www.cafeconleche.org/books/effectivexml
http://www.amazon.com/exec/obidos/ISBN%3D0321150406/ref%3Dnosim/cafeaulaitA
Received on Tuesday, 26 October 2004 19:40:58 UTC