X-Git-Url: http://git.ozlabs.org/?p=ccan;a=blobdiff_plain;f=ccan%2Fsparse_bsearch%2F_info;h=eb1e735a1e93efefa140d5273b9d87c0f5f278ab;hp=9c5e84118d08f20abd4d1f1cfdb3e81f1219b190;hb=9d2d2c49f053018724bcc6e37029da10b7c3d60d;hpb=0d8d8a9c1db4c67602fc94d9d3723ef08485595a

diff --git a/ccan/sparse_bsearch/_info b/ccan/sparse_bsearch/_info
index 9c5e8411..eb1e735a 100644
--- a/ccan/sparse_bsearch/_info
+++ b/ccan/sparse_bsearch/_info
@@ -1,6 +1,6 @@
+#include "config.h"
 #include <string.h>
 #include <stdio.h>
-#include "config.h"
 
 /**
  * sparse_bsearch - search a sorted array with some invalid entries
@@ -15,7 +15,7 @@
  * Example:
  *	#include <ccan/sparse_bsearch/sparse_bsearch.h>
  *
- *	static bool val_valid(unsigned int *val)
+ *	static bool val_valid(const unsigned int *val)
  *	{
  *		return *val != 0;
  *	}
@@ -26,7 +26,7 @@
  *	static unsigned int values[] = { 1, 7, 11, 1235, 99999 };
  *
  *	// Return true if this value is in set, and remove it.
- *	bool remove_from_values(unsigned int val)
+ *	static bool remove_from_values(unsigned int val)
  *	{
  *		unsigned int *p;
  *		// We use 5 here, but ccan/array_size.h is better!
@@ -49,6 +49,9 @@
  *		}
  *		return 0;
  *	}
+ *
+ * License: LGPL (v2.1 or any later version)
+ * Author: Rusty Russell <rusty@rustcorp.com.au>
  */
 int main(int argc, char *argv[])
 {