@zzzen/pyright-internal 1.2.0-dev.20240721 → 1.2.0-dev.20240804

package/dist/analyzer/tuples.js

@@ -0,0 +1,253 @@
+"use strict";
+/*
+ * tuples.ts
+ * Copyright (c) Microsoft Corporation.
+ * Licensed under the MIT license.
+ * Author: Eric Traut
+ *
+ * Provides special-case logic for type analysis of tuples.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getSlicedTupleType = exports.adjustTupleTypeArgs = exports.assignTupleTypeArgs = void 0;
+const localize_1 = require("../localization/localize");
+const types_1 = require("./types");
+const typeUtils_1 = require("./typeUtils");
+// Assigns the source type arguments to the dest type arguments. It assumed
+// the the caller has already verified that both the dest and source are
+// tuple classes.
+function assignTupleTypeArgs(evaluator, destType, srcType, diag, destConstraints, srcConstraints, flags, recursionCount) {
+    var _a, _b;
+    const destTypeArgs = [...((_a = destType.priv.tupleTypeArgs) !== null && _a !== void 0 ? _a : [])];
+    const srcTypeArgs = [...((_b = srcType.priv.tupleTypeArgs) !== null && _b !== void 0 ? _b : [])];
+    if (adjustTupleTypeArgs(evaluator, destTypeArgs, srcTypeArgs, flags)) {
+        for (let argIndex = 0; argIndex < srcTypeArgs.length; argIndex++) {
+            const entryDiag = diag === null || diag === void 0 ? void 0 : diag.createAddendum();
+            const destArgType = destTypeArgs[argIndex].type;
+            const srcArgType = srcTypeArgs[argIndex].type;
+            // Handle the special case where the dest is a TypeVarTuple
+            // and the source is a `*tuple[Any, ...]`. This is allowed.
+            if ((0, types_1.isTypeVarTuple)(destArgType) &&
+                destArgType.priv.isUnpacked &&
+                !destArgType.priv.isInUnion &&
+                (0, typeUtils_1.isTupleGradualForm)(srcArgType)) {
+                return true;
+            }
+            if (!evaluator.assignType(destArgType, srcArgType, entryDiag === null || entryDiag === void 0 ? void 0 : entryDiag.createAddendum(), destConstraints, srcConstraints, flags, recursionCount)) {
+                if (entryDiag) {
+                    entryDiag.addMessage(localize_1.LocAddendum.tupleEntryTypeMismatch().format({
+                        entry: argIndex + 1,
+                    }));
+                }
+                return false;
+            }
+        }
+    }
+    else {
+        const isDestIndeterminate = destTypeArgs.some((t) => t.isUnbounded || (0, types_1.isTypeVarTuple)(t.type));
+        if (srcTypeArgs.some((t) => t.isUnbounded || (0, types_1.isTypeVarTuple)(t.type))) {
+            if (isDestIndeterminate) {
+                diag === null || diag === void 0 ? void 0 : diag.addMessage(localize_1.LocAddendum.tupleSizeIndeterminateSrcDest().format({
+                    expected: destTypeArgs.length - 1,
+                }));
+            }
+            else {
+                diag === null || diag === void 0 ? void 0 : diag.addMessage(localize_1.LocAddendum.tupleSizeIndeterminateSrc().format({
+                    expected: destTypeArgs.length,
+                }));
+            }
+        }
+        else {
+            if (isDestIndeterminate) {
+                diag === null || diag === void 0 ? void 0 : diag.addMessage(localize_1.LocAddendum.tupleSizeMismatchIndeterminateDest().format({
+                    expected: destTypeArgs.length - 1,
+                    received: srcTypeArgs.length,
+                }));
+            }
+            else {
+                diag === null || diag === void 0 ? void 0 : diag.addMessage(localize_1.LocAddendum.tupleSizeMismatch().format({
+                    expected: destTypeArgs.length,
+                    received: srcTypeArgs.length,
+                }));
+            }
+        }
+        return false;
+    }
+    return true;
+}
+exports.assignTupleTypeArgs = assignTupleTypeArgs;
+// Adjusts the source and/or dest type arguments list to attempt to match
+// the length of the src type arguments list if the dest or source contain
+// entries with indeterminate length or unpacked TypeVarTuple entries.
+// It returns true if the source is potentially compatible with the dest
+// type, false otherwise.
+function adjustTupleTypeArgs(evaluator, destTypeArgs, srcTypeArgs, flags) {
+    const destUnboundedOrVariadicIndex = destTypeArgs.findIndex((t) => t.isUnbounded || (0, types_1.isTypeVarTuple)(t.type));
+    const srcUnboundedIndex = srcTypeArgs.findIndex((t) => t.isUnbounded);
+    const srcVariadicIndex = srcTypeArgs.findIndex((t) => (0, types_1.isTypeVarTuple)(t.type));
+    if (srcUnboundedIndex >= 0) {
+        if ((0, types_1.isAnyOrUnknown)(srcTypeArgs[srcUnboundedIndex].type)) {
+            // If the source contains an unbounded Any, expand it to match the dest length.
+            const typeToReplicate = srcTypeArgs.length > 0 ? srcTypeArgs[srcUnboundedIndex].type : types_1.AnyType.create();
+            while (srcTypeArgs.length < destTypeArgs.length) {
+                srcTypeArgs.splice(srcUnboundedIndex, 0, { type: typeToReplicate, isUnbounded: true });
+            }
+            if (srcTypeArgs.length > destTypeArgs.length) {
+                srcTypeArgs.splice(srcUnboundedIndex, 1);
+            }
+        }
+        else if (destUnboundedOrVariadicIndex < 0) {
+            // If the source contains an unbounded type but the dest does not, it's incompatible.
+            return false;
+        }
+    }
+    // If the dest contains an unbounded Any, expand it to match the source length.
+    if (destUnboundedOrVariadicIndex >= 0 &&
+        destTypeArgs[destUnboundedOrVariadicIndex].isUnbounded &&
+        (0, types_1.isAnyOrUnknown)(destTypeArgs[destUnboundedOrVariadicIndex].type)) {
+        while (destTypeArgs.length < srcTypeArgs.length) {
+            destTypeArgs.splice(destUnboundedOrVariadicIndex, 0, destTypeArgs[destUnboundedOrVariadicIndex]);
+        }
+    }
+    // Remove any optional parameters from the end of the two lists until the lengths match.
+    while (srcTypeArgs.length > destTypeArgs.length && srcTypeArgs[srcTypeArgs.length - 1].isOptional) {
+        srcTypeArgs.splice(srcTypeArgs.length - 1, 1);
+    }
+    while (destTypeArgs.length > srcTypeArgs.length && destTypeArgs[destTypeArgs.length - 1].isOptional) {
+        destTypeArgs.splice(destTypeArgs.length - 1, 1);
+    }
+    const srcArgsToCapture = srcTypeArgs.length - destTypeArgs.length + 1;
+    let skipAdjustSrc = false;
+    // If we're doing reverse type mappings and the source contains a TypeVarTuple,
+    // we need to adjust the dest so the reverse type mapping assignment
+    // can be performed.
+    if ((flags & 2 /* AssignTypeFlags.ReverseTypeVarMatching */) !== 0) {
+        const destArgsToCapture = destTypeArgs.length - srcTypeArgs.length + 1;
+        if (srcVariadicIndex >= 0 && destArgsToCapture >= 0) {
+            // If the only removed arg from the dest type args is itself a variadic,
+            // don't bother adjusting it.
+            const skipAdjustment = destArgsToCapture === 1 && (0, types_1.isTypeVarTuple)(destTypeArgs[srcVariadicIndex].type);
+            const tupleClass = evaluator.getTupleClassType();
+            if (!skipAdjustment && tupleClass && (0, types_1.isInstantiableClass)(tupleClass)) {
+                const removedArgs = destTypeArgs.splice(srcVariadicIndex, destArgsToCapture);
+                // Package up the remaining type arguments into a tuple object.
+                const variadicTuple = types_1.ClassType.cloneAsInstance((0, typeUtils_1.specializeTupleClass)(tupleClass, removedArgs.map((typeArg) => {
+                    return {
+                        type: typeArg.type,
+                        isUnbounded: typeArg.isUnbounded,
+                        isOptional: typeArg.isOptional,
+                    };
+                }), 
+                /* isTypeArgExplicit */ true, 
+                /* isUnpackedTuple */ true));
+                destTypeArgs.splice(srcVariadicIndex, 0, {
+                    type: variadicTuple,
+                    isUnbounded: false,
+                });
+            }
+            skipAdjustSrc = true;
+        }
+    }
+    else {
+        if (destUnboundedOrVariadicIndex >= 0 && srcArgsToCapture >= 0) {
+            // If the dest contains a variadic element, determine which source
+            // args map to this element and package them up into an unpacked tuple.
+            if ((0, types_1.isTypeVarTuple)(destTypeArgs[destUnboundedOrVariadicIndex].type)) {
+                const tupleClass = evaluator.getTupleClassType();
+                if (tupleClass && (0, types_1.isInstantiableClass)(tupleClass)) {
+                    const removedArgs = srcTypeArgs.splice(destUnboundedOrVariadicIndex, srcArgsToCapture);
+                    let variadicTuple;
+                    // If we're left with a single unpacked variadic type var, there's no
+                    // need to wrap it in a nested tuple.
+                    if (removedArgs.length === 1 && (0, types_1.isUnpackedTypeVarTuple)(removedArgs[0].type)) {
+                        variadicTuple = removedArgs[0].type;
+                    }
+                    else {
+                        // Package up the remaining type arguments into a tuple object.
+                        variadicTuple = types_1.ClassType.cloneAsInstance((0, typeUtils_1.specializeTupleClass)(tupleClass, removedArgs.map((typeArg) => {
+                            return {
+                                type: typeArg.type,
+                                isUnbounded: typeArg.isUnbounded,
+                                isOptional: typeArg.isOptional,
+                            };
+                        }), 
+                        /* isTypeArgExplicit */ true, 
+                        /* isUnpackedTuple */ true));
+                    }
+                    srcTypeArgs.splice(destUnboundedOrVariadicIndex, 0, {
+                        type: variadicTuple,
+                        isUnbounded: false,
+                    });
+                }
+                skipAdjustSrc = true;
+            }
+        }
+    }
+    if (!skipAdjustSrc && destUnboundedOrVariadicIndex >= 0 && srcArgsToCapture >= 0) {
+        // If possible, package up the source entries that correspond to
+        // the dest unbounded tuple. This isn't possible if the source contains
+        // an unbounded tuple outside of this range.
+        if (srcUnboundedIndex < 0 ||
+            (srcUnboundedIndex >= destUnboundedOrVariadicIndex &&
+                srcUnboundedIndex < destUnboundedOrVariadicIndex + srcArgsToCapture)) {
+            const removedArgTypes = srcTypeArgs.splice(destUnboundedOrVariadicIndex, srcArgsToCapture).map((t) => {
+                if ((0, types_1.isTypeVar)(t.type) && (0, types_1.isUnpackedTypeVarTuple)(t.type) && !t.type.priv.isInUnion) {
+                    return types_1.TypeVarType.cloneForUnpacked(t.type, /* isInUnion */ true);
+                }
+                return t.type;
+            });
+            srcTypeArgs.splice(destUnboundedOrVariadicIndex, 0, {
+                type: removedArgTypes.length > 0 ? (0, types_1.combineTypes)(removedArgTypes) : types_1.AnyType.create(),
+                isUnbounded: false,
+            });
+        }
+    }
+    return destTypeArgs.length === srcTypeArgs.length;
+}
+exports.adjustTupleTypeArgs = adjustTupleTypeArgs;
+// Given a tuple type and a slice expression, determines the resulting
+// type if it can be determined. If not, it returns undefined.
+function getSlicedTupleType(evaluator, tupleType, sliceNode) {
+    // We don't handle step values.
+    if (sliceNode.d.stepValue || !tupleType.priv.tupleTypeArgs) {
+        return undefined;
+    }
+    const tupleTypeArgs = tupleType.priv.tupleTypeArgs;
+    const startValue = getTupleSliceParam(evaluator, sliceNode.d.startValue, 0, tupleTypeArgs);
+    const endValue = getTupleSliceParam(evaluator, sliceNode.d.endValue, tupleTypeArgs.length, tupleTypeArgs);
+    if (startValue === undefined || endValue === undefined || endValue < startValue) {
+        return undefined;
+    }
+    const slicedTypeArgs = tupleTypeArgs.slice(startValue, endValue);
+    return types_1.ClassType.cloneAsInstance((0, typeUtils_1.specializeTupleClass)(tupleType, slicedTypeArgs));
+}
+exports.getSlicedTupleType = getSlicedTupleType;
+function getTupleSliceParam(evaluator, expression, defaultValue, tupleTypeArgs) {
+    let value = defaultValue;
+    if (expression) {
+        const valType = evaluator.getTypeOfExpression(expression).type;
+        if (!(0, types_1.isClassInstance)(valType) || !types_1.ClassType.isBuiltIn(valType, 'int') || !(0, typeUtils_1.isLiteralType)(valType)) {
+            return undefined;
+        }
+        value = valType.priv.literalValue;
+        const unboundedIndex = tupleTypeArgs.findIndex((typeArg) => typeArg.isUnbounded || (0, types_1.isTypeVarTuple)(typeArg.type));
+        if (value < 0) {
+            value = tupleTypeArgs.length + value;
+            if (unboundedIndex >= 0 && value <= unboundedIndex) {
+                return undefined;
+            }
+            else if (value < 0) {
+                return 0;
+            }
+        }
+        else {
+            if (unboundedIndex >= 0 && value > unboundedIndex) {
+                return undefined;
+            }
+            else if (value > tupleTypeArgs.length) {
+                return tupleTypeArgs.length;
+            }
+        }
+    }
+    return value;
+}
+//# sourceMappingURL=tuples.js.map

package/dist/analyzer/tuples.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tuples.js","sourceRoot":"","sources":["../../../../../src/analyzer/tuples.ts"],"names":[],"mappings":";AAAA;;;;;;;GAOG;;;AAGH,uDAAuD;AAIvD,mCAaiB;AACjB,2CAAuG;AAEvG,2EAA2E;AAC3E,wEAAwE;AACxE,iBAAiB;AACjB,SAAgB,mBAAmB,CAC/B,SAAwB,EACxB,QAAmB,EACnB,OAAkB,EAClB,IAAoC,EACpC,eAA8C,EAC9C,cAA6C,EAC7C,KAAsB,EACtB,cAAsB;;IAEtB,MAAM,YAAY,GAAG,CAAC,GAAG,CAAC,MAAA,QAAQ,CAAC,IAAI,CAAC,aAAa,mCAAI,EAAE,CAAC,CAAC,CAAC;IAC9D,MAAM,WAAW,GAAG,CAAC,GAAG,CAAC,MAAA,OAAO,CAAC,IAAI,CAAC,aAAa,mCAAI,EAAE,CAAC,CAAC,CAAC;IAE5D,IAAI,mBAAmB,CAAC,SAAS,EAAE,YAAY,EAAE,WAAW,EAAE,KAAK,CAAC,EAAE;QAClE,KAAK,IAAI,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,WAAW,CAAC,MAAM,EAAE,QAAQ,EAAE,EAAE;YAC9D,MAAM,SAAS,GAAG,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,cAAc,EAAE,CAAC;YACzC,MAAM,WAAW,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC;YAChD,MAAM,UAAU,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC;YAE9C,2DAA2D;YAC3D,2DAA2D;YAC3D,IACI,IAAA,sBAAc,EAAC,WAAW,CAAC;gBAC3B,WAAW,CAAC,IAAI,CAAC,UAAU;gBAC3B,CAAC,WAAW,CAAC,IAAI,CAAC,SAAS;gBAC3B,IAAA,8BAAkB,EAAC,UAAU,CAAC,EAChC;gBACE,OAAO,IAAI,CAAC;aACf;YAED,IACI,CAAC,SAAS,CAAC,UAAU,CACjB,WAAW,EACX,UAAU,EACV,SAAS,aAAT,SAAS,uBAAT,SAAS,CAAE,cAAc,EAAE,EAC3B,eAAe,EACf,cAAc,EACd,KAAK,EACL,cAAc,CACjB,EACH;gBACE,IAAI,SAAS,EAAE;oBACX,SAAS,CAAC,UAAU,CAChB,sBAAW,CAAC,sBAAsB,EAAE,CAAC,MAAM,CAAC;wBACxC,KAAK,EAAE,QAAQ,GAAG,CAAC;qBACtB,CAAC,CACL,CAAC;iBACL;gBACD,OAAO,KAAK,CAAC;aAChB;SACJ;KACJ;SAAM;QACH,MAAM,mBAAmB,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,IAAI,IAAA,sBAAc,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAE9F,IAAI,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,IAAI,IAAA,sBAAc,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE;YAClE,IAAI,mBAAmB,EAAE;gBACrB,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,UAAU,CACZ,sBAAW,CAAC,6BAA6B,EAAE,CAAC,MAAM,CAAC;oBAC/C,QAAQ,EAAE,YAAY,CAAC,MAAM,GAAG,CAAC;iBACpC,CAAC,CACL,CAAC;aACL;iBAAM;gBACH,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,UAAU,CACZ,sBAAW,CAAC,yBAAyB,EAAE,CAAC,MAAM,CAAC;oBAC3C,QAAQ,EAAE,YAAY,CAAC,MAAM;iBAChC,CAAC,CACL,CAAC;aACL;SACJ;aAAM;YACH,IAAI,mBAAmB,EAAE;gBACrB,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,UAAU,CACZ,sBAAW,CAAC,kCAAkC,EAAE,CAAC,MAAM,CAAC;oBACpD,QAAQ,EAAE,YAAY,CAAC,MAAM,GAAG,CAAC;oBACjC,QAAQ,EAAE,WAAW,CAAC,MAAM;iBAC/B,CAAC,CACL,CAAC;aACL;iBAAM;gBACH,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,UAAU,CACZ,sBAAW,CAAC,iBAAiB,EAAE,CAAC,MAAM,CAAC;oBACnC,QAAQ,EAAE,YAAY,CAAC,MAAM;oBAC7B,QAAQ,EAAE,WAAW,CAAC,MAAM;iBAC/B,CAAC,CACL,CAAC;aACL;SACJ;QAED,OAAO,KAAK,CAAC;KAChB;IAED,OAAO,IAAI,CAAC;AAChB,CAAC;AA1FD,kDA0FC;AAED,yEAAyE;AACzE,0EAA0E;AAC1E,sEAAsE;AACtE,wEAAwE;AACxE,yBAAyB;AACzB,SAAgB,mBAAmB,CAC/B,SAAwB,EACxB,YAA4B,EAC5B,WAA2B,EAC3B,KAAsB;IAEtB,MAAM,4BAA4B,GAAG,YAAY,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,IAAI,IAAA,sBAAc,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAC5G,MAAM,iBAAiB,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;IACtE,MAAM,gBAAgB,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,sBAAc,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAE9E,IAAI,iBAAiB,IAAI,CAAC,EAAE;QACxB,IAAI,IAAA,sBAAc,EAAC,WAAW,CAAC,iBAAiB,CAAC,CAAC,IAAI,CAAC,EAAE;YACrD,+EAA+E;YAC/E,MAAM,eAAe,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,iBAAiB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,eAAO,CAAC,MAAM,EAAE,CAAC;YAExG,OAAO,WAAW,CAAC,MAAM,GAAG,YAAY,CAAC,MAAM,EAAE;gBAC7C,WAAW,CAAC,MAAM,CAAC,iBAAiB,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,eAAe,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC;aAC1F;YAED,IAAI,WAAW,CAAC,MAAM,GAAG,YAAY,CAAC,MAAM,EAAE;gBAC1C,WAAW,CAAC,MAAM,CAAC,iBAAiB,EAAE,CAAC,CAAC,CAAC;aAC5C;SACJ;aAAM,IAAI,4BAA4B,GAAG,CAAC,EAAE;YACzC,qFAAqF;YACrF,OAAO,KAAK,CAAC;SAChB;KACJ;IAED,+EAA+E;IAC/E,IACI,4BAA4B,IAAI,CAAC;QACjC,YAAY,CAAC,4BAA4B,CAAC,CAAC,WAAW;QACtD,IAAA,sBAAc,EAAC,YAAY,CAAC,4BAA4B,CAAC,CAAC,IAAI,CAAC,EACjE;QACE,OAAO,YAAY,CAAC,MAAM,GAAG,WAAW,CAAC,MAAM,EAAE;YAC7C,YAAY,CAAC,MAAM,CAAC,4BAA4B,EAAE,CAAC,EAAE,YAAY,CAAC,4BAA4B,CAAC,CAAC,CAAC;SACpG;KACJ;IAED,wFAAwF;IACxF,OAAO,WAAW,CAAC,MAAM,GAAG,YAAY,CAAC,MAAM,IAAI,WAAW,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,UAAU,EAAE;QAC/F,WAAW,CAAC,MAAM,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;KACjD;IAED,OAAO,YAAY,CAAC,MAAM,GAAG,WAAW,CAAC,MAAM,IAAI,YAAY,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,UAAU,EAAE;QACjG,YAAY,CAAC,MAAM,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;KACnD;IAED,MAAM,gBAAgB,GAAG,WAAW,CAAC,MAAM,GAAG,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC;IACtE,IAAI,aAAa,GAAG,KAAK,CAAC;IAE1B,+EAA+E;IAC/E,oEAAoE;IACpE,oBAAoB;IACpB,IAAI,CAAC,KAAK,iDAAyC,CAAC,KAAK,CAAC,EAAE;QACxD,MAAM,iBAAiB,GAAG,YAAY,CAAC,MAAM,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QAEvE,IAAI,gBAAgB,IAAI,CAAC,IAAI,iBAAiB,IAAI,CAAC,EAAE;YACjD,wEAAwE;YACxE,6BAA6B;YAC7B,MAAM,cAAc,GAAG,iBAAiB,KAAK,CAAC,IAAI,IAAA,sBAAc,EAAC,YAAY,CAAC,gBAAgB,CAAC,CAAC,IAAI,CAAC,CAAC;YACtG,MAAM,UAAU,GAAG,SAAS,CAAC,iBAAiB,EAAE,CAAC;YAEjD,IAAI,CAAC,cAAc,IAAI,UAAU,IAAI,IAAA,2BAAmB,EAAC,UAAU,CAAC,EAAE;gBAClE,MAAM,WAAW,GAAG,YAAY,CAAC,MAAM,CAAC,gBAAgB,EAAE,iBAAiB,CAAC,CAAC;gBAE7E,+DAA+D;gBAC/D,MAAM,aAAa,GAAG,iBAAS,CAAC,eAAe,CAC3C,IAAA,gCAAoB,EAChB,UAAU,EACV,WAAW,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE;oBACxB,OAAO;wBACH,IAAI,EAAE,OAAO,CAAC,IAAI;wBAClB,WAAW,EAAE,OAAO,CAAC,WAAW;wBAChC,UAAU,EAAE,OAAO,CAAC,UAAU;qBACjC,CAAC;gBACN,CAAC,CAAC;gBACF,uBAAuB,CAAC,IAAI;gBAC5B,qBAAqB,CAAC,IAAI,CAC7B,CACJ,CAAC;gBAEF,YAAY,CAAC,MAAM,CAAC,gBAAgB,EAAE,CAAC,EAAE;oBACrC,IAAI,EAAE,aAAa;oBACnB,WAAW,EAAE,KAAK;iBACrB,CAAC,CAAC;aACN;YAED,aAAa,GAAG,IAAI,CAAC;SACxB;KACJ;SAAM;QACH,IAAI,4BAA4B,IAAI,CAAC,IAAI,gBAAgB,IAAI,CAAC,EAAE;YAC5D,kEAAkE;YAClE,uEAAuE;YACvE,IAAI,IAAA,sBAAc,EAAC,YAAY,CAAC,4BAA4B,CAAC,CAAC,IAAI,CAAC,EAAE;gBACjE,MAAM,UAAU,GAAG,SAAS,CAAC,iBAAiB,EAAE,CAAC;gBAEjD,IAAI,UAAU,IAAI,IAAA,2BAAmB,EAAC,UAAU,CAAC,EAAE;oBAC/C,MAAM,WAAW,GAAG,WAAW,CAAC,MAAM,CAAC,4BAA4B,EAAE,gBAAgB,CAAC,CAAC;oBAEvF,IAAI,aAAmB,CAAC;oBAExB,qEAAqE;oBACrE,qCAAqC;oBACrC,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,IAAI,IAAA,8BAAsB,EAAC,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE;wBACzE,aAAa,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;qBACvC;yBAAM;wBACH,+DAA+D;wBAC/D,aAAa,GAAG,iBAAS,CAAC,eAAe,CACrC,IAAA,gCAAoB,EAChB,UAAU,EACV,WAAW,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE;4BACxB,OAAO;gCACH,IAAI,EAAE,OAAO,CAAC,IAAI;gCAClB,WAAW,EAAE,OAAO,CAAC,WAAW;gCAChC,UAAU,EAAE,OAAO,CAAC,UAAU;6BACjC,CAAC;wBACN,CAAC,CAAC;wBACF,uBAAuB,CAAC,IAAI;wBAC5B,qBAAqB,CAAC,IAAI,CAC7B,CACJ,CAAC;qBACL;oBAED,WAAW,CAAC,MAAM,CAAC,4BAA4B,EAAE,CAAC,EAAE;wBAChD,IAAI,EAAE,aAAa;wBACnB,WAAW,EAAE,KAAK;qBACrB,CAAC,CAAC;iBACN;gBAED,aAAa,GAAG,IAAI,CAAC;aACxB;SACJ;KACJ;IAED,IAAI,CAAC,aAAa,IAAI,4BAA4B,IAAI,CAAC,IAAI,gBAAgB,IAAI,CAAC,EAAE;QAC9E,gEAAgE;QAChE,uEAAuE;QACvE,4CAA4C;QAC5C,IACI,iBAAiB,GAAG,CAAC;YACrB,CAAC,iBAAiB,IAAI,4BAA4B;gBAC9C,iBAAiB,GAAG,4BAA4B,GAAG,gBAAgB,CAAC,EAC1E;YACE,MAAM,eAAe,GAAG,WAAW,CAAC,MAAM,CAAC,4BAA4B,EAAE,gBAAgB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;gBACjG,IAAI,IAAA,iBAAS,EAAC,CAAC,CAAC,IAAI,CAAC,IAAI,IAAA,8BAAsB,EAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE;oBAC/E,OAAO,mBAAW,CAAC,gBAAgB,CAAC,CAAC,CAAC,IAAI,EAAE,eAAe,CAAC,IAAI,CAAC,CAAC;iBACrE;gBACD,OAAO,CAAC,CAAC,IAAI,CAAC;YAClB,CAAC,CAAC,CAAC;YAEH,WAAW,CAAC,MAAM,CAAC,4BAA4B,EAAE,CAAC,EAAE;gBAChD,IAAI,EAAE,eAAe,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAA,oBAAY,EAAC,eAAe,CAAC,CAAC,CAAC,CAAC,eAAO,CAAC,MAAM,EAAE;gBACnF,WAAW,EAAE,KAAK;aACrB,CAAC,CAAC;SACN;KACJ;IAED,OAAO,YAAY,CAAC,MAAM,KAAK,WAAW,CAAC,MAAM,CAAC;AACtD,CAAC;AA/JD,kDA+JC;AAED,sEAAsE;AACtE,8DAA8D;AAC9D,SAAgB,kBAAkB,CAC9B,SAAwB,EACxB,SAAoB,EACpB,SAAoB;IAEpB,+BAA+B;IAC/B,IAAI,SAAS,CAAC,CAAC,CAAC,SAAS,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,aAAa,EAAE;QACxD,OAAO,SAAS,CAAC;KACpB;IAED,MAAM,aAAa,GAAG,SAAS,CAAC,IAAI,CAAC,aAAa,CAAC;IACnD,MAAM,UAAU,GAAG,kBAAkB,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;IAC3F,MAAM,QAAQ,GAAG,kBAAkB,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,QAAQ,EAAE,aAAa,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;IAE1G,IAAI,UAAU,KAAK,SAAS,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,GAAG,UAAU,EAAE;QAC7E,OAAO,SAAS,CAAC;KACpB;IAED,MAAM,cAAc,GAAG,aAAa,CAAC,KAAK,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;IACjE,OAAO,iBAAS,CAAC,eAAe,CAAC,IAAA,gCAAoB,EAAC,SAAS,EAAE,cAAc,CAAC,CAAC,CAAC;AACtF,CAAC;AApBD,gDAoBC;AAED,SAAS,kBAAkB,CACvB,SAAwB,EACxB,UAAsC,EACtC,YAAoB,EACpB,aAA6B;IAE7B,IAAI,KAAK,GAAG,YAAY,CAAC;IAEzB,IAAI,UAAU,EAAE;QACZ,MAAM,OAAO,GAAG,SAAS,CAAC,mBAAmB,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC;QAC/D,IAAI,CAAC,IAAA,uBAAe,EAAC,OAAO,CAAC,IAAI,CAAC,iBAAS,CAAC,SAAS,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,CAAC,IAAA,yBAAa,EAAC,OAAO,CAAC,EAAE;YAC9F,OAAO,SAAS,CAAC;SACpB;QAED,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,YAAsB,CAAC;QAC5C,MAAM,cAAc,GAAG,aAAa,CAAC,SAAS,CAC1C,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,WAAW,IAAI,IAAA,sBAAc,EAAC,OAAO,CAAC,IAAI,CAAC,CACnE,CAAC;QAEF,IAAI,KAAK,GAAG,CAAC,EAAE;YACX,KAAK,GAAG,aAAa,CAAC,MAAM,GAAG,KAAK,CAAC;YACrC,IAAI,cAAc,IAAI,CAAC,IAAI,KAAK,IAAI,cAAc,EAAE;gBAChD,OAAO,SAAS,CAAC;aACpB;iBAAM,IAAI,KAAK,GAAG,CAAC,EAAE;gBAClB,OAAO,CAAC,CAAC;aACZ;SACJ;aAAM;YACH,IAAI,cAAc,IAAI,CAAC,IAAI,KAAK,GAAG,cAAc,EAAE;gBAC/C,OAAO,SAAS,CAAC;aACpB;iBAAM,IAAI,KAAK,GAAG,aAAa,CAAC,MAAM,EAAE;gBACrC,OAAO,aAAa,CAAC,MAAM,CAAC;aAC/B;SACJ;KACJ;IAED,OAAO,KAAK,CAAC;AACjB,CAAC"}

package/dist/analyzer/typeComplexity.d.ts

@@ -0,0 +1,2 @@
+import { Type } from './types';
+export declare function getComplexityScoreForType(type: Type, recursionCount?: number): number;

package/dist/analyzer/typeComplexity.js

@@ -0,0 +1,94 @@
+"use strict";
+/*
+ * typeComplexity.ts
+ * Copyright (c) Microsoft Corporation.
+ * Licensed under the MIT license.
+ * Author: Eric Traut
+ *
+ * Routines that compute a "complexity score" for a type. This is used
+ * during constraint solving to pick a "best" type when multiple types
+ * meet the constraints.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getComplexityScoreForType = void 0;
+const types_1 = require("./types");
+// Returns a "score" for a type that captures the relative complexity
+// of the type. Scores should all be between 0 and 1 where 0 means
+// very simple and 1 means complex. This is a heuristic, so there's
+// often no objectively correct answer.
+function getComplexityScoreForType(type, recursionCount = 0) {
+    if (recursionCount > types_1.maxTypeRecursionCount) {
+        return 1;
+    }
+    recursionCount++;
+    switch (type.category) {
+        case 1 /* TypeCategory.Unknown */:
+        case 2 /* TypeCategory.Any */: {
+            return 0.5;
+        }
+        case 9 /* TypeCategory.TypeVar */: {
+            // Assume type[T] is more complex than T.
+            return types_1.TypeBase.isInstantiable(type) ? 0.55 : 0.5;
+        }
+        case 4 /* TypeCategory.Function */:
+        case 5 /* TypeCategory.OverloadedFunction */: {
+            // Classes and unions should be preferred over functions,
+            // so make this relatively high (more than 0.75).
+            return types_1.TypeBase.isInstantiable(type) ? 0.85 : 0.8;
+        }
+        case 0 /* TypeCategory.Unbound */:
+        case 3 /* TypeCategory.Never */:
+            return 1.0;
+        case 8 /* TypeCategory.Union */: {
+            let maxScore = 0;
+            // If this union has a very large number of subtypes, don't bother
+            // accurately computing the score. Assume a fixed value.
+            if (type.priv.subtypes.length < 16) {
+                type.priv.subtypes.forEach((subtype) => {
+                    const subtypeScore = getComplexityScoreForType(subtype, recursionCount);
+                    maxScore = Math.max(maxScore, subtypeScore);
+                });
+            }
+            else {
+                maxScore = 0.5;
+            }
+            return maxScore;
+        }
+        case 6 /* TypeCategory.Class */: {
+            return getComplexityScoreForClass(type, recursionCount);
+        }
+    }
+    // For all other types, return a score of 0.
+    return 0;
+}
+exports.getComplexityScoreForType = getComplexityScoreForType;
+function getComplexityScoreForClass(classType, recursionCount) {
+    let typeArgScoreSum = 0;
+    let typeArgCount = 0;
+    if (classType.priv.tupleTypeArgs) {
+        classType.priv.tupleTypeArgs.forEach((typeArg) => {
+            typeArgScoreSum += getComplexityScoreForType(typeArg.type, recursionCount);
+            typeArgCount++;
+        });
+    }
+    else if (classType.priv.typeArgs) {
+        classType.priv.typeArgs.forEach((type) => {
+            typeArgScoreSum += getComplexityScoreForType(type, recursionCount);
+            typeArgCount++;
+        });
+    }
+    else if (classType.shared.typeParams) {
+        classType.shared.typeParams.forEach((type) => {
+            typeArgScoreSum += getComplexityScoreForType(types_1.AnyType.create(), recursionCount);
+            typeArgCount++;
+        });
+    }
+    const averageTypeArgComplexity = typeArgCount > 0 ? typeArgScoreSum / typeArgCount : 0;
+    let result = 0.5 + averageTypeArgComplexity * 0.25;
+    // Assume type[T] is more complex than T.
+    if ((0, types_1.isInstantiableClass)(classType)) {
+        result += 0.05;
+    }
+    return result;
+}
+//# sourceMappingURL=typeComplexity.js.map

package/dist/analyzer/typeComplexity.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"typeComplexity.js","sourceRoot":"","sources":["../../../../../src/analyzer/typeComplexity.ts"],"names":[],"mappings":";AAAA;;;;;;;;;GASG;;;AAEH,mCAAuH;AAEvH,qEAAqE;AACrE,kEAAkE;AAClE,mEAAmE;AACnE,uCAAuC;AACvC,SAAgB,yBAAyB,CAAC,IAAU,EAAE,cAAc,GAAG,CAAC;IACpE,IAAI,cAAc,GAAG,6BAAqB,EAAE;QACxC,OAAO,CAAC,CAAC;KACZ;IACD,cAAc,EAAE,CAAC;IAEjB,QAAQ,IAAI,CAAC,QAAQ,EAAE;QACnB,kCAA0B;QAC1B,6BAAqB,CAAC,CAAC;YACnB,OAAO,GAAG,CAAC;SACd;QAED,iCAAyB,CAAC,CAAC;YACvB,yCAAyC;YACzC,OAAO,gBAAQ,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC;SACrD;QAED,mCAA2B;QAC3B,4CAAoC,CAAC,CAAC;YAClC,yDAAyD;YACzD,iDAAiD;YACjD,OAAO,gBAAQ,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC;SACrD;QAED,kCAA0B;QAC1B;YACI,OAAO,GAAG,CAAC;QAEf,+BAAuB,CAAC,CAAC;YACrB,IAAI,QAAQ,GAAG,CAAC,CAAC;YAEjB,kEAAkE;YAClE,wDAAwD;YACxD,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,EAAE,EAAE;gBAChC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;oBACnC,MAAM,YAAY,GAAG,yBAAyB,CAAC,OAAO,EAAE,cAAc,CAAC,CAAC;oBACxE,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC;gBAChD,CAAC,CAAC,CAAC;aACN;iBAAM;gBACH,QAAQ,GAAG,GAAG,CAAC;aAClB;YAED,OAAO,QAAQ,CAAC;SACnB;QAED,+BAAuB,CAAC,CAAC;YACrB,OAAO,0BAA0B,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;SAC3D;KACJ;IAED,4CAA4C;IAC5C,OAAO,CAAC,CAAC;AACb,CAAC;AApDD,8DAoDC;AAED,SAAS,0BAA0B,CAAC,SAAoB,EAAE,cAAsB;IAC5E,IAAI,eAAe,GAAG,CAAC,CAAC;IACxB,IAAI,YAAY,GAAG,CAAC,CAAC;IAErB,IAAI,SAAS,CAAC,IAAI,CAAC,aAAa,EAAE;QAC9B,SAAS,CAAC,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;YAC7C,eAAe,IAAI,yBAAyB,CAAC,OAAO,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;YAC3E,YAAY,EAAE,CAAC;QACnB,CAAC,CAAC,CAAC;KACN;SAAM,IAAI,SAAS,CAAC,IAAI,CAAC,QAAQ,EAAE;QAChC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;YACrC,eAAe,IAAI,yBAAyB,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;YACnE,YAAY,EAAE,CAAC;QACnB,CAAC,CAAC,CAAC;KACN;SAAM,IAAI,SAAS,CAAC,MAAM,CAAC,UAAU,EAAE;QACpC,SAAS,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;YACzC,eAAe,IAAI,yBAAyB,CAAC,eAAO,CAAC,MAAM,EAAE,EAAE,cAAc,CAAC,CAAC;YAC/E,YAAY,EAAE,CAAC;QACnB,CAAC,CAAC,CAAC;KACN;IAED,MAAM,wBAAwB,GAAG,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,eAAe,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;IACvF,IAAI,MAAM,GAAG,GAAG,GAAG,wBAAwB,GAAG,IAAI,CAAC;IAEnD,yCAAyC;IACzC,IAAI,IAAA,2BAAmB,EAAC,SAAS,CAAC,EAAE;QAChC,MAAM,IAAI,IAAI,CAAC;KAClB;IAED,OAAO,MAAM,CAAC;AAClB,CAAC"}