1 /* SPDX-License-Identifier: LGPL-2.1+ */
4 #include "extract-word.h"
8 Set
*internal_set_new(const struct hash_ops
*hash_ops HASHMAP_DEBUG_PARAMS
);
9 #define set_new(ops) internal_set_new(ops HASHMAP_DEBUG_SRC_ARGS)
11 static inline Set
*set_free(Set
*s
) {
12 internal_hashmap_free(HASHMAP_BASE(s
));
16 static inline Set
*set_free_free(Set
*s
) {
17 internal_hashmap_free_free(HASHMAP_BASE(s
));
21 /* no set_free_free_free */
23 static inline Set
*set_copy(Set
*s
) {
24 return (Set
*) internal_hashmap_copy(HASHMAP_BASE(s
));
27 int internal_set_ensure_allocated(Set
**s
, const struct hash_ops
*hash_ops HASHMAP_DEBUG_PARAMS
);
28 #define set_ensure_allocated(h, ops) internal_set_ensure_allocated(h, ops HASHMAP_DEBUG_SRC_ARGS)
30 int set_put(Set
*s
, const void *key
);
33 static inline void *set_get(Set
*s
, void *key
) {
34 return internal_hashmap_get(HASHMAP_BASE(s
), key
);
38 static inline bool set_contains(Set
*s
, const void *key
) {
39 return internal_hashmap_contains(HASHMAP_BASE(s
), key
);
42 static inline void *set_remove(Set
*s
, const void *key
) {
43 return internal_hashmap_remove(HASHMAP_BASE(s
), key
);
47 /* no set_remove_value */
48 int set_remove_and_put(Set
*s
, const void *old_key
, const void *new_key
);
49 /* no set_remove_and_replace */
50 int set_merge(Set
*s
, Set
*other
);
52 static inline int set_reserve(Set
*h
, unsigned entries_add
) {
53 return internal_hashmap_reserve(HASHMAP_BASE(h
), entries_add
);
56 static inline int set_move(Set
*s
, Set
*other
) {
57 return internal_hashmap_move(HASHMAP_BASE(s
), HASHMAP_BASE(other
));
60 static inline int set_move_one(Set
*s
, Set
*other
, const void *key
) {
61 return internal_hashmap_move_one(HASHMAP_BASE(s
), HASHMAP_BASE(other
), key
);
64 static inline unsigned set_size(Set
*s
) {
65 return internal_hashmap_size(HASHMAP_BASE(s
));
68 static inline bool set_isempty(Set
*s
) {
69 return set_size(s
) == 0;
72 static inline unsigned set_buckets(Set
*s
) {
73 return internal_hashmap_buckets(HASHMAP_BASE(s
));
76 bool set_iterate(Set
*s
, Iterator
*i
, void **value
);
78 static inline void set_clear(Set
*s
) {
79 internal_hashmap_clear(HASHMAP_BASE(s
));
82 static inline void set_clear_free(Set
*s
) {
83 internal_hashmap_clear_free(HASHMAP_BASE(s
));
86 /* no set_clear_free_free */
88 static inline void *set_steal_first(Set
*s
) {
89 return internal_hashmap_first_key_and_value(HASHMAP_BASE(s
), true, NULL
);
92 #define set_clear_with_destructor(_s, _f) \
95 while ((_item = set_steal_first(_s))) \
98 #define set_free_with_destructor(_s, _f) \
100 set_clear_with_destructor(_s, _f); \
104 /* no set_steal_first_key */
105 /* no set_first_key */
107 static inline void *set_first(Set
*s
) {
108 return internal_hashmap_first_key_and_value(HASHMAP_BASE(s
), false, NULL
);
113 static inline char **set_get_strv(Set
*s
) {
114 return internal_hashmap_get_strv(HASHMAP_BASE(s
));
117 int set_consume(Set
*s
, void *value
);
118 int set_put_strdup(Set
*s
, const char *p
);
119 int set_put_strdupv(Set
*s
, char **l
);
120 int set_put_strsplit(Set
*s
, const char *v
, const char *separators
, ExtractFlags flags
);
122 #define SET_FOREACH(e, s, i) \
123 for ((i) = ITERATOR_FIRST; set_iterate((s), &(i), (void**)&(e)); )
125 #define SET_FOREACH_MOVE(e, d, s) \
126 for (; ({ e = set_first(s); assert_se(!e || set_move_one(d, s, e) >= 0); e; }); )
128 DEFINE_TRIVIAL_CLEANUP_FUNC(Set
*, set_free
);
129 DEFINE_TRIVIAL_CLEANUP_FUNC(Set
*, set_free_free
);
131 #define _cleanup_set_free_ _cleanup_(set_freep)
132 #define _cleanup_set_free_free_ _cleanup_(set_free_freep)