-
Notifications
You must be signed in to change notification settings - Fork 10
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
Maybe make a traverse test #24
Comments
|
Also, afaiu |
I think For traversals... I'm not sure how worth it that is. Often times the function being ran will have more overhead than the traversal itself. But feel free to come up with an interesting test. 👌 |
Yes, since I like folds & traversals & between the two - traversal would be the most direct test of data type spine traverse. With laziness, If only nomeata/ghc-heap-view#36 merged so BTW this may be useful in checking the benchmarks also: https://www.youtube.com/watch?v=I4lnCG18TaY |
You should use IO to do the traversal if anything. I think |
Ok. I would look into |
traverse pure
probably suitable to be used for data structure spine traversal "in the data-type-recommended way".Maybe there even more idiomatic way to do it.
Maybe
traverse (const $ Identity ())
would ensure nudging Haskell to not manipulating, maybe even not looking into values at all.As I am interested to see how data structure spine traversing goes in which data types to understand the impact of the design of data structures on spine traversal & so fold.
The text was updated successfully, but these errors were encountered: