#include "strv.h"
static void test_set_steal_first(void) {
+ log_info("/* %s */", __func__);
+
_cleanup_ordered_set_free_ OrderedSet *m = NULL;
int seen[3] = {};
char *val;
static void test_set_free_with_hash_ops(void) {
OrderedSet *m;
struct Item items[4] = {};
- unsigned i;
+
+ log_info("/* %s */", __func__);
assert_se(m = ordered_set_new(&item_hash_ops));
- for (i = 0; i < ELEMENTSOF(items) - 1; i++)
+
+ for (size_t i = 0; i < ELEMENTSOF(items) - 1; i++)
assert_se(ordered_set_put(m, items + i) == 1);
+ for (size_t i = 0; i < ELEMENTSOF(items) - 1; i++)
+ assert_se(ordered_set_put(m, items + i) == 0); /* We get 0 here, because we use trivial hash
+ * ops. Also see below... */
+
m = ordered_set_free(m);
assert_se(items[0].seen == 1);
assert_se(items[1].seen == 1);
static void test_set_put(void) {
_cleanup_ordered_set_free_ OrderedSet *m = NULL;
- _cleanup_free_ char **t = NULL;
+ _cleanup_free_ char **t = NULL, *str = NULL;
+
+ log_info("/* %s */", __func__);
m = ordered_set_new(&string_hash_ops);
assert_se(m);
assert_se(ordered_set_put(m, (void*) "333") == 0);
assert_se(ordered_set_put(m, (void*) "22") == 0);
+ assert_se(str = strdup("333"));
+ assert_se(ordered_set_put(m, str) == -EEXIST); /* ... and we get -EEXIST here, because we use
+ * non-trivial hash ops. */
+
assert_se(t = ordered_set_get_strv(m));
assert_se(streq(t[0], "1"));
assert_se(streq(t[1], "22"));
_cleanup_free_ char **final = NULL; /* "just free" because the strings are in the set */
void *t;
+ log_info("/* %s */", __func__);
+
m = ordered_set_new(&string_hash_ops);
assert_se(m);