Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
Cache algorithms: implementation or library available?
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Hugo Ferreira <hmf@i...>
Subject: Re: [Caml-list] Cache algorithms: implementation or library available?

I would like to thank Mattias Engdegård, Dario Teixeira, Gerd Stolpmann
and Martin Jambon for their suggestions. I going through the code and

Hugo F.

Mattias Engdegård wrote:
>>> The Weak module is never the right tool for implementing a cache.
>> I'm not disputing this, but I would like you hear your thoughts on  
>> this topic. Why?
> Weak references go away at the whim of the GC, not when it would be
> useful to flush the cache. A longer explanation and more about weak
> references can be found in the Cuoq/Doligez article in last year's
> workshop on ML (
> _______________________________________________
> Caml-list mailing list. Subscription management:
> Archives:
> Beginner's list:
> Bug reports: