DynamicArray.h File Reference

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
struct	_DYNAMIC_ARRAY

Macros
#define	Array_Create(pArray, type, ItemCountMax)   Array_Create_(pArray, sizeof(type), ItemCountMax)

Typedefs
typedef struct _DYNAMIC_ARRAY	DYNAMIC_ARRAY
typedef struct _DYNAMIC_ARRAY *	PDYNAMIC_ARRAY

Functions
int	Array_Create_ (PDYNAMIC_ARRAY pArray, size_t ItemSize, size_t ItemCountMax)
void *	Array_Insert (PDYNAMIC_ARRAY pArray, const void *NewItems, size_t NewItemCount)
void *	Array_ItemAt (PDYNAMIC_ARRAY pArray, size_t ItemIndex)
size_t	Array_IndexOf (PDYNAMIC_ARRAY pArray, const void *ArrayPtr)
void	Array_Free (PDYNAMIC_ARRAY pArray)

Macro Definition Documentation

#define Array_Create	(		pArray,
			type,
			ItemCountMax
	)		Array_Create_(pArray, sizeof(type), ItemCountMax)

Typedef Documentation

typedef struct _DYNAMIC_ARRAY DYNAMIC_ARRAY

typedef struct _DYNAMIC_ARRAY * PDYNAMIC_ARRAY

Function Documentation

int Array_Create_	(	PDYNAMIC_ARRAY	pArray,
		size_t	ItemSize,
		size_t	ItemCountMax
	)

{
 pArray->ItemArray = CASC_ALLOC(char, (ItemSize * ItemCountMax));
 if(pArray->ItemArray == NULL)
 return ERROR_NOT_ENOUGH_MEMORY;

 pArray->ItemCountMax = ItemCountMax;
 pArray->ItemCount = 0;
 pArray->ItemSize = ItemSize;
 return ERROR_SUCCESS;
}

void Array_Free

(

PDYNAMIC_ARRAY

pArray

)

{
 if(pArray != NULL && pArray->ItemArray != NULL)
 {
 CASC_FREE(pArray->ItemArray);
 }
}

Here is the caller graph for this function:

size_t Array_IndexOf	(	PDYNAMIC_ARRAY	pArray,
		const void *	ArrayPtr
	)

{
 char * ArrayItem = (char *)ArrayPtr;

 assert(pArray->ItemArray <= ArrayItem && ArrayItem <= pArray->ItemArray + (pArray->ItemCount * pArray->ItemSize));
 return ((ArrayItem - pArray->ItemArray) / pArray->ItemSize);
}

Here is the caller graph for this function:

void* Array_Insert	(	PDYNAMIC_ARRAY	pArray,
		const void *	NewItems,
		size_t	NewItemCount
	)

{
 char * NewItemPtr;

 // Try to enlarge the buffer, if needed
 if(!EnlargeArray(pArray, pArray->ItemCount + NewItemCount))
 return NULL;
 NewItemPtr = pArray->ItemArray + (pArray->ItemCount * pArray->ItemSize);

 // Copy the old item(s), if any
 if(NewItems != NULL)
 memcpy(NewItemPtr, NewItems, (NewItemCount * pArray->ItemSize));

 // Increment the size of the array
 pArray->ItemCount += NewItemCount;
 return NewItemPtr;
}

Here is the call graph for this function:

Here is the caller graph for this function:

void* Array_ItemAt	(	PDYNAMIC_ARRAY	pArray,
		size_t	ItemIndex
	)

{
 assert(ItemIndex < pArray->ItemCount);
 return pArray->ItemArray + (ItemIndex * pArray->ItemSize);
}

Here is the caller graph for this function: