2009/5/14 stepken <
[hidden email]>:
> Salût!
>
>
http://en.wikipedia.org/wiki/Memoization>
>
http://wiki.tcl.tk/3740>
>
http://wiki.tcl.tk/13004>
I have thought about this under a different angle, but with same
conclusions, which can be formalized as:
if you have a complex function , which can be represented as a
composition of two or more functions, like:
f(x,y,w,z) = a(x,y,w)*b(z)
then its easy to see that if part of function f() input is not
changing (x,y,w), then you don't have to re-evaluate the a() function
to compute a final result of f().
Of course, this assuming that a() don't have any side effects.
I think such kind of caching is more easily achievable in functional
languages, than in smalltalk.
> G.S.
>
> _______________________________________________
> Pharo-project mailing list
>
[hidden email]
>
http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/pharo-project>
--
Best regards,
Igor Stasenko AKA sig.
_______________________________________________
Pharo-project mailing list
[hidden email]
http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/pharo-project