perf(array): pre-size Ap and Flatten results#190
Draft
nishantmehta wants to merge 1 commit into
Draft
Conversation
array.Ap and array.Flatten both routed through MonadChain, which grows the result from nil and (for Ap) allocates an intermediate slice per function. Their output lengths are known up front -- len(fab)*len(fa) for the applicative cartesian product and the sum of inner lengths for flatten -- so build the result in a single pre-sized allocation. Benchmarks (added): BenchmarkAp 6 -> 1 allocs/op (-83%), 155 -> 66 ns/op BenchmarkFlatten 3 -> 1 allocs/op (-67%), 51 -> 24 ns/op Signed-off-by: Nishant Mehta <nishantmehta.n@gmail.com>
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
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.
Problem
array.Apandarray.Flattenboth route throughMonadChain, which grows theresult from
nil;Apadditionally allocates an intermediate slice per function(via
MonadMap).Change
Both output lengths are known up front —
len(fab)*len(fa)for the applicativecartesian product, and the sum of the inner slice lengths for flatten — so the
result is built in a single pre-sized allocation. Element order and values are
unchanged (the change is in
array/generic, which the publicarray.Ap/array.Flattendelegate to).Result
Benchmarks (added),
-benchmem -count=6:ApbeforeApafterFlattenbeforeFlattenafter−83% / −67% allocations respectively.
Testing
go test -race ./array/...passes (existing tests cover element order/values).BenchmarkApandBenchmarkFlattenwere added to demonstrate and guard the win.