Re: Implementing Memorize

[Lutz Donnerhacke <lutz@iks-jena.de>]

* Marius Amado Alves wrote:
> On Wed, 2003-10-22 at 11:33, Lutz Donnerhacke wrote:
>> * Lutz Donnerhacke wrote:
>> > Calculating Fibbonacci numbers recursivly is easy but braindead. Languages
>> > with access to the symbol table at execution time are able to change the the
>> > reccuring call with a memorize wrapper which returns already computed values
>> > immediatly instead of recalculating them. In the referenced article I wrote
>> > an C-Implementation of such a wrapper. Now I'm looking for a more elegant
>> > version in Ada.
> 
> So your problem is generating the Fibonaci number of a given natural N.

No. Fib is only an application for the more general pattern Memorize.

> I would not use recursive calls here because call stack space is usually
> shorter than the range of naturals. I would use increments in a loop.

The Memorize package should get the function to be computed as a generic
parameter. So you can't assume anything about the parameters used.

> Took a look at your code. I think you're failing to set the Valid
> component.

Yep. Code in progress.