in are
computed, and probably don't exist before you do the recursive call,
and then are discarded shortly afterward.
It seems like putting a cap on the cache size, and then just
overwriting old entries would be better.
Am I missing something?
- Job
On Wed, Sep 16, 2009 at 4:48 PM, Rodney Price
How does garbage collection work in an example like the one below? You
memoize a function with some sort of lookup table, which stores function
arguments as keys and function results as values. As long as the
function remains in scope, the keys in the lookup table remain in
memory, which means
When I run Example.lhs for test-framework I get
[0]
[1]
in the test results, just as you show on your web page. If I run
Example.lhs under ghci rather than compiled, I find the [0] [1] mingled
with the test results in random ways. This leads me to believe that
whatever is printing out [0] [1]
