As of 0.7.6 sympy uses an LRU cache by default. cachey looks interesting but I think the "nbytes" may be challenging to compute for sympy objects and operations.
There was some discussion of adopting a similar caching policy a while ago: https://github.com/sympy/sympy/issues/6321 On Wednesday, August 19, 2015 at 10:23:57 PM UTC-6, Denis Akhiyarov wrote: > > 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 sympy+unsubscr...@googlegroups.com. To post to this group, send email to sympy@googlegroups.com. 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/453826fc-305f-4cff-9915-1158d07105ba%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
