Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

关于unorderset_set的比较操作符 #130

Closed
wz1114841863 opened this issue Apr 1, 2023 · 2 comments
Closed

关于unorderset_set的比较操作符 #130

wz1114841863 opened this issue Apr 1, 2023 · 2 comments

Comments

@wz1114841863
Copy link

这里为什么用了equal_range_multi函数，这个函数是用来查键值出来出现的迭代器区间，但hashtable本身并没有实现==，是否应该使用迭代器去逐元素比较
friend bool operator==(const unordered_multiset &lhs, const unordered_multiset &rhs) { return lhs.ht_.equal_range_multi(rhs.ht_); }
@Adeshen
Copy link

Adeshen commented Apr 1, 2023 via email

@myc13381
Copy link

同问，不知这是为何

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
3 participants
@wz1114841863 @Adeshen @myc13381