I'd like to compare the dicts by content, so I thought this can be done by creating an unordered hash of the item tuples.
What is the most elegant solution for that?
I was thinking about XORing all individual hashes, but maybe there is another ready-made solution?
EDIT:
I have nested data structures. Some classes contain dicts. These classes can be aggregated to sets. So to compare the sets with the predefined set comparison I have to implement both __eq__
(which is easy) and __hash__
(which is my question) for my dict-classes?!