Comment #13 on issue 3222 by [email protected]: Memory problems with
the cache
http://code.google.com/p/sympy/issues/detail?id=3222
A simple yet efficient idea for the cache is employing the
least-recently-used-like (LRU-like) list. Every cache "hit" moves an item
to the top of the list. When a new item (due to the cache "miss") is added
to the cache (to the top of the list) and the limit of the cache (e.g. 1000
items) is exceeded, the bottommost item is removed.
--
You received this message because this project is configured to send all
issue notifications to this address.
You may adjust your notification preferences at:
https://code.google.com/hosting/settings
--
You received this message because you are subscribed to the Google Groups
"sympy-issues" 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-issues.
For more options, visit https://groups.google.com/groups/opt_out.
