--- libelwix/inc/elwix/apatricia.h	2013/01/17 10:05:35	1.1
+++ libelwix/inc/elwix/apatricia.h	2013/05/30 09:07:33	1.2
@@ -3,7 +3,7 @@
 *  by Michael Pounov <misho@elwix.org>
 *
 * $Author: misho $
-* $Id: apatricia.h,v 1.1 2013/01/17 10:05:35 misho Exp $
+* $Id: apatricia.h,v 1.2 2013/05/30 09:07:33 misho Exp $
 *
 **************************************************************************
 The ELWIX and AITNET software is distributed under the following
@@ -103,30 +103,30 @@ typedef struct _patricia_tree_t {
 } patricia_tree_t;
 
 
-inline patricia_tree_t *New_Patricia(int maxbits);
-inline void Destroy_Patricia(patricia_tree_t *patricia, void_fn_t func);
-inline void Clear_Patricia(patricia_tree_t *patricia, void_fn_t func);
-inline prefix_t *Ref_Prefix(prefix_t *prefix);
-inline void Deref_Prefix(prefix_t * prefix);
+patricia_tree_t *New_Patricia(int maxbits);
+void Destroy_Patricia(patricia_tree_t *patricia, void_fn_t func);
+void Clear_Patricia(patricia_tree_t *patricia, void_fn_t func);
+prefix_t *Ref_Prefix(prefix_t *prefix);
+void Deref_Prefix(prefix_t * prefix);
 
-inline patricia_node_t *patricia_lookup(patricia_tree_t *patricia, prefix_t *prefix);
-inline void patricia_remove(patricia_tree_t *patricia, patricia_node_t *node);
-inline void patricia_process(patricia_tree_t *patricia, void_fn_t func);
+patricia_node_t *patricia_lookup(patricia_tree_t *patricia, prefix_t *prefix);
+void patricia_remove(patricia_tree_t *patricia, patricia_node_t *node);
+void patricia_process(patricia_tree_t *patricia, void_fn_t func);
 
-inline patricia_node_t *patricia_search_exact(patricia_tree_t *patricia, prefix_t *prefix);
-inline patricia_node_t *patricia_search_best(patricia_tree_t *patricia, prefix_t *prefix);
-inline patricia_node_t *patricia_search_best2(patricia_tree_t *patricia, prefix_t *prefix, int inclusive);
+patricia_node_t *patricia_search_exact(patricia_tree_t *patricia, prefix_t *prefix);
+patricia_node_t *patricia_search_best(patricia_tree_t *patricia, prefix_t *prefix);
+patricia_node_t *patricia_search_best2(patricia_tree_t *patricia, prefix_t *prefix, int inclusive);
 
 /* { from demo.c */
-inline char *prefix_toa(prefix_t *prefix);
-inline prefix_t *ascii2prefix(int family, char *string);
+char *prefix_toa(prefix_t *prefix);
+prefix_t *ascii2prefix(int family, char *string);
 
 #define addroute make_and_lookup
-inline patricia_node_t *make_and_lookup(patricia_tree_t *tree, char *string);
+patricia_node_t *make_and_lookup(patricia_tree_t *tree, char *string);
 #define delroute lookup_then_remove
-inline void lookup_then_remove(patricia_tree_t *tree, char *string);
-inline patricia_node_t *try_search_exact(patricia_tree_t *tree, char *string);
-inline patricia_node_t *try_search_best(patricia_tree_t *tree, char *string);
+void lookup_then_remove(patricia_tree_t *tree, char *string);
+patricia_node_t *try_search_exact(patricia_tree_t *tree, char *string);
+patricia_node_t *try_search_best(patricia_tree_t *tree, char *string);
 /* } */
 
 /* { from defs.h */