X-Git-Url: http://git.ozlabs.org/?a=blobdiff_plain;ds=sidebyside;f=ccan%2Fbtree%2F_info;h=46877229b9e015944d9b6cf56d289ad4a78165a0;hb=ee6f11b307599200a574208372bc962eff81a9b1;hp=2b81dafbe4e0cd6f7f3e016e24ca186ad7470876;hpb=8f7447e48f6405a083919f3d6b591eb7dfbc6a9f;p=ccan

diff --git a/ccan/btree/_info b/ccan/btree/_info
index 2b81dafb..46877229 100644
--- a/ccan/btree/_info
+++ b/ccan/btree/_info
@@ -12,14 +12,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