aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorJoseph Hunkeler <jhunkeler@gmail.com>2025-01-31 11:42:01 -0500
committerJoseph Hunkeler <jhunkeler@gmail.com>2025-01-31 11:42:01 -0500
commitd716b2a5f7e9f4b2cf3f5d4efbcbd2f07bb5ccb9 (patch)
tree15e312921eb5def103643fe1fcb1147fa0d67e1e
parent727e176e30cf05ee2d88c28bb44bb0364d8e4e72 (diff)
downloadstasis-add-strlist-contains.tar.gz
Implements tests function for strlist_containsadd-strlist-contains
-rw-r--r--tests/test_strlist.c48
1 files changed, 48 insertions, 0 deletions
diff --git a/tests/test_strlist.c b/tests/test_strlist.c
index 90219bd..ce38ff6 100644
--- a/tests/test_strlist.c
+++ b/tests/test_strlist.c
@@ -247,6 +247,53 @@ void test_strlist_remove() {
guard_strlist_free(&list);
}
+void test_strlist_contains() {
+ struct StrList *list = strlist_init();
+ strlist_append(&list, "abc"); // 0
+ strlist_append(&list, "abc123"); // 1
+ strlist_append(&list, "abcdef"); // 2
+ strlist_append(&list, "abc123def456"); // 3
+ strlist_append(&list, "abcdefghi"); // 4
+ strlist_append(&list, "abc123def456ghi789"); // 5
+
+ struct testcase {
+ struct StrList *haystack;
+ const char *needle;
+ int expected_retval;
+ size_t expected_index;
+ };
+
+ struct testcase tc[] = {
+ // found
+ {.haystack = list, .needle = "abc", .expected_retval = 1, .expected_index = 0},
+ {.haystack = list, .needle = "abc123", .expected_retval = 1, .expected_index = 1},
+ {.haystack = list, .needle = "abcdef", .expected_retval = 1, .expected_index = 2},
+ {.haystack = list, .needle = "abc123def456", .expected_retval = 1, .expected_index = 3},
+ {.haystack = list, .needle = "abcdefghi", .expected_retval = 1, .expected_index = 4},
+ {.haystack = list, .needle = "abc123def456ghi789", .expected_retval = 1, .expected_index = 5},
+ // not found
+ {.haystack = list, .needle = "ZabcZ", .expected_retval = 0, .expected_index = 0},
+ {.haystack = list, .needle = "Zabc123Z", .expected_retval = 0, .expected_index = 0},
+ {.haystack = list, .needle = "ZabcdefZ", .expected_retval = 0, .expected_index = 0},
+ {.haystack = list, .needle = "Zabc123def456Z", .expected_retval = 0, .expected_index = 0},
+ {.haystack = list, .needle = "ZabcdefghiZ", .expected_retval = 0, .expected_index = 0},
+ {.haystack = list, .needle = "Zabc123def456ghi789Z", .expected_retval = 0, .expected_index = 0},
+ };
+
+ for (size_t i = 0; i < strlist_count(list); i++) {
+ struct testcase *t = &tc[i];
+ size_t index_of = 0;
+ int result = strlist_contains(t->haystack, t->needle, &index_of);
+
+ STASIS_ASSERT(result == t->expected_retval, "unexpected return value");
+ if (result) {
+ STASIS_ASSERT(index_of == t->expected_index && strcmp(strlist_item(t->haystack, index_of), t->needle) == 0, "value at index is the wrong item in the list");
+ }
+ }
+
+ guard_strlist_free(&list);
+}
+
void test_strlist_cmp() {
struct StrList *left;
struct StrList *right;
@@ -589,6 +636,7 @@ int main(int argc, char *argv[]) {
test_strlist_append_strlist,
test_strlist_append_tokenize,
test_strlist_append_array,
+ test_strlist_contains,
test_strlist_copy,
test_strlist_remove,
test_strlist_cmp,