Adds a (currently very conservative, based on design meeting feedback) limit on how large of a tuple type we will create through spread normalization.

On each recursion, checkingT['length'] kicks offresolveObjectTypeMembers, which instantiates base types. Recall that anN-tuple is modeled something like

interfaceTuple<T0,T1, ...,TN>extendsArray<T0|T1| ...|TN>{0:T0;1:T1;// ...}

So in order to instantiate the base type, we have to pass along an array type mapper mapping T0...TN to the “type arguments,” or the element types of this particular tuple. So even though, in this case, every element type isany, the source side of the mapper is anN+1-length array filled withN unique type parameter identities (plus thethis type parameter). When we instantiate each union constituentT0 | T1 | ... | TN, we have to search through thatN-length array of sources, even though in this case we’ll always findany in the target side.

So you can imagine by the time we get to the 15th recursion or so, this is starting to take a while, and we’re creating quite a lot of type parameter identities. Pretty much all the time was being spent in this spiral of trying to instantiate the Array base type.

Fixes#41771