--- libelwix/src/array.c	2013/03/25 10:46:41	1.1.1.1.6.2
+++ libelwix/src/array.c	2013/08/23 15:11:36	1.2.22.1
@@ -3,7 +3,7 @@
 *  by Michael Pounov <misho@elwix.org>
 *
 * $Author: misho $
-* $Id: array.c,v 1.1.1.1.6.2 2013/03/25 10:46:41 misho Exp $
+* $Id: array.c,v 1.2.22.1 2013/08/23 15:11:36 misho Exp $
 *
 **************************************************************************
 The ELWIX and AITNET software is distributed under the following
@@ -52,7 +52,7 @@ SUCH DAMAGE.
  * @numItems = Number of Items
  * return: NULL error, != NULL allocated memory for array
  */
-inline array_t *
+array_t *
 array_Init(int numItems)
 {
 	array_t *arr = NULL;
@@ -137,7 +137,7 @@ array_To(array_t * __restrict arr)
  * @arr = Array
  * return: none
  */
-inline void
+void
 array_Free(array_t * __restrict arr)
 {
 	register int i;
@@ -160,7 +160,7 @@ array_Free(array_t * __restrict arr)
  * @parr = Array
  * return: none
  */
-inline void
+void
 array_Destroy(array_t ** __restrict parr)
 {
 	if (!parr || !*parr)
@@ -178,7 +178,7 @@ array_Destroy(array_t ** __restrict parr)
  * @arr = Array
  * return: -1 empty or >-1 position of last used element
  */
-inline int
+int
 array_Len(array_t * __restrict arr)
 {
 	register int i;
@@ -319,7 +319,7 @@ array_Concat(array_t * __restrict dest, array_t * __re
 /*
  * array_Copy() Copy source array to destination array
  *
- * @dest = Destination array, after use free with io_arrayDestroy()
+ * @dest = Destination array, after use free with array_Destroy()
  * @src = Source array
  * return: -1 error; >0 count of destination array
  */
@@ -347,7 +347,7 @@ array_Copy(array_t ** __restrict dest, array_t * __res
  * @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 *
+void *
 array_Elem(array_t * __restrict arr, int n, void *data)
 {
 	void *dat = NULL;
@@ -373,7 +373,7 @@ array_Elem(array_t * __restrict arr, int n, void *data
  * @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
+int
 array_Push(array_t * __restrict arr, void *data, int nogrow)
 {
 	int ret = -1;
@@ -401,7 +401,7 @@ array_Push(array_t * __restrict arr, void *data, int n
  * @nodel = Don't delete after Pop element
  * return: -1 not found used position, array is empty!, >-1 return element position
  */
-inline int
+int
 array_Pop(array_t * __restrict arr, void ** __restrict data, int nodel)
 {
 	int ret = -1;
@@ -422,7 +422,7 @@ array_Pop(array_t * __restrict arr, void ** __restrict
 
 /*
  * array_Args() Parse and make array from arguments ... (input string will be modified!!! 
- *	and output array must be free with io_arrayDestroy() after use!)
+ *	and output array must be free with array_Destroy() after use!)
  *
  * @psArgs = Input arguments line, after execute string is modified!!!
  * @nargs = Maximum requested count of arguments from input string psArgs, if 0 all psArgs