25 May
2011
25 May
'11
5:09 p.m.
On 25/05/2011 18:25, Phil Bouchard wrote:
Just to make sure: O(n) where n is the number of objects already allocated?
The number of objects currently in the pool.
The pages are not contiguous, so you need to walk through each page at least.
It'll still be decently fast.
It's already what it does.