Why must ID be Hashable? I think Equatable is enough for identification. DBs often use trees for indices instead of hash tables. Don't we want to make ID Comparable instead of Hashable in such cases? Even if ID is just Equatable in the standard library, we can make ID Hashabl...