diff --git a/doc/interfaces/simple_segregated_storage.html b/doc/interfaces/simple_segregated_storage.html index c7456d8..1138d04 100644 --- a/doc/interfaces/simple_segregated_storage.html +++ b/doc/interfaces/simple_segregated_storage.html @@ -116,7 +116,7 @@ An object of type simple_segregated_storage<SizeType>t.ordered_free(chunk)voidSame as above!t.empty()Places chunk back on the free list. Note that chunk may not be 0. Order-preserving. O(N) with respect to the size of the free list. -t.malloc_n(n, partition_sz)void *!empty()Attempts to find a contiguous sequence of n partition_sz-sized chunks. If found, removes them all from the free list and returns a pointer to the first. If not found, returns 0. It is strongly recommended (but not required) that the free list be ordered, as this algorithm will fail to find a contiguous sequence unless it is contiguous in the free list as well. Order-preserving. O(N) with respect to the size of the free list. +t.malloc_n(n, partition_sz)void *Attempts to find a contiguous sequence of n partition_sz-sized chunks. If found, removes them all from the free list and returns a pointer to the first. If not found, returns 0. It is strongly recommended (but not required) that the free list be ordered, as this algorithm will fail to find a contiguous sequence unless it is contiguous in the free list as well. Order-preserving. O(N) with respect to the size of the free list. t.free_n(chunk, n, partition_sz)voidchunk was previously returned from a call to t.malloc_n(n, partition_sz)!t.empty()t.add_block(chunk, n * partition_sz, partition_sz)Assumes that chunk actually refers to a block of chunks spanning n * partition_sz bytes; segregates and adds in that block. Note that chunk may not be 0. O(n). diff --git a/include/boost/pool/simple_segregated_storage.hpp b/include/boost/pool/simple_segregated_storage.hpp index 1976562..b6d8bb4 100644 --- a/include/boost/pool/simple_segregated_storage.hpp +++ b/include/boost/pool/simple_segregated_storage.hpp @@ -136,14 +136,10 @@ class simple_segregated_storage } } - // pre: !empty() // Note: if you're allocating/deallocating n a lot, you should // be using an ordered pool. void * malloc_n(size_type n, size_type partition_size); - // pre: !empty() - void * ordered_malloc_n(size_type n, size_type partition_size); - // pre: chunks was previously allocated from *this with the same // values for n and partition_size // post: !empty()