# Narrowing for checks involving `type(x)`

## `type(x) is C`

```py
from typing import final

class A: ...
class B: ...

@final
class C: ...

def _(x: A | B, y: A | C):
    if type(x) is A:
        reveal_type(x)  # revealed: A
    else:
        # It would be wrong to infer `B` here. The type
        # of `x` could be a subclass of `A`, so we need
        # to infer the full union type:
        reveal_type(x)  # revealed: A | B

    if A is type(x):
        reveal_type(x)  # revealed: A
    else:
        reveal_type(x)  # revealed: A | B

    if type(y) is C:
        reveal_type(y)  # revealed: C
    else:
        # here, however, inferring `A` is fine,
        # because `C` is `@final`: no subclass of `A`
        # and `C` could exist
        reveal_type(y)  # revealed: A

    if C is type(y):
        reveal_type(y)  # revealed: C
    else:
        reveal_type(y)  # revealed: A

    if type(y) is A:
        reveal_type(y)  # revealed: A
    else:
        # but here, `type(y)` could be a subclass of `A`,
        # in which case the `type(y) is A` call would evaluate
        # to `False` even if `y` was an instance of `A`,
        # so narrowing cannot occur
        reveal_type(y)  # revealed: A | C

    if A is type(y):
        reveal_type(y)  # revealed: A
    else:
        reveal_type(y)  # revealed: A | C
```

## `type(x) is C` in chained comparisons

```py
from typing import Literal

class A: ...
class B: ...

def _(x: A | B, y: Literal[1, 2]):
    if type(x) is A is not None:
        reveal_type(x)  # revealed: A

    if y is 1 is not type(x):
        reveal_type(y)  # revealed: Literal[1]
```

## `type(x) is type(self)`

```py
class Pattern: ...

class InstanceOf(Pattern):
    def matches(self, other: Pattern) -> bool:
        if type(other) is type(self):
            reveal_type(other)  # revealed: InstanceOf
            return True

        reveal_type(other)  # revealed: Pattern
        return False
```

## `type(x) is not C`

```py
from typing import final

class A: ...
class B: ...

@final
class C: ...

def _(x: A | B, y: A | C):
    if type(x) is not A:
        # Same reasoning as above: no narrowing should occur here.
        reveal_type(x)  # revealed: A | B
    else:
        reveal_type(x)  # revealed: A

    if type(y) is not C:
        # same reasoning as above: narrowing *can* occur here because `C` is `@final`
        reveal_type(y)  # revealed: A
    else:
        reveal_type(y)  # revealed: C

    if type(y) is not A:
        # same reasoning as above: narrowing *cannot* occur here
        # because `A` is not `@final`
        reveal_type(y)  # revealed: A | C
    else:
        reveal_type(y)  # revealed: A
```

## `x.__class__ is C`

```py
from typing import final

class A: ...
class B: ...

@final
class C: ...

def _(x: A | B, y: A | C):
    if x.__class__ is A:
        reveal_type(x)  # revealed: A
    else:
        reveal_type(x)  # revealed: A | B

    if C is y.__class__:
        reveal_type(y)  # revealed: C
    else:
        reveal_type(y)  # revealed: A

    if x.__class__ is not A:
        reveal_type(x)  # revealed: A | B
    else:
        reveal_type(x)  # revealed: A

    if y.__class__ is not C:
        reveal_type(y)  # revealed: A
    else:
        reveal_type(y)  # revealed: C
```

## The top materialization is used for generic classes

```py
# list is invariant
def f(x: list[int] | None):
    if type(x) is list:
        reveal_type(x)  # revealed: list[int]
    else:
        reveal_type(x)  # revealed: list[int] | None

    if type(x) is not list:
        reveal_type(x)  # revealed: list[int] | None
    else:
        reveal_type(x)  # revealed: list[int]

# frozenset is covariant
def g(x: frozenset[bytes] | None):
    if type(x) is frozenset:
        reveal_type(x)  # revealed: frozenset[bytes]
    else:
        reveal_type(x)  # revealed: frozenset[bytes] | None

    if type(x) is not frozenset:
        reveal_type(x)  # revealed: frozenset[bytes] | None
    else:
        reveal_type(x)  # revealed: frozenset[bytes]

def h(x: object):
    if type(x) is list:
        reveal_type(x)  # revealed: Top[list[Unknown]]
    elif type(x) is frozenset:
        reveal_type(x)  # revealed: frozenset[object]
    else:
        reveal_type(x)  # revealed: object

    if type(x) is not list and type(x) is not frozenset:
        reveal_type(x)  # revealed: object
    else:
        reveal_type(x)  # revealed: Top[list[Unknown]] | frozenset[object]
```

## No narrowing for `type(x) is C[int]`

At runtime, `type(x)` will never return a generic alias object (only ever a class-literal object),
so no narrowing can occur if `type(x)` is compared with a generic alias object.

```toml
[environment]
python-version = "3.12"
```

```py
class A[T]: ...
class B: ...

def f(x: A[int] | B):
    if type(x) is A[int]:
        # this branch is actually unreachable -- we *could* reveal `Never` here!
        reveal_type(x)  # revealed: A[int] | B
    else:
        reveal_type(x)  # revealed: A[int] | B

    if type(x) is A:
        reveal_type(x)  # revealed: A[int] | (B & A[object])
    else:
        reveal_type(x)  # revealed: A[int] | B

    if type(x) is B:
        reveal_type(x)  # revealed: B
    else:
        reveal_type(x)  # revealed: A[int] | B

    if type(x) is not A[int]:
        reveal_type(x)  # revealed: A[int] | B
    else:
        # this branch is actually unreachable -- we *could* reveal `Never` here!
        reveal_type(x)  # revealed: A[int] | B

    if type(x) is not A:
        reveal_type(x)  # revealed: A[int] | B
    else:
        reveal_type(x)  # revealed: A[int] | (B & A[object])

    if type(x) is not B:
        reveal_type(x)  # revealed: A[int] | B
    else:
        reveal_type(x)  # revealed: B
```

## `type(x) == C`, `type(x) != C`

No narrowing can occur for equality comparisons, since there might be a custom `__eq__`
implementation on the metaclass.

TODO: Narrowing might be possible in some cases where the classes themselves are `@final` or their
metaclass is `@final`.

```py
class IsEqualToEverything(type):
    def __eq__(cls, other):
        return True

class A(metaclass=IsEqualToEverything): ...
class B(metaclass=IsEqualToEverything): ...

def _(x: A | B, y: object):
    if type(x) == A:
        reveal_type(x)  # revealed: A | B

    if type(x) != A:
        reveal_type(x)  # revealed: A | B

    if type(y) == bool:
        reveal_type(y)  # revealed: object
    else:
        reveal_type(y)  # revealed: object
```

## No narrowing for custom `type` callable

```py
class A: ...
class B: ...

def type(x):
    return int

def _(x: A | B):
    if type(x) is A:
        reveal_type(x)  # revealed: A | B
    else:
        reveal_type(x)  # revealed: A | B
```

## No narrowing for multiple arguments

Narrowing does not occur in the same way if `type` is used to dynamically create a class:

```py
def _(x: str | int):
    # The following diagnostic is valid, since the three-argument form of `type`
    # can only be called with `str` as the first argument.
    #
    # error: [invalid-argument-type] "Invalid argument to parameter 1 (`name`) of `type()`: Expected `str`, found `str | int`"
    if type(x, (), {}) is str:
        # But we synthesize a new class object as the result of a three-argument call to `type`,
        # and we know that this synthesized class object is not the same object as the `str` class object,
        # so here the type is narrowed to `Never`!
        reveal_type(x)  # revealed: Never
    else:
        reveal_type(x)  # revealed: str | int
```

## No narrowing for keyword arguments

`type` can't be used with a keyword argument:

```py
def _(x: str | int):
    # error: [no-matching-overload] "No overload of class `type` matches arguments"
    if type(object=x) is str:
        reveal_type(x)  # revealed: str | int
```

## Narrowing if `type` is aliased

```py
class A: ...
class B: ...

def _(x: A | B):
    alias_for_type = type

    if alias_for_type(x) is A:
        reveal_type(x)  # revealed: A
```

## Narrowing for generic classes

```toml
[environment]
python-version = "3.13"
```

Note that `type` returns the runtime class of an object, which does _not_ include specializations in
the case of a generic class. (The typevars are erased.) That means we cannot narrow the type to the
specialization that we compare with; we must narrow to an unknown specialization of the generic
class.

```py
class A[T = int]: ...
class B: ...

def _[T](x: A | B):
    if type(x) is A[str]:
        # TODO: `type()` never returns a generic alias, so `type(x)` cannot be `A[str]`
        reveal_type(x)  # revealed: A[int] | B
    else:
        reveal_type(x)  # revealed: A[int] | B
```

## Narrowing for tuple

An early version of <https://github.com/astral-sh/ruff/pull/19920> caused us to crash on this:

```py
def _(val):
    if type(val) is tuple:
        reveal_type(val)  # revealed: Unknown & tuple[object, ...]
```

## Limitations

```py
class Base: ...
class Derived(Base): ...

def _(x: Base):
    if type(x) is Base:
        # Ideally, this could be narrower, but there is now way to
        # express a constraint like `Base & ~ProperSubtypeOf[Base]`.
        reveal_type(x)  # revealed: Base
```

## Assignment expressions

```py
def _(x: object):
    if (y := type(x)) is bool:
        reveal_type(y)  # revealed: <class 'bool'>
        reveal_type(x)  # revealed: bool
    if (type(y := x)) is bool:
        reveal_type(y)  # revealed: bool
```

## Narrowing where the right-hand side is not a class literal

```toml
[environment]
python-version = "3.12"
```

```py
from typing import final

class Foo: ...

def f(x: Foo, y: type[int]):
    if type(x) is y:
        reveal_type(x)  # revealed: Foo & int
    else:
        reveal_type(x)  # revealed: Foo

    if type(x) is not y:
        reveal_type(x)  # revealed: Foo
    else:
        reveal_type(x)  # revealed: Foo & int

@final
class Bar: ...

def g(x: object, y: type[Bar]):
    if type(x) is y:
        reveal_type(x)  # revealed: Bar
    else:
        # `Bar` is `@final`, so we can do `else`-branch narrowing here
        reveal_type(x)  # revealed: ~Bar

    if type(x) is not y:
        reveal_type(x)  # revealed: ~Bar
    else:
        reveal_type(x)  # revealed: Bar

def j[T: int](x: Foo, y: type[T]):
    if type(x) is y:
        reveal_type(x)  # revealed: Foo & int
    else:
        reveal_type(x)  # revealed: Foo

    if type(x) is not y:
        reveal_type(x)  # revealed: Foo
    else:
        reveal_type(x)  # revealed: Foo & int

def k[T: type[int]](x: Foo, y: T):
    if type(x) is y:
        reveal_type(x)  # revealed: Foo & int
    else:
        reveal_type(x)  # revealed: Foo

    if type(x) is not y:
        reveal_type(x)  # revealed: Foo
    else:
        reveal_type(x)  # revealed: Foo & int

type IntClassAlias = type[int]

def strange(x: Foo, y: IntClassAlias):
    if type(x) is y:
        reveal_type(x)  # revealed: Foo & int
    else:
        reveal_type(x)  # revealed: Foo

    if type(x) is not y:
        reveal_type(x)  # revealed: Foo
    else:
        reveal_type(x)  # revealed: Foo & int

class Spam[T]: ...

def h(x: Foo, y: type[Spam[int]]):
    # no narrowing can occur, because `Spam[int]` is a generic class,
    # and `if type(x) is Y` is not a valid operation if `Y` could be
    # a generic alias.

    if type(x) is y:
        reveal_type(x)  # revealed: Foo
    else:
        reveal_type(x)  # revealed: Foo

    if type(x) is not y:
        reveal_type(x)  # revealed: Foo
    else:
        reveal_type(x)  # revealed: Foo

def i[T](x: Foo, y: type[Spam[T]]):
    # same here: no  narrowing can occur
    if type(x) is y:
        reveal_type(x)  # revealed: Foo
    else:
        reveal_type(x)  # revealed: Foo

    if type(x) is not y:
        reveal_type(x)  # revealed: Foo
    else:
        reveal_type(x)  # revealed: Foo
```
