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

debug

This commit is contained in:
Douglas Creager 2025-09-26 09:13:21 -04:00
parent 209ae1a39b
commit fa4a038b02
1 changed files with 14 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -597,6 +597,8 @@ impl<'db> Node<'db> {
/// We currently use a brute-force algorithm to calculate the minimization, which should be /// We currently use a brute-force algorithm to calculate the minimization, which should be
/// fine for the sizes of BDDs and don't-care sets that we work with. /// fine for the sizes of BDDs and don't-care sets that we work with.
fn minimize(self, db: &'db dyn Db, do_not_care: Node<'db>) -> Self { fn minimize(self, db: &'db dyn Db, do_not_care: Node<'db>) -> Self {
eprintln!("==> minimize {}", self.display(db));
eprintln!(" relative to {}", do_not_care.display(db));
self.minimizations(db, do_not_care) self.minimizations(db, do_not_care)
.as_slice() .as_slice()
.iter() .iter()
@ -608,14 +610,21 @@ impl<'db> Node<'db> {
/// Returns all of the minimizations of this BDD that have the same size as the smallest /// Returns all of the minimizations of this BDD that have the same size as the smallest
/// minimization. /// minimization.
fn minimizations(self, db: &'db dyn Db, do_not_care: Node<'db>) -> Minimized<'db, 'db> { fn minimizations(self, db: &'db dyn Db, do_not_care: Node<'db>) -> Minimized<'db, 'db> {
eprintln!(" -> minimizations {}", self.display(db));
eprintln!(" -> relative to {}", do_not_care.display(db));
match (self, do_not_care) { match (self, do_not_care) {
// If we never care about this node, then its minimization can evaluate to any result. // If we never care about this node, then its minimization can evaluate to any result.
(_, Node::AlwaysTrue) => { (_, Node::AlwaysTrue) => {
eprintln!(" -> minimizations of {}", self.display(db));
eprintln!(" always");
eprintln!(" never");
Minimized::OwnedTwo([Node::AlwaysTrue, Node::AlwaysFalse]) Minimized::OwnedTwo([Node::AlwaysTrue, Node::AlwaysFalse])
} }
// If we always care about this node, then its minimization should behave the same as // If we always care about this node, then its minimization should behave the same as
// the node itself. // the node itself.
(_, Node::AlwaysFalse) => { (_, Node::AlwaysFalse) => {
eprintln!(" -> minimizations of {}", self.display(db));
eprintln!(" {}", self.display(db));
Minimized::OwnedOne(self) Minimized::OwnedOne(self)
} }
// If we sometimes care about this node, we need to recurse down, finding the // If we sometimes care about this node, we need to recurse down, finding the
@ -992,10 +1001,14 @@ impl<'db> InteriorNode<'db> {
} }
} }
}; };
eprintln!(" -> minimizations of {}", node.display(db));
let mut result = Vec::new(); let mut result = Vec::new();
for if_true in true_minimized.as_slice() { for if_true in true_minimized.as_slice() {
for if_false in false_minimized.as_slice() { for if_false in false_minimized.as_slice() {
result.push(Node::new(db, self_constraint, *if_true, *if_false)); let x = Node::new(db, constraint, *if_true, *if_false);
eprintln!(" {} {}", x.interior_node_count(db), x.display(db));
result.push(x);
} }
} }
let minimum_size = (result.iter()) let minimum_size = (result.iter())