On Sat, Jun 30, 2012 at 12:14 AM, Joachim Durchholz <[email protected]> wrote: > Am 29.06.2012 23:24, schrieb Ondřej Čertík: > >> I think that there is a huge speed penalty for sorting the actual >> arguments. > > > Why do you think so?
Because I tried it. We tried a lot of things when trying to make the core fast. The fastest seems to be to reuse internal Python data structures (dict) natively, that is, without sorting, as much as we can. Any artificial (hash independent) sorting makes things slow. If you want to play with such things, use this simple code: https://github.com/certik/sympyx Maybe you can figure out some way which is hash() independent and still fast. At least I didn't figure it out. Ondrej -- 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.
