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