Re: Implementing Memorize

[Dmitry A. Kazakov <mailbox@dmitry-kazakov.de>]

On Wed, 22 Oct 2003 11:07:43 +0000 (UTC), Lutz Donnerhacke
<lutz@iks-jena.de> wrote:

>* Marius Amado Alves wrote:
>>> What's the correct way to implement it?
>>
>> Maybe with an access-to-subprogram type.
>
>Of course this works. But I'm looking for a generic version.
>
>> What problem are your trying to solve?
>
>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.

Solution depends on how exposed should be the context used to store
results:

1. Completely hidden (allocated upon elaboration of the body)
2. Partially exposed as a generic parameter of the compilation unit
3. Fully exposed as a parameter of the subprogram

---
Regards,
Dmitry Kazakov
www.dmitry-kazakov.de