fix: performance improvement and shuffling limited queries #3
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.
The original$O(n^2)$ performance ($n$ being the number of items to shuffle).$O(n)$ . Crucial when shuffling medium to big collections.
shuffleArray
andgetRandomItems
functions had a quadratic performance, mainly caused bysplice
in the loop, resulting in aWith the these updated ones (credit to this awesome blog post about Fisher-Yates Shuffle) we get a much better linear performance of
This also fixes the fact that when doing a limited query, the output would have still being sorted by
id
s in alphanumeric order.Detailed Explanation
A slightly in-depth explanation on the performance improvement that this PR introduces (mainly discussed privately on Discord):