On 10 November 2016 at 17:41, Sven Van Caekenberghe <sven@stfx.eu> wrote:
Even that is not necessarily true, Generational Garbage collection and other tricks can avoid a full heap GC for a long time, even (or especially) under memory allocation stress.

That is why it is��Big O notation (upper bound / worst case) ;)��