Basic Examples (3) 

The first time LimitedCache is used, the value is computed:

In[1]:=

Out[1]=

No evaluation is performed when the computation result is in the cache from a previous calculation:

In[2]:=

Out[2]=

By default, a maximum of 100 values will be cached, so evaluations that get discarded will be recomputed:

In[3]:=

Out[3]=

In[4]:=

Out[4]=

Scope (2) 

The first use of LimitedCache sets the size of the cache:

In[5]:=

Out[5]=

In[6]:=

Out[6]=

In[7]:=

Out[7]=

You can change the cache size, in which case all previously cached values will be discarded:

In[8]:=

Out[9]=

By default all cached values share the same cache with least recently used values being discarded first. If you need to maintain separate caches for different tasks you can provide a cache name:

In[10]:=

Out[10]=

In[11]:=

Out[11]=

In[12]:=

Out[12]=

The data is stored in a DataStructure. This can be accessed directly and supports all operations supported by the "LeastRecentlyUsedCache” DataStructure:

In[13]:=

Out[13]=

In[14]:=

Out[14]=

Applications (2) 

The typical application is to memoize function evaluations that are likely to be repeated many times. For example this double-recursive method for calculate Fibonacci numbers recomputes many values:

In[15]:=

Out[15]=

By caching some of the values, you can prevent much of the recursion and improve the evaluation time:

In[16]:=

Out[16]=

Properties and Relations (1) 

LimitedCache has the same purpose as Once except that Once will typically require more memory the more that it is used, while LimitedCache does not:

In[17]:=

Out[17]=

In[18]:=

Out[18]=