25 May
2011
25 May
'11
7:05 p.m.
On 5/25/2011 10:09 AM, Mathias Gaunard wrote:
The number of objects currently in the pool.
People might confuse that with the size of the object because the same letter is used twice for two different purposes "t.ordered_malloc(n)" and "O(n)": http://www.boost.org/doc/libs/1_36_0/libs/pool/doc/interfaces/pool.html On the other hand if you allocate big objects at the end of the pool and small ones at the beginning then I'm pretty sure there is a way to sort out free space and end up with a O(log(n)) complexity. O(n) doesn't make sense.
It's already what it does.
Ok false alarm because I read somewhere is_from() was slow. -Phil