Optimize Money#split(n)
for large n
#287
Merged
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.
When passing a very large number to split, it result in allocating between 2 and 3 arrays of such size. e..g
Money.new(1_000_000).split(1_000_000)
allocates an array of size 1M, then concat it with an empty array, which cause Ruby to allocate another array of 1M entries.All this cause two
8MB
mallocs, which doesn't sound like that much but if done a few times is likely to trigger Ruby GC.Instead we can return a small enumerable that will simply act like an array, but won't actually materialize it.