@zzzen/pyright-internal 1.2.0-dev.20261018 → 1.2.0-dev.20261108

package/dist/analyzer/typeGuards.js

@@ -43,6 +43,7 @@ var __importStar = (this && this.__importStar) || (function () {
     };
 })();
 Object.defineProperty(exports, "__esModule", { value: true });
+exports.applyTypeNarrowingCallback = applyTypeNarrowingCallback;
 exports.getTypeNarrowingCallback = getTypeNarrowingCallback;
 exports.getIsInstanceClassTypes = getIsInstanceClassTypes;
 exports.narrowTypeForInstanceOrSubclass = narrowTypeForInstanceOrSubclass;
@@ -57,15 +58,94 @@ const parseNodes_1 = require("../parser/parseNodes");
 const analyzerNodeInfo_1 = require("./analyzerNodeInfo");
 const constraintSolver_1 = require("./constraintSolver");
 const constraintTracker_1 = require("./constraintTracker");
-const enums_1 = require("./enums");
-const operations_1 = require("./operations");
 const parameterUtils_1 = require("./parameterUtils");
 const ParseTreeUtils = __importStar(require("./parseTreeUtils"));
 const scopeUtils_1 = require("./scopeUtils");
 const symbol_1 = require("./symbol");
-const typedDicts_1 = require("./typedDicts");
+const TypeEvaluatorNarrowing = __importStar(require("./typeEvaluator/typeGuardNarrowing"));
 const types_1 = require("./types");
 const typeUtils_1 = require("./typeUtils");
+function applyTypeNarrowingCallback(callback, type) {
+    const result = callback(type);
+    const baseType = (0, types_1.getInferredTupleLiteralBase)(type);
+    if (baseType === type) {
+        return result;
+    }
+    // Narrow both views at the flow boundary, not recursively within a guard.
+    // Independently established literals must survive mutable inference too.
+    const baseResult = callback(baseType);
+    if (!result && !baseResult) {
+        return undefined;
+    }
+    return {
+        type: (0, types_1.retainInferredTupleLiterals)(result?.type ?? type, (0, types_1.getInferredTupleLiteralBase)(baseResult?.type ?? baseType)),
+        isIncomplete: !!result?.isIncomplete || !!baseResult?.isIncomplete,
+    };
+}
+function getEqualsNarrowingContext(evaluator) {
+    return {
+        getTypeOfExpression: (expression) => evaluator.getTypeOfExpression(expression),
+        isMatchingExpression: (reference, expression) => ParseTreeUtils.isMatchingExpression(reference, expression, (ref, expr) => isNameSameScope(evaluator, ref, expr)),
+        isMatchingExpressionOrWalrusRhs: (reference, expression) => isMatchingExpressionOrWalrusRhs(evaluator, reference, expression),
+    };
+}
+function getMemberAccessNarrowingContext(evaluator) {
+    return {
+        getTypeOfExpression: (expression) => evaluator.getTypeOfExpression(expression),
+        isMatchingExpression: (reference, expression) => ParseTreeUtils.isMatchingExpression(reference, expression, (ref, expr) => isNameSameScope(evaluator, ref, expr)),
+    };
+}
+function getLenComparisonNarrowingContext(evaluator) {
+    return {
+        getTypeOfExpression: (expression, flags) => evaluator.getTypeOfExpression(expression, flags),
+        isMatchingExpression: (reference, expression) => ParseTreeUtils.isMatchingExpression(reference, expression, (ref, expr) => isNameSameScope(evaluator, ref, expr)),
+    };
+}
+function getInOperatorNarrowingContext(evaluator) {
+    return {
+        getTypeOfExpression: (expression, flags) => evaluator.getTypeOfExpression(expression, flags),
+        isMatchingExpression: (reference, expression) => ParseTreeUtils.isMatchingExpression(reference, expression, (ref, expr) => isNameSameScope(evaluator, ref, expr)),
+        isMatchingExpressionOrWalrusRhs: (reference, expression) => isMatchingExpressionOrWalrusRhs(evaluator, reference, expression),
+    };
+}
+function getNoneEllipsisNarrowingContext(evaluator) {
+    return {
+        isMatchingExpression: (reference, expression) => ParseTreeUtils.isMatchingExpression(reference, expression, (ref, expr) => isNameSameScope(evaluator, ref, expr)),
+        isMatchingExpressionOrWalrusRhs: (reference, expression) => isMatchingExpressionOrWalrusRhs(evaluator, reference, expression),
+    };
+}
+function getTypeIsCallNarrowingContext(evaluator) {
+    return {
+        getTypeOfExpression: (expression, flags) => evaluator.getTypeOfExpression(expression, flags),
+        isMatchingExpressionOrWalrusRhs: (reference, expression) => isMatchingExpressionOrWalrusRhs(evaluator, reference, expression),
+        mapSubtypesExpandTypeVars: (type, callback) => evaluator.mapSubtypesExpandTypeVars(type, /* options */ undefined, callback),
+    };
+}
+function getIsLiteralOrClassNarrowingContext(evaluator) {
+    return {
+        getTypeOfExpression: (expression) => evaluator.getTypeOfExpression(expression),
+        isMatchingExpressionOrWalrusRhs: (reference, expression) => isMatchingExpressionOrWalrusRhs(evaluator, reference, expression),
+    };
+}
+function getIndexedLiteralNarrowingContext(evaluator) {
+    return {
+        getTypeOfExpression: (expression) => evaluator.getTypeOfExpression(expression),
+        isMatchingExpression: (reference, expression) => ParseTreeUtils.isMatchingExpression(reference, expression, (ref, expr) => isNameSameScope(evaluator, ref, expr)),
+    };
+}
+function getIsInstanceCallNarrowingContext(evaluator) {
+    return {
+        getTypeOfExpression: (expression, flags) => evaluator.getTypeOfExpression(expression, flags),
+        getIsInstanceClassTypes: (argType, argExpr) => getIsInstanceClassTypes(evaluator, argType, argExpr),
+        isMatchingExpressionOrWalrusRhs: (reference, expression) => isMatchingExpressionOrWalrusRhs(evaluator, reference, expression),
+    };
+}
+function getBoolCallNarrowingContext(evaluator) {
+    return {
+        getTypeOfExpression: (expression, flags) => evaluator.getTypeOfExpression(expression, flags),
+        isMatchingExpressionOrWalrusRhs: (reference, expression) => isMatchingExpressionOrWalrusRhs(evaluator, reference, expression),
+    };
+}
 // Given a reference expression and a test expression, returns a callback that
 // can be used to narrow the type described by the reference expression.
 // If the specified flow node is not associated with the test expression,
@@ -81,394 +161,185 @@ function getTypeNarrowingCallback(evaluator, reference, testExpression, isPositi
     if (testExpression.nodeType === 7 /* ParseNodeType.BinaryOperation */) {
         const isOrIsNotOperator = testExpression.d.operator === 39 /* OperatorType.Is */ || testExpression.d.operator === 40 /* OperatorType.IsNot */;
         const equalsOrNotEqualsOperator = testExpression.d.operator === 12 /* OperatorType.Equals */ || testExpression.d.operator === 28 /* OperatorType.NotEquals */;
-        const comparisonOperator = equalsOrNotEqualsOperator ||
-            testExpression.d.operator === 20 /* OperatorType.LessThan */ ||
-            testExpression.d.operator === 21 /* OperatorType.LessThanOrEqual */ ||
-            testExpression.d.operator === 15 /* OperatorType.GreaterThan */ ||
-            testExpression.d.operator === 16 /* OperatorType.GreaterThanOrEqual */;
         if (isOrIsNotOperator || equalsOrNotEqualsOperator) {
-            // Invert the "isPositiveTest" value if this is an "is not" operation.
-            const adjIsPositiveTest = testExpression.d.operator === 39 /* OperatorType.Is */ || testExpression.d.operator === 12 /* OperatorType.Equals */
-                ? isPositiveTest
-                : !isPositiveTest;
-            // Look for "X is None", "X is not None", "X == None", and "X != None".
-            // These are commonly-used patterns used in control flow.
-            if (testExpression.d.rightExpr.nodeType === 14 /* ParseNodeType.Constant */ &&
-                testExpression.d.rightExpr.d.constType === 27 /* KeywordType.None */) {
-                // Allow the LHS to be a simple expression or an assignment expression.
-                // For assignment expressions, narrow both the target and the RHS
-                // (consistent with truthiness narrowing).
-                if (isMatchingExpressionOrWalrusRhs(evaluator, reference, testExpression.d.leftExpr)) {
+            const noneEllipsisInfo = TypeEvaluatorNarrowing.getNoneEllipsisNarrowingInfo(getNoneEllipsisNarrowingContext(evaluator), reference, testExpression, isPositiveTest);
+            if (noneEllipsisInfo) {
+                if (noneEllipsisInfo.kind === 'none') {
                     return (type) => {
-                        return { type: narrowTypeForIsNone(evaluator, type, adjIsPositiveTest), isIncomplete: false };
-                    };
-                }
-                const leftExpression = testExpression.d.leftExpr;
-                if (leftExpression.nodeType === 27 /* ParseNodeType.Index */ &&
-                    ParseTreeUtils.isMatchingExpression(reference, leftExpression.d.leftExpr, (ref, expr) => isNameSameScope(evaluator, ref, expr)) &&
-                    leftExpression.d.items.length === 1 &&
-                    !leftExpression.d.trailingComma &&
-                    leftExpression.d.items[0].d.argCategory === 0 /* ArgCategory.Simple */ &&
-                    !leftExpression.d.items[0].d.name &&
-                    leftExpression.d.items[0].d.valueExpr.nodeType === 40 /* ParseNodeType.Number */ &&
-                    leftExpression.d.items[0].d.valueExpr.d.isInteger &&
-                    !leftExpression.d.items[0].d.valueExpr.d.isImaginary) {
-                    const indexValue = leftExpression.d.items[0].d.valueExpr.d.value;
-                    if (typeof indexValue === 'number') {
-                        return (type) => {
-                            return {
-                                type: narrowTupleTypeForIsNone(evaluator, type, adjIsPositiveTest, indexValue),
-                                isIncomplete: false,
-                            };
+                        return {
+                            type: narrowTypeForIsNone(evaluator, type, noneEllipsisInfo.adjIsPositiveTest),
+                            isIncomplete: false,
                         };
-                    }
+                    };
                 }
-            }
-            // Look for "X is ...", "X is not ...", "X == ...", and "X != ...".
-            if (testExpression.d.rightExpr.nodeType === 21 /* ParseNodeType.Ellipsis */) {
-                if (isMatchingExpressionOrWalrusRhs(evaluator, reference, testExpression.d.leftExpr)) {
+                if (noneEllipsisInfo.kind === 'tuple-none') {
                     return (type) => {
                         return {
-                            type: narrowTypeForIsEllipsis(evaluator, testExpression, type, adjIsPositiveTest),
+                            type: narrowTupleTypeForIsNone(evaluator, type, noneEllipsisInfo.adjIsPositiveTest, noneEllipsisInfo.tupleIndex),
                             isIncomplete: false,
                         };
                     };
                 }
+                return (type) => {
+                    return {
+                        type: narrowTypeForIsEllipsis(evaluator, testExpression, type, noneEllipsisInfo.adjIsPositiveTest),
+                        isIncomplete: false,
+                    };
+                };
             }
-            // Look for "type(X) is Y", "type(X) is not Y", "type(X) == Y" or "type(X) != Y".
-            if (testExpression.d.leftExpr.nodeType === 9 /* ParseNodeType.Call */) {
-                if (testExpression.d.leftExpr.d.args.length === 1 &&
-                    testExpression.d.leftExpr.d.args[0].d.argCategory === 0 /* ArgCategory.Simple */) {
-                    const arg0Expr = testExpression.d.leftExpr.d.args[0].d.valueExpr;
-                    if (isMatchingExpressionOrWalrusRhs(evaluator, reference, arg0Expr)) {
-                        const callType = evaluator.getTypeOfExpression(testExpression.d.leftExpr.d.leftExpr, 2 /* EvalFlags.CallBaseDefaults */).type;
-                        if ((0, types_1.isInstantiableClass)(callType) && types_1.ClassType.isBuiltIn(callType, 'type')) {
-                            const rhsResult = evaluator.getTypeOfExpression(testExpression.d.rightExpr);
-                            const classTypes = [];
-                            let isClassType = true;
-                            evaluator.mapSubtypesExpandTypeVars(rhsResult.type, 
-                            /* options */ undefined, (expandedSubtype) => {
-                                if ((0, types_1.isInstantiableClass)(expandedSubtype)) {
-                                    classTypes.push(expandedSubtype);
-                                }
-                                else {
-                                    isClassType = false;
-                                }
-                                return undefined;
-                            });
-                            if (isClassType && classTypes.length > 0) {
-                                return (type) => {
-                                    return {
-                                        type: narrowTypeForTypeIs(evaluator, type, classTypes, adjIsPositiveTest),
-                                        isIncomplete: !!rhsResult.isIncomplete,
-                                    };
-                                };
-                            }
-                        }
-                    }
-                }
+            const typeIsCallInfo = TypeEvaluatorNarrowing.getTypeIsCallNarrowingInfo(getTypeIsCallNarrowingContext(evaluator), reference, testExpression, isPositiveTest);
+            if (typeIsCallInfo) {
+                return (type) => {
+                    return {
+                        type: narrowTypeForTypeIs(evaluator, type, typeIsCallInfo.classTypes, typeIsCallInfo.adjIsPositiveTest, typeIsCallInfo.isOrIsNotOperator, typeIsCallInfo.classTypeVar, typeIsCallInfo.allowLegacyEquality),
+                        isIncomplete: typeIsCallInfo.isIncomplete,
+                    };
+                };
             }
             if (isOrIsNotOperator) {
-                if (isMatchingExpressionOrWalrusRhs(evaluator, reference, testExpression.d.leftExpr)) {
-                    const rightTypeResult = evaluator.getTypeOfExpression(testExpression.d.rightExpr);
-                    const rightType = rightTypeResult.type;
-                    // Look for "X is Y" or "X is not Y" where Y is a literal.
-                    if ((0, types_1.isClassInstance)(rightType) && rightType.priv.literalValue !== undefined) {
+                const isLiteralOrClassInfo = TypeEvaluatorNarrowing.getIsLiteralOrClassNarrowingInfo(getIsLiteralOrClassNarrowingContext(evaluator), reference, testExpression, isPositiveTest);
+                if (isLiteralOrClassInfo) {
+                    if (isLiteralOrClassInfo.kind === 'literal') {
                         return (type) => {
                             return {
-                                type: narrowTypeForLiteralComparison(evaluator, type, rightType, adjIsPositiveTest, 
+                                type: narrowTypeForLiteralComparison(evaluator, type, isLiteralOrClassInfo.rightType, isLiteralOrClassInfo.adjIsPositiveTest, 
                                 /* isIsOperator */ true),
-                                isIncomplete: !!rightTypeResult.isIncomplete,
+                                isIncomplete: isLiteralOrClassInfo.isIncomplete,
                             };
                         };
                     }
-                    // Look for X is <class> or X is not <class>.
-                    if ((0, types_1.isInstantiableClass)(rightType)) {
-                        return (type) => {
-                            return {
-                                type: narrowTypeForClassComparison(evaluator, type, rightType, adjIsPositiveTest),
-                                isIncomplete: !!rightTypeResult.isIncomplete,
-                            };
+                    return (type) => {
+                        return {
+                            type: narrowTypeForClassComparison(evaluator, type, isLiteralOrClassInfo.rightType, isLiteralOrClassInfo.adjIsPositiveTest),
+                            isIncomplete: isLiteralOrClassInfo.isIncomplete,
                         };
-                    }
-                }
-                // Look for X[<literal>] is <literal> or X[<literal>] is not <literal>.
-                if (testExpression.d.leftExpr.nodeType === 27 /* ParseNodeType.Index */ &&
-                    testExpression.d.leftExpr.d.items.length === 1 &&
-                    !testExpression.d.leftExpr.d.trailingComma &&
-                    testExpression.d.leftExpr.d.items[0].d.argCategory === 0 /* ArgCategory.Simple */ &&
-                    ParseTreeUtils.isMatchingExpression(reference, testExpression.d.leftExpr.d.leftExpr, (ref, expr) => isNameSameScope(evaluator, ref, expr))) {
-                    const indexTypeResult = evaluator.getTypeOfExpression(testExpression.d.leftExpr.d.items[0].d.valueExpr);
-                    const indexType = indexTypeResult.type;
-                    if ((0, types_1.isClassInstance)(indexType) && (0, typeUtils_1.isLiteralType)(indexType)) {
-                        if (types_1.ClassType.isBuiltIn(indexType, 'str')) {
-                            const rightType = evaluator.getTypeOfExpression(testExpression.d.rightExpr).type;
-                            if ((0, types_1.isClassInstance)(rightType) && rightType.priv.literalValue !== undefined) {
-                                return (type) => {
-                                    return {
-                                        type: narrowTypeForDiscriminatedDictEntryComparison(evaluator, type, indexType, rightType, adjIsPositiveTest),
-                                        isIncomplete: !!indexTypeResult.isIncomplete,
-                                    };
-                                };
-                            }
-                        }
-                        else if (types_1.ClassType.isBuiltIn(indexType, 'int')) {
-                            const rightTypeResult = evaluator.getTypeOfExpression(testExpression.d.rightExpr);
-                            const rightType = rightTypeResult.type;
-                            if ((0, types_1.isClassInstance)(rightType) && rightType.priv.literalValue !== undefined) {
-                                let canNarrow = false;
-                                // Narrowing can be applied only for bool or enum literals.
-                                if (types_1.ClassType.isBuiltIn(rightType, 'bool')) {
-                                    canNarrow = true;
-                                }
-                                else if (rightType.priv.literalValue instanceof types_1.EnumLiteral) {
-                                    canNarrow = true;
-                                }
-                                if (canNarrow) {
-                                    return (type) => {
-                                        return {
-                                            type: narrowTypeForDiscriminatedTupleComparison(evaluator, type, indexType, rightType, adjIsPositiveTest),
-                                            isIncomplete: !!rightTypeResult.isIncomplete,
-                                        };
-                                    };
-                                }
-                            }
-                        }
-                    }
+                    };
                 }
-            }
-            if (equalsOrNotEqualsOperator) {
-                // Look for X == <literal> or X != <literal>
-                const adjIsPositiveTest = testExpression.d.operator === 12 /* OperatorType.Equals */ ? isPositiveTest : !isPositiveTest;
-                if (isMatchingExpressionOrWalrusRhs(evaluator, reference, testExpression.d.leftExpr)) {
-                    const rightTypeResult = evaluator.getTypeOfExpression(testExpression.d.rightExpr);
-                    const rightType = rightTypeResult.type;
-                    if ((0, types_1.isClassInstance)(rightType) && rightType.priv.literalValue !== undefined) {
+                const indexedLiteralInfo = TypeEvaluatorNarrowing.getIndexedLiteralNarrowingInfo(getIndexedLiteralNarrowingContext(evaluator), reference, testExpression, isPositiveTest);
+                if (indexedLiteralInfo) {
+                    if (indexedLiteralInfo.kind === 'dict') {
                         return (type) => {
                             return {
-                                type: narrowTypeForLiteralComparison(evaluator, type, rightType, adjIsPositiveTest, 
-                                /* isIsOperator */ false),
-                                isIncomplete: !!rightTypeResult.isIncomplete,
+                                type: narrowTypeForDiscriminatedDictEntryComparison(evaluator, type, indexedLiteralInfo.indexType, indexedLiteralInfo.rightType, indexedLiteralInfo.adjIsPositiveTest),
+                                isIncomplete: indexedLiteralInfo.isIncomplete,
                             };
                         };
                     }
-                    // Look for X == <class> or X != <class>.
-                    if ((0, types_1.isInstantiableClass)(rightType)) {
-                        return (type) => {
-                            return {
-                                type: narrowTypeForClassComparison(evaluator, type, rightType, adjIsPositiveTest, 
-                                /* isIsOperator */ false),
-                                isIncomplete: !!rightTypeResult.isIncomplete,
-                            };
+                    return (type) => {
+                        return {
+                            type: narrowTypeForDiscriminatedTupleComparison(evaluator, type, indexedLiteralInfo.indexType, indexedLiteralInfo.rightType, indexedLiteralInfo.adjIsPositiveTest),
+                            isIncomplete: indexedLiteralInfo.isIncomplete,
                         };
-                    }
-                }
-                // Look for X[<literal>] == <literal> or X[<literal>] != <literal>
-                if (testExpression.d.leftExpr.nodeType === 27 /* ParseNodeType.Index */ &&
-                    testExpression.d.leftExpr.d.items.length === 1 &&
-                    !testExpression.d.leftExpr.d.trailingComma &&
-                    testExpression.d.leftExpr.d.items[0].d.argCategory === 0 /* ArgCategory.Simple */ &&
-                    ParseTreeUtils.isMatchingExpression(reference, testExpression.d.leftExpr.d.leftExpr, (ref, expr) => isNameSameScope(evaluator, ref, expr))) {
-                    const indexTypeResult = evaluator.getTypeOfExpression(testExpression.d.leftExpr.d.items[0].d.valueExpr);
-                    const indexType = indexTypeResult.type;
-                    if ((0, types_1.isClassInstance)(indexType) && (0, typeUtils_1.isLiteralType)(indexType)) {
-                        if (types_1.ClassType.isBuiltIn(indexType, ['str', 'int'])) {
-                            const rightTypeResult = evaluator.getTypeOfExpression(testExpression.d.rightExpr);
-                            const rightType = rightTypeResult.type;
-                            if ((0, typeUtils_1.isLiteralTypeOrUnion)(rightType)) {
-                                return (type) => {
-                                    let narrowedType;
-                                    if (types_1.ClassType.isBuiltIn(indexType, 'str')) {
-                                        narrowedType = narrowTypeForDiscriminatedDictEntryComparison(evaluator, type, indexType, rightType, adjIsPositiveTest);
-                                    }
-                                    else {
-                                        narrowedType = narrowTypeForDiscriminatedTupleComparison(evaluator, type, indexType, rightType, adjIsPositiveTest);
-                                    }
-                                    return {
-                                        type: narrowedType,
-                                        isIncomplete: !!indexTypeResult.isIncomplete || !!rightTypeResult.isIncomplete,
-                                    };
-                                };
-                            }
-                        }
-                    }
+                    };
                 }
             }
-            // Look for X.Y == <literal> or X.Y != <literal>
-            if (equalsOrNotEqualsOperator &&
-                testExpression.d.leftExpr.nodeType === 35 /* ParseNodeType.MemberAccess */ &&
-                ParseTreeUtils.isMatchingExpression(reference, testExpression.d.leftExpr.d.leftExpr, (ref, expr) => isNameSameScope(evaluator, ref, expr))) {
-                const rightTypeResult = evaluator.getTypeOfExpression(testExpression.d.rightExpr);
-                const rightType = rightTypeResult.type;
-                const memberName = testExpression.d.leftExpr.d.member;
-                if ((0, types_1.isClassInstance)(rightType)) {
-                    if (rightType.priv.literalValue !== undefined || (0, typeUtils_1.isNoneInstance)(rightType)) {
-                        return (type) => {
-                            return {
-                                type: narrowTypeForDiscriminatedLiteralFieldComparison(evaluator, type, memberName.d.value, rightType, adjIsPositiveTest),
-                                isIncomplete: !!rightTypeResult.isIncomplete,
-                            };
+            const equalsInfo = TypeEvaluatorNarrowing.getEqualsNarrowingInfo(getEqualsNarrowingContext(evaluator), reference, testExpression, isPositiveTest);
+            if (equalsInfo) {
+                if (equalsInfo.kind === 'literal') {
+                    return (type) => {
+                        return {
+                            type: narrowTypeForLiteralComparison(evaluator, type, equalsInfo.rightType, equalsInfo.adjIsPositiveTest, 
+                            /* isIsOperator */ false),
+                            isIncomplete: equalsInfo.isIncomplete,
                         };
-                    }
+                    };
                 }
-            }
-            // Look for X.Y is <literal> or X.Y is not <literal> where <literal> is
-            // an enum or bool literal
-            if (testExpression.d.leftExpr.nodeType === 35 /* ParseNodeType.MemberAccess */ &&
-                ParseTreeUtils.isMatchingExpression(reference, testExpression.d.leftExpr.d.leftExpr, (ref, expr) => isNameSameScope(evaluator, ref, expr))) {
-                const rightTypeResult = evaluator.getTypeOfExpression(testExpression.d.rightExpr);
-                const rightType = rightTypeResult.type;
-                const memberName = testExpression.d.leftExpr.d.member;
-                if ((0, types_1.isClassInstance)(rightType) &&
-                    (types_1.ClassType.isEnumClass(rightType) || types_1.ClassType.isBuiltIn(rightType, 'bool')) &&
-                    rightType.priv.literalValue !== undefined) {
+                if (equalsInfo.kind === 'class') {
                     return (type) => {
                         return {
-                            type: narrowTypeForDiscriminatedLiteralFieldComparison(evaluator, type, memberName.d.value, rightType, adjIsPositiveTest),
-                            isIncomplete: !!rightTypeResult.isIncomplete,
+                            type: narrowTypeForClassComparison(evaluator, type, equalsInfo.rightType, equalsInfo.adjIsPositiveTest, 
+                            /* isIsOperator */ false),
+                            isIncomplete: equalsInfo.isIncomplete,
                         };
                     };
                 }
-            }
-            // Look for X.Y is None or X.Y is not None
-            // These are commonly-used patterns used in control flow.
-            if (testExpression.d.leftExpr.nodeType === 35 /* ParseNodeType.MemberAccess */ &&
-                ParseTreeUtils.isMatchingExpression(reference, testExpression.d.leftExpr.d.leftExpr, (ref, expr) => isNameSameScope(evaluator, ref, expr)) &&
-                testExpression.d.rightExpr.nodeType === 14 /* ParseNodeType.Constant */ &&
-                testExpression.d.rightExpr.d.constType === 27 /* KeywordType.None */) {
-                const memberName = testExpression.d.leftExpr.d.member;
                 return (type) => {
+                    let narrowedType;
+                    const indexType = equalsInfo.indexType;
+                    if (types_1.ClassType.isBuiltIn(indexType, 'str')) {
+                        narrowedType = narrowTypeForDiscriminatedDictEntryComparison(evaluator, type, indexType, equalsInfo.rightType, equalsInfo.adjIsPositiveTest);
+                    }
+                    else {
+                        narrowedType = narrowTypeForDiscriminatedTupleComparison(evaluator, type, indexType, equalsInfo.rightType, equalsInfo.adjIsPositiveTest);
+                    }
                     return {
-                        type: narrowTypeForDiscriminatedFieldNoneComparison(evaluator, type, memberName.d.value, adjIsPositiveTest),
-                        isIncomplete: false,
+                        type: narrowedType,
+                        isIncomplete: equalsInfo.isIncomplete,
                     };
                 };
             }
-        }
-        // Look for len(x) == <literal>, len(x) != <literal>, len(x) < <literal>, etc.
-        if (comparisonOperator &&
-            testExpression.d.leftExpr.nodeType === 9 /* ParseNodeType.Call */ &&
-            testExpression.d.leftExpr.d.args.length === 1) {
-            const arg0Expr = testExpression.d.leftExpr.d.args[0].d.valueExpr;
-            if (ParseTreeUtils.isMatchingExpression(reference, arg0Expr, (ref, expr) => isNameSameScope(evaluator, ref, expr))) {
-                const callTypeResult = evaluator.getTypeOfExpression(testExpression.d.leftExpr.d.leftExpr, 2 /* EvalFlags.CallBaseDefaults */);
-                const callType = callTypeResult.type;
-                if ((0, types_1.isFunction)(callType) && callType.shared.fullName === 'builtins.len') {
-                    const rightTypeResult = evaluator.getTypeOfExpression(testExpression.d.rightExpr);
-                    const rightType = rightTypeResult.type;
-                    if ((0, types_1.isClassInstance)(rightType) &&
-                        typeof rightType.priv.literalValue === 'number' &&
-                        rightType.priv.literalValue >= 0) {
-                        let tupleLength = rightType.priv.literalValue;
-                        // We'll treat <, <= and == as positive tests with >=, > and != as
-                        // their negative counterparts.
-                        const isLessOrEqual = testExpression.d.operator === 12 /* OperatorType.Equals */ ||
-                            testExpression.d.operator === 20 /* OperatorType.LessThan */ ||
-                            testExpression.d.operator === 21 /* OperatorType.LessThanOrEqual */;
-                        const adjIsPositiveTest = isLessOrEqual ? isPositiveTest : !isPositiveTest;
-                        // For <= (or its negative counterpart >), adjust the tuple length by 1.
-                        if (testExpression.d.operator === 21 /* OperatorType.LessThanOrEqual */ ||
-                            testExpression.d.operator === 15 /* OperatorType.GreaterThan */) {
-                            tupleLength++;
-                        }
-                        const isEqualityCheck = testExpression.d.operator === 12 /* OperatorType.Equals */ ||
-                            testExpression.d.operator === 28 /* OperatorType.NotEquals */;
-                        return (type) => {
-                            return {
-                                type: narrowTypeForTupleLength(evaluator, type, tupleLength, adjIsPositiveTest, !isEqualityCheck),
-                                isIncomplete: !!callTypeResult.isIncomplete || !!rightTypeResult.isIncomplete,
-                            };
+            const memberAccessInfo = TypeEvaluatorNarrowing.getMemberAccessNarrowingInfo(getMemberAccessNarrowingContext(evaluator), reference, testExpression, isPositiveTest);
+            if (memberAccessInfo) {
+                if (memberAccessInfo.kind === 'none') {
+                    return (type) => {
+                        return {
+                            type: narrowTypeForDiscriminatedFieldNoneComparison(evaluator, type, memberAccessInfo.memberName, memberAccessInfo.adjIsPositiveTest),
+                            isIncomplete: false,
                         };
-                    }
+                    };
                 }
-            }
-        }
-        if (testExpression.d.operator === 41 /* OperatorType.In */ || testExpression.d.operator === 42 /* OperatorType.NotIn */) {
-            // Look for "x in y" or "x not in y" where y is one of several built-in types.
-            if (isMatchingExpressionOrWalrusRhs(evaluator, reference, testExpression.d.leftExpr)) {
-                const rightTypeResult = evaluator.getTypeOfExpression(testExpression.d.rightExpr);
-                const rightType = rightTypeResult.type;
-                const adjIsPositiveTest = testExpression.d.operator === 41 /* OperatorType.In */ ? isPositiveTest : !isPositiveTest;
                 return (type) => {
                     return {
-                        type: narrowTypeForContainerType(evaluator, type, rightType, adjIsPositiveTest),
-                        isIncomplete: !!rightTypeResult.isIncomplete,
+                        type: narrowTypeForDiscriminatedLiteralFieldComparison(evaluator, type, memberAccessInfo.memberName, memberAccessInfo.rightType, memberAccessInfo.adjIsPositiveTest),
+                        isIncomplete: memberAccessInfo.isIncomplete,
                     };
                 };
             }
-            if (ParseTreeUtils.isMatchingExpression(reference, testExpression.d.rightExpr, (ref, expr) => isNameSameScope(evaluator, ref, expr))) {
-                // Look for <string literal> in y where y is a union that contains
-                // one or more TypedDicts.
-                const leftTypeResult = evaluator.getTypeOfExpression(testExpression.d.leftExpr);
-                const leftType = leftTypeResult.type;
-                if ((0, types_1.isClassInstance)(leftType) && types_1.ClassType.isBuiltIn(leftType, 'str') && (0, typeUtils_1.isLiteralType)(leftType)) {
-                    const adjIsPositiveTest = testExpression.d.operator === 41 /* OperatorType.In */ ? isPositiveTest : !isPositiveTest;
-                    return (type) => {
-                        return {
-                            type: narrowTypeForTypedDictKey(evaluator, type, types_1.ClassType.cloneAsInstantiable(leftType), adjIsPositiveTest),
-                            isIncomplete: !!leftTypeResult.isIncomplete,
-                        };
+        }
+        const lenComparisonInfo = TypeEvaluatorNarrowing.getLenComparisonNarrowingInfo(getLenComparisonNarrowingContext(evaluator), reference, testExpression, isPositiveTest);
+        if (lenComparisonInfo) {
+            return (type) => {
+                return {
+                    type: narrowTypeForTupleLength(evaluator, type, lenComparisonInfo.tupleLength, lenComparisonInfo.adjIsPositiveTest, lenComparisonInfo.isLessThanCheck),
+                    isIncomplete: lenComparisonInfo.isIncomplete,
+                };
+            };
+        }
+        const inOperatorInfo = TypeEvaluatorNarrowing.getInOperatorNarrowingInfo(getInOperatorNarrowingContext(evaluator), reference, testExpression, isPositiveTest);
+        if (inOperatorInfo) {
+            if (inOperatorInfo.kind === 'container') {
+                return (type) => {
+                    return {
+                        type: narrowTypeForContainerType(evaluator, type, inOperatorInfo.containerType, inOperatorInfo.adjIsPositiveTest),
+                        isIncomplete: inOperatorInfo.isIncomplete,
                     };
-                }
+                };
             }
+            return (type) => {
+                return {
+                    type: narrowTypeForTypedDictKey(evaluator, type, inOperatorInfo.typedDictKeyType, inOperatorInfo.adjIsPositiveTest),
+                    isIncomplete: inOperatorInfo.isIncomplete,
+                };
+            };
         }
     }
     if (testExpression.nodeType === 9 /* ParseNodeType.Call */) {
-        // Look for "isinstance(X, Y)" or "issubclass(X, Y)".
-        if (testExpression.d.args.length === 2) {
-            // Make sure the first parameter is a supported expression type
-            // and the second parameter is a valid class type or a tuple
-            // of valid class types.
-            const arg0Expr = testExpression.d.args[0].d.valueExpr;
-            const arg1Expr = testExpression.d.args[1].d.valueExpr;
-            if (isMatchingExpressionOrWalrusRhs(evaluator, reference, arg0Expr)) {
-                const callTypeResult = evaluator.getTypeOfExpression(testExpression.d.leftExpr, 2 /* EvalFlags.CallBaseDefaults */);
-                const callType = callTypeResult.type;
-                if ((0, types_1.isFunction)(callType) && types_1.FunctionType.isBuiltIn(callType, ['isinstance', 'issubclass'])) {
-                    const isInstanceCheck = types_1.FunctionType.isBuiltIn(callType, 'isinstance');
-                    const arg1TypeResult = evaluator.getTypeOfExpression(arg1Expr, 536871546 /* EvalFlags.IsInstanceArgDefaults */);
-                    const arg1Type = arg1TypeResult.type;
-                    const classTypeInfo = getIsInstanceClassTypes(evaluator, arg1Type, arg1Expr);
-                    const isIncomplete = !!callTypeResult.isIncomplete || !!arg1TypeResult.isIncomplete;
-                    if (classTypeInfo) {
-                        const classTypeList = isPositiveTest
-                            ? classTypeInfo.classTypes
-                            : classTypeInfo.negativeClassTypes;
-                        return (type) => {
-                            return {
-                                type: narrowTypeForInstanceOrSubclass(evaluator, type, classTypeList, isInstanceCheck, 
-                                /* isTypeIsCheck */ false, isPositiveTest, testExpression, nodeInfo),
-                                isIncomplete,
-                            };
-                        };
-                    }
-                    else if (isIncomplete) {
-                        // If the type is incomplete, it may include unknowns, which will result
-                        // in classTypeList being undefined.
-                        return (type) => {
-                            return {
-                                type,
-                                isIncomplete: true,
-                            };
-                        };
-                    }
-                }
-            }
-        }
-        // Look for "bool(X)"
-        if (testExpression.d.args.length === 1 && !testExpression.d.args[0].d.name) {
-            if (isMatchingExpressionOrWalrusRhs(evaluator, reference, testExpression.d.args[0].d.valueExpr)) {
-                const callTypeResult = evaluator.getTypeOfExpression(testExpression.d.leftExpr, 2 /* EvalFlags.CallBaseDefaults */);
-                const callType = callTypeResult.type;
-                if ((0, types_1.isInstantiableClass)(callType) && types_1.ClassType.isBuiltIn(callType, 'bool')) {
-                    return (type) => {
-                        return {
-                            type: narrowTypeForTruthiness(evaluator, type, isPositiveTest),
-                            isIncomplete: !!callTypeResult.isIncomplete,
-                        };
+        const isInstanceInfo = TypeEvaluatorNarrowing.getIsInstanceCallNarrowingInfo(getIsInstanceCallNarrowingContext(evaluator), reference, testExpression, isPositiveTest);
+        if (isInstanceInfo) {
+            if (isInstanceInfo.kind === 'narrow') {
+                return (type) => {
+                    return {
+                        type: narrowTypeForInstanceOrSubclass(evaluator, type, isInstanceInfo.classTypeList, isInstanceInfo.isInstanceCheck, 
+                        /* isTypeIsCheck */ false, isPositiveTest, testExpression, nodeInfo),
+                        isIncomplete: isInstanceInfo.isIncomplete,
                     };
-                }
+                };
             }
+            return (type) => {
+                return {
+                    type,
+                    isIncomplete: true,
+                };
+            };
+        }
+        const boolCallInfo = TypeEvaluatorNarrowing.getBoolCallNarrowingInfo(getBoolCallNarrowingContext(evaluator), reference, testExpression);
+        if (boolCallInfo) {
+            return (type) => {
+                return {
+                    type: narrowTypeForTruthiness(evaluator, type, isPositiveTest),
+                    isIncomplete: boolCallInfo.isIncomplete,
+                };
+            };
         }
         // Look for a TypeGuard function.
         const isFunctionReturnTypeGuard = (type) => {
@@ -645,11 +516,9 @@ function getTypeNarrowingCallback(evaluator, reference, testExpression, isPositi
     // We normally won't find a "not" operator here because they are stripped out
     // by the binder when it creates condition flow nodes, but we can find this
     // in the case of local variables type narrowing.
-    if (reference.nodeType === 38 /* ParseNodeType.Name */) {
-        if (testExpression.nodeType === 55 /* ParseNodeType.UnaryOperation */ &&
-            testExpression.d.operator === 38 /* OperatorType.Not */) {
-            return getTypeNarrowingCallback(evaluator, reference, testExpression.d.expr, !isPositiveTest, nodeInfo, recursionCount);
-        }
+    const notExpressionInfo = TypeEvaluatorNarrowing.getNotExpressionNarrowingInfo(reference, testExpression, isPositiveTest);
+    if (reference.nodeType === 38 /* ParseNodeType.Name */ && notExpressionInfo) {
+        return getTypeNarrowingCallback(evaluator, reference, notExpressionInfo.innerExpression, notExpressionInfo.adjIsPositiveTest, nodeInfo, recursionCount);
     }
     return undefined;
 }
@@ -744,377 +613,34 @@ function getTypeNarrowingCallbackForAssignmentExpression(evaluator, reference, t
         getTypeNarrowingCallback(evaluator, reference, testExpression.d.name, isPositiveTest, nodeInfo, recursionCount));
 }
 function narrowTypeForUserDefinedTypeGuard(evaluator, type, typeGuardType, isPositiveTest, isStrictTypeGuard, errorNode, nodeInfo) {
-    // For non-strict type guards, always narrow to the typeGuardType
-    // in the positive case and don't narrow in the negative case.
-    if (!isStrictTypeGuard) {
-        let result = type;
-        if (isPositiveTest) {
-            result = typeGuardType;
-            // If the type guard is a non-constrained TypeVar, add a
-            // condition to the resulting type.
-            if ((0, types_1.isTypeVar)(type) && !(0, types_1.isParamSpec)(type) && !types_1.TypeVarType.hasConstraints(type)) {
-                result = (0, typeUtils_1.addConditionToType)(result, [{ typeVar: type, constraintIndex: 0 }]);
-            }
-            return result;
-        }
-        return result;
-    }
-    const filterTypes = [];
-    (0, typeUtils_1.doForEachSubtype)(typeGuardType, (typeGuardSubtype) => {
-        filterTypes.push((0, typeUtils_1.convertToInstantiable)(typeGuardSubtype));
-    });
-    return narrowTypeForInstanceOrSubclass(evaluator, type, filterTypes, 
-    /* isInstanceCheck */ true, 
-    /* isTypeIsCheck */ true, isPositiveTest, errorNode, nodeInfo);
+    return TypeEvaluatorNarrowing.narrowTypeForUserDefinedTypeGuard(evaluator, type, typeGuardType, isPositiveTest, isStrictTypeGuard, errorNode, nodeInfo, narrowTypeForInstanceOrSubclass);
 }
 // Narrow the type based on whether the subtype can be true or false.
 function narrowTypeForTruthiness(evaluator, type, isPositiveTest) {
-    return (0, typeUtils_1.mapSubtypes)(type, (subtype) => {
-        if (isPositiveTest) {
-            if (evaluator.canBeTruthy(subtype)) {
-                return evaluator.removeFalsinessFromType(subtype);
-            }
-        }
-        else {
-            if (evaluator.canBeFalsy(subtype)) {
-                return evaluator.removeTruthinessFromType(subtype);
-            }
-        }
-        return undefined;
-    });
+    return TypeEvaluatorNarrowing.narrowTypeForTruthiness(evaluator, type, isPositiveTest);
 }
 // Handle type narrowing for expressions of the form "a[I] is None" and "a[I] is not None" where
 // I is an integer and a is a union of Tuples (or subtypes thereof) with known lengths and entry types.
 function narrowTupleTypeForIsNone(evaluator, type, isPositiveTest, indexValue) {
-    return evaluator.mapSubtypesExpandTypeVars(type, /* options */ undefined, (subtype) => {
-        const tupleType = (0, typeUtils_1.getSpecializedTupleType)(subtype);
-        if (!tupleType || (0, typeUtils_1.isUnboundedTupleClass)(tupleType) || !tupleType.priv.tupleTypeArgs) {
-            return subtype;
-        }
-        const tupleLength = tupleType.priv.tupleTypeArgs.length;
-        if (indexValue < 0 || indexValue >= tupleLength) {
-            return subtype;
-        }
-        const typeOfEntry = evaluator.makeTopLevelTypeVarsConcrete(tupleType.priv.tupleTypeArgs[indexValue].type);
-        if (isPositiveTest) {
-            if (!evaluator.assignType(typeOfEntry, evaluator.getNoneType())) {
-                return undefined;
-            }
-        }
-        else {
-            if ((0, typeUtils_1.isNoneInstance)(typeOfEntry)) {
-                return undefined;
-            }
-        }
-        return subtype;
-    });
-}
-// Walks a chain of NewType instances down to the innermost non-NewType base
-// instance (e.g. NewType("Y", NewType("X", bool)) -> an instance of bool).
-// Returns undefined if `subtype` is not a NewType instance or its base cannot
-// be resolved to a class.
-function getInnermostNewTypeBaseInstance(subtype) {
-    if (!(0, types_1.isClassInstance)(subtype) || !types_1.ClassType.isNewTypeClass(subtype)) {
-        return undefined;
-    }
-    let currentType = subtype;
-    while ((0, types_1.isClassInstance)(currentType) && types_1.ClassType.isNewTypeClass(currentType)) {
-        if (currentType.shared.baseClasses.length === 0) {
-            return undefined;
-        }
-        const baseClass = currentType.shared.baseClasses[0];
-        if (!(0, types_1.isClass)(baseClass)) {
-            return undefined;
-        }
-        currentType = types_1.ClassType.cloneAsInstance(baseClass);
-    }
-    return currentType;
+    return TypeEvaluatorNarrowing.narrowTupleTypeForIsNone(evaluator, type, isPositiveTest, indexValue);
 }
 // Handle type narrowing for expressions of the form "x is None" and "x is not None".
 function narrowTypeForIsNone(evaluator, type, isPositiveTest) {
-    const expandedType = (0, typeUtils_1.mapSubtypes)(type, (subtype) => {
-        return (0, typeUtils_1.transformPossibleRecursiveTypeAlias)(subtype);
-    });
-    let resultIncludesNoneSubtype = false;
-    const result = evaluator.mapSubtypesExpandTypeVars(expandedType, 
-    /* options */ undefined, (subtype, unexpandedSubtype) => {
-        if ((0, types_1.isAnyOrUnknown)(subtype)) {
-            // Narrow to None in positive tests, matching the behavior of other
-            // narrowing functions (narrowTypeForInstanceOrSubclass, narrowTypeForLiteralComparison).
-            if (isPositiveTest) {
-                resultIncludesNoneSubtype = true;
-                return (0, typeUtils_1.addConditionToType)(evaluator.getNoneType(), subtype.props?.condition);
-            }
-            // For negative tests, keep the original type.
-            return subtype;
-        }
-        let useExpandedSubtype = false;
-        if ((0, types_1.isTypeVar)(unexpandedSubtype) && !types_1.TypeVarType.isSelf(unexpandedSubtype)) {
-            // If the TypeVar has value constraints and one or more of them
-            // are possibly compatible with None, use the expanded subtypes.
-            if (unexpandedSubtype.shared.constraints.some((constraint) => {
-                return evaluator.assignType(constraint, evaluator.getNoneType());
-            })) {
-                useExpandedSubtype = true;
-            }
-            // If the TypeVar han an explicit bound that is possibly compatible
-            // with None (e.g. "T: int | None"), use the expanded subtypes.
-            if (unexpandedSubtype.shared.boundType &&
-                evaluator.assignType(unexpandedSubtype.shared.boundType, evaluator.getNoneType())) {
-                useExpandedSubtype = true;
-            }
-        }
-        const adjustedSubtype = useExpandedSubtype ? subtype : unexpandedSubtype;
-        // A NewType whose innermost base is exactly None (e.g. NewType("Apple", NoneType))
-        // can be identity-compared with None: keep the NewType identity on the positive
-        // branch and eliminate it on the negative branch. A NewType whose base is merely
-        // None-compatible (e.g. NewType("Obj", object)) is intentionally not handled here;
-        // it falls through to the generic checks below so that "is not None" does not
-        // incorrectly collapse to Never.
-        const newTypeBaseInstance = getInnermostNewTypeBaseInstance(adjustedSubtype);
-        if (newTypeBaseInstance && (0, typeUtils_1.isNoneInstance)(newTypeBaseInstance)) {
-            resultIncludesNoneSubtype = true;
-            return isPositiveTest ? adjustedSubtype : undefined;
-        }
-        // Is it an exact match for None?
-        if ((0, typeUtils_1.isNoneInstance)(subtype)) {
-            resultIncludesNoneSubtype = true;
-            return isPositiveTest ? adjustedSubtype : undefined;
-        }
-        // Is it potentially None?
-        if (evaluator.assignType(subtype, evaluator.getNoneType())) {
-            resultIncludesNoneSubtype = true;
-            return isPositiveTest
-                ? (0, typeUtils_1.addConditionToType)(evaluator.getNoneType(), subtype.props?.condition)
-                : adjustedSubtype;
-        }
-        return isPositiveTest ? undefined : adjustedSubtype;
-    });
-    // If this is a positive test and the result is a union that includes None,
-    // we can eliminate all the non-None subtypes include Any or Unknown. If some
-    // of the subtypes are None types with conditions, retain those.
-    if (isPositiveTest && resultIncludesNoneSubtype) {
-        return (0, typeUtils_1.mapSubtypes)(result, (subtype) => {
-            const baseInstance = getInnermostNewTypeBaseInstance(subtype);
-            return (0, typeUtils_1.isNoneInstance)(subtype) || (baseInstance && (0, typeUtils_1.isNoneInstance)(baseInstance)) ? subtype : undefined;
-        });
-    }
-    return result;
+    return TypeEvaluatorNarrowing.narrowTypeForIsNone(evaluator, type, isPositiveTest);
 }
 // Handle type narrowing for expressions of the form "x is ..." and "x is not ...".
 function narrowTypeForIsEllipsis(evaluator, node, type, isPositiveTest) {
-    const expandedType = (0, typeUtils_1.mapSubtypes)(type, (subtype) => {
-        return (0, typeUtils_1.transformPossibleRecursiveTypeAlias)(subtype);
-    });
-    let resultIncludesEllipsisSubtype = false;
-    const ellipsisType = evaluator.getBuiltInObject(node, 'EllipsisType') ??
-        evaluator.getBuiltInObject(node, 'ellipsis') ??
-        types_1.AnyType.create();
-    const isEllipsisInstance = (subtype) => {
-        return (0, types_1.isClassInstance)(subtype) && types_1.ClassType.isBuiltIn(subtype, ['EllipsisType', 'ellipsis']);
-    };
-    const result = evaluator.mapSubtypesExpandTypeVars(expandedType, 
-    /* options */ undefined, (subtype, unexpandedSubtype) => {
-        if ((0, types_1.isAnyOrUnknown)(subtype)) {
-            // We need to assume that "Any" is always both ellipsis and not ellipsis,
-            // so it matches regardless of whether the test is positive or negative.
-            return subtype;
-        }
-        // If this is a TypeVar that isn't constrained, use the unexpanded
-        // TypeVar. For all other cases (including constrained TypeVars),
-        // use the expanded subtype.
-        const adjustedSubtype = (0, types_1.isTypeVar)(unexpandedSubtype) && !types_1.TypeVarType.hasConstraints(unexpandedSubtype)
-            ? unexpandedSubtype
-            : subtype;
-        // Only a NewType whose innermost base is exactly the ellipsis type is treated
-        // as the singleton (see narrowTypeForIsNone for the rationale); a merely
-        // ellipsis-compatible base falls through so "is not ..." does not collapse to Never.
-        const newTypeBaseInstance = getInnermostNewTypeBaseInstance(adjustedSubtype);
-        if (newTypeBaseInstance && isEllipsisInstance(newTypeBaseInstance)) {
-            resultIncludesEllipsisSubtype = true;
-            return isPositiveTest ? adjustedSubtype : undefined;
-        }
-        // Is it an exact match for ellipsis?
-        if (isEllipsisInstance(subtype)) {
-            resultIncludesEllipsisSubtype = true;
-            return isPositiveTest ? adjustedSubtype : undefined;
-        }
-        // Is it potentially ellipsis?
-        if (evaluator.assignType(subtype, ellipsisType)) {
-            resultIncludesEllipsisSubtype = true;
-            return isPositiveTest ? (0, typeUtils_1.addConditionToType)(ellipsisType, subtype.props?.condition) : adjustedSubtype;
-        }
-        return isPositiveTest ? undefined : adjustedSubtype;
-    });
-    // If this is a positive test and the result is a union that includes ellipsis,
-    // we can eliminate all the non-ellipsis subtypes include Any or Unknown. If some
-    // of the subtypes are ellipsis types with conditions, retain those.
-    if (isPositiveTest && resultIncludesEllipsisSubtype) {
-        return (0, typeUtils_1.mapSubtypes)(result, (subtype) => {
-            const baseInstance = getInnermostNewTypeBaseInstance(subtype);
-            return isEllipsisInstance(subtype) || (baseInstance && isEllipsisInstance(baseInstance))
-                ? subtype
-                : undefined;
-        });
-    }
-    return result;
+    return TypeEvaluatorNarrowing.narrowTypeForIsEllipsis(evaluator, node, type, isPositiveTest);
 }
 // The "isinstance" and "issubclass" calls accept classes, runtime unions,
 // and arbitrarily-nested tuples of these. This method extracts possible
 // classes and guaranteed negative filters,
 // or undefined if the filter contains a non-class type.
 function getIsInstanceClassTypes(evaluator, argType, argExpr) {
-    let foundNonClassType = false;
-    const classTypes = [];
-    const negativeClassTypes = [];
-    // Create a helper function that returns a list of class types or
-    // undefined if any of the types are not valid.
-    const addClassTypesToList = (types, isAmbiguous, isUnboundedEntry) => {
-        types.forEach((subtype) => {
-            if ((0, types_1.isClass)(subtype)) {
-                subtype = (0, typeUtils_1.specializeWithUnknownTypeArgs)(subtype, evaluator.getTupleClassType());
-                if ((0, types_1.isInstantiableClass)(subtype) && types_1.ClassType.isBuiltIn(subtype, 'Callable')) {
-                    subtype = (0, typeUtils_1.convertToInstantiable)((0, typeUtils_1.getUnknownTypeForCallable)());
-                }
-                else if (types_1.TypeBase.isInstance(subtype) && types_1.ClassType.isBuiltIn(subtype, 'type')) {
-                    if (subtype.priv.typeArgs && subtype.priv.typeArgs.length > 0) {
-                        const typeArg = subtype.priv.typeArgs[0];
-                        if ((0, types_1.isAnyOrUnknown)(typeArg)) {
-                            foundNonClassType = true;
-                            return;
-                        }
-                        if ((0, types_1.isInstantiableClass)(typeArg)) {
-                            subtype = types_1.ClassType.cloneIncludeSubclasses(typeArg);
-                        }
-                        else if ((0, types_1.isClassInstance)(typeArg)) {
-                            subtype = types_1.ClassType.cloneAsInstantiable(typeArg);
-                        }
-                    }
-                }
-            }
-            let classType;
-            if ((0, types_1.isInstantiableClass)(subtype)) {
-                // If this is a reference to a class that has type promotions (e.g.
-                // float or complex), remove the promotions for purposes of the
-                // isinstance check).
-                if (!subtype.priv.includeSubclasses && subtype.priv.includePromotions) {
-                    subtype = types_1.ClassType.cloneRemoveTypePromotions(subtype);
-                }
-                classType = subtype;
-            }
-            else if ((0, types_1.isTypeVar)(subtype) && types_1.TypeBase.isInstantiable(subtype)) {
-                classType = subtype;
-            }
-            else if ((0, typeUtils_1.isNoneTypeClass)(subtype)) {
-                (0, debug_1.assert)((0, types_1.isInstantiableClass)(subtype));
-                classType = subtype;
-            }
-            else if ((0, types_1.isFunction)(subtype) &&
-                subtype.shared.parameters.length === 2 &&
-                subtype.shared.parameters[0].category === 1 /* ParamCategory.ArgsList */ &&
-                subtype.shared.parameters[1].category === 2 /* ParamCategory.KwargsDict */) {
-                classType = subtype;
-            }
-            else {
-                foundNonClassType = true;
-                return;
-            }
-            classTypes.push(classType);
-            // Unbounded entries may be absent, and alternative class objects
-            // are not all guaranteed to participate in the runtime check.
-            if (!isUnboundedEntry && !isAmbiguous) {
-                negativeClassTypes.push(classType);
-            }
-        });
-    };
-    const addClassTypesRecursive = (type, isAmbiguous, isUnboundedEntry, recursionCount, expression) => {
-        if (recursionCount > types_1.maxTypeRecursionCount) {
-            return;
-        }
-        // A runtime union checks both operands, but either operand can itself
-        // be an alternative class object. Keep their certainty separate.
-        if ((0, types_1.isUnion)(type) &&
-            expression?.nodeType === 7 /* ParseNodeType.BinaryOperation */ &&
-            expression.d.operator === 6 /* OperatorType.BitwiseOr */) {
-            const leftType = evaluator.getCachedType(expression.d.leftExpr);
-            const rightType = evaluator.getCachedType(expression.d.rightExpr);
-            if (leftType &&
-                rightType &&
-                !(0, operations_1.customMetaclassSupportsMethod)(leftType, '__or__') &&
-                !(0, operations_1.customMetaclassSupportsMethod)(rightType, '__ror__')) {
-                // Match the union evaluator's normalization of None operands to NoneType.
-                const adjustedLeftType = (0, typeUtils_1.isNoneInstance)(leftType)
-                    ? (0, typeUtils_1.convertToInstantiable)(evaluator.getNoneType())
-                    : leftType;
-                const adjustedRightType = (0, typeUtils_1.isNoneInstance)(rightType)
-                    ? (0, typeUtils_1.convertToInstantiable)(evaluator.getNoneType())
-                    : rightType;
-                addClassTypesRecursive(adjustedLeftType, isAmbiguous, isUnboundedEntry, recursionCount, expression.d.leftExpr);
-                addClassTypesRecursive(adjustedRightType, isAmbiguous, isUnboundedEntry, recursionCount, expression.d.rightExpr);
-                return;
-            }
-        }
-        const isRuntimeUnion = type.props?.specialForm && types_1.ClassType.isBuiltIn(type.props.specialForm, 'UnionType');
-        const isAmbiguousType = isAmbiguous || ((0, types_1.isUnion)(type) && !isRuntimeUnion);
-        (0, typeUtils_1.doForEachSubtype)(type, (subtype) => {
-            if ((0, types_1.isClassInstance)(subtype) && (0, typeUtils_1.isTupleClass)(subtype)) {
-                if (subtype.priv.tupleTypeArgs) {
-                    let entryExpressions;
-                    if (expression?.nodeType === 52 /* ParseNodeType.Tuple */) {
-                        const expressions = [];
-                        expression.d.items.forEach((item) => {
-                            if (item.nodeType !== 56 /* ParseNodeType.Unpack */) {
-                                expressions.push(item);
-                                return;
-                            }
-                            const unpackedType = evaluator.getCachedType(item.d.expr);
-                            const entryCount = unpackedType && (0, types_1.isClassInstance)(unpackedType) && (0, typeUtils_1.isTupleClass)(unpackedType)
-                                ? unpackedType.priv.tupleTypeArgs?.length ?? 1
-                                : 1;
-                            for (let index = 0; index < entryCount; index++) {
-                                expressions.push(undefined);
-                            }
-                        });
-                        if (expressions.length === subtype.priv.tupleTypeArgs.length) {
-                            entryExpressions = expressions;
-                        }
-                    }
-                    subtype.priv.tupleTypeArgs.forEach((tupleEntry, index) => {
-                        addClassTypesRecursive(tupleEntry.type, isAmbiguousType, isUnboundedEntry || tupleEntry.isUnbounded, recursionCount + 1, entryExpressions?.[index]);
-                    });
-                }
-            }
-            else {
-                addClassTypesToList([subtype], isAmbiguousType, isUnboundedEntry);
-            }
-        });
-    };
-    addClassTypesRecursive(argType, /* isAmbiguous */ false, /* isUnboundedEntry */ false, 0, argExpr);
-    return foundNonClassType ? undefined : { classTypes, negativeClassTypes };
+    return TypeEvaluatorNarrowing.getIsInstanceClassTypes(evaluator, argType, argExpr);
 }
 function narrowTypeForInstanceOrSubclass(evaluator, type, filterTypes, isInstanceCheck, isTypeIsCheck, isPositiveTest, errorNode, nodeInfo) {
-    if (!isInstanceCheck && !isTypeIsCheck && !isPositiveTest) {
-        // A custom subclass check can reject even the exact same final class.
-        // Preserve the existing narrowing policy for non-final classes, including ABCs.
-        filterTypes = filterTypes.filter((filterType) => {
-            const concreteFilterType = evaluator.makeTopLevelTypeVarsConcrete(filterType);
-            return (!(0, types_1.isInstantiableClass)(concreteFilterType) ||
-                !types_1.ClassType.isFinal(concreteFilterType) ||
-                !(0, operations_1.customMetaclassSupportsMethod)(concreteFilterType, '__subclasscheck__'));
-        });
-    }
-    if (!isPositiveTest && filterTypes.length === 0) {
-        return type;
-    }
-    // First try with intersection types disallowed.
-    const narrowedType = narrowTypeForInstanceOrSubclassInternal(evaluator, type, filterTypes, isInstanceCheck, isTypeIsCheck, isPositiveTest, 
-    /* allowIntersections */ false, errorNode, nodeInfo);
-    if (!(0, types_1.isNever)(narrowedType)) {
-        return narrowedType;
-    }
-    // Try again with intersection types allowed.
-    return narrowTypeForInstanceOrSubclassInternal(evaluator, type, filterTypes, isInstanceCheck, isTypeIsCheck, isPositiveTest, 
-    /* allowIntersections */ true, errorNode, nodeInfo);
+    return TypeEvaluatorNarrowing.narrowTypeForInstanceOrSubclass(evaluator, type, filterTypes, isInstanceCheck, isTypeIsCheck, isPositiveTest, errorNode, nodeInfo, narrowTypeForInstanceOrSubclassInternal);
 }
 function narrowTypeForInstanceOrSubclassInternal(evaluator, type, filterTypes, isInstanceCheck, isTypeIsCheck, isPositiveTest, allowIntersections, errorNode, nodeInfo) {
     const result = (0, typeUtils_1.mapSubtypes)(type, (subtype) => {
@@ -1594,756 +1120,91 @@ function intersectTupleTypes(type1, type2) {
 }
 // Attempts to narrow a union of tuples based on their known length.
 function narrowTypeForTupleLength(evaluator, referenceType, lengthValue, isPositiveTest, isLessThanCheck) {
-    return (0, typeUtils_1.mapSubtypes)(referenceType, (subtype) => {
-        const concreteSubtype = evaluator.makeTopLevelTypeVarsConcrete(subtype);
-        // If it's not a tuple, we can't narrow it.
-        if (!(0, types_1.isClassInstance)(concreteSubtype) ||
-            !(0, typeUtils_1.isTupleClass)(concreteSubtype) ||
-            !concreteSubtype.priv.tupleTypeArgs) {
-            return subtype;
-        }
-        // If the tuple contains a TypeVarTuple, we can't narrow it.
-        if (concreteSubtype.priv.tupleTypeArgs.some((typeArg) => (0, types_1.isUnpackedTypeVarTuple)(typeArg.type))) {
-            return subtype;
-        }
-        // If the tuple contains no unbounded elements, then we know its length exactly.
-        if (!concreteSubtype.priv.tupleTypeArgs.some((typeArg) => typeArg.isUnbounded)) {
-            const tupleLengthMatches = isLessThanCheck
-                ? concreteSubtype.priv.tupleTypeArgs.length < lengthValue
-                : concreteSubtype.priv.tupleTypeArgs.length === lengthValue;
-            return tupleLengthMatches === isPositiveTest ? subtype : undefined;
-        }
-        // The tuple contains a "...". We'll expand this into as many elements as
-        // necessary to match the lengthValue.
-        const elementsToAdd = lengthValue - concreteSubtype.priv.tupleTypeArgs.length + 1;
-        if (!isLessThanCheck) {
-            // If the specified length is smaller than the minimum length of this tuple,
-            // we can rule it out for a positive test and rule it in for a negative test.
-            if (elementsToAdd < 0) {
-                return isPositiveTest ? undefined : subtype;
-            }
-            if (!isPositiveTest) {
-                // If this is an equality check for the minimum length (e.g.
-                // "len(x) == 0"), we can expand the minimum length by one).
-                const minLen = concreteSubtype.priv.tupleTypeArgs.length - 1;
-                if (lengthValue === minLen) {
-                    return expandUnboundedTupleElement(concreteSubtype, 1, /* keepUnbounded */ true);
-                }
-                return subtype;
-            }
-            return expandUnboundedTupleElement(concreteSubtype, elementsToAdd, /* keepUnbounded */ false);
-        }
-        // If this is a tuple related to an "*args: P.args" parameter, don't expand it.
-        if ((0, types_1.isParamSpec)(subtype) && subtype.priv.paramSpecAccess) {
-            return subtype;
-        }
-        // Place an upper limit on the number of union subtypes we
-        // will expand the tuple to.
-        const maxTupleUnionExpansion = 32;
-        if (elementsToAdd > maxTupleUnionExpansion) {
-            return subtype;
-        }
-        if (isPositiveTest) {
-            if (elementsToAdd < 1) {
-                return undefined;
-            }
-            const typesToCombine = [];
-            for (let i = 0; i < elementsToAdd; i++) {
-                typesToCombine.push(expandUnboundedTupleElement(concreteSubtype, i, /* keepUnbounded */ false));
-            }
-            return (0, types_1.combineTypes)(typesToCombine);
-        }
-        return expandUnboundedTupleElement(concreteSubtype, elementsToAdd, /* keepUnbounded */ true);
-    });
+    return TypeEvaluatorNarrowing.narrowTypeForTupleLength(evaluator, referenceType, lengthValue, isPositiveTest, isLessThanCheck);
 }
 // Expands a tuple type that contains an unbounded element to include
 // multiple bounded elements of that same type in place of (or in addition
 // to) the unbounded element.
-function expandUnboundedTupleElement(tupleType, elementsToAdd, keepUnbounded) {
-    const tupleTypeArgs = [];
-    tupleType.priv.tupleTypeArgs.forEach((typeArg) => {
-        if (!typeArg.isUnbounded) {
-            tupleTypeArgs.push(typeArg);
-        }
-        else {
-            for (let i = 0; i < elementsToAdd; i++) {
-                tupleTypeArgs.push({ isUnbounded: false, type: typeArg.type });
-            }
-            if (keepUnbounded) {
-                tupleTypeArgs.push(typeArg);
-            }
-        }
-    });
-    return (0, typeUtils_1.specializeTupleClass)(tupleType, tupleTypeArgs);
-}
 // Attempts to narrow a type (make it more constrained) based on an "in" binary operator.
 function narrowTypeForContainerType(evaluator, referenceType, containerType, isPositiveTest) {
-    if (isPositiveTest) {
-        const elementType = getElementTypeForContainerNarrowing(containerType);
-        if (!elementType) {
-            return referenceType;
-        }
-        return narrowTypeForContainerElementType(evaluator, referenceType, evaluator.makeTopLevelTypeVarsConcrete(elementType));
-    }
-    // Narrowing in the negative case is possible only with tuples
-    // with a known length.
-    if (!(0, types_1.isClassInstance)(containerType) ||
-        !types_1.ClassType.isBuiltIn(containerType, 'tuple') ||
-        !containerType.priv.tupleTypeArgs) {
-        return referenceType;
-    }
-    // Determine which tuple types can be eliminated. Only "None" and
-    // literal types can be handled here.
-    const typesToEliminate = [];
-    containerType.priv.tupleTypeArgs.forEach((tupleEntry) => {
-        if (!tupleEntry.isUnbounded) {
-            if ((0, typeUtils_1.isNoneInstance)(tupleEntry.type)) {
-                typesToEliminate.push(tupleEntry.type);
-            }
-            else if ((0, types_1.isClassInstance)(tupleEntry.type) && (0, typeUtils_1.isLiteralType)(tupleEntry.type)) {
-                typesToEliminate.push(tupleEntry.type);
-            }
-        }
-    });
-    if (typesToEliminate.length === 0) {
-        return referenceType;
-    }
-    return (0, typeUtils_1.mapSubtypes)(referenceType, (referenceSubtype) => {
-        referenceSubtype = evaluator.makeTopLevelTypeVarsConcrete(referenceSubtype);
-        if ((0, types_1.isClassInstance)(referenceSubtype) && referenceSubtype.priv.literalValue === undefined) {
-            // If we're able to enumerate all possible literal values
-            // (for bool or enum), we can eliminate all others in a negative test.
-            const allLiteralTypes = enumerateLiteralsForType(evaluator, referenceSubtype);
-            if (allLiteralTypes && allLiteralTypes.length > 0) {
-                return (0, types_1.combineTypes)(allLiteralTypes.filter((type) => !typesToEliminate.some((t) => (0, types_1.isTypeSame)(t, type))));
-            }
-        }
-        if (typesToEliminate.some((t) => (0, types_1.isTypeSame)(t, referenceSubtype))) {
-            return undefined;
-        }
-        return referenceSubtype;
-    });
+    return TypeEvaluatorNarrowing.narrowTypeForContainerType(evaluator, referenceType, containerType, isPositiveTest);
 }
 function getElementTypeForContainerNarrowing(containerType) {
-    // We support contains narrowing only for certain built-in types that have been specialized.
-    const supportedContainers = ['list', 'set', 'frozenset', 'deque', 'tuple', 'dict', 'defaultdict', 'OrderedDict'];
-    if (!(0, types_1.isClassInstance)(containerType) || !types_1.ClassType.isBuiltIn(containerType, supportedContainers)) {
-        return undefined;
-    }
-    if (!containerType.priv.typeArgs || containerType.priv.typeArgs.length < 1) {
-        return undefined;
-    }
-    let elementType = containerType.priv.typeArgs[0];
-    if ((0, typeUtils_1.isTupleClass)(containerType) && containerType.priv.tupleTypeArgs) {
-        elementType = (0, types_1.combineTypes)(containerType.priv.tupleTypeArgs.map((t) => t.type));
-    }
-    return elementType;
+    return TypeEvaluatorNarrowing.getElementTypeForContainerNarrowing(containerType);
 }
 function narrowTypeForContainerElementType(evaluator, referenceType, elementType) {
-    return evaluator.mapSubtypesExpandTypeVars(referenceType, /* options */ undefined, (referenceSubtype) => {
-        return (0, typeUtils_1.mapSubtypes)(elementType, (elementSubtype) => {
-            if ((0, types_1.isAnyOrUnknown)(elementSubtype)) {
-                return referenceSubtype;
-            }
-            // If the two types are disjoint (i.e. are not comparable), eliminate this subtype.
-            if (!evaluator.isTypeComparable(elementSubtype, referenceSubtype)) {
-                return undefined;
-            }
-            // If one of the two types is a literal, we can narrow to that type.
-            if ((0, types_1.isClassInstance)(elementSubtype) &&
-                ((0, typeUtils_1.isLiteralLikeType)(elementSubtype) || (0, typeUtils_1.isNoneInstance)(elementSubtype)) &&
-                evaluator.assignType(referenceSubtype, elementSubtype)) {
-                return (0, typeUtils_1.stripTypeForm)((0, typeUtils_1.addConditionToType)(elementSubtype, referenceSubtype.props?.condition));
-            }
-            if ((0, types_1.isClassInstance)(referenceSubtype) &&
-                ((0, typeUtils_1.isLiteralLikeType)(referenceSubtype) || (0, typeUtils_1.isNoneInstance)(referenceSubtype)) &&
-                evaluator.assignType(elementSubtype, referenceSubtype)) {
-                return (0, typeUtils_1.stripTypeForm)((0, typeUtils_1.addConditionToType)(referenceSubtype, elementSubtype.props?.condition));
-            }
-            // If the element type is a known class object that is assignable to
-            // the reference type, we can narrow to that class object.
-            if ((0, types_1.isInstantiableClass)(elementSubtype) &&
-                !elementSubtype.priv.includeSubclasses &&
-                evaluator.assignType(referenceSubtype, elementSubtype)) {
-                return (0, typeUtils_1.stripTypeForm)((0, typeUtils_1.addConditionToType)(elementSubtype, referenceSubtype.props?.condition));
-            }
-            // It's not safe to narrow.
-            return referenceSubtype;
-        });
-    });
+    return TypeEvaluatorNarrowing.narrowTypeForContainerElementType(evaluator, referenceType, elementType);
 }
 // Attempts to narrow a type based on whether it is a TypedDict with
 // a literal key value.
 function narrowTypeForTypedDictKey(evaluator, referenceType, literalKey, isPositiveTest) {
-    const narrowedType = evaluator.mapSubtypesExpandTypeVars(referenceType, 
-    /* options */ undefined, (subtype, unexpandedSubtype) => {
-        if ((0, types_1.isParamSpec)(unexpandedSubtype)) {
-            return unexpandedSubtype;
-        }
-        if ((0, types_1.isClassInstance)(subtype) && types_1.ClassType.isTypedDictClass(subtype)) {
-            const entries = (0, typedDicts_1.getTypedDictMembersForClass)(evaluator, subtype, /* allowNarrowed */ true);
-            const knownEntry = entries.knownItems.get(literalKey.priv.literalValue);
-            const tdEntry = knownEntry ?? entries.extraItems;
-            if (isPositiveTest) {
-                // The code that is commented out below implements the behavior that is technically
-                // correct, but until we PEP 728 is ratified and we have a way to express "extra items"
-                // and closed TypedDicts, we'll preserve the older (less correct) behavior to enable
-                // narrowing of TypedDicts based on checks for specific keys.
-                // TODO - remove this behavior once PEP 728 is accepted and the feature is no
-                // longer experimental.
-                if (!tdEntry) {
-                    return undefined;
-                }
-                // if (!tdEntry) {
-                //     // If there is no TD entry for this key and no "extra items" defined,
-                //     // we have to assume that the TypedDict may contain extra items, so
-                //     // narrowing it isn't possible in this case.
-                //     return subtype;
-                // }
-                if ((0, types_1.isNever)(tdEntry.valueType)) {
-                    // If the entry is typed as Never or the "extra items" is typed as Never,
-                    // then this key cannot be present in the TypedDict, and we can eliminate it.
-                    // A closed TypedDict has an "extra items" of Never, so this is what allows
-                    // a key check to discriminate between closed TypedDicts.
-                    return undefined;
-                }
-                // If the entry is currently not required and not marked provided, we can mark
-                // it as provided after this guard expression confirms it is.
-                if (tdEntry.isRequired || tdEntry.isProvided) {
-                    return subtype;
-                }
-                const newNarrowedEntriesMap = new Map(subtype.priv.typedDictNarrowedEntries ?? []);
-                // Add the new entry.
-                newNarrowedEntriesMap.set(literalKey.priv.literalValue, {
-                    valueType: tdEntry.valueType,
-                    isReadOnly: tdEntry.isReadOnly,
-                    isRequired: false,
-                    isProvided: true,
-                });
-                // Clone the TypedDict object with the new entries.
-                return types_1.ClassType.cloneAsInstance(types_1.ClassType.cloneForNarrowedTypedDictEntries(types_1.ClassType.cloneAsInstantiable(subtype), newNarrowedEntriesMap));
-            }
-            else {
-                if (!knownEntry) {
-                    // The key is not one of the known items, so it can be supplied
-                    // only through an "extra items" entry, which says nothing about
-                    // whether this particular key is present. Its absence is therefore
-                    // consistent with the type, and the subtype cannot be eliminated.
-                    return subtype;
-                }
-                return knownEntry.isRequired || knownEntry.isProvided ? undefined : subtype;
-            }
-        }
-        return subtype;
-    });
-    return narrowedType;
+    return TypeEvaluatorNarrowing.narrowTypeForTypedDictKey(evaluator, referenceType, literalKey, isPositiveTest);
 }
 // Attempts to narrow a TypedDict type based on a comparison (equal or not
 // equal) between a discriminating entry type that has a declared literal
 // type to a literal value.
 function narrowTypeForDiscriminatedDictEntryComparison(evaluator, referenceType, indexLiteralType, literalType, isPositiveTest) {
-    let canNarrow = true;
-    const narrowedType = (0, typeUtils_1.mapSubtypes)(referenceType, (subtype) => {
-        if ((0, types_1.isClassInstance)(subtype) && types_1.ClassType.isTypedDictClass(subtype)) {
-            const symbolMap = (0, typedDicts_1.getTypedDictMembersForClass)(evaluator, subtype);
-            const tdEntry = symbolMap.knownItems.get(indexLiteralType.priv.literalValue);
-            if (tdEntry && (0, typeUtils_1.isLiteralTypeOrUnion)(tdEntry.valueType)) {
-                if (isPositiveTest) {
-                    let foundMatch = false;
-                    (0, typeUtils_1.doForEachSubtype)(literalType, (literalSubtype) => {
-                        if (evaluator.assignType(tdEntry.valueType, literalSubtype)) {
-                            foundMatch = true;
-                        }
-                    });
-                    return foundMatch ? subtype : undefined;
-                }
-                else {
-                    let foundNonMatch = false;
-                    (0, typeUtils_1.doForEachSubtype)(literalType, (literalSubtype) => {
-                        if (!evaluator.assignType(literalSubtype, tdEntry.valueType)) {
-                            foundNonMatch = true;
-                        }
-                    });
-                    return foundNonMatch ? subtype : undefined;
-                }
-            }
-        }
-        canNarrow = false;
-        return subtype;
-    });
-    return canNarrow ? narrowedType : referenceType;
+    return TypeEvaluatorNarrowing.narrowTypeForDiscriminatedDictEntryComparison(evaluator, referenceType, indexLiteralType, literalType, isPositiveTest);
 }
 function narrowTypeForDiscriminatedTupleComparison(evaluator, referenceType, indexLiteralType, literalType, isPositiveTest) {
-    let canNarrow = true;
-    const narrowedType = (0, typeUtils_1.mapSubtypes)(referenceType, (subtype) => {
-        if ((0, types_1.isClassInstance)(subtype) &&
-            types_1.ClassType.isTupleClass(subtype) &&
-            !(0, typeUtils_1.isUnboundedTupleClass)(subtype) &&
-            typeof indexLiteralType.priv.literalValue === 'number' &&
-            (0, types_1.isClassInstance)(literalType)) {
-            const indexValue = indexLiteralType.priv.literalValue;
-            if (subtype.priv.tupleTypeArgs && indexValue >= 0 && indexValue < subtype.priv.tupleTypeArgs.length) {
-                const tupleEntryType = subtype.priv.tupleTypeArgs[indexValue]?.type;
-                if (tupleEntryType && (0, typeUtils_1.isLiteralTypeOrUnion)(tupleEntryType)) {
-                    if (isPositiveTest) {
-                        return evaluator.assignType(tupleEntryType, literalType) ? subtype : undefined;
-                    }
-                    else {
-                        return evaluator.assignType(literalType, tupleEntryType) ? undefined : subtype;
-                    }
-                }
-            }
-        }
-        canNarrow = false;
-        return subtype;
-    });
-    return canNarrow ? narrowedType : referenceType;
+    return TypeEvaluatorNarrowing.narrowTypeForDiscriminatedTupleComparison(evaluator, referenceType, indexLiteralType, literalType, isPositiveTest);
 }
 // Attempts to narrow a type based on a comparison (equal or not equal)
 // between a discriminating field that has a declared literal type to a
 // literal value.
 function narrowTypeForDiscriminatedLiteralFieldComparison(evaluator, referenceType, memberName, literalType, isPositiveTest) {
-    const narrowedType = (0, typeUtils_1.mapSubtypes)(referenceType, (subtype) => {
-        let memberInfo;
-        if ((0, types_1.isClassInstance)(subtype)) {
-            memberInfo = (0, typeUtils_1.lookUpObjectMember)(subtype, memberName);
-        }
-        else if ((0, types_1.isInstantiableClass)(subtype)) {
-            memberInfo = (0, typeUtils_1.lookUpClassMember)(subtype, memberName);
-        }
-        if (memberInfo && memberInfo.isTypeDeclared) {
-            let memberType = evaluator.getTypeOfMember(memberInfo);
-            // Handle the case where the field is a property
-            // that has a declared literal return type for its getter.
-            if ((0, types_1.isClassInstance)(subtype) && (0, types_1.isClassInstance)(memberType) && (0, typeUtils_1.isProperty)(memberType)) {
-                const getterType = memberType.priv.fgetInfo?.methodType;
-                if (getterType && (0, types_1.isFunction)(getterType) && getterType.shared.declaredReturnType) {
-                    const getterReturnType = types_1.FunctionType.getEffectiveReturnType(getterType);
-                    if (getterReturnType) {
-                        memberType = getterReturnType;
-                    }
-                }
-            }
-            if ((0, typeUtils_1.isLiteralTypeOrUnion)(memberType, /* allowNone */ true)) {
-                if (isPositiveTest) {
-                    return evaluator.assignType(memberType, literalType) ? subtype : undefined;
-                }
-                else {
-                    return evaluator.assignType(literalType, memberType) ? undefined : subtype;
-                }
-            }
-        }
-        return subtype;
-    });
-    return narrowedType;
+    return TypeEvaluatorNarrowing.narrowTypeForDiscriminatedLiteralFieldComparison(evaluator, referenceType, memberName, literalType, isPositiveTest);
 }
 // Attempts to narrow a type based on a comparison (equal or not equal)
 // between a discriminating field that has a declared None type to a
 // None.
 function narrowTypeForDiscriminatedFieldNoneComparison(evaluator, referenceType, memberName, isPositiveTest) {
-    return (0, typeUtils_1.mapSubtypes)(referenceType, (subtype) => {
-        let memberInfo;
-        if ((0, types_1.isClassInstance)(subtype)) {
-            memberInfo = (0, typeUtils_1.lookUpObjectMember)(subtype, memberName);
-        }
-        else if ((0, types_1.isInstantiableClass)(subtype)) {
-            memberInfo = (0, typeUtils_1.lookUpClassMember)(subtype, memberName);
-        }
-        if (memberInfo && memberInfo.isTypeDeclared) {
-            // Check the declared type before narrowing, since the member type
-            // below will be concretized and lose descriptor identity.
-            const declaredType = evaluator.getDeclaredTypeOfSymbol(memberInfo.symbol)?.type;
-            if (!declaredType) {
-                // isTypeDeclared is true but the type couldn't be resolved (e.g. an
-                // unresolvable stub).  Conservatively skip narrowing rather than risk
-                // incorrectly eliminating a descriptor-typed member.
-                return subtype;
-            }
-            // Check if any subtype of the declared type is a descriptor or property.
-            // isMaybeDescriptorInstance handles declared types in instance form (ClassInstance),
-            // while isMaybeDescriptorClass handles declared types in instantiable form
-            // (InstantiableClass), which occurs when the annotation refers to the class object itself.
-            // This check applies to both positive and negative test paths: descriptor __get__
-            // return values don't reflect stored values regardless of test polarity.
-            const isDescriptorOrProperty = (0, typeUtils_1.someSubtypes)(declaredType, (declaredSubtype) => (0, typeUtils_1.isProperty)(declaredSubtype) ||
-                (0, typeUtils_1.isMaybeDescriptorInstance)(declaredSubtype) ||
-                (0, typeUtils_1.isMaybeDescriptorClass)(declaredSubtype));
-            if (isDescriptorOrProperty) {
-                return subtype;
-            }
-            const memberType = evaluator.makeTopLevelTypeVarsConcrete(evaluator.getTypeOfMember(memberInfo));
-            let canNarrow = true;
-            if (isPositiveTest) {
-                (0, typeUtils_1.doForEachSubtype)(memberType, (memberSubtype) => {
-                    memberSubtype = evaluator.makeTopLevelTypeVarsConcrete(memberSubtype);
-                    if ((0, types_1.isAnyOrUnknown)(memberSubtype) || (0, typeUtils_1.isNoneInstance)(memberSubtype) || (0, types_1.isNever)(memberSubtype)) {
-                        canNarrow = false;
-                    }
-                });
-            }
-            else {
-                canNarrow = (0, typeUtils_1.isNoneInstance)(memberType);
-            }
-            if (canNarrow) {
-                return undefined;
-            }
-        }
-        return subtype;
-    });
+    return TypeEvaluatorNarrowing.narrowTypeForDiscriminatedFieldNoneComparison(evaluator, referenceType, memberName, isPositiveTest);
 }
+// Determines whether two classes have incompatible disjoint bases (PEP 800),
+// in which case no class can derive from both of them.
+// Fill gradual holes without replacing facts inferred from the guarded value.
 // Attempts to narrow a type based on a "type(x) is y" or "type(x) is not y" check.
-function narrowTypeForTypeIs(evaluator, type, classTypes, isPositiveTest) {
-    // We currently don't support narrowing in the negative direction
-    // when there are more than one class types.
-    if (!isPositiveTest && classTypes.length > 1) {
-        return type;
-    }
-    const typesToCombine = classTypes.map((classType) => {
-        return evaluator.mapSubtypesExpandTypeVars(type, 
-        /* options */ undefined, (subtype, unexpandedSubtype) => {
-            if ((0, types_1.isClassInstance)(subtype)) {
-                const matches = types_1.ClassType.isDerivedFrom(classType, types_1.ClassType.cloneAsInstantiable(subtype));
-                if (isPositiveTest) {
-                    if (matches) {
-                        if (types_1.ClassType.isSameGenericClass(types_1.ClassType.cloneAsInstantiable(subtype), classType)) {
-                            return (0, typeUtils_1.addConditionToType)(subtype, (0, typeUtils_1.getTypeCondition)(classType));
-                        }
-                        return (0, typeUtils_1.addConditionToType)(types_1.ClassType.cloneAsInstance(classType), subtype.props?.condition);
-                    }
-                    if (!classType.priv.includeSubclasses) {
-                        return undefined;
-                    }
-                    if (!(0, types_1.isTypeVar)(unexpandedSubtype) || !types_1.TypeVarType.isSelf(unexpandedSubtype)) {
-                        return (0, typeUtils_1.addConditionToType)(subtype, classType.props?.condition);
-                    }
-                }
-                if (!classType.priv.includeSubclasses) {
-                    // If the class if marked final and it matches, then
-                    // we can eliminate it in the negative case.
-                    if (matches && types_1.ClassType.isFinal(subtype)) {
-                        return undefined;
-                    }
-                    // We can't eliminate the subtype in the negative
-                    // case because it could be a subclass of the type,
-                    // in which case `type(x) is y` would fail.
-                    return subtype;
-                }
-            }
-            if ((0, types_1.isAnyOrUnknown)(subtype)) {
-                return isPositiveTest
-                    ? types_1.ClassType.cloneAsInstance((0, typeUtils_1.addConditionToType)(classType, (0, typeUtils_1.getTypeCondition)(subtype)))
-                    : subtype;
-            }
-            return unexpandedSubtype;
-        });
-    });
-    return (0, types_1.combineTypes)(typesToCombine);
-}
-function hasUnresolvedMetaclassInMro(classType) {
-    return classType.shared.mro.some((baseClass) => !(0, types_1.isInstantiableClass)(baseClass) || !!(baseClass.shared.flags & 134217728 /* ClassTypeFlags.HasUnresolvedMetaclass */));
+function narrowTypeForTypeIs(evaluator, type, classTypes, isPositiveTest, isIsOperator, classTypeVar, allowLegacyEquality) {
+    return TypeEvaluatorNarrowing.narrowTypeForTypeIs(evaluator, type, classTypes, isPositiveTest, isIsOperator, classTypeVar, allowLegacyEquality);
 }
 // Determines whether an equality comparison ("==" or "!=") involving the
 // specified class object is guaranteed to have identity semantics. This
 // requires that the class is statically closed (it cannot be a subclass
 // with a different metaclass), is not generic (specialized aliases compare
 // by value), and its metaclass does not override "__eq__" or "__ne__".
-function hasIdentityEqualitySemantics(classType, metaclassEqualityResults) {
-    if (classType.priv.includeSubclasses && !types_1.ClassType.isFinal(classType)) {
-        return false;
-    }
-    if (classType.shared.typeParams.length > 0) {
-        return false;
-    }
-    const metaclass = classType.shared.effectiveMetaclass;
-    if (!metaclass ||
-        !(0, types_1.isInstantiableClass)(metaclass) ||
-        hasUnresolvedMetaclassInMro(classType) ||
-        hasUnresolvedMetaclassInMro(metaclass)) {
-        return false;
-    }
-    if (types_1.ClassType.isBuiltIn(metaclass, 'type')) {
-        return true;
-    }
-    // Cloned metaclasses share method definitions, but the class-specific checks above cannot be shared.
-    const cachedResult = metaclassEqualityResults.get(metaclass.shared);
-    if (cachedResult !== undefined) {
-        return cachedResult;
-    }
-    const result = !(0, operations_1.customMetaclassSupportsMethod)(classType, '__eq__') && !(0, operations_1.customMetaclassSupportsMethod)(classType, '__ne__');
-    metaclassEqualityResults.set(metaclass.shared, result);
-    return result;
-}
+// Legacy forward type(x) equality guards check declared metaclasses without closing subclass hierarchies.
 // Attempts to narrow a type based on a comparison with a class using "is" or
 // "is not", or "==" or "!=".
 function narrowTypeForClassComparison(evaluator, referenceType, classType, isPositiveTest, isIsOperator = true) {
-    // Limit reuse to this invocation so results cannot outlive the evaluation that established them.
-    const metaclassEqualityResults = isIsOperator ? undefined : new Map();
-    if (metaclassEqualityResults && !hasIdentityEqualitySemantics(classType, metaclassEqualityResults)) {
-        return referenceType;
-    }
-    return (0, typeUtils_1.mapSubtypes)(referenceType, (subtype) => {
-        // Multiple class constraints expand to a union with distinct conditions, which equality cannot narrow.
-        if (metaclassEqualityResults &&
-            (0, types_1.isTypeVar)(subtype) &&
-            !subtype.shared.recursiveAlias &&
-            subtype.shared.constraints.length > 1 &&
-            subtype.shared.constraints.every(types_1.isClassInstance)) {
-            return subtype;
-        }
-        let concreteSubtype = evaluator.makeTopLevelTypeVarsConcrete(subtype);
-        if (metaclassEqualityResults &&
-            (!(0, types_1.isInstantiableClass)(concreteSubtype) ||
-                !hasIdentityEqualitySemantics(concreteSubtype, metaclassEqualityResults))) {
-            return subtype;
-        }
-        if (isPositiveTest) {
-            if ((0, types_1.isClassInstance)(concreteSubtype) &&
-                types_1.TypeBase.isInstance(subtype) &&
-                types_1.ClassType.isBuiltIn(concreteSubtype, 'type')) {
-                concreteSubtype =
-                    concreteSubtype.priv.typeArgs && concreteSubtype.priv.typeArgs.length > 0
-                        ? (0, typeUtils_1.convertToInstantiable)(concreteSubtype.priv.typeArgs[0])
-                        : types_1.UnknownType.create();
-            }
-            if ((0, types_1.isAnyOrUnknown)(concreteSubtype)) {
-                return (0, typeUtils_1.addConditionToType)(classType, (0, typeUtils_1.getTypeCondition)(concreteSubtype));
-            }
-            if ((0, types_1.isClass)(concreteSubtype)) {
-                if (types_1.TypeBase.isInstance(concreteSubtype)) {
-                    if (!isIsOperator) {
-                        return subtype;
-                    }
-                    return types_1.ClassType.isBuiltIn(concreteSubtype, 'object') ? classType : undefined;
-                }
-                const isSuperType = isFilterSuperclass(subtype, concreteSubtype, classType, classType);
-                if (!classType.priv.includeSubclasses) {
-                    // Handle the case where the LHS and RHS operands are specific
-                    // classes, as opposed to types that represent classes and their
-                    // subclasses.
-                    if (!concreteSubtype.priv.includeSubclasses) {
-                        return types_1.ClassType.isSameGenericClass(concreteSubtype, classType) ? classType : undefined;
-                    }
-                    if (isSuperType) {
-                        return (0, typeUtils_1.addConditionToType)(classType, (0, typeUtils_1.getTypeCondition)(concreteSubtype));
-                    }
-                    const isSubType = types_1.ClassType.isDerivedFrom(classType, concreteSubtype);
-                    if (isSubType) {
-                        return (0, typeUtils_1.addConditionToType)(classType, (0, typeUtils_1.getTypeCondition)(concreteSubtype));
-                    }
-                    return undefined;
-                }
-                if (types_1.ClassType.isFinal(concreteSubtype) && !isSuperType) {
-                    return undefined;
-                }
-            }
-        }
-        else {
-            if ((0, types_1.isInstantiableClass)(concreteSubtype) &&
-                types_1.ClassType.isSameGenericClass(classType, concreteSubtype) &&
-                types_1.ClassType.isFinal(classType)) {
-                return undefined;
-            }
-        }
-        return subtype;
-    });
-}
-function isFilterSuperclass(varType, concreteVarType, filterType, concreteFilterType) {
-    if ((0, types_1.isTypeVar)(filterType) || concreteFilterType.priv.literalValue !== undefined) {
-        return (0, types_1.isTypeSame)((0, typeUtils_1.convertToInstance)(filterType), varType);
-    }
-    // If the filter type represents all possible subclasses
-    // of a type, we can't make any statements about its superclass
-    // relationship with concreteVarType.
-    if (concreteFilterType.priv.includeSubclasses) {
-        return false;
-    }
-    if (types_1.ClassType.isDerivedFrom(concreteVarType, concreteFilterType)) {
-        return true;
-    }
-    // Handle the special case where the variable type is a TypedDict and
-    // we're filtering against 'dict'. TypedDict isn't derived from dict,
-    // but at runtime, isinstance returns True.
-    if (types_1.ClassType.isBuiltIn(concreteFilterType, 'dict') && types_1.ClassType.isTypedDictClass(concreteVarType)) {
-        return true;
-    }
-    return false;
+    return TypeEvaluatorNarrowing.narrowTypeForClassComparison(evaluator, referenceType, classType, isPositiveTest, isIsOperator);
 }
 // Determines whether the specified class is an enum class whose members derive
 // from a primitive type (e.g. IntEnum or StrEnum). Members of such classes
 // compare equal to their underlying primitive value at runtime.
-function isPrimitiveBackedEnumClass(classType) {
-    if (!types_1.ClassType.isEnumClass(classType)) {
-        return false;
-    }
-    return (0, typeUtils_1.derivesFromStdlibClass)(classType, 'int') || (0, typeUtils_1.derivesFromStdlibClass)(classType, 'str');
-}
 // Determines whether enumType is a primitive-backed enum class and primitiveType
 // is the primitive type (int or str) from which it derives.
-function isPrimitiveBackedEnumAndPrimitive(enumType, primitiveType) {
-    if (types_1.ClassType.isEnumClass(primitiveType) || !isPrimitiveBackedEnumClass(enumType)) {
-        return false;
-    }
-    // Exclude bool, which derives from int but whose literal values are distinct
-    // from the corresponding int literals.
-    if (types_1.ClassType.isBuiltIn(primitiveType, 'int')) {
-        return (0, typeUtils_1.derivesFromStdlibClass)(enumType, 'int');
-    }
-    if (types_1.ClassType.isBuiltIn(primitiveType, 'str')) {
-        return (0, typeUtils_1.derivesFromStdlibClass)(enumType, 'str');
-    }
-    return false;
-}
 // If the specified type is a literal member of a primitive-backed enum class,
 // returns the corresponding primitive literal type. Otherwise returns the type
 // unmodified.
-function unwrapPrimitiveBackedEnumLiteral(classType) {
-    const literalValue = classType.priv.literalValue;
-    if (!(literalValue instanceof types_1.EnumLiteral) || !isPrimitiveBackedEnumClass(classType)) {
-        return classType;
-    }
-    const itemType = literalValue.itemType;
-    if ((0, types_1.isClassInstance)(itemType) && itemType.priv.literalValue !== undefined) {
-        return itemType;
-    }
-    return classType;
-}
 // Determines whether two literal types compare equal using the `==` operator at
 // runtime. This differs from ClassType.isLiteralValueSame only for members of
 // primitive-backed enum classes, which compare equal to their underlying
 // primitive values.
-function isLiteralValueEqualAtRuntime(type1, type2) {
-    return types_1.ClassType.isLiteralValueSame(unwrapPrimitiveBackedEnumLiteral(type1), unwrapPrimitiveBackedEnumLiteral(type2));
-}
 // Attempts to narrow a type (make it more constrained) based on a comparison
 // (equal or not equal) to a literal value. It also handles "is" or "is not"
 // operators if isIsOperator is true.
 function narrowTypeForLiteralComparison(evaluator, referenceType, literalType, isPositiveTest, isIsOperator) {
-    return evaluator.mapSubtypesExpandTypeVars(referenceType, /* options */ undefined, (subtype) => {
-        subtype = evaluator.makeTopLevelTypeVarsConcrete(subtype);
-        if ((0, types_1.isAnyOrUnknown)(subtype)) {
-            if (isPositiveTest) {
-                return literalType;
-            }
-            return subtype;
-        }
-        // Determine whether this is a comparison between a primitive-backed enum
-        // (e.g. IntEnum or StrEnum) and its underlying primitive type. Such a
-        // comparison can be used for narrowing because the enum member compares
-        // equal to its underlying primitive value at runtime.
-        const isPrimitiveBackedEnumComparison = !isIsOperator &&
-            (0, types_1.isClassInstance)(subtype) &&
-            (isPrimitiveBackedEnumAndPrimitive(subtype, literalType) ||
-                isPrimitiveBackedEnumAndPrimitive(literalType, subtype));
-        if ((0, types_1.isClassInstance)(subtype) &&
-            (types_1.ClassType.isSameGenericClass(literalType, subtype) || isPrimitiveBackedEnumComparison)) {
-            if (subtype.priv.literalValue !== undefined) {
-                const literalValueMatches = isPrimitiveBackedEnumComparison
-                    ? isLiteralValueEqualAtRuntime(subtype, literalType)
-                    : types_1.ClassType.isLiteralValueSame(subtype, literalType);
-                if (isPositiveTest) {
-                    return literalValueMatches ? subtype : undefined;
-                }
-                const isSingleton = types_1.ClassType.isEnumClass(literalType) ||
-                    (0, typeUtils_1.isSentinelLiteral)(subtype) ||
-                    types_1.ClassType.isBuiltIn(literalType, 'bool');
-                // For negative tests, we can eliminate the literal value if it doesn't match,
-                // but only for equality tests or for 'is' tests that involve enums, bools, or sentinels.
-                return literalValueMatches && (isSingleton || !isIsOperator) ? undefined : subtype;
-            }
-            if (isPositiveTest) {
-                if (isPrimitiveBackedEnumComparison) {
-                    // If the reference type is the enum, attempt to find the member
-                    // whose value matches the primitive literal. If no member can be
-                    // identified (e.g. for an IntFlag class, whose members cannot be
-                    // enumerated), retain the reference type rather than narrowing it
-                    // to the primitive literal type.
-                    if (types_1.ClassType.isEnumClass(subtype)) {
-                        const allLiteralTypes = enumerateLiteralsForType(evaluator, subtype);
-                        const match = allLiteralTypes?.find((type) => isLiteralValueEqualAtRuntime(type, literalType));
-                        return match ?? subtype;
-                    }
-                    // The reference type is the primitive type, so narrowing it to the
-                    // enum literal would lose its (potentially derived) class. Retain
-                    // the reference type instead.
-                    return subtype;
-                }
-                return literalType;
-            }
-            // If we're able to enumerate all possible literal values
-            // (for bool or enum), we can eliminate all others in a negative test.
-            const allLiteralTypes = enumerateLiteralsForType(evaluator, subtype);
-            if (allLiteralTypes && allLiteralTypes.length > 0) {
-                return (0, types_1.combineTypes)(allLiteralTypes.filter((type) => isPrimitiveBackedEnumComparison
-                    ? !isLiteralValueEqualAtRuntime(type, literalType)
-                    : !types_1.ClassType.isLiteralValueSame(type, literalType)));
-            }
-            return subtype;
-        }
-        if (isPositiveTest) {
-            if ((0, types_1.isClassInstance)(subtype) && types_1.ClassType.isBuiltIn(subtype, 'LiteralString')) {
-                return literalType;
-            }
-            if (isIsOperator || (0, typeUtils_1.isNoneInstance)(subtype)) {
-                const compareType = getInnermostNewTypeBaseInstance(subtype) ?? subtype;
-                const isSubtype = evaluator.assignType(compareType, literalType);
-                if (isSubtype) {
-                    return (0, types_1.isClassInstance)(subtype) && types_1.ClassType.isNewTypeClass(subtype) ? subtype : literalType;
-                }
-                return undefined;
-            }
-        }
-        return subtype;
-    });
+    return TypeEvaluatorNarrowing.narrowTypeForLiteralComparison(evaluator, referenceType, literalType, isPositiveTest, isIsOperator);
 }
 function enumerateLiteralsForType(evaluator, type) {
-    if (types_1.ClassType.isBuiltIn(type, 'bool')) {
-        // Booleans have only two types: True and False.
-        return [
-            types_1.ClassType.cloneWithLiteral(type, /* value */ true),
-            types_1.ClassType.cloneWithLiteral(type, /* value */ false),
-        ];
-    }
-    if (types_1.ClassType.isEnumClass(type)) {
-        // Enum expansion doesn't apply if the member set cannot be statically
-        // enumerated or if the class derives from enum.Flag.
-        if (types_1.ClassType.isEnumMemberSetMayBeDynamicallyModified(type) ||
-            type.shared.mro.some((mroClass) => (0, types_1.isClass)(mroClass) && types_1.ClassType.isBuiltIn(mroClass, 'Flag'))) {
-            return undefined;
-        }
-        // Enumerate all of the values in this enumeration.
-        const enumList = [];
-        const fields = types_1.ClassType.getSymbolTable(type);
-        fields.forEach((symbol, name) => {
-            if (!symbol.isIgnoredForProtocolMatch()) {
-                let symbolType = evaluator.getEffectiveTypeOfSymbol(symbol);
-                symbolType = (0, enums_1.transformTypeForEnumMember)(evaluator, type, name, (0, analyzerNodeInfo_1.getInfoReader)(evaluator)) ?? symbolType;
-                if ((0, types_1.isClassInstance)(symbolType) &&
-                    types_1.ClassType.isSameGenericClass(type, symbolType) &&
-                    symbolType.priv.literalValue !== undefined) {
-                    enumList.push(symbolType);
-                }
-            }
-        });
-        return enumList;
-    }
-    return undefined;
+    return TypeEvaluatorNarrowing.enumerateLiteralsForType(evaluator, type);
 }
 // Determines whether the expression name node is in the same scope or
 // an outer scope from the reference name node. This allows isMatchingExpression
 // to determine whether two name nodes are referring to the same symbol.
 function isNameSameScope(evaluator, reference, expression) {
-    const refSymbol = evaluator.lookUpSymbolRecursive(reference, reference.d.value, /* honorCodeFlow */ false);
-    const exprSymbol = evaluator.lookUpSymbolRecursive(expression, expression.d.value, /* honorCodeFlow */ false);
-    if (!refSymbol || !exprSymbol) {
-        // This shouldn't happen, but just to be safe...
-        return true;
-    }
-    const refScope = refSymbol.scope;
-    const exprScope = exprSymbol.scope;
-    if (refScope === exprScope) {
-        return true;
-    }
-    return (0, scopeUtils_1.isScopeContainedWithin)(refScope, exprScope);
+    return TypeEvaluatorNarrowing.isNameSameScope(evaluator, reference, expression);
 }
 // Matches a reference against an expression, including the RHS of an assignment
 // expression. This keeps walrus narrowing consistent with truthiness handling in