Skip to content
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.

Sign up for GitHub

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

Jump to bottom

Define toListOf more efficiently using Endo? #105

Closed
shachaf opened this issue Nov 21, 2012 · 1 comment
Closed

Define toListOf more efficiently using Endo? #105

shachaf opened this issue Nov 21, 2012 · 1 comment
Assignees
@ekmett
Labels
performance
Milestone
3.4

Comments

@shachaf
Copy link
Collaborator

shachaf commented Nov 21, 2012

toListOf l = foldrOf l (:) [] is asymptotically more efficient than the current definition for e.g. a left-biased tree.
@ekmett
Copy link
Owner

ekmett commented Nov 21, 2012

Sold.

ekmett added a commit that referenced this issue Nov 21, 2012
@ekmett
Switched to the asymptotically more efficient toListOf to close issue
50bada2 
#105
@ekmett ekmett closed this as completed Nov 21, 2012
@ghost ghost assigned ekmett Nov 21, 2012
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@ekmett ekmett

Labels
performance
Projects
None yet
Milestone
3.4
Development

No branches or pull requests
2 participants
@shachaf @ekmett