SqPtrArray

SqArray
│
└─── SqPtrArray
     │
     └─── SqStrArray

struct SqPtrArray
{
	void    **data;
	int       length;
};

	// C functions
	capacity   = sq_ptr_array_capacity(array);
	clearFunc  = sq_ptr_array_clear_func(array);

	// C++ methods
	capacity   = array->capacity();
	clearFunc  = array->clearFunc();

	// 'func' can be NULL if you don't need to free the element's memory.
	SqDestroyFunc  func = free;

	SqPtrArray     arrayLocal;
	sq_ptr_array_init(&arrayLocal, capacity, func);
	sq_ptr_array_final(&arrayLocal);

	SqPtrArray    *array;
	array = sq_ptr_array_new(capacity, func);
	sq_ptr_array_free(array);

	// 'func' can be NULL if you don't need to free the element's memory.
	SqDestroyFunc  func = free;

	// Sq::PtrArray has constructor and destructor
	Sq::PtrArray   arrayLocal;

	Sq::PtrArray  *array;
	array = new Sq::PtrArray(capacity, func);
	delete array;

	// erase elements
	sq_ptr_array_erase(array, index, n_elements);

	// steal elements
	sq_ptr_array_steal(array, index, n_elements);

	// erase elements
	array->erase(index, n_elements);

	// steal elements
	array->steal(index, n_elements);

	void **memory;

	memory = sq_ptr_array_alloc(array, count);
	memory = sq_ptr_array_alloc_at(array, index, count);

	void  *ptrs[3] = {NULL};

	sq_ptr_array_push(array, NULL);
	sq_ptr_array_append(array, ptrs, sizeof(ptrs) / sizeof(void*));

	int   index = 5;

	sq_ptr_array_push_to(array, index, NULL);
	sq_ptr_array_insert(array, index, ptrs, sizeof(ptrs) / sizeof(void*));

	int  compareFunc(const void **ptr1, const void **ptr2);

	sq_ptr_array_sort(array, (SqCompareFunc)compareFunc);

	void **key;
	void **element;
	int    insertingIndex;

	element = sq_ptr_array_find(array, key, compareFunc);
	element = sq_ptr_array_find_sorted(array, key, compareFunc, &insertingIndex);