Reusable objects for forming private heaps. More...

#include <linked.h>

Inheritance diagram for ucommon::ReusableObject:

Collaboration diagram for ucommon::ReusableObject:

Public Member Functions
ReusableObject *	getNext (void)
	Get next effective reusable object when iterating. More...

Public Member Functions inherited from ucommon::LinkedObject
virtual	~LinkedObject ()

virtual void	release (void) __OVERRIDE
	Release list, mark as no longer linked. More...

virtual void	retain (void) __OVERRIDE
	Retain by marking as self referenced list. More...

void	enlist (LinkedObject **root)
	Add our object to an existing linked list through a pointer. More...

void	delist (LinkedObject **root)
	Locate and remove ourselves from a list of objects. More...

bool	is_member (LinkedObject *list) const
	Search to see if we are a member of a specific list. More...

LinkedObject *	getNext (void) const
	Get next effective object when iterating. More...

Protected Member Functions
virtual void	release (void) __OVERRIDE
	Release list, mark as no longer linked. More...

Protected Member Functions inherited from ucommon::LinkedObject
	LinkedObject (LinkedObject **root)
	Construct base class attached to a chain of objects. More...

	LinkedObject ()
	Construct base class unattached to anyone. More...

	LinkedObject (const LinkedObject &from)

Friends
class	ReusableAllocator

Additional Inherited Members
Static Public Member Functions inherited from ucommon::LinkedObject
static void	purge (LinkedObject *root)
	Release all objects from a list. More...

static unsigned	count (const LinkedObject *root)
	Count the number of linked objects in a list. More...

static LinkedObject *	getIndexed (LinkedObject *root, unsigned index)
	Get member by index. More...

Protected Attributes inherited from ucommon::LinkedObject
LinkedObject *	Next

Detailed Description

Reusable objects for forming private heaps.

Reusable objects are linked objects that may be allocated in a private heap, and are returned to a free list when they are no longer needed so they can be reused without having to be re-allocated. The free list is the root of a linked object chain. This is used as a base class for those objects that will be managed through reusable heaps.