version 1.1.1.1, 2013/01/17 10:05:35
|
version 1.1.1.1.6.1, 2013/05/26 20:03:18
|
Line 105 int sarr_Copy(sarr_t ** __restrict dest, sarr_t * __re
|
Line 105 int sarr_Copy(sarr_t ** __restrict dest, sarr_t * __re
|
* @idx = Index (warning 1st element is at position 1) |
* @idx = Index (warning 1st element is at position 1) |
* return: NULL not found, !=NULL element |
* return: NULL not found, !=NULL element |
*/ |
*/ |
inline void *sarr_Get(sarr_t * __restrict arr, unsigned int idx); | void *sarr_Get(sarr_t * __restrict arr, unsigned int idx); |
/* |
/* |
* sarr_Get2() - Always get element from dynamic split-order array |
* sarr_Get2() - Always get element from dynamic split-order array |
* Function automatic grow array. Good use for Hash tables! |
* Function automatic grow array. Good use for Hash tables! |
Line 123 void *sarr_Get2(sarr_t * __restrict arr, unsigned int
|
Line 123 void *sarr_Get2(sarr_t * __restrict arr, unsigned int
|
* @data = Value |
* @data = Value |
* return: NULL error or empty, !=NULL old value in element |
* return: NULL error or empty, !=NULL old value in element |
*/ |
*/ |
inline void *sarr_Set(sarr_t * __restrict arr, unsigned int idx, void *data); | void *sarr_Set(sarr_t * __restrict arr, unsigned int idx, void *data); |
#define sarr_Del(_arr, _idx) sarr_Set((_arr), _idx, NULL) |
#define sarr_Del(_arr, _idx) sarr_Set((_arr), _idx, NULL) |
#define sarr(_arr, _idx, _type) ((_type) sarr_Get((_arr), _idx)) |
#define sarr(_arr, _idx, _type) ((_type) sarr_Get((_arr), _idx)) |
|
|