]>
Commit | Line | Data |
---|---|---|
db9ecf05 | 1 | /* SPDX-License-Identifier: LGPL-2.1-or-later */ |
c2f1db8f | 2 | #pragma once |
60918275 | 3 | |
0c15577a | 4 | #include "forward.h" |
60918275 LP |
5 | #include "hashmap.h" |
6 | ||
3fb2326f | 7 | #define set_free_and_replace(a, b) \ |
fc4c10b2 | 8 | free_and_replace_full(a, b, set_free) |
3fb2326f | 9 | |
c09ce222 | 10 | Set* set_new(const struct hash_ops *hash_ops); |
60918275 | 11 | |
8a35af80 | 12 | static inline Set* set_free(Set *s) { |
885001ed | 13 | return (Set*) _hashmap_free(HASHMAP_BASE(s)); |
89439d4f | 14 | } |
60918275 | 15 | |
c09ce222 | 16 | #define set_copy(s) ((Set*) _hashmap_copy(HASHMAP_BASE(s))) |
89439d4f | 17 | |
54bbfa00 | 18 | int set_ensure_allocated(Set **s, const struct hash_ops *hash_ops); |
60918275 | 19 | |
89439d4f MS |
20 | int set_put(Set *s, const void *key); |
21 | /* no set_update */ | |
22 | /* no set_replace */ | |
f3f14c57 | 23 | static inline void *set_get(const Set *s, const void *key) { |
138f49e4 | 24 | return _hashmap_get(HASHMAP_BASE((Set *) s), key); |
89439d4f MS |
25 | } |
26 | /* no set_get2 */ | |
27 | ||
3c4e3031 | 28 | static inline bool set_contains(const Set *s, const void *key) { |
138f49e4 | 29 | return _hashmap_contains(HASHMAP_BASE((Set *) s), key); |
89439d4f MS |
30 | } |
31 | ||
4a9185c4 | 32 | static inline void *set_remove(Set *s, const void *key) { |
138f49e4 | 33 | return _hashmap_remove(HASHMAP_BASE(s), key); |
89439d4f MS |
34 | } |
35 | ||
36 | /* no set_remove2 */ | |
37 | /* no set_remove_value */ | |
38 | int set_remove_and_put(Set *s, const void *old_key, const void *new_key); | |
39 | /* no set_remove_and_replace */ | |
91cdde8a LP |
40 | int set_merge(Set *s, Set *other); |
41 | ||
89439d4f | 42 | static inline int set_reserve(Set *h, unsigned entries_add) { |
138f49e4 | 43 | return _hashmap_reserve(HASHMAP_BASE(h), entries_add); |
89439d4f MS |
44 | } |
45 | ||
46 | static inline int set_move(Set *s, Set *other) { | |
138f49e4 | 47 | return _hashmap_move(HASHMAP_BASE(s), HASHMAP_BASE(other)); |
89439d4f MS |
48 | } |
49 | ||
50 | static inline int set_move_one(Set *s, Set *other, const void *key) { | |
138f49e4 | 51 | return _hashmap_move_one(HASHMAP_BASE(s), HASHMAP_BASE(other), key); |
89439d4f MS |
52 | } |
53 | ||
3c4e3031 | 54 | static inline unsigned set_size(const Set *s) { |
138f49e4 | 55 | return _hashmap_size(HASHMAP_BASE((Set *) s)); |
89439d4f MS |
56 | } |
57 | ||
3c4e3031 | 58 | static inline bool set_isempty(const Set *s) { |
89439d4f MS |
59 | return set_size(s) == 0; |
60 | } | |
61 | ||
3c4e3031 | 62 | static inline unsigned set_buckets(const Set *s) { |
138f49e4 | 63 | return _hashmap_buckets(HASHMAP_BASE((Set *) s)); |
89439d4f | 64 | } |
60918275 | 65 | |
e4126adf ZJS |
66 | static inline bool set_iterate(const Set *s, Iterator *i, void **value) { |
67 | return _hashmap_iterate(HASHMAP_BASE((Set*) s), i, value, NULL); | |
68 | } | |
60918275 | 69 | |
89439d4f | 70 | static inline void set_clear(Set *s) { |
885001ed | 71 | _hashmap_clear(HASHMAP_BASE(s)); |
89439d4f MS |
72 | } |
73 | ||
89439d4f | 74 | static inline void *set_steal_first(Set *s) { |
138f49e4 | 75 | return _hashmap_first_key_and_value(HASHMAP_BASE(s), true, NULL); |
89439d4f MS |
76 | } |
77 | ||
78 | /* no set_steal_first_key */ | |
79 | /* no set_first_key */ | |
9946996c | 80 | |
f18f809c | 81 | static inline void *set_first(const Set *s) { |
138f49e4 | 82 | return _hashmap_first_key_and_value(HASHMAP_BASE((Set *) s), false, NULL); |
89439d4f | 83 | } |
60918275 | 84 | |
89439d4f MS |
85 | /* no set_next */ |
86 | ||
87 | static inline char **set_get_strv(Set *s) { | |
138f49e4 | 88 | return _hashmap_get_strv(HASHMAP_BASE(s)); |
89439d4f MS |
89 | } |
90 | ||
24655047 YW |
91 | char** set_to_strv(Set **s); |
92 | ||
c09ce222 | 93 | int set_ensure_put(Set **s, const struct hash_ops *hash_ops, const void *key); |
0f9ccd95 | 94 | |
c09ce222 | 95 | int set_ensure_consume(Set **s, const struct hash_ops *hash_ops, void *key); |
fcc1d031 | 96 | |
89439d4f | 97 | int set_consume(Set *s, void *value); |
b8b46b1c | 98 | |
c09ce222 | 99 | int set_put_strndup_full(Set **s, const struct hash_ops *hash_ops, const char *p, size_t n); |
cb649d12 YW |
100 | #define set_put_strdup_full(s, hash_ops, p) set_put_strndup_full(s, hash_ops, p, SIZE_MAX) |
101 | #define set_put_strndup(s, p, n) set_put_strndup_full(s, &string_hash_ops_free, p, n) | |
102 | #define set_put_strdup(s, p) set_put_strndup(s, p, SIZE_MAX) | |
103 | ||
54bbfa00 | 104 | int set_put_strdupv_full(Set **s, const struct hash_ops *hash_ops, char **l); |
11e9fec2 | 105 | #define set_put_strdupv(s, l) set_put_strdupv_full(s, &string_hash_ops_free, l) |
b8b46b1c | 106 | |
d97c5aea | 107 | int set_put_strsplit(Set *s, const char *v, const char *separators, ExtractFlags flags); |
9590dfe7 | 108 | |
90e74a66 ZJS |
109 | #define _SET_FOREACH(e, s, i) \ |
110 | for (Iterator i = ITERATOR_FIRST; set_iterate((s), &i, (void**)&(e)); ) | |
111 | #define SET_FOREACH(e, s) \ | |
112 | _SET_FOREACH(e, s, UNIQ_T(i, UNIQ)) | |
60918275 | 113 | |
35aa04e9 LP |
114 | #define SET_FOREACH_MOVE(e, d, s) \ |
115 | for (; ({ e = set_first(s); assert_se(!e || set_move_one(d, s, e) >= 0); e; }); ) | |
116 | ||
14bf2c9d | 117 | DEFINE_TRIVIAL_CLEANUP_FUNC(Set*, set_free); |
89439d4f | 118 | |
dfb33a97 | 119 | #define _cleanup_set_free_ _cleanup_(set_freep) |
4dbce717 | 120 | |
8d80f275 | 121 | int set_strjoin(Set *s, const char *separator, bool wrap_with_separator, char **ret); |
e4304fb8 LP |
122 | |
123 | bool set_equal(Set *a, Set *b); | |
d25d4f18 YW |
124 | |
125 | bool set_fnmatch(Set *include_patterns, Set *exclude_patterns, const char *needle); |