[Date Index] [Thread Index] [Author Index]

Re: Caching of values and delayed sets

• To: mathgroup at smc.vnet.net
• Subject: [mg39733] Re: [mg39668] Caching of values and delayed sets
• From: Kirk Reinholtz <kirk.reinholtz at jpl.nasa.gov>
• Date: Mon, 3 Mar 2003 23:51:25 -0500 (EST)
• References: <200303010747.CAA09846@smc.vnet.net>
• Sender: owner-wri-mathgroup at wolfram.com

C := C = (Pause[10];42);

Nafod40 wrote:
> 
> Hola Amigos,
> 
> I have a variable A that depends via a delayed set on variables B1
> through B1000 that each depend via delayed set on variable C and other
> a mixture of the other B's, which delayed set depends on some slow to
> calculate function C:= slow[ ]. If you explode out the tree view of A
> symbolically, the variable C might appear 5000 times in a messy
> acyclic dependency graph.
> 
> How do I inject some smarts, so that, when asking for the value of A,
> I only evaluate C:=slow[ ] once, and cache it and use the cached value
> for every other time that I need C?

• References:
  • Caching of values and delayed sets
    • From: may106@psu.edu (Nafod40)