Re: Caching of values and delayed sets
- To: mathgroup at smc.vnet.net
- Subject: [mg39697] Re: Caching of values and delayed sets
- From: atelesforos at hotmail.com (Orestis Vantzos)
- Date: Sat, 1 Mar 2003 22:06:21 -0500 (EST)
- Organization: http://groups.google.com/
- References: <b3pgdu$7hr$1@smc.vnet.net>
- Sender: owner-wri-mathgroup at wolfram.com
C:=(C=slow[...]) should work... Orestis may106 at psu.edu (Nafod40) wrote in message news:<b3pgdu$7hr$1 at smc.vnet.net>... > 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?