]>
Commit | Line | Data |
---|---|---|
53e1b683 | 1 | /* SPDX-License-Identifier: LGPL-2.1+ */ |
4a280a7e LP |
2 | #pragma once |
3 | ||
4a280a7e LP |
4 | #include "hashmap.h" |
5 | ||
6 | typedef struct OrderedSet OrderedSet; | |
7 | ||
8 | static inline OrderedSet* ordered_set_new(const struct hash_ops *ops) { | |
9 | return (OrderedSet*) ordered_hashmap_new(ops); | |
10 | } | |
11 | ||
0264d072 LP |
12 | static inline int ordered_set_ensure_allocated(OrderedSet **s, const struct hash_ops *ops) { |
13 | if (*s) | |
14 | return 0; | |
15 | ||
16 | *s = ordered_set_new(ops); | |
17 | if (!*s) | |
18 | return -ENOMEM; | |
19 | ||
20 | return 0; | |
21 | } | |
22 | ||
4a280a7e LP |
23 | static inline OrderedSet* ordered_set_free(OrderedSet *s) { |
24 | ordered_hashmap_free((OrderedHashmap*) s); | |
25 | return NULL; | |
26 | } | |
27 | ||
28 | static inline OrderedSet* ordered_set_free_free(OrderedSet *s) { | |
29 | ordered_hashmap_free_free((OrderedHashmap*) s); | |
30 | return NULL; | |
31 | } | |
32 | ||
33 | static inline int ordered_set_put(OrderedSet *s, void *p) { | |
34 | return ordered_hashmap_put((OrderedHashmap*) s, p, p); | |
35 | } | |
36 | ||
37 | static inline bool ordered_set_isempty(OrderedSet *s) { | |
38 | return ordered_hashmap_isempty((OrderedHashmap*) s); | |
39 | } | |
40 | ||
8927b1da DH |
41 | static inline bool ordered_set_iterate(OrderedSet *s, Iterator *i, void **value) { |
42 | return ordered_hashmap_iterate((OrderedHashmap*) s, i, value, NULL); | |
4a280a7e LP |
43 | } |
44 | ||
98767d75 IT |
45 | static inline void* ordered_set_remove(OrderedSet *s, void *p) { |
46 | return ordered_hashmap_remove((OrderedHashmap*) s, p); | |
47 | } | |
48 | ||
49 | static inline void* ordered_set_steal_first(OrderedSet *s) { | |
50 | return ordered_hashmap_steal_first((OrderedHashmap*) s); | |
51 | } | |
52 | ||
00616955 LP |
53 | int ordered_set_consume(OrderedSet *s, void *p); |
54 | int ordered_set_put_strdup(OrderedSet *s, const char *p); | |
55 | int ordered_set_put_strdupv(OrderedSet *s, char **l); | |
56 | ||
4a280a7e | 57 | #define ORDERED_SET_FOREACH(e, s, i) \ |
8927b1da | 58 | for ((i) = ITERATOR_FIRST; ordered_set_iterate((s), &(i), (void**)&(e)); ) |
4a280a7e LP |
59 | |
60 | DEFINE_TRIVIAL_CLEANUP_FUNC(OrderedSet*, ordered_set_free); | |
00616955 | 61 | DEFINE_TRIVIAL_CLEANUP_FUNC(OrderedSet*, ordered_set_free_free); |
4a280a7e LP |
62 | |
63 | #define _cleanup_ordered_set_free_ _cleanup_(ordered_set_freep) | |
00616955 | 64 | #define _cleanup_ordered_set_free_free_ _cleanup_(ordered_set_free_freep) |