Imagelibrary/Containers
1
0
Fork 0
mirror of https://github.com/bkthomps/Containers.git synced 2025-11-16 12:34:47 +00:00
Code Issues Packages Projects Releases Wiki Activity

Add ordered retrieval (#120)

Browse Source 
Add ordered retrieval functions to the tree-based containers.
This commit is contained in:
Bailey Thompson
2020-08-20 01:35:28 -04:00
committed by GitHub
parent 6af6778702
commit c77aa4d87b
12 changed files with 1013 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

94
tst/test_multiset.c
View File

@@ -605,6 +605,99 @@ static void test_big_object(void)
assert(!multiset_destroy(me));
}
static void test_ordered_retrieval(void)
{
int *get;
int val = 4;
multiset me = multiset_init(sizeof(int), compare_int);
assert(!multiset_first(me));
assert(!multiset_last(me));
assert(multiset_put(me, &val) == BK_OK);
get = multiset_first(me);
assert(val == *get);
get = multiset_last(me);
assert(val == *get);
val = 5;
assert(multiset_put(me, &val) == BK_OK);
val = 3;
assert(multiset_put(me, &val) == BK_OK);
get = multiset_first(me);
assert(3 == *get);
get = multiset_last(me);
assert(5 == *get);
/* Lower tests */
val = 7;
get = multiset_lower(me, &val);
assert(5 == *get);
val = 6;
get = multiset_lower(me, &val);
assert(5 == *get);
val = 5;
get = multiset_lower(me, &val);
assert(4 == *get);
val = 4;
get = multiset_lower(me, &val);
assert(3 == *get);
val = 3;
get = multiset_lower(me, &val);
assert(!get);
/* Higher tests */
val = 1;
get = multiset_higher(me, &val);
assert(3 == *get);
val = 2;
get = multiset_higher(me, &val);
assert(3 == *get);
val = 3;
get = multiset_higher(me, &val);
assert(4 == *get);
val = 4;
get = multiset_higher(me, &val);
assert(5 == *get);
val = 5;
get = multiset_higher(me, &val);
assert(!get);
/* Floor tests */
val = 7;
get = multiset_floor(me, &val);
assert(5 == *get);
val = 6;
get = multiset_floor(me, &val);
assert(5 == *get);
val = 5;
get = multiset_floor(me, &val);
assert(5 == *get);
val = 4;
get = multiset_floor(me, &val);
assert(4 == *get);
val = 3;
get = multiset_floor(me, &val);
assert(3 == *get);
val = 2;
get = multiset_floor(me, &val);
assert(!get);
/* Ceiling tests */
val = 1;
get = multiset_ceiling(me, &val);
assert(3 == *get);
val = 2;
get = multiset_ceiling(me, &val);
assert(3 == *get);
val = 3;
get = multiset_ceiling(me, &val);
assert(3 == *get);
val = 4;
get = multiset_ceiling(me, &val);
assert(4 == *get);
val = 5;
get = multiset_ceiling(me, &val);
assert(5 == *get);
val = 6;
get = multiset_ceiling(me, &val);
assert(!get);
multiset_destroy(me);
}
void test_multiset(void)
{
test_invalid_init();
@@ -621,4 +714,5 @@ void test_multiset(void)
test_put_out_of_memory();
#endif
test_big_object();
test_ordered_retrieval();
}