54 lines
1.6 KiB
Python
54 lines
1.6 KiB
Python
|
from sympy.core.relational import Eq, is_eq
|
||
|
|
from sympy.core.basic import Basic
|
||
|
|
from sympy.core.logic import fuzzy_and, fuzzy_bool
|
||
|
|
from sympy.logic.boolalg import And
|
||
|
|
from sympy.multipledispatch import dispatch
|
||
|
|
from sympy.sets.sets import tfn, ProductSet, Interval, FiniteSet, Set
|
||
|
|
|
||
|
|
|
||
|
|
@dispatch(Interval, FiniteSet) # type:ignore
|
||
|
|
def _eval_is_eq(lhs, rhs): # noqa: F811
|
||
|
|
return False
|
||
|
|
|
||
|
|
|
||
|
|
@dispatch(FiniteSet, Interval) # type:ignore
|
||
|
|
def _eval_is_eq(lhs, rhs): # noqa: F811
|
||
|
|
return False
|
||
|
|
|
||
|
|
|
||
|
|
@dispatch(Interval, Interval) # type:ignore
|
||
|
|
def _eval_is_eq(lhs, rhs): # noqa: F811
|
||
|
|
return And(Eq(lhs.left, rhs.left),
|
||
|
|
Eq(lhs.right, rhs.right),
|
||
|
|
lhs.left_open == rhs.left_open,
|
||
|
|
lhs.right_open == rhs.right_open)
|
||
|
|
|
||
|
|
@dispatch(FiniteSet, FiniteSet) # type:ignore
|
||
|
|
def _eval_is_eq(lhs, rhs): # noqa: F811
|
||
|
|
def all_in_both():
|
||
|
|
s_set = set(lhs.args)
|
||
|
|
o_set = set(rhs.args)
|
||
|
|
yield fuzzy_and(lhs._contains(e) for e in o_set - s_set)
|
||
|
|
yield fuzzy_and(rhs._contains(e) for e in s_set - o_set)
|
||
|
|
|
||
|
|
return tfn[fuzzy_and(all_in_both())]
|
||
|
|
|
||
|
|
|
||
|
|
@dispatch(ProductSet, ProductSet) # type:ignore
|
||
|
|
def _eval_is_eq(lhs, rhs): # noqa: F811
|
||
|
|
if len(lhs.sets) != len(rhs.sets):
|
||
|
|
return False
|
||
|
|
|
||
|
|
eqs = (is_eq(x, y) for x, y in zip(lhs.sets, rhs.sets))
|
||
|
|
return tfn[fuzzy_and(map(fuzzy_bool, eqs))]
|
||
|
|
|
||
|
|
|
||
|
|
@dispatch(Set, Basic) # type:ignore
|
||
|
|
def _eval_is_eq(lhs, rhs): # noqa: F811
|
||
|
|
return False
|
||
|
|
|
||
|
|
|
||
|
|
@dispatch(Set, Set) # type:ignore
|
||
|
|
def _eval_is_eq(lhs, rhs): # noqa: F811
|
||
|
|
return tfn[fuzzy_and(a.is_subset(b) for a, b in [(lhs, rhs), (rhs, lhs)])]
|