diff options
| author | Carl Worth <cworth@cworth.org> | 2013-10-25 13:38:38 -0700 |
|---|---|---|
| committer | Eric Anholt <eric@anholt.net> | 2013-10-25 15:29:09 -0700 |
| commit | 5594ed57413bf0117c592cf8edc8c9363b98a578 (patch) | |
| tree | eb91118aaee8acb55d2356f0047aa9f4f7d5ecd0 /tests/set/delete_management.c | |
| parent | 9dd53079a431768b76431fa632a5ea086d0c54e9 (diff) | |
Add set_contains and int_set_contains functions.
These are convenience functions on top of set_search and
int_set_search. With a set, containment is often the most important
notion of interest, and it helps to be able to query this without
needing to declare a local struct set_entry*.
v2: Whitespace consistency (changes by anholt)
Diffstat (limited to 'tests/set/delete_management.c')
| -rw-r--r-- | tests/set/delete_management.c | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/tests/set/delete_management.c b/tests/set/delete_management.c index f54c9c5..14f1fe1 100644 --- a/tests/set/delete_management.c +++ b/tests/set/delete_management.c @@ -67,6 +67,7 @@ main(int argc, char **argv) /* Make sure that all our entries were present at the end. */ for (i = size - 100; i < size; i++) { + assert(set_contains(set, i, &keys[i])); entry = set_search(set, i, &keys[i]); assert(entry); assert(key_value(entry->key) == i); |