lib/sset.h

   1 /*
   2  * Copyright (c) 2011, 2012 Nicira, Inc.
   3  *
   4  * Licensed under the Apache License, Version 2.0 (the "License");
   5  * you may not use this file except in compliance with the License.
   6  * You may obtain a copy of the License at:
   7  *
   8  *     http://www.apache.org/licenses/LICENSE-2.0
   9  *
  10  * Unless required by applicable law or agreed to in writing, software
  11  * distributed under the License is distributed on an "AS IS" BASIS,
  12  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  13  * See the License for the specific language governing permissions and
  14  * limitations under the License.
  15  */
  16
  17 #ifndef SSET_H
  18 #define SSET_H
  19
  20 #include "hmap.h"
  21 #include "util.h"
  22
  23 #ifdef __cplusplus
  24 extern "C" {
  25 #endif
  26
  27 struct sset_node {
  28     struct hmap_node hmap_node;
  29     char name[1];
  30 };
  31
  32 /* A set of strings. */
  33 struct sset {
  34     struct hmap map;
  35 };
  36
  37 #define SSET_INITIALIZER(SSET) { HMAP_INITIALIZER(&(SSET)->map) }
  38
  39 /* Basics. */
  40 void sset_init(struct sset *);
  41 void sset_destroy(struct sset *);
  42 void sset_clone(struct sset *, const struct sset *);
  43 void sset_swap(struct sset *, struct sset *);
  44 void sset_moved(struct sset *);
  45
  46 /* Count. */
  47 bool sset_is_empty(const struct sset *);
  48 size_t sset_count(const struct sset *);
  49
  50 /* Insertion. */
  51 struct sset_node *sset_add(struct sset *, const char *);
  52 struct sset_node *sset_add_and_free(struct sset *, char *);
  53 void sset_add_assert(struct sset *, const char *);
  54 void sset_add_array(struct sset *, char **, size_t n);
  55
  56 /* Deletion. */
  57 void sset_clear(struct sset *);
  58 void sset_delete(struct sset *, struct sset_node *);
  59 bool sset_find_and_delete(struct sset *, const char *);
  60 void sset_find_and_delete_assert(struct sset *, const char *);
  61 char *sset_pop(struct sset *);
  62
  63 /* Search. */
  64 struct sset_node *sset_find(const struct sset *, const char *);
  65 bool sset_contains(const struct sset *, const char *);
  66 bool sset_equals(const struct sset *, const struct sset *);
  67
  68 /* Iteration macros. */
  69 #define SSET_FOR_EACH(NAME, SSET)               \
  70     for ((NAME) = SSET_FIRST(SSET);             \
  71          SSET_NODE_FROM_NAME(NAME) != NULL;     \
  72          (NAME) = SSET_NEXT(SSET, NAME))
  73
  74 #define SSET_FOR_EACH_SAFE(NAME, NEXT, SSET)        \
  75     for ((NAME) = SSET_FIRST(SSET);                 \
  76          (SSET_NODE_FROM_NAME(NAME) != NULL         \
  77           ? (NEXT) = SSET_NEXT(SSET, NAME), true    \
  78           : false);                                 \
  79          (NAME) = (NEXT))
  80 \f
  81 /* Implementation helper macros. */
  82
  83 #define SSET_NODE_FROM_HMAP_NODE(HMAP_NODE) \
  84     CONTAINER_OF(HMAP_NODE, struct sset_node, hmap_node)
  85 #define SSET_NAME_FROM_HMAP_NODE(HMAP_NODE) \
  86     (CONST_CAST(const char *, (SSET_NODE_FROM_HMAP_NODE(HMAP_NODE)->name)))
  87 #define SSET_NODE_FROM_NAME(NAME) CONTAINER_OF(NAME, struct sset_node, name)
  88 #define SSET_FIRST(SSET) SSET_NAME_FROM_HMAP_NODE(hmap_first(&(SSET)->map))
  89 #define SSET_NEXT(SSET, NAME)                                           \
  90     SSET_NAME_FROM_HMAP_NODE(                                           \
  91         hmap_next(&(SSET)->map, &SSET_NODE_FROM_NAME(NAME)->hmap_node))
  92
  93 #ifdef __cplusplus
  94 }
  95 #endif
  96
  97 #endif /* sset.h */