P
Pierre Couderc
I am looking for a "special" kind of map :
- it is read like a map
- if the searched element exists, it is given back imediately
- if the searched element does not exist, an initialise() is called to
do the job.
- anyway the map has a limited size, when it is full, the oldest element
is dropped ( if recalled later, will need again an initialise())
Is there some STL (or not) to do that?
My idea is to store in memory big data only if there is enough physical
memory available.
Thank you in advance
Pierre Couderc
- it is read like a map
- if the searched element exists, it is given back imediately
- if the searched element does not exist, an initialise() is called to
do the job.
- anyway the map has a limited size, when it is full, the oldest element
is dropped ( if recalled later, will need again an initialise())
Is there some STL (or not) to do that?
My idea is to store in memory big data only if there is enough physical
memory available.
Thank you in advance
Pierre Couderc