We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
It would be very helpful to implement isequal and hash in a fast efficient manner since in many uses Element instances are used as keys.
For example: Base.hash(elm::Element) = hash(elm.number) Base.isequal(elm1::Element,elm2::Element) = elm1.number==elm2.number
Base.hash(elm::Element) = hash(elm.number)
Base.isequal(elm1::Element,elm2::Element) = elm1.number==elm2.number
and maybe also
Base.isless(elm1::Element, elm2::Element) = elm1.number < elm2.number
The text was updated successfully, but these errors were encountered:
A PR would be welcome.
Sorry, something went wrong.
Can someone close this, since it was done in #28?
No branches or pull requests
It would be very helpful to implement isequal and hash in a fast efficient manner since in many uses Element instances are used as keys.
For example:
Base.hash(elm::Element) = hash(elm.number)
Base.isequal(elm1::Element,elm2::Element) = elm1.number==elm2.number
and maybe also
Base.isless(elm1::Element, elm2::Element) = elm1.number < elm2.number
The text was updated successfully, but these errors were encountered: