Once I had some issues with cache in sympy and recently noticed this nice idea cachey. Seems to be a perfect fit for sympy? In short the idea is to cache based on size and computation effort using a simple formula.
http://matthewrocklin.com/blog/work/2015/08/03/Caching/ The goal is to keep the cache of limited size, but pick/keep the cached items wisely. score+=compute_time/nbytes*(1+e)^t -- You received this message because you are subscribed to the Google Groups "sympy" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/sympy. To view this discussion on the web visit https://groups.google.com/d/msgid/sympy/131c8b3c-db25-4b24-9652-c35efc377a82%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
