-
Notifications
You must be signed in to change notification settings - Fork 28
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.
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
(HashIndices([1, missing]) == HashIndices([1, missing])) == missing? #11
Comments
what is the purpose of combining those with |
This is due to two lines of thoughts:
|
Yes, I'd like to implement @tkf I'm sorting through some ordering stuff at the moment - dId you have thoughts on |
You mean after #13 (so Yeah, if the elements of the container do not distinguish |
In #13 I'm adding |
Writing JuliaLang/julia#34744 (comment), I started wonder if
==
on your set types (AbstractIndices
) would be defined in terms ofstrong_equal(a, b) = isequal(a, b) && a == b
as they are the mapping to itself? Also, wouldn't this solve the O(N^2) problem for defining==
you mentioned?The text was updated successfully, but these errors were encountered: