--- libelwix/inc/elwix/aarray.h	2013/01/17 10:05:35	1.1
+++ libelwix/inc/elwix/aarray.h	2013/05/26 20:03:18	1.1.1.1.6.2
@@ -3,7 +3,7 @@
 *  by Michael Pounov <misho@elwix.org>
 *
 * $Author: misho $
-* $Id: aarray.h,v 1.1 2013/01/17 10:05:35 misho Exp $
+* $Id: aarray.h,v 1.1.1.1.6.2 2013/05/26 20:03:18 misho Exp $
 *
 **************************************************************************
 The ELWIX and AITNET software is distributed under the following
@@ -79,14 +79,14 @@ typedef struct _tagArray {
  * @numItems = Number of Items
  * 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
  *
  * @parr = Array
  * 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
  *	(WARNING! If assign static array dont use this!!!)
@@ -94,7 +94,7 @@ inline void array_Destroy(array_t ** __restrict parr);
  * @arr = Array
  * 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
@@ -130,7 +130,7 @@ char **array_To(array_t * __restrict arr);
  * @arr = Array
  * 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!!!
@@ -174,7 +174,7 @@ int array_Copy(array_t ** __restrict dest, array_t * _
  * @data = Element, if set NULL GET element at position or !=NULL PUT 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
  *
@@ -183,7 +183,7 @@ inline void *array_Elem(array_t * __restrict arr, int 
  * @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
  */
-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
  *
@@ -192,7 +192,7 @@ inline int array_Push(array_t * __restrict arr, void *
  * @nodel = Don't delete after Pop element
  * 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