Can not compare std::unorded_set with custom KeyEqual

烈酒焚心 提交于 2021-02-07 06:12:09

问题


The following program does not compile. But If I do not comment out operator==, it compiles. Why operator== is still needed when I already provide FooEqual

#include <cstddef>
#include <unordered_set>

struct Foo {
};

struct FooHasher {
  size_t operator()(const Foo&) const {
    return 1;
  }
};

struct FooEqual {
  bool operator()(const Foo& lhs, const Foo& rhs) const {
    return true;
  }
};

// bool operator==(const Foo& lhs, const Foo& rhs) {
//   return true;
// }

int main() {
  std::unordered_set<Foo, FooHasher, FooEqual> s1;
  std::unordered_set<Foo, FooHasher, FooEqual> s2;
  (void)(s1 == s2);
  return 0;
}

回答1:


"23.2.5 Unordered associative containers" states:

Two unordered containers a and b compare equal if a.size() == b.size() and, for every equivalent=key group [Ea1,Ea2) obtained from a.equal_range(Ea1), there exists an equivalent-key group [Eb1,Eb2) obtained from b.equal_range(Ea1), such that distance(Ea1, Ea2) == distance(Eb1, Eb2) and is_permutation(Ea1, Ea2, Eb1) returns true.

Stripping this down, it all comes down to the equality of unordered containers being defined in terms of std::is_permutation().

The important part is that this references the three argument form of std::is_permutation(), and not the four argument form!

In other words, the whole house of cards ends up being reduced to the default operator==, for the contents of the unordered container, rather than the container's official comparison function.

That's my read on this.




回答2:


According to http://en.cppreference.com/w/cpp/container/unordered_set/operator_cmp you do in fact need the operator== for comparison (I don't have access to the standard right now - I'll try to update with the specific quote sometime tomorrow):

The behavior is undefined if Key is not EqualityComparable.

The behavior is also undefined if Hash and KeyEqual do not have the same behavior on lhs and rhs or if the equality comparison operator for Key is not a refinement of the partition into equivalent-key groups introduced by KeyEqual (that is, if two keys that compare equal fall into different partitions)



来源:https://stackoverflow.com/questions/36167764/can-not-compare-stdunorded-set-with-custom-keyequal

易学教程内所有资源均来自网络或用户发布的内容,如有违反法律规定的内容欢迎反馈
该文章没有解决你所遇到的问题?点击提问,说说你的问题,让更多的人一起探讨吧!