DynamicArray.cpp File Reference

#include "../CascLib.h"
#include "../CascCommon.h"

Include dependency graph for DynamicArray.cpp:

Macros
#define	__CASCLIB_SELF__

Functions
static bool	EnlargeArray (PDYNAMIC_ARRAY pArray, size_t NewItemCount)
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 __CASCLIB_SELF__

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:

static bool EnlargeArray ( PDYNAMIC_ARRAY  pArray, size_t  NewItemCount  )

static

{
 char * NewItemArray;
 size_t ItemCountMax;

 // We expect the array to be already allocated
 assert(pArray->ItemArray != NULL);
 assert(pArray->ItemCountMax != 0);
 
 // Shall we enlarge the table?
 if(NewItemCount > pArray->ItemCountMax)
 {
 // Calculate new table size
 ItemCountMax = pArray->ItemCountMax;
 while(ItemCountMax < NewItemCount)
 ItemCountMax = ItemCountMax << 1;

 // Allocate new table
 NewItemArray = CASC_REALLOC(char, pArray->ItemArray, pArray->ItemSize * ItemCountMax);
 if(NewItemArray == NULL)
 return false;

 // Set the new table size
 pArray->ItemCountMax = ItemCountMax;
 pArray->ItemArray = NewItemArray;
 }

 return true;
}

Here is the caller graph for this function: