src/set.c

   1 /*-*- Mode: C; c-basic-offset: 8; indent-tabs-mode: nil -*-*/
   2
   3 /***
   4   This file is part of systemd.
   5
   6   Copyright 2010 Lennart Poettering
   7
   8   systemd is free software; you can redistribute it and/or modify it
   9   under the terms of the GNU General Public License as published by
  10   the Free Software Foundation; either version 2 of the License, or
  11   (at your option) any later version.
  12
  13   systemd is distributed in the hope that it will be useful, but
  14   WITHOUT ANY WARRANTY; without even the implied warranty of
  15   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  16   General Public License for more details.
  17
  18   You should have received a copy of the GNU General Public License
  19   along with systemd; If not, see <http://www.gnu.org/licenses/>.
  20 ***/
  21
  22 #include <stdlib.h>
  23
  24 #include "set.h"
  25 #include "hashmap.h"
  26
  27 #define MAKE_SET(h) ((Set*) (h))
  28 #define MAKE_HASHMAP(s) ((Hashmap*) (s))
  29
  30 /* For now this is not much more than a wrapper around a hashmap */
  31
  32 Set *set_new(hash_func_t hash_func, compare_func_t compare_func) {
  33         return MAKE_SET(hashmap_new(hash_func, compare_func));
  34 }
  35
  36 void set_free(Set* s) {
  37         hashmap_free(MAKE_HASHMAP(s));
  38 }
  39
  40 void set_free_free(Set *s) {
  41         hashmap_free_free(MAKE_HASHMAP(s));
  42 }
  43
  44 int set_ensure_allocated(Set **s, hash_func_t hash_func, compare_func_t compare_func) {
  45         return hashmap_ensure_allocated((Hashmap**) s, hash_func, compare_func);
  46 }
  47
  48 int set_put(Set *s, void *value) {
  49         return hashmap_put(MAKE_HASHMAP(s), value, value);
  50 }
  51
  52 int set_replace(Set *s, void *value) {
  53         return hashmap_replace(MAKE_HASHMAP(s), value, value);
  54 }
  55
  56 void *set_get(Set *s, void *value) {
  57         return hashmap_get(MAKE_HASHMAP(s), value);
  58 }
  59
  60 void *set_remove(Set *s, void *value) {
  61         return hashmap_remove(MAKE_HASHMAP(s), value);
  62 }
  63
  64 int set_remove_and_put(Set *s, void *old_value, void *new_value) {
  65         return hashmap_remove_and_put(MAKE_HASHMAP(s), old_value, new_value, new_value);
  66 }
  67
  68 unsigned set_size(Set *s) {
  69         return hashmap_size(MAKE_HASHMAP(s));
  70 }
  71
  72 bool set_isempty(Set *s) {
  73         return hashmap_isempty(MAKE_HASHMAP(s));
  74 }
  75
  76 void *set_iterate(Set *s, Iterator *i) {
  77         return hashmap_iterate(MAKE_HASHMAP(s), i, NULL);
  78 }
  79
  80 void *set_iterate_backwards(Set *s, Iterator *i) {
  81         return hashmap_iterate_backwards(MAKE_HASHMAP(s), i, NULL);
  82 }
  83
  84 void *set_iterate_skip(Set *s, void *value, Iterator *i) {
  85         return hashmap_iterate_skip(MAKE_HASHMAP(s), value, i);
  86 }
  87
  88 void *set_steal_first(Set *s) {
  89         return hashmap_steal_first(MAKE_HASHMAP(s));
  90 }
  91
  92 void* set_first(Set *s) {
  93         return hashmap_first(MAKE_HASHMAP(s));
  94 }
  95
  96 void* set_last(Set *s) {
  97         return hashmap_last(MAKE_HASHMAP(s));
  98 }
  99
 100 int set_merge(Set *s, Set *other) {
 101         return hashmap_merge(MAKE_HASHMAP(s), MAKE_HASHMAP(other));
 102 }
 103
 104 void set_move(Set *s, Set *other) {
 105         return hashmap_move(MAKE_HASHMAP(s), MAKE_HASHMAP(other));
 106 }
 107
 108 int set_move_one(Set *s, Set *other, void *value) {
 109         return hashmap_move_one(MAKE_HASHMAP(s), MAKE_HASHMAP(other), value);
 110 }
 111
 112 Set* set_copy(Set *s) {
 113         return MAKE_SET(hashmap_copy(MAKE_HASHMAP(s)));
 114 }
 115
 116 void set_clear(Set *s) {
 117         hashmap_clear(MAKE_HASHMAP(s));
 118 }