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