83 lines
1.6 KiB
C
83 lines
1.6 KiB
C
/* SPDX-License-Identifier: LGPL-2.1+ */
|
|
|
|
#include "fileio.h"
|
|
#include "ordered-set.h"
|
|
#include "strv.h"
|
|
|
|
int ordered_set_consume(OrderedSet *s, void *p) {
|
|
int r;
|
|
|
|
r = ordered_set_put(s, p);
|
|
if (r <= 0)
|
|
free(p);
|
|
|
|
return r;
|
|
}
|
|
|
|
int ordered_set_put_strdup(OrderedSet *s, const char *p) {
|
|
char *c;
|
|
int r;
|
|
|
|
assert(s);
|
|
assert(p);
|
|
|
|
c = strdup(p);
|
|
if (!c)
|
|
return -ENOMEM;
|
|
|
|
r = ordered_set_consume(s, c);
|
|
if (r == -EEXIST)
|
|
return 0;
|
|
|
|
return r;
|
|
}
|
|
|
|
int ordered_set_put_strdupv(OrderedSet *s, char **l) {
|
|
int n = 0, r;
|
|
char **i;
|
|
|
|
STRV_FOREACH(i, l) {
|
|
r = ordered_set_put_strdup(s, *i);
|
|
if (r < 0)
|
|
return r;
|
|
|
|
n += r;
|
|
}
|
|
|
|
return n;
|
|
}
|
|
|
|
int ordered_set_put_string_set(OrderedSet *s, OrderedSet *l) {
|
|
int n = 0, r;
|
|
Iterator i;
|
|
char *p;
|
|
|
|
/* Like ordered_set_put_strv, but for an OrderedSet of strings */
|
|
|
|
ORDERED_SET_FOREACH(p, l, i) {
|
|
r = ordered_set_put_strdup(s, p);
|
|
if (r < 0)
|
|
return r;
|
|
|
|
n += r;
|
|
}
|
|
|
|
return n;
|
|
}
|
|
|
|
void ordered_set_print(FILE *f, const char *field, OrderedSet *s) {
|
|
bool space = false;
|
|
Iterator i;
|
|
char *p;
|
|
|
|
if (ordered_set_isempty(s))
|
|
return;
|
|
|
|
fputs(field, f);
|
|
|
|
ORDERED_SET_FOREACH(p, s, i)
|
|
fputs_with_space(f, p, NULL, &space);
|
|
|
|
fputc('\n', f);
|
|
}
|