# Exhaustiveness checking

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

## Checks on literals

```py
from typing import Literal, assert_never

def if_else_exhaustive(x: Literal[0, 1, "a"]):
    if x == 0:
        pass
    elif x == 1:
        pass
    elif x == "a":
        pass
    else:
        no_diagnostic_here

        assert_never(x)

def if_else_exhaustive_no_assertion(x: Literal[0, 1, "a"]) -> int:
    if x == 0:
        return 0
    elif x == 1:
        return 1
    elif x == "a":
        return 2

def if_else_non_exhaustive(x: Literal[0, 1, "a"]):
    if x == 0:
        pass
    elif x == "a":
        pass
    else:
        this_should_be_an_error  # error: [unresolved-reference]

        # this diagnostic is correct: the inferred type of `x` is `Literal[1]`
        assert_never(x)  # error: [type-assertion-failure]

def match_exhaustive(x: Literal[0, 1, "a"]):
    match x:
        case 0:
            pass
        case 1:
            pass
        case "a":
            pass
        case _:
            no_diagnostic_here

            assert_never(x)

def match_exhaustive_no_assertion(x: Literal[0, 1, "a"]) -> int:
    match x:
        case 0:
            return 0
        case 1:
            return 1
        case "a":
            return 2

def match_non_exhaustive(x: Literal[0, 1, "a"]):
    match x:
        case 0:
            pass
        case "a":
            pass
        case _:
            this_should_be_an_error  # error: [unresolved-reference]

            # this diagnostic is correct: the inferred type of `x` is `Literal[1]`
            assert_never(x)  # error: [type-assertion-failure]

# This is based on real-world code:
# https://github.com/scipy/scipy/blob/99c0ef6af161a4d8157cae5276a20c30b7677c6f/scipy/linalg/tests/test_lapack.py#L147-L171
def exhaustiveness_using_containment_checks():
    for norm_str in "Mm1OoIiFfEe":
        if norm_str in "FfEe":
            return
        else:
            if norm_str in "Mm":
                return
            elif norm_str in "1Oo":
                return
            elif norm_str in "Ii":
                return

        assert_never(norm_str)
```

## Checks on fixed-length tuples

Finite tuple elements are expanded into their Cartesian product when checking whether a `match`
statement is exhaustive. The expansion is used only for reachability; it does not affect the
inferred type of the subject or pattern captures.

```py
def constructed_bool_tuple(b_1: bool, b_2: bool) -> int:
    match (b_1, b_2):
        case (True, True):
            return 0
        case (False, _):
            return 1
        case (_, False):
            return 2

def direct_bool_tuple(pair: tuple[bool, bool]) -> int:
    match pair:
        case (True, True):
            return 0
        case (False, _):
            return 1
        case (_, False):
            return 2

def non_exhaustive_bool_tuple(pair: tuple[bool, bool]) -> int:  # error: [invalid-return-type]
    match pair:
        case (True, True):
            return 0
        case (False, _):
            return 1

def guarded_bool_tuple(pair: tuple[bool, bool], flag: bool) -> int:  # error: [invalid-return-type]
    match pair:
        case (True, True) if flag:
            return 0
        case (False, _):
            return 1
        case (_, False):
            return 2
```

Although this tuple has 128 possible value combinations, the patterns only constrain the first two
positions. Tuple-pattern fallthrough only expands positions that can fail, so it can prove the match
exhaustive without enumerating the remaining elements.

```py
def tuple_expands_only_constrained_positions(
    value: tuple[bool, bool, bool, bool, bool, bool, bool],
) -> int:
    match value:
        case (True, True, _, _, _, _, _):
            return 0
        case (False, _, _, _, _, _, _):
            return 1
        case (_, False, _, _, _, _, _):
            return 2
```

Tuple length alone does not prevent exhaustive sequence-pattern checking. The patterns below
constrain only the first element, and together they cover every possible value of the tuple.

```py
# fmt: off
LongBoolTuple = tuple[
    bool, bool, bool, bool, bool, bool, bool, bool, bool, bool,
    bool, bool, bool, bool, bool, bool, bool, bool, bool, bool,
    bool, bool, bool, bool, bool, bool, bool, bool, bool, bool,
    bool, bool, bool, bool, bool, bool, bool, bool, bool, bool,
    bool, bool, bool, bool, bool, bool, bool, bool, bool, bool,
    bool, bool, bool, bool, bool, bool, bool, bool, bool, bool,
    bool, bool, bool, bool, bool,
]

def long_tuple_with_one_constrained_position(value: LongBoolTuple) -> int:
    match value:
        case (
            True, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _,
            _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _,
            _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _,
        ):
            return 0
        case (
            False, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _,
            _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _,
            _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _, _,
        ):
            return 1
# fmt: on
```

## Checks on enum literals

```py
from enum import Enum
from typing import assert_never

class Color(Enum):
    RED = 1
    GREEN = 2
    BLUE = 3

def if_else_exhaustive(x: Color):
    if x == Color.RED:
        pass
    elif x == Color.GREEN:
        pass
    elif x == Color.BLUE:
        pass
    else:
        no_diagnostic_here

        assert_never(x)

def if_else_exhaustive_no_assertion(x: Color) -> int:
    if x == Color.RED:
        return 1
    elif x == Color.GREEN:
        return 2
    elif x == Color.BLUE:
        return 3

def if_else_non_exhaustive(x: Color):
    if x == Color.RED:
        pass
    elif x == Color.BLUE:
        pass
    else:
        this_should_be_an_error  # error: [unresolved-reference]

        # this diagnostic is correct: inferred type of `x` is `Literal[Color.GREEN]`
        assert_never(x)  # error: [type-assertion-failure]

def match_exhaustive(x: Color):
    match x:
        case Color.RED:
            pass
        case Color.GREEN:
            pass
        case Color.BLUE:
            pass
        case _:
            no_diagnostic_here

            assert_never(x)

def match_exhaustive_2(x: Color):
    match x:
        case Color.RED:
            pass
        case Color.GREEN | Color.BLUE:
            pass
        case _:
            no_diagnostic_here

            assert_never(x)

def match_exhaustive_no_assertion(x: Color) -> int:
    match x:
        case Color.RED:
            return 1
        case Color.GREEN:
            return 2
        case Color.BLUE:
            return 3

def match_exhaustive_through_instance(x: Color) -> int:
    match x:
        case x.RED:
            reveal_type(x)  # revealed: Literal[Color.RED]
            return 1
        case x.GREEN:
            reveal_type(x)  # revealed: Literal[Color.GREEN]
            return 2
        case x.BLUE:
            reveal_type(x)  # revealed: Literal[Color.BLUE]
            return 3

def match_non_exhaustive(x: Color):
    match x:
        case Color.RED:
            pass
        case Color.BLUE:
            pass
        case _:
            this_should_be_an_error  # error: [unresolved-reference]

            # this diagnostic is correct: inferred type of `x` is `Literal[Color.GREEN]`
            assert_never(x)  # error: [type-assertion-failure]
```

Matching every named member is not exhaustive for enums that can also have unnamed members.

```py
from enum import Enum, Flag

class Permission(Flag):
    READ = 1

class MissingValueEnum(Enum):
    ONLY = 1

    @classmethod
    def _missing_(cls, value: object) -> "MissingValueEnum":
        return object.__new__(cls)

def match_flag(value: Permission) -> int:  # error: [invalid-return-type]
    match value:
        case Permission.READ:
            return 1

def match_open_enum(value: MissingValueEnum) -> int:  # error: [invalid-return-type]
    match value:
        case MissingValueEnum.ONLY:
            return 1
```

## Checks on enum literal subsets

```py
from enum import Enum
from typing import Literal, assert_never

class Color(Enum):
    RED = 1
    GREEN = 2
    BLUE = 3
    ORANGE = 4

def match_exhaustive_literal_or_pattern(v: Literal[Color.RED, Color.GREEN, Color.BLUE]) -> None:
    match v:
        case Color.RED | Color.GREEN | Color.BLUE:
            pass
        case _:
            assert_never(v)

def match_exhaustive_literal_or_non_enum_pattern(v: Literal[Color.RED, Color.GREEN, Color.BLUE]) -> None:
    match v:
        case Color.RED | Color.GREEN | Color.BLUE | int():
            pass
        case _:
            assert_never(v)

def match_exhaustive_literal_grouped_or_pattern(v: Literal[Color.RED, Color.GREEN, Color.BLUE]) -> None:
    match v:
        case (Color.RED | Color.GREEN) | Color.BLUE:
            pass
        case _:
            assert_never(v)

def match_exhaustive_literal_or_as_pattern(v: Literal[Color.RED, Color.GREEN]) -> None:
    match v:
        case (Color.RED | Color.GREEN) as selected:
            pass
        case _:
            assert_never(v)

def match_overlapping_or_arm_is_reachable(v: Literal[Color.RED, Color.GREEN, Color.BLUE]) -> None:
    match v:
        case Color.RED:
            pass
        case Color.RED | Color.GREEN | Color.BLUE:
            assert_never(v)  # error: [type-assertion-failure]

def match_class_pattern_arm_is_reachable(v: Literal[Color.RED, Color.GREEN, Color.BLUE]) -> None:
    match v:
        case Color.RED | Color.GREEN:
            pass
        case Color():
            assert_never(v)  # error: [type-assertion-failure]

def match_mixed_or_arm_is_reachable(v: Literal[Color.RED]) -> None:
    match v:
        case Color.BLUE | Color():
            assert_never(v)  # error: [type-assertion-failure]

def match_non_exhaustive_literal_or_pattern(v: Literal[Color.RED, Color.GREEN, Color.BLUE]) -> None:
    match v:
        case Color.RED | Color.GREEN:
            pass
        case _:
            # this diagnostic is correct: inferred type of `v` is `Literal[Color.BLUE]`
            assert_never(v)  # error: [type-assertion-failure]
```

## `isinstance` checks

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

```py
from typing import assert_never

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

class GenericClass[T]:
    x: T

def if_else_exhaustive(x: A | B | C):
    if isinstance(x, A):
        pass
    elif isinstance(x, B):
        pass
    elif isinstance(x, C):
        pass
    else:
        no_diagnostic_here

        assert_never(x)

def if_else_exhaustive_no_assertion(x: A | B | C) -> int:
    if isinstance(x, A):
        return 0
    elif isinstance(x, B):
        return 1
    elif isinstance(x, C):
        return 2

def if_else_non_exhaustive(x: A | B | C):
    if isinstance(x, A):
        pass
    elif isinstance(x, C):
        pass
    else:
        this_should_be_an_error  # error: [unresolved-reference]

        # this diagnostic is correct: the inferred type of `x` is `B & ~A & ~C`
        assert_never(x)  # error: [type-assertion-failure]

def match_exhaustive(x: A | B | C):
    match x:
        case A():
            pass
        case B():
            pass
        case C():
            pass
        case _:
            no_diagnostic_here

            assert_never(x)

def match_exhaustive_no_assertion(x: A | B | C) -> int:
    match x:
        case A():
            return 0
        case B():
            return 1
        case C():
            return 2

def match_non_exhaustive(x: A | B | C):
    match x:
        case A():
            pass
        case C():
            pass
        case _:
            this_should_be_an_error  # error: [unresolved-reference]

            # this diagnostic is correct: the inferred type of `x` is `B & ~A & ~C`
            assert_never(x)  # error: [type-assertion-failure]

# Note: no invalid-return-type diagnostic; the `match` is exhaustive
def match_exhaustive_generic[T](obj: GenericClass[T]) -> GenericClass[T]:
    match obj:
        case GenericClass(x=42):
            reveal_type(obj)  # revealed: GenericClass[T@match_exhaustive_generic]
            return obj
        case GenericClass(x=x):
            reveal_type(x)  # revealed: T@match_exhaustive_generic
            reveal_type(obj)  # revealed: GenericClass[T@match_exhaustive_generic]
            return obj
```

## `isinstance` checks with generics

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

```py
from typing import assert_never

class A[T]:
    value: T

class ASub[T](A[T]): ...

class B[T]:
    value: T

class C[T]:
    value: T

class D: ...
class E: ...
class F: ...

def if_else_exhaustive(x: A[D] | B[E] | C[F]):
    if isinstance(x, A):
        pass
    elif isinstance(x, B):
        pass
    elif isinstance(x, C):
        pass
    else:
        no_diagnostic_here
        assert_never(x)

def if_else_exhaustive_no_assertion(x: A[D] | B[E] | C[F]) -> int:
    if isinstance(x, A):
        return 0
    elif isinstance(x, B):
        return 1
    elif isinstance(x, C):
        return 2

def if_else_non_exhaustive(x: A[D] | B[E] | C[F]):
    if isinstance(x, A):
        pass
    elif isinstance(x, C):
        pass
    else:
        this_should_be_an_error  # error: [unresolved-reference]

        # this diagnostic is correct: the inferred type of `x` is `B[E] & ~A[D] & ~C[F]`
        assert_never(x)  # error: [type-assertion-failure]

def match_exhaustive(x: A[D] | B[E] | C[F]):
    match x:
        case A():
            pass
        case B():
            pass
        case C():
            pass
        case _:
            no_diagnostic_here
            assert_never(x)

def match_exhaustive_no_assertion(x: A[D] | B[E] | C[F]) -> int:
    match x:
        case A():
            return 0
        case B():
            return 1
        case C():
            return 2

def match_non_exhaustive(x: A[D] | B[E] | C[F]):
    match x:
        case A():
            pass
        case C():
            pass
        case _:
            this_should_be_an_error  # error: [unresolved-reference]

            # this diagnostic is correct: the inferred type of `x` is `B[E] & ~A[D] & ~C[F]`
            assert_never(x)  # error: [type-assertion-failure]

# This function might seem a bit silly, but it's a pattern that exists in real-world code!
# see https://github.com/bokeh/bokeh/blob/adef0157284696ce86961b2089c75fddda53c15c/src/bokeh/core/property/container.py#L130-L140
def no_invalid_return_diagnostic_here_either[T](x: A[T]) -> ASub[T]:
    if isinstance(x, A):
        if isinstance(x, ASub):
            return x
        else:
            return ASub()
    else:
        # We *would* emit a diagnostic here complaining that it's an invalid `return` statement
        # ...except that we (correctly) infer that this branch is unreachable, so the complaint
        # is null and void (and therefore we don't emit a diagnostic)
        return x
```

## More `match` pattern types

### `as` patterns

```py
from typing import assert_never

def as_pattern_exhaustive(subject: int | str):
    match subject:
        case int() as x:
            pass
        case str() as y:
            pass
        case _:
            no_diagnostic_here

            assert_never(subject)

def as_pattern_non_exhaustive(subject: int | str):
    match subject:
        case int() as x:
            pass
        case _:
            this_should_be_an_error  # error: [unresolved-reference]

            # this diagnostic is correct: the inferred type of `subject` is `str`
            assert_never(subject)  # error: [type-assertion-failure]
```

## Exhaustiveness checking for methods of enums

```py
from enum import Enum

class Answer(Enum):
    YES = "yes"
    NO = "no"

    def is_yes(self) -> bool:
        reveal_type(self)  # revealed: Self@is_yes

        match self:
            case Answer.YES:
                return True
            case Answer.NO:
                return False
```

## Exhaustiveness checking for type variables with bounds or constraints

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

```py
from typing import assert_never, Literal

def f[T: bool](x: T) -> T:
    match x:
        case True:
            return x
        case False:
            return x
        case _:
            reveal_type(x)  # revealed: Never
            assert_never(x)

def g[T: Literal["foo", "bar"]](x: T) -> T:
    match x:
        case "foo":
            return x
        case "bar":
            return x
        case _:
            reveal_type(x)  # revealed: Never
            assert_never(x)

def h[T: int | str](x: T) -> T:
    if isinstance(x, int):
        return x
    elif isinstance(x, str):
        return x
    else:
        reveal_type(x)  # revealed: Never
        assert_never(x)

def i[T: (int, str)](x: T) -> T:
    match x:
        case int():
            pass
        case str():
            pass
        case _:
            assert_never(x)

    return x

def eq_narrow_match_constrained[T: (Literal["foo"], Literal["bar"])](x: T) -> T:
    match x:
        case "foo":
            pass
        case "bar":
            pass
        case _:
            assert_never(x)

    return x

def eq_narrow_if_bounded[T: Literal["foo", "bar"]](x: T) -> T:
    if x == "foo":
        pass
    elif x == "bar":
        pass
    else:
        assert_never(x)

    return x

def eq_narrow_if_constrained[T: (Literal["foo"], Literal["bar"])](x: T) -> T:
    if x == "foo":
        pass
    elif x == "bar":
        pass
    else:
        assert_never(x)

    return x
```

In these examples, no `invalid-return-type` diagnostics are emitted, despite the fact there are no
`else` clauses. Note that these examples deliberately also do *not* have any `assert_never` or
`assert_type` calls, since these call expressions can create their own `IsNonTerminalCall`
predicates in our reachability infrastructure!

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

def j[T: A | B](x: T) -> bool:
    if isinstance(x, A):
        return True
    elif isinstance(x, B):
        return False

def k[T: (A, B)](x: T) -> bool:
    if isinstance(x, A):
        return True
    elif isinstance(x, B):
        return False

def l[T](x: T) -> bool:
    if isinstance(x, int):
        return True
    elif not isinstance(x, int):
        return False

def m[T: A | B](x: T) -> bool:
    match x:
        case A():
            return True
        case B():
            return False

def n[T: (A, B)](x: T) -> bool:
    match x:
        case A():
            return True
        case B():
            return False

def o[T: Literal["foo", "bar"]](x: T) -> bool:
    if x == "foo":
        return True
    elif x == "bar":
        return False

def p[T: Literal["foo", "bar"]](x: T) -> bool:
    match x:
        case "foo":
            return True
        case "bar":
            return False

def q[T: (Literal["foo"], Literal["bar"])](x: T) -> bool:
    if x == "foo":
        return True
    elif x == "bar":
        return False

def r[T: (Literal["foo"], Literal["bar"])](x: T) -> bool:
    match x:
        case "foo":
            return True
        case "bar":
            return False
```

## Exhaustiveness checking for `NewType`s of `float` and `complex`

```py
from typing_extensions import NewType, assert_never

FloatN = NewType("FloatN", float)
ComplexN = NewType("ComplexN", complex)

def f(x: FloatN) -> bool:
    if isinstance(x, int):
        return True
    elif isinstance(x, float):
        return False
    else:
        assert_never(x)

def g(x: ComplexN) -> bool:
    if isinstance(x, int):
        return True
    elif isinstance(x, float):
        return True
    elif isinstance(x, complex):
        return False
    else:
        assert_never(x)

# the same version of the above tests, but isolated
# from the fact that `assert_never` creates its own
# reachability constraint:

# no `invalid-return-type` diagnostic
def h(x: FloatN) -> bool:
    if isinstance(x, int):
        return True
    elif isinstance(x, float):
        return False

# no `invalid-return-type` diagnostic
def i(x: ComplexN) -> bool:
    if isinstance(x, int):
        return True
    elif isinstance(x, float):
        return True
    elif isinstance(x, complex):
        return False
```
