ruff

faae72b8 - [ty] Clarify behavior of constraint sets for gradual upper bounds and constraints (#21287)

[ty] Clarify behavior of constraint sets for gradual upper bounds and constraints (#21287) When checking whether a constraint set is satisfied, if a typevar has a non-fully-static upper bound or constraint, we are free to choose any materialization that makes the check succeed. In non-inferable positions, we have to show that the constraint set is satisfied for all valid specializations, so it's best to choose the most restrictive materialization, since that minimizes the set of valid specializations that have to pass. In inferable positions, we only have to show that the constraint set is satisfied for _some_ valid specializations, so it's best to choose the most permissive materialization, since that maximizes our chances of finding a specialization that passes.