ruff/crates/ty_python_semantic at d9aaacd01f9da1219013c5413a94db7d487298d7 - ruff

mirror of https://github.com/astral-sh/ruff synced 2026-01-10 16:15:19 -05:00

Files

Shaygan Hooshyari d9aaacd01f [ty] Evaluate reachability of non-definitely-bound to Ambiguous (#19579 )

## Summary

closes https://github.com/astral-sh/ty/issues/692

If the expression (or any child expressions) is not definitely bound the
reachability constraint evaluation is determined as ambiguous.

This fixes the infinite cycles panic in the following code:

```py
from typing import Literal

class Toggle:
    def __init__(self: "Toggle"):
        if not self.x:
            self.x: Literal[True] = True
```

Credit of this solution is for David.

## Test Plan

- Added a test case with too many cycle iterations panic.
- Previous tests.

---------

Co-authored-by: David Peter <mail@david-peter.de>

2025-08-28 14:34:49 +02:00