X-Git-Url: http://git.ozlabs.org/?p=ccan;a=blobdiff_plain;f=ccan%2Fbtree%2F_info;h=7a69ed910243e5bead2fb60109a326383607abd2;hp=2b81dafbe4e0cd6f7f3e016e24ca186ad7470876;hb=HEAD;hpb=8f7447e48f6405a083919f3d6b591eb7dfbc6a9f

diff --git a/ccan/btree/_info b/ccan/btree/_info
index 2b81dafb..7a69ed91 100644
--- a/ccan/btree/_info
+++ b/ccan/btree/_info
@@ -1,5 +1,6 @@
-#include <string.h>
 #include "config.h"
+#include <stdio.h>
+#include <string.h>
 
 /**
  * btree - Efficient sorted associative container based on B-trees.
@@ -12,14 +13,6 @@
  * invalidate all iterators pointing to it (including the one passed to the
  * insertion or removal function).
  *
- * btree currently doesn't have convenience functions for the simple tasks of
- * "look up by key", "insert a key", and "remove a key".  To insert or remove,
- * you first have use btree_find* to position an iterator on the
- * insertion/removal point, then call btree_insert_at or btree_remove_at using
- * that iterator.  Since a btree can hold multiple items with the same key,
- * it isn't clear how the convenience functions should work yet.  I'm open to
- * suggestions.
- *
  * A B-tree (not to be confused with a binary tree) is a data structure that
  * performs insertion, removal, and lookup in O(log n) time per operation.
  * Although B-trees are typically used for databases and filesystems, this is
@@ -45,7 +38,7 @@
  * };
  * 
  * //Define the ordering function order_by_letter_set
- * btree_search_implement
+ * static btree_search_implement
  * (
  * 	order_by_letter_set,
  * 	struct word *,
@@ -58,7 +51,7 @@
  * char *chomp(char *str);
  * char *make_letter_set(char *str);
  * 
- * void insert_word(struct btree *btree, struct word *word)
+ * static void insert_word(struct btree *btree, struct word *word)
  * {
  * 	btree_iterator iter;
  * 	
@@ -69,7 +62,7 @@
  * 	btree_insert_at(iter, word);
  * }
  * 
- * void print_anagrams(struct btree *btree, char *line)
+ * static void print_anagrams(struct btree *btree, char *line)
  * {
  * 	btree_iterator iter, end;
  * 	struct word key = {
@@ -94,7 +87,7 @@
  * 	}
  * }
  * 
- * int destroy_word(struct word *word, void *ctx)
+ * static int destroy_word(struct word *word, void *ctx)
  * {
  * 	(void) ctx;
  * 	
@@ -105,7 +98,7 @@
  * 	return 1;
  * }
  * 
- * struct btree *read_dictionary(const char *filename)
+ * static struct btree *read_dictionary(const char *filename)
  * {
  * 	FILE *f;
  * 	char line[256];
@@ -137,7 +130,7 @@
  * 	
  * 	return btree;
  * 
- * fail:
+ *   fail:
  * 	btree_delete(btree);
  * 	fprintf(stderr, "%s: %s\n", filename, strerror(errno));
  * 	return NULL;
@@ -231,9 +224,9 @@
  * 	return str;
  * }
  *
- * Author: Joey Adams
- * Version: 0.1.0
- * Licence: BSD
+ * Author: Joey Adams <joeyadams3.14159@gmail.com>
+ * License: MIT
+ * Version: 0.2
  */
 int main(int argc, char *argv[])
 {