Comment #2 on issue 3159 by [email protected]: Intersection class for sets
http://code.google.com/p/sympy/issues/detail?id=3159
Good point.
I've started something here
https://github.com/mrocklin/sympy/tree/intersection
My current solution is to have a two step reduction process. First we go
through global rules like 'if the intersection contains an empty set return
the empty set' or 'distribute any unions'
Then we go through all the constituent sets and ask them if they can
simplify themselves against any other constituent. The _intersect(self,
other) method now returns a new set if self knows how to intersect itself
into other and returns None otherwise.
--
You received this message because you are subscribed to the Google Groups
"sympy-issues" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sympy-issues?hl=en.
