Debian Codegraph @

src/basic/ordered-set.h

raw
1 /* SPDX-License-Identifier: LGPL-2.1-or-later */
2 #pragma once
3
4 #include "basic-forward.h"
5 #include "hashmap.h"
6
7 typedef struct OrderedSet OrderedSet;
8
9 static inline OrderedSet* ordered_set_new(const struct hash_ops *ops) {
10 return (OrderedSet*) ordered_hashmap_new(ops);
11 }
12
13 int ordered_set_ensure_allocated(OrderedSet **s, const struct hash_ops *ops);
14
15 int ordered_set_ensure_put(OrderedSet **s, const struct hash_ops *ops, void *p);
16
17 static inline void ordered_set_clear(OrderedSet *s) {
18 return ordered_hashmap_clear((OrderedHashmap*) s);
19 }
20
21 static inline OrderedSet* ordered_set_free(OrderedSet *s) {
22 return (OrderedSet*) ordered_hashmap_free((OrderedHashmap*) s);
23 }
24
25 static inline int ordered_set_contains(OrderedSet *s, const void *p) {
26 return ordered_hashmap_contains((OrderedHashmap*) s, p);
27 }
28
29 static inline int ordered_set_put(OrderedSet *s, void *p) {
30 return ordered_hashmap_put((OrderedHashmap*) s, p, p);
31 }
32
33 static inline void *ordered_set_get(OrderedSet *s, const void *p) {
34 return ordered_hashmap_get((OrderedHashmap*) s, p);
35 }
36
37 static inline unsigned ordered_set_size(OrderedSet *s) {
38 return ordered_hashmap_size((OrderedHashmap*) s);
39 }
40
41 static inline bool ordered_set_isempty(OrderedSet *s) {
42 return ordered_hashmap_isempty((OrderedHashmap*) s);
43 }
44
45 static inline bool ordered_set_iterate(OrderedSet *s, Iterator *i, void **value) {
46 return ordered_hashmap_iterate((OrderedHashmap*) s, i, value, NULL);
47 }
48
49 static inline void* ordered_set_remove(OrderedSet *s, void *p) {
50 return ordered_hashmap_remove((OrderedHashmap*) s, p);
51 }
52
53 static inline void* ordered_set_first(OrderedSet *s) {
54 return ordered_hashmap_first((OrderedHashmap*) s);
55 }
56
57 static inline void* ordered_set_steal_first(OrderedSet *s) {
58 return ordered_hashmap_steal_first((OrderedHashmap*) s);
59 }
60
61 static inline char** ordered_set_get_strv(OrderedSet *s) {
62 return _hashmap_get_strv(HASHMAP_BASE((OrderedHashmap*) s));
63 }
64
65 static inline int ordered_set_reserve(OrderedSet *s, unsigned entries_add) {
66 return ordered_hashmap_reserve((OrderedHashmap*) s, entries_add);
67 }
68
69 int ordered_set_consume(OrderedSet *s, void *p);
70
71 int ordered_set_put_strdup_full(OrderedSet **s, const struct hash_ops *hash_ops, const char *p);
72 #define ordered_set_put_strdup(s, p) ordered_set_put_strdup_full(s, &string_hash_ops_free, p)
73 int ordered_set_put_strdupv_full(OrderedSet **s, const struct hash_ops *hash_ops, char **l);
74 #define ordered_set_put_strdupv(s, l) ordered_set_put_strdupv_full(s, &string_hash_ops_free, l)
75 int ordered_set_put_string_set_full(OrderedSet **s, const struct hash_ops *hash_ops, OrderedSet *l);
76 #define ordered_set_put_string_set(s, l) ordered_set_put_string_set_full(s, &string_hash_ops_free, l)
77
78 void ordered_set_print(FILE *f, const char *field, OrderedSet *s);
79
80 #define _ORDERED_SET_FOREACH(e, s, i) \
81 for (Iterator i = ITERATOR_FIRST; ordered_set_iterate((s), &i, (void**)&(e)); )
82 #define ORDERED_SET_FOREACH(e, s) \
83 _ORDERED_SET_FOREACH(e, s, UNIQ_T(i, UNIQ))
84
85 DEFINE_TRIVIAL_CLEANUP_FUNC(OrderedSet*, ordered_set_free);
86
87 #define _cleanup_ordered_set_free_ _cleanup_(ordered_set_freep)