| /* SPDX-License-Identifier: LGPL-2.1+ */ |
| #pragma once |
| |
| #include <stdio.h> |
| |
| #include "hashmap.h" |
| |
| typedef struct OrderedSet OrderedSet; |
| |
| static inline OrderedSet* ordered_set_new(const struct hash_ops *ops) { |
| return (OrderedSet*) ordered_hashmap_new(ops); |
| } |
| |
| static inline int ordered_set_ensure_allocated(OrderedSet **s, const struct hash_ops *ops) { |
| if (*s) |
| return 0; |
| |
| *s = ordered_set_new(ops); |
| if (!*s) |
| return -ENOMEM; |
| |
| return 0; |
| } |
| |
| static inline OrderedSet* ordered_set_free(OrderedSet *s) { |
| return (OrderedSet*) ordered_hashmap_free((OrderedHashmap*) s); |
| } |
| |
| static inline OrderedSet* ordered_set_free_free(OrderedSet *s) { |
| return (OrderedSet*) ordered_hashmap_free_free((OrderedHashmap*) s); |
| } |
| |
| static inline int ordered_set_put(OrderedSet *s, void *p) { |
| return ordered_hashmap_put((OrderedHashmap*) s, p, p); |
| } |
| |
| static inline unsigned ordered_set_size(OrderedSet *s) { |
| return ordered_hashmap_size((OrderedHashmap*) s); |
| } |
| |
| static inline bool ordered_set_isempty(OrderedSet *s) { |
| return ordered_hashmap_isempty((OrderedHashmap*) s); |
| } |
| |
| static inline bool ordered_set_iterate(OrderedSet *s, Iterator *i, void **value) { |
| return ordered_hashmap_iterate((OrderedHashmap*) s, i, value, NULL); |
| } |
| |
| static inline void* ordered_set_remove(OrderedSet *s, void *p) { |
| return ordered_hashmap_remove((OrderedHashmap*) s, p); |
| } |
| |
| static inline void* ordered_set_steal_first(OrderedSet *s) { |
| return ordered_hashmap_steal_first((OrderedHashmap*) s); |
| } |
| |
| static inline char **ordered_set_get_strv(OrderedSet *s) { |
| return internal_hashmap_get_strv(HASHMAP_BASE((OrderedHashmap*) s)); |
| } |
| |
| int ordered_set_consume(OrderedSet *s, void *p); |
| int ordered_set_put_strdup(OrderedSet *s, const char *p); |
| int ordered_set_put_strdupv(OrderedSet *s, char **l); |
| int ordered_set_put_string_set(OrderedSet *s, OrderedSet *l); |
| void ordered_set_print(FILE *f, const char *field, OrderedSet *s); |
| |
| #define ORDERED_SET_FOREACH(e, s, i) \ |
| for ((i) = ITERATOR_FIRST; ordered_set_iterate((s), &(i), (void**)&(e)); ) |
| |
| DEFINE_TRIVIAL_CLEANUP_FUNC(OrderedSet*, ordered_set_free); |
| DEFINE_TRIVIAL_CLEANUP_FUNC(OrderedSet*, ordered_set_free_free); |
| |
| #define _cleanup_ordered_set_free_ _cleanup_(ordered_set_freep) |
| #define _cleanup_ordered_set_free_free_ _cleanup_(ordered_set_free_freep) |