This repository has been archived by the owner on Oct 1, 2024. It is now read-only.
Return early in GraphQL fill for primitive partial #2701
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.
Description
Optimises the GraphQL filler by returning early in the
createValue
function if we have a concrete partial value.I was profiling some slower tests in admin and found that a lot of the time was spent calling faker's
seed
method. This is done with a stable seed for the particular branch/leaf node on the GraphQL document so that the random values for each node are stable. The re-seeding of the faker instance is slow, because it needs to reinitialise the mersenne twister that is used for RNG.For large lists of known primitive values, such as currency or country codes, or other arrays of enums, which in the admin might be 200+ elements long for country codes, this becomes a performance issue. We are reseeding the faker instance for each element, even when not consuming it.
Another optimisation and some thoughts on random data in general:
#2700