1 /* SPDX-License-Identifier: LGPL-2.1-or-later */
5 #include "ordered-set.h"
6 #include "string-util.h"
9 static void test_set_steal_first(void) {
10 log_info("/* %s */", __func__
);
12 _cleanup_ordered_set_free_ OrderedSet
*m
= NULL
;
16 m
= ordered_set_new(&string_hash_ops
);
19 assert_se(ordered_set_put(m
, (void*) "1") == 1);
20 assert_se(ordered_set_put(m
, (void*) "22") == 1);
21 assert_se(ordered_set_put(m
, (void*) "333") == 1);
23 ordered_set_print(stdout
, "SET=", m
);
25 while ((val
= ordered_set_steal_first(m
)))
26 seen
[strlen(val
) - 1]++;
28 assert_se(seen
[0] == 1 && seen
[1] == 1 && seen
[2] == 1);
30 assert_se(ordered_set_isempty(m
));
32 ordered_set_print(stdout
, "SET=", m
);
38 static void item_seen(Item
*item
) {
42 DEFINE_PRIVATE_HASH_OPS_WITH_VALUE_DESTRUCTOR(item_hash_ops
, void, trivial_hash_func
, trivial_compare_func
, Item
, item_seen
);
44 static void test_set_free_with_hash_ops(void) {
46 struct Item items
[4] = {};
48 log_info("/* %s */", __func__
);
50 assert_se(m
= ordered_set_new(&item_hash_ops
));
52 for (size_t i
= 0; i
< ELEMENTSOF(items
) - 1; i
++)
53 assert_se(ordered_set_put(m
, items
+ i
) == 1);
55 for (size_t i
= 0; i
< ELEMENTSOF(items
) - 1; i
++)
56 assert_se(ordered_set_put(m
, items
+ i
) == 0); /* We get 0 here, because we use trivial hash
57 * ops. Also see below... */
59 m
= ordered_set_free(m
);
60 assert_se(items
[0].seen
== 1);
61 assert_se(items
[1].seen
== 1);
62 assert_se(items
[2].seen
== 1);
63 assert_se(items
[3].seen
== 0);
66 static void test_set_put(void) {
67 _cleanup_ordered_set_free_ OrderedSet
*m
= NULL
;
68 _cleanup_free_
char **t
= NULL
, *str
= NULL
;
70 log_info("/* %s */", __func__
);
72 m
= ordered_set_new(&string_hash_ops
);
75 assert_se(ordered_set_put(m
, (void*) "1") == 1);
76 assert_se(ordered_set_put(m
, (void*) "22") == 1);
77 assert_se(ordered_set_put(m
, (void*) "333") == 1);
78 assert_se(ordered_set_put(m
, (void*) "333") == 0);
79 assert_se(ordered_set_remove(m
, (void*) "333"));
80 assert_se(ordered_set_put(m
, (void*) "333") == 1);
81 assert_se(ordered_set_put(m
, (void*) "333") == 0);
82 assert_se(ordered_set_put(m
, (void*) "22") == 0);
84 assert_se(str
= strdup("333"));
85 assert_se(ordered_set_put(m
, str
) == -EEXIST
); /* ... and we get -EEXIST here, because we use
86 * non-trivial hash ops. */
88 assert_se(t
= ordered_set_get_strv(m
));
89 assert_se(streq(t
[0], "1"));
90 assert_se(streq(t
[1], "22"));
91 assert_se(streq(t
[2], "333"));
94 ordered_set_print(stdout
, "FOO=", m
);
97 static void test_set_put_string_set(void) {
98 _cleanup_ordered_set_free_free_ OrderedSet
*m
= NULL
;
99 _cleanup_ordered_set_free_ OrderedSet
*q
= NULL
;
100 _cleanup_free_
char **final
= NULL
; /* "just free" because the strings are in the set */
103 log_info("/* %s */", __func__
);
105 m
= ordered_set_new(&string_hash_ops
);
108 q
= ordered_set_new(&string_hash_ops
);
111 assert_se(t
= strdup("1"));
112 assert_se(ordered_set_put(m
, t
) == 1);
113 assert_se(t
= strdup("22"));
114 assert_se(ordered_set_put(m
, t
) == 1);
115 assert_se(t
= strdup("333"));
116 assert_se(ordered_set_put(m
, t
) == 1);
118 assert_se(ordered_set_put(q
, (void*) "11") == 1);
119 assert_se(ordered_set_put(q
, (void*) "22") == 1);
120 assert_se(ordered_set_put(q
, (void*) "33") == 1);
122 assert_se(ordered_set_put_string_set(m
, q
) == 2);
124 assert_se(final
= ordered_set_get_strv(m
));
125 assert_se(strv_equal(final
, STRV_MAKE("1", "22", "333", "11", "33")));
127 ordered_set_print(stdout
, "BAR=", m
);
130 int main(int argc
, const char *argv
[]) {
131 test_set_steal_first();
132 test_set_free_with_hash_ops();
134 test_set_put_string_set();