{

//We will create a buffer of 1000 bytes to store a list

managed_heap_memory heap_memory(1000);

MyList * mylist = heap_memory.construct<MyList>("MyList")

(heap_memory.get_segment_manager());

//Obtain handle, that identifies the list in the buffer

managed_heap_memory::handle_t list_handle = heap_memory.get_handle_from_address(mylist);

//Fill list until there is no more memory in the buffer

try{

while(1) {

mylist->insert(mylist->begin(), 0);

}

}

catch(const bad_alloc &){

//memory is full

}

//Let's obtain the size of the list

MyList::size_type old_size = mylist->size();

//<-

(void)old_size;

//->

//To make the list bigger, let's increase the heap buffer

//in 1000 bytes more.

heap_memory.grow(1000);

//If memory has been reallocated, the old pointer is invalid, so

//use previously obtained handle to find the new pointer.

mylist = static_cast<MyList *>

(heap_memory.get_address_from_handle(list_handle));

//Fill list until there is no more memory in the buffer

try{

while(1) {

mylist->insert(mylist->begin(), 0);

}

}

catch(const bad_alloc &){

//memory is full

}

//Let's obtain the new size of the list

MyList::size_type new_size = mylist->size();

//<-

(void)new_size;

//->

assert(new_size > old_size);

//Destroy list

heap_memory.destroy_ptr(mylist);

return 0;