diff options
author | Alex Auvolat <alex.auvolat@ens.fr> | 2015-02-14 20:08:40 +0100 |
---|---|---|
committer | Alex Auvolat <alex.auvolat@ens.fr> | 2015-02-14 20:08:40 +0100 |
commit | fea4c7a29e26bccab9a2982d600bd272e21a925a (patch) | |
tree | 410eb29058b1be429aee79911566a18d71dae7de /src/common/include/btree.h | |
parent | dc86ed35a4a41ab53bb595e69fe57c29264fd146 (diff) | |
download | kogata-fea4c7a29e26bccab9a2982d600bd272e21a925a.tar.gz kogata-fea4c7a29e26bccab9a2982d600bd272e21a925a.zip |
Add btree_remove_v to selectively remove bindings that have a key
Diffstat (limited to 'src/common/include/btree.h')
-rw-r--r-- | src/common/include/btree.h | 2 |
1 files changed, 2 insertions, 0 deletions
diff --git a/src/common/include/btree.h b/src/common/include/btree.h index 34fd2b3..9975885 100644 --- a/src/common/include/btree.h +++ b/src/common/include/btree.h @@ -7,6 +7,7 @@ // - btree_lower returns any item with matching key, or if none returns last item with smaller key // - btree_upper returns any item with matching key, or if none returns first item with bigger key // - btree_remove removes *all bindings* with matching key +// - btree_remove_v removes bindings with matching *key and value* // - btree_iter_on calls iterator function on all bindings with matching key // Memory management is same as for hashtbl (a kv_iter_fun_t is called when an item is released) @@ -19,6 +20,7 @@ void delete_btree(btree_t *t); bool btree_add(btree_t *t, void* key, void* val); void btree_remove(btree_t *t, const void* key); +void btree_remove_v(btree_t *t, const void* key, const void* value); void* btree_find(btree_t *i, const void* key); void* btree_lower(btree_t *i, const void* key); |