File: fix-README

package info (click to toggle)
libavl 0.3.5-4.1
  • links: PTS
  • area: main
  • in suites: forky, sid, trixie
  • size: 152 kB
  • sloc: ansic: 671; makefile: 39
file content (22 lines) | stat: -rw-r--r-- 470 bytes parent folder | download | duplicates (2) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
 
--- a/README
+++ b/README
@@ -38,8 +38,8 @@
 
 	int main(void) {
 		char *buf[BUFSIZE];
-		AVLTree *tree;
-		AVLTree *node;
+		avl_tree *tree;
+		avl_node *node;
 
 		tree = avl_alloc_tree((avl_compare_t)strcmp, (avl_freeitem_t)free);
 
@@ -49,7 +49,7 @@
 		for(node = tree->head; node; node = node->next)
 			printf("%s", node->item);
 
-		avl_free_tree(tree, free);
+		avl_free_tree(tree);
 	}
 
 A real implementation would check the return values of avl_alloc_tree,