From 5159068838ac7caffe1f12d8e6f37d8f456ab253 Mon Sep 17 00:00:00 2001
From: Douglas Creager <dcreager@dcreager.net>
Date: Fri, 14 Nov 2025 13:50:21 -0500
Subject: [PATCH] remove unused stuff

---
 .../src/types/constraints.rs                  | 20 +------------------
 1 file changed, 1 insertion(+), 19 deletions(-)

diff --git a/crates/ty_python_semantic/src/types/constraints.rs b/crates/ty_python_semantic/src/types/constraints.rs
index 6beb8c3854..4f040c7af4 100644
--- a/crates/ty_python_semantic/src/types/constraints.rs
+++ b/crates/ty_python_semantic/src/types/constraints.rs
@@ -885,13 +885,6 @@ impl<'db> Node<'db> {
             .or(db, self.negate(db).and(db, else_node))
     }
 
-    fn satisfies(self, db: &'db dyn Db, other: Self) -> Self {
-        let simplified_self = self.simplify(db);
-        let implication = simplified_self.implies(db, other);
-        let (simplified, domain) = implication.simplify_and_domain(db);
-        simplified.and(db, domain)
-    }
-
     fn implies_subtype_of(self, db: &'db dyn Db, lhs: Type<'db>, rhs: Type<'db>) -> Self {
         // When checking subtyping involving a typevar, we can turn the subtyping check into a
         // constraint (i.e, "is `T` a subtype of `int` becomes the constraint `T ≤ int`), and then
@@ -1196,12 +1189,6 @@ impl<'db> Node<'db> {
         simplified
     }
 
-    /// Returns the domain (the set of allowed inputs) for a BDD.
-    fn domain(self, db: &'db dyn Db) -> Self {
-        let (_, domain) = self.simplify_and_domain(db);
-        domain
-    }
-
     /// Returns clauses describing all of the variable assignments that cause this BDD to evaluate
     /// to `true`. (This translates the boolean function that this BDD represents into DNF form.)
     fn satisfied_clauses(self, db: &'db dyn Db) -> SatisfiedClauses<'db> {
@@ -2314,6 +2301,7 @@ impl<'db> SequentMap<'db> {
         }
     }
 
+    #[expect(dead_code)] // Keep this around for debugging purposes
     fn display<'a>(&'a self, db: &'db dyn Db, prefix: &'a dyn Display) -> impl Display + 'a {
         struct DisplaySequentMap<'a, 'db> {
             map: &'a SequentMap<'db>,
@@ -2456,12 +2444,6 @@ impl<'db> PathAssignments<'db> {
 #[derive(Debug)]
 struct PathAssignmentConflict;
 
-enum PathAssignmentOutcome {
-    Added,
-    Existing,
-    Conflict,
-}
-
 /// A single clause in the DNF representation of a BDD
 #[derive(Clone, Debug, Default, Eq, PartialEq)]
 struct SatisfiedClause<'db> {