-
Notifications
You must be signed in to change notification settings - Fork 3
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
Differentiate unconstrained lists vs. orderable? #1
Comments
I did a quick prototype and something like this seems to work:
with the actual comparable type broken out in the same folder:
This breaks the original |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Coming here emirpasic/gods#179 looking for a generic
Queue
(based on genericList
). The current List implementations are constrained byorderable
to allow forContains
andIndexOf
(maybe more). It would be nice if theorderable
Properties could be optional, i.e. part of a different type (OrderableList
?). Otherwise, the lists become useless for queues of uncomparable types like e.g.func()
.The text was updated successfully, but these errors were encountered: