-
Notifications
You must be signed in to change notification settings - Fork 247
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
define pairs for Cons #580
Comments
And this allows Base.Iterators.Reverse(x::Cons) = reverse(x) |
Oh thats pretty cunning. |
Yes. Good eye. I wonder then if |
I wonder if |
we have a few other packages for this kind of list. It might be a good idea to remove this from DataStructures and leaver it to a package that is more into that kind of collection; |
So, in the above discussion should I infer that |
No decision has been made here. Yet.
|
I think 2nd option would be best in this scenario |
It might be worth mentioning this in a Julia language issue. |
@jlapeyre feel encouraged to open such an issue and link to here |
With this definition
findall
,findfirst
, etc. will work with linked lists.Or maybe even, since there seems to be no default method for
pairs
,(Of course, the latter would go in Julia, not a package)
The text was updated successfully, but these errors were encountered: