Use MathJax format for complexity annotations #830
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
treeowl
reviewed
Apr 13, 2022
treeowl
reviewed
Apr 13, 2022
treeowl
reviewed
Apr 13, 2022
|
So much work! Thanks a lot! I haven't reviewed everything here, but it mostly looks great. I had a few comments. |
It isn't that much work, just a few search & replace operations. Just someone had to do it. |
|
@treeowl is there anything left to do before this can be merged? |
|
No, I just forgot. |
|
Thanks again. |
josephcsible
added a commit
to josephcsible/containers
that referenced
this pull request
Jul 23, 2022
treeowl
pushed a commit
that referenced
this pull request
Sep 5, 2022
tomsmeding
added a commit
to tomsmeding/haskell-containers
that referenced
this pull request
Jul 9, 2023
As discussed in haskell#870, the complexities for union, difference, etc. on Set and Map were changed in haskell#830 to fix some partiality in the expressions, but along the way new partiality was introduced, and useful special cases like m = 1 get incorrect complexity values from the new formulas. The original formula was as stated in the original paper: https://dl.acm.org/doi/10.1145/322123.322127 and this holds for 0 < m <= n, which seems sufficient to me. (The m=0 case is excluded, but for m=0 nothing needs to be done anyway. This contrary to the m=1 case, in which useful work with very specific complexity (namely, O(log(n))) needs to be done.) This commit reverts all occurrences of the modified complexity formula back to the original one.
treeowl
pushed a commit
that referenced
this pull request
Sep 27, 2023
As discussed in #870, the complexities for union, difference, etc. on Set and Map were changed in #830 to fix some partiality in the expressions, but along the way new partiality was introduced, and useful special cases like m = 1 get incorrect complexity values from the new formulas. The original formula was as stated in the original paper: https://dl.acm.org/doi/10.1145/322123.322127 and this holds for 0 < m <= n, which seems sufficient to me. (The m=0 case is excluded, but for m=0 nothing needs to be done anyway. This contrary to the m=1 case, in which useful work with very specific complexity (namely, O(log(n))) needs to be done.) This commit reverts all occurrences of the modified complexity formula back to the original one.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Closes #731.