version 1.1, 2013/01/17 10:05:35
|
version 1.2.6.1, 2013/06/10 12:34:14
|
Line 58 typedef struct _tagArray {
|
Line 58 typedef struct _tagArray {
|
#define array_Zero(_arr) (assert((_arr)), memset((_arr)->arr_data, 0, \ |
#define array_Zero(_arr) (assert((_arr)), memset((_arr)->arr_data, 0, \ |
array_Size((_arr)) * sizeof(intptr_t))) |
array_Size((_arr)) * sizeof(intptr_t))) |
|
|
|
#define array_Ptr(_arr, _d) (_arr)->arr_data[_d] |
#define array_Get2(_arr, _d) (assert((_arr) && (_arr)->arr_num > _d), ((_arr)->arr_data + _d)) |
#define array_Get2(_arr, _d) (assert((_arr) && (_arr)->arr_num > _d), ((_arr)->arr_data + _d)) |
#define array_Get(_arr, _d) (assert((_arr) && (_arr)->arr_num > _d), (_arr)->arr_data[_d]) |
#define array_Get(_arr, _d) (assert((_arr) && (_arr)->arr_num > _d), (_arr)->arr_data[_d]) |
#define array(_arr, _d, _type) (assert((_arr) && (_arr)->arr_num > _d), \ |
#define array(_arr, _d, _type) (assert((_arr) && (_arr)->arr_num > _d), \ |
Line 79 typedef struct _tagArray {
|
Line 80 typedef struct _tagArray {
|
* @numItems = Number of Items |
* @numItems = Number of Items |
* return: NULL error, != NULL allocated memory for array |
* return: NULL error, != NULL allocated memory for array |
*/ |
*/ |
inline array_t *array_Init(int numItems); | array_t *array_Init(int numItems); |
/* |
/* |
* array_Destroy() - Free and destroy dynamic array |
* array_Destroy() - Free and destroy dynamic array |
* |
* |
* @parr = Array |
* @parr = Array |
* return: none |
* return: none |
*/ |
*/ |
inline void array_Destroy(array_t ** __restrict parr); | void array_Destroy(array_t ** __restrict parr); |
/* |
/* |
* array_Free() - Free all data in dynamic array items |
* array_Free() - Free all data in dynamic array items |
* (WARNING! If assign static array dont use this!!!) |
* (WARNING! If assign static array dont use this!!!) |
Line 94 inline void array_Destroy(array_t ** __restrict parr);
|
Line 95 inline void array_Destroy(array_t ** __restrict parr);
|
* @arr = Array |
* @arr = Array |
* return: none |
* return: none |
*/ |
*/ |
inline void array_Free(array_t * __restrict arr); | void array_Free(array_t * __restrict arr); |
|
|
/* |
/* |
* array_From() - Create and fill array from array with pointers |
* array_From() - Create and fill array from array with pointers |
Line 130 char **array_To(array_t * __restrict arr);
|
Line 131 char **array_To(array_t * __restrict arr);
|
* @arr = Array |
* @arr = Array |
* return: -1 empty or >-1 position of last used element |
* return: -1 empty or >-1 position of last used element |
*/ |
*/ |
inline int array_Len(array_t * __restrict arr); | int array_Len(array_t * __restrict arr); |
|
|
/* |
/* |
* array_Grow() - Grow/Shrink dynamic array, Use with care when it shrink!!! |
* array_Grow() - Grow/Shrink dynamic array, Use with care when it shrink!!! |
Line 174 int array_Copy(array_t ** __restrict dest, array_t * _
|
Line 175 int array_Copy(array_t ** __restrict dest, array_t * _
|
* @data = Element, if set NULL GET element at position or !=NULL PUT element at position |
* @data = Element, if set NULL GET element at position or !=NULL PUT element at position |
* return: -1 error or !=-1 return element at position |
* return: -1 error or !=-1 return element at position |
*/ |
*/ |
inline void *array_Elem(array_t * __restrict arr, int n, void *data); | void *array_Elem(array_t * __restrict arr, int n, void *data); |
/* |
/* |
* array_Push() - Push element into dynamic array like stack manner, place at first empty position |
* array_Push() - Push element into dynamic array like stack manner, place at first empty position |
* |
* |
Line 183 inline void *array_Elem(array_t * __restrict arr, int
|
Line 184 inline void *array_Elem(array_t * __restrict arr, int
|
* @nogrow = Don't grow array if not enough space |
* @nogrow = Don't grow array if not enough space |
* return: -1 not found empty position, array is full!, >-1 return position of stored element into array |
* return: -1 not found empty position, array is full!, >-1 return position of stored element into array |
*/ |
*/ |
inline int array_Push(array_t * __restrict arr, void **data, int nogrow); | int array_Push(array_t * __restrict arr, void *data, int nogrow); |
/* |
/* |
* array_Pop() - Pop element from dynamic array like stack manner, last used position |
* array_Pop() - Pop element from dynamic array like stack manner, last used position |
* |
* |
Line 192 inline int array_Push(array_t * __restrict arr, void *
|
Line 193 inline int array_Push(array_t * __restrict arr, void *
|
* @nodel = Don't delete after Pop element |
* @nodel = Don't delete after Pop element |
* return: -1 not found used position, array is empty!, >-1 return element position |
* return: -1 not found used position, array is empty!, >-1 return element position |
*/ |
*/ |
inline int array_Pop(array_t * __restrict arr, void ** __restrict data, int nodel); | int array_Pop(array_t * __restrict arr, void ** __restrict data, int nodel); |
|
|
|
|
#endif |
#endif |