You'll have to time this to see if it's faster than our recurrence_memo. recurrence_memo might be faster because it uses the fact that the inputs are 0, 1, 2, ..., so it's just indexing a list rather than using a dictionary lookup.
Aaron Meurer On Thu, Sep 6, 2012 at 9:36 AM, smichr <[email protected]> wrote: > Just happened across a recent post that might be worth checking out for > those that appreciate and can evaluate these things: > > http://code.activestate.com/recipes/578231-probably-the-fastest-memoization-decorator-in-the-/ > > -- > You received this message because you are subscribed to the Google Groups > "sympy" group. > To view this discussion on the web visit > https://groups.google.com/d/msg/sympy/-/W0wPJ6RaQBQJ. > 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. -- 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.
