2017-11-18 17:09:20 +01:00
|
|
|
/* SPDX-License-Identifier: LGPL-2.1+ */
|
2014-10-01 15:32:16 +02:00
|
|
|
|
|
|
|
#include "set.h"
|
2019-02-20 22:29:20 +01:00
|
|
|
#include "strv.h"
|
2014-10-01 15:32:16 +02:00
|
|
|
|
|
|
|
static void test_set_steal_first(void) {
|
|
|
|
_cleanup_set_free_ Set *m = NULL;
|
|
|
|
int seen[3] = {};
|
|
|
|
char *val;
|
|
|
|
|
|
|
|
m = set_new(&string_hash_ops);
|
|
|
|
assert_se(m);
|
|
|
|
|
|
|
|
assert_se(set_put(m, (void*) "1") == 1);
|
|
|
|
assert_se(set_put(m, (void*) "22") == 1);
|
|
|
|
assert_se(set_put(m, (void*) "333") == 1);
|
|
|
|
|
|
|
|
while ((val = set_steal_first(m)))
|
|
|
|
seen[strlen(val) - 1]++;
|
|
|
|
|
2014-10-04 23:51:45 +02:00
|
|
|
assert_se(seen[0] == 1 && seen[1] == 1 && seen[2] == 1);
|
2014-10-01 15:32:16 +02:00
|
|
|
|
|
|
|
assert_se(set_isempty(m));
|
|
|
|
}
|
|
|
|
|
2017-11-28 12:35:49 +01:00
|
|
|
typedef struct Item {
|
|
|
|
int seen;
|
|
|
|
} Item;
|
|
|
|
static void item_seen(Item *item) {
|
|
|
|
item->seen++;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void test_set_free_with_destructor(void) {
|
|
|
|
Set *m;
|
|
|
|
struct Item items[4] = {};
|
|
|
|
unsigned i;
|
|
|
|
|
|
|
|
assert_se(m = set_new(NULL));
|
|
|
|
for (i = 0; i < ELEMENTSOF(items) - 1; i++)
|
|
|
|
assert_se(set_put(m, items + i) == 1);
|
|
|
|
|
|
|
|
m = set_free_with_destructor(m, item_seen);
|
|
|
|
assert_se(items[0].seen == 1);
|
|
|
|
assert_se(items[1].seen == 1);
|
|
|
|
assert_se(items[2].seen == 1);
|
|
|
|
assert_se(items[3].seen == 0);
|
|
|
|
}
|
|
|
|
|
2018-11-25 13:54:44 +01:00
|
|
|
DEFINE_PRIVATE_HASH_OPS_WITH_VALUE_DESTRUCTOR(item_hash_ops, void, trivial_hash_func, trivial_compare_func, Item, item_seen);
|
|
|
|
|
|
|
|
static void test_set_free_with_hash_ops(void) {
|
|
|
|
Set *m;
|
|
|
|
struct Item items[4] = {};
|
|
|
|
unsigned i;
|
|
|
|
|
|
|
|
assert_se(m = set_new(&item_hash_ops));
|
|
|
|
for (i = 0; i < ELEMENTSOF(items) - 1; i++)
|
|
|
|
assert_se(set_put(m, items + i) == 1);
|
|
|
|
|
|
|
|
m = set_free(m);
|
|
|
|
assert_se(items[0].seen == 1);
|
|
|
|
assert_se(items[1].seen == 1);
|
|
|
|
assert_se(items[2].seen == 1);
|
|
|
|
assert_se(items[3].seen == 0);
|
|
|
|
}
|
|
|
|
|
2015-04-10 16:53:17 +02:00
|
|
|
static void test_set_put(void) {
|
|
|
|
_cleanup_set_free_ Set *m = NULL;
|
|
|
|
|
|
|
|
m = set_new(&string_hash_ops);
|
|
|
|
assert_se(m);
|
|
|
|
|
|
|
|
assert_se(set_put(m, (void*) "1") == 1);
|
|
|
|
assert_se(set_put(m, (void*) "22") == 1);
|
|
|
|
assert_se(set_put(m, (void*) "333") == 1);
|
|
|
|
assert_se(set_put(m, (void*) "333") == 0);
|
|
|
|
assert_se(set_remove(m, (void*) "333"));
|
|
|
|
assert_se(set_put(m, (void*) "333") == 1);
|
|
|
|
assert_se(set_put(m, (void*) "333") == 0);
|
|
|
|
assert_se(set_put(m, (void*) "22") == 0);
|
2019-02-20 22:29:20 +01:00
|
|
|
|
|
|
|
_cleanup_free_ char **t = set_get_strv(m);
|
|
|
|
assert_se(strv_contains(t, "1"));
|
|
|
|
assert_se(strv_contains(t, "22"));
|
|
|
|
assert_se(strv_contains(t, "333"));
|
|
|
|
assert_se(strv_length(t) == 3);
|
2015-04-10 16:53:17 +02:00
|
|
|
}
|
|
|
|
|
2014-10-01 15:32:16 +02:00
|
|
|
int main(int argc, const char *argv[]) {
|
|
|
|
test_set_steal_first();
|
2017-11-28 12:35:49 +01:00
|
|
|
test_set_free_with_destructor();
|
2018-11-25 13:54:44 +01:00
|
|
|
test_set_free_with_hash_ops();
|
2015-04-10 16:53:17 +02:00
|
|
|
test_set_put();
|
2014-10-01 15:32:16 +02:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|