Skip to content

[generics-rep] Add algorithmic complexity notes #244

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
Open
matthewleon opened this issue Jan 29, 2018 · 2 comments
Open

[generics-rep] Add algorithmic complexity notes #244

matthewleon opened this issue Jan 29, 2018 · 2 comments
Labels
type: documentation Improvements or additions to documentation.

Comments

@matthewleon
Copy link
Contributor

Haven't really looked at the other generics, but for Enum, at least, it would be nice to have a note regarding the algorithmic complexity of the generic methods.
@matthewleon matthewleon changed the title Add algorithmic complexity notes on Enum Add algorithmic complexity notes Jan 29, 2018
@matthewleon
Copy link
Contributor Author

Just looked at Bounded, and that one might also surprise people.

@matthewleon
Copy link
Contributor Author

(though I guess in the case of Bounded, the algorithm only runs when the VM first executes the script? Haven't checked.)

@JordanMartinez JordanMartinez changed the title Add algorithmic complexity notes [generics-rep] Add algorithmic complexity notes Dec 26, 2020
@JordanMartinez JordanMartinez transferred this issue from purescript-deprecated/purescript-generics-rep Dec 26, 2020
@JordanMartinez JordanMartinez added the type: documentation Improvements or additions to documentation. label Dec 1, 2021
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
type: documentation Improvements or additions to documentation.
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@matthewleon @JordanMartinez