On Fri, Jun 22, 2012 at 7:39 PM, Ronan Lamy <[email protected]> wrote: > 2012/6/22 Sergiu Ivanov <[email protected]>: >> >> * FiniteSet implicitly sorts its elements, and > > That is very wrong, for two reasons: > * mathematical sets have no notion of element ordering. > * this makes (large) FiniteSets much slower than anybody would expect.
Yes. I was basing off what I can currently see in the code. >> In view of the status quo, my question is as follows: how useful is >> the capability of FiniteSet to host any kind of object? Does anyone >> use it? >> >> I have seen somewhere in SymPy that something stored a frozendict in a >> FiniteSet; this can be substituted by storing a FiniteSet within a >> FiniteSet. My strong opinion is that FiniteSet should only be able to >> store Basic's, that would be much more consistent with the current >> SymPy philosophy as I perceive it. > > I agree. It would also prevent people from mistakenly using FiniteSet when > they would be better served by builtin sets or frozensets. Good to hear. Sergiu -- You received this message because you are subscribed to the Google Groups "sympy" 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?hl=en.
