Re: Exceeding memory while using STL containers
dhruv wrote:
blwy10 wrote:
What happens when in the process of using STL containers, we insert so
many elements that our computer runs out of memory to store them. What
happens then? I assume that this behaviour is implementation-defined
and dependent on what STL am I using and what OS I am running but I'm
just curious to know what would/should typically happen. To be more
precise, I am using Windows XP SP 2 and VC Toolkit 2003, including its
STL implementation. The container specifically is std::set.
The container's insert() function will throw an std::bad_alloc()
exception, and I don't think there's much that can be done about it
either. The result is NOT implementation dependant, and is defined by
the C++ standard. This is of course assuming that you are using
std::allocator() or some replacement that adheres to the standard.
And haven't replaced the global operator new, and haven't
specified a custom new handler, and that the OS correctly
reports the error to operator new, and that having run out of
memory, you're still able to allocated enough stack to call the
operator new function (and that it can call any functions it
happens to use internally).
In practice, just catching bad_alloc is nowhere near enough to
be able to recover from out of memory conditions.
--
James Kanze GABI Software
Conseils en informatique orient?e objet/
Beratung in objektorientierter Datenverarbeitung
9 place S?mard, 78210 St.-Cyr-l'?cole, France, +33 (0)1 30 23 00 34
[ See http://www.gotw.ca/resources/clcm.htm for info about ]
[ comp.lang.c++.moderated. First time posters: Do this! ]