Python
/
ruff
mirror of https://github.com/astral-sh/ruff
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

document display source_order

This commit is contained in:
Douglas Creager 2025-12-15 09:09:41 -05:00
parent 019db2a22e
commit 358185b5e2
1 changed files with 4 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
crates/ty_python_semantic/src/types/constraints.rs
View File

@ -2153,7 +2153,10 @@ impl<'db> InteriorNode<'db> {
.collect(); .collect();
// Repeatedly pop constraint pairs off of the visit queue, checking whether each pair can // Repeatedly pop constraint pairs off of the visit queue, checking whether each pair can
// be simplified. // be simplified. If we add any derived constraints, we will place them at the end in
// source order. (We do not have any test cases that depend on constraint sets being
// displayed in a consistent ordering, so we don't need to be clever in assigning these
// `source_order`s.)
let mut simplified = Node::Interior(self); let mut simplified = Node::Interior(self);
let mut next_source_order = self.max_source_order(db) + 1; let mut next_source_order = self.max_source_order(db) + 1;
while let Some((left_constraint, right_constraint)) = to_visit.pop() { while let Some((left_constraint, right_constraint)) = to_visit.pop() {
@ -2358,7 +2361,6 @@ impl<'db> InteriorNode<'db> {
intersection_constraint.when_true(), intersection_constraint.when_true(),
next_source_order, next_source_order,
); );
next_source_order += 1;
let negative_intersection_node = Node::new_satisfied_constraint( let negative_intersection_node = Node::new_satisfied_constraint(
db, db,
intersection_constraint.when_false(), intersection_constraint.when_false(),