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.
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
New API to convert directly between lazy and short bytestrings #619
base: master
Are you sure you want to change the base?
New API to convert directly between lazy and short bytestrings #619
Changes from all commits
0158b8c
File filter
Filter by extension
Conversations
Jump to
There are no files selected for viewing
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Would it be better not to pass
size
, but rather extract it every time withgetSizeofMutableByteArray#
? Admittedly this would require IO before any pattern-matching begins...There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
This is a purely internal helper function, we could even move it into a
where
clause, to really make sure there are no unexpected calls. So I don't think such caution is warranted, I was much more concerned with handling integer arithmetic overflow, which I believe is handled correctly.There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
...or we could just say
let newUsed = checkedAdd "Short.lazyToShort" used len
. (This does have the marginal downside of checking for overflow in the no-new-buffer case.)Another option is to allow
used+len
to signed-overflow, but checkintToWord newUsed <= intToWord size
since it cannot unsigned-overflow.There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
(size + size `quot` 2)
overflows and becomes negative, this will behave degenerately and cause O(n²) allocation for inputs that narrowly fit into theInt#
size limit.(`div` 2)
will compile to an arithmetic right shift; signed(`quot` 2)
needs an extra shift and add/subtract to fix up negative odd inputs. (Or(`shiftR` 1)
makes the performance question much easier.)