diff options
Diffstat (limited to 'WWW/Library/Implementation/HTBTree.h')
| -rw-r--r-- | WWW/Library/Implementation/HTBTree.h | 14 |
1 files changed, 7 insertions, 7 deletions
diff --git a/WWW/Library/Implementation/HTBTree.h b/WWW/Library/Implementation/HTBTree.h index cbbfad43..0bf10cf7 100644 --- a/WWW/Library/Implementation/HTBTree.h +++ b/WWW/Library/Implementation/HTBTree.h @@ -30,7 +30,7 @@ typedef struct _HTBTree_element { int right_depth; } HTBTElement; -typedef int (*HTComparer) PARAMS((void * a, void * b)); +typedef int (*HTComparer) (void * a, void * b); typedef struct _HTBTree_top { HTComparer compare; @@ -43,7 +43,7 @@ typedef struct _HTBTree_top { Create a binary tree given its discrimination routine */ -extern HTBTree * HTBTree_new PARAMS((HTComparer comp)); +extern HTBTree * HTBTree_new (HTComparer comp); @@ -52,7 +52,7 @@ extern HTBTree * HTBTree_new PARAMS((HTComparer comp)); Free storage of the tree but not of the objects */ -extern void HTBTree_free PARAMS((HTBTree* tree)); +extern void HTBTree_free (HTBTree* tree); @@ -61,7 +61,7 @@ extern void HTBTree_free PARAMS((HTBTree* tree)); Free storage of the tree and of the objects */ -extern void HTBTreeAndObject_free PARAMS((HTBTree* tree)); +extern void HTBTreeAndObject_free (HTBTree* tree); @@ -71,7 +71,7 @@ Add an object to a binary tree */ -extern void HTBTree_add PARAMS((HTBTree* tree, void * object)); +extern void HTBTree_add (HTBTree* tree, void * object); /* @@ -81,7 +81,7 @@ Search an object in a binary tree returns Pointer to equivalent object in a tree or NULL if none. */ -extern void * HTBTree_search PARAMS((HTBTree* tree, void * object)); +extern void * HTBTree_search (HTBTree* tree, void * object); /* @@ -104,6 +104,6 @@ Find next element in depth-first order returns Pointer to element or NULL if none left. */ -extern HTBTElement * HTBTree_next PARAMS((HTBTree* tree, HTBTElement * ele)); +extern HTBTElement * HTBTree_next (HTBTree* tree, HTBTElement * ele); #endif /* HTBTREE_H */ |