From: David Abrahams (david.abrahams_at_[hidden])
Date: 2002-03-14 08:27:09
Given that this implements a linear search for elements, I probably
wouldn't use it.
----- Original Message -----
> "David Abrahams" <david.abrahams_at_[hidden]> writes:
> | I'm interested if it interacts intelligently with shared_ptr.
> | What I want is a cache which can be incrementally flushed, such that
> | only items that will be destroyed have a reference count of zero.
> | In other words, I want to use shared_ptrs to keep things alive as
> | as they are referenced; when the cache holds the only reference to
> | object, an explicit request for memory may release the final
> How far is this from what you would need?
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk