mirror of
https://github.com/astral-sh/ruff.git
synced 2025-11-23 13:36:52 +00:00
remove unused stuff
This commit is contained in:
parent
c3fbe0269f
commit
5159068838
1 changed files with 1 additions and 19 deletions
|
|
@ -885,13 +885,6 @@ impl<'db> Node<'db> {
|
||||||
.or(db, self.negate(db).and(db, else_node))
|
.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 {
|
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
|
// 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
|
// 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
|
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
|
/// 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.)
|
/// to `true`. (This translates the boolean function that this BDD represents into DNF form.)
|
||||||
fn satisfied_clauses(self, db: &'db dyn Db) -> SatisfiedClauses<'db> {
|
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 {
|
fn display<'a>(&'a self, db: &'db dyn Db, prefix: &'a dyn Display) -> impl Display + 'a {
|
||||||
struct DisplaySequentMap<'a, 'db> {
|
struct DisplaySequentMap<'a, 'db> {
|
||||||
map: &'a SequentMap<'db>,
|
map: &'a SequentMap<'db>,
|
||||||
|
|
@ -2456,12 +2444,6 @@ impl<'db> PathAssignments<'db> {
|
||||||
#[derive(Debug)]
|
#[derive(Debug)]
|
||||||
struct PathAssignmentConflict;
|
struct PathAssignmentConflict;
|
||||||
|
|
||||||
enum PathAssignmentOutcome {
|
|
||||||
Added,
|
|
||||||
Existing,
|
|
||||||
Conflict,
|
|
||||||
}
|
|
||||||
|
|
||||||
/// A single clause in the DNF representation of a BDD
|
/// A single clause in the DNF representation of a BDD
|
||||||
#[derive(Clone, Debug, Default, Eq, PartialEq)]
|
#[derive(Clone, Debug, Default, Eq, PartialEq)]
|
||||||
struct SatisfiedClause<'db> {
|
struct SatisfiedClause<'db> {
|
||||||
|
|
|
||||||
Loading…
Add table
Add a link
Reference in a new issue