You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
This issue is splintered off from #16 to contain discussion on issues that pertain to generic order relations specifically (e.g. generic interfaces like the proposed gen:orderable, conventions for order-related APIs). The other one will continue to be used for equality-oriented discussion. The composite relations <= and >= and any attendant discussion around the relationship between order and equality could be carried on in either issue as the discussion warrants.
The text was updated successfully, but these errors were encountered:
If we are doing changes to how hashing is done, I'd like to see the hash code method/function accept a hasher object. This would eliminate the need for providing a hash and a secondary hash function. I also think this style of hashing is easier to implement for individual objects.
The other thing we should think about is how to handle order relations for inexact numbers. I assume Scheme/Racket already have ways to do this, but this could be a good time to consider how/if partial orders should be supported.
See RRFI [Draft]: Equality and Order Relations Interface
This issue is splintered off from #16 to contain discussion on issues that pertain to generic order relations specifically (e.g. generic interfaces like the proposed
gen:orderable
, conventions for order-related APIs). The other one will continue to be used for equality-oriented discussion. The composite relations <= and >= and any attendant discussion around the relationship between order and equality could be carried on in either issue as the discussion warrants.The text was updated successfully, but these errors were encountered: