On 9/4/07, "Martin v. Löwis" <[EMAIL PROTECTED]> wrote: > > Oh, and another thing: the items views can contain unhashable values > > That, of course, could be fixed: if the key-value pairs would only > hash by key (ignoring the value), they would remain hashable.
How would that help? The key/value pairs are ordinary tuples, so you still wouldn't be able to look them up in another set, nor would you be able to represent d.items() & d.items() as a regular set or frozenset instance. What use case are you thinking of that this would address? -- --Guido van Rossum (home page: http://www.python.org/~guido/) _______________________________________________ Python-3000 mailing list [email protected] http://mail.python.org/mailman/listinfo/python-3000 Unsubscribe: http://mail.python.org/mailman/options/python-3000/archive%40mail-archive.com
