3 * File name: ir/adt/eset.c
4 * Purpose: Datentyp: Vereinfachte Menge (hash-set) zum Speichern von
6 * Author: Hubert Schmid
10 * Copyright: (c) 2002 Universität Karlsruhe
11 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
23 int dummy; /* dummy entry */
27 #define INITIAL_SLOTS 64
29 static int pcmp(const void *p1, const void *p2, size_t size) {
30 const void **q1 = (const void **)p1;
31 const void **q2 = (const void **)p2;
37 eset * eset_create(void) {
38 return (eset *) new_set(pcmp, INITIAL_SLOTS);
42 eset * eset_copy(eset *source) {
43 eset * ret = eset_create();
45 for (p = eset_first(source); p; p = eset_next(source)) {
52 void eset_destroy(eset *s) {
56 /* Returns the number of elements in the set. */
57 int eset_count(eset *s) {
58 return set_count((set *)s);
61 void eset_insert(eset *s, void *p) {
62 if (!eset_contains(s, p)) {
63 set_insert((set *)s, &p, sizeof(p), HASH_PTR(p));
68 int eset_contains(eset *s, void *p) {
69 return set_find((set *)s, &p, sizeof(p), HASH_PTR(p)) != NULL;
73 void * eset_first(eset *s) {
74 void * p = set_first((set *) s);
75 return p == NULL ? NULL : *((void **)p);
79 void * eset_next(eset *s) {
80 void *p = set_next((set *) s);
81 return p == NULL ? NULL : *((void **)p);
85 void eset_insert_all(eset *target, eset *source) {
87 for (p = eset_first(source); p; p = eset_next(source)) {
88 eset_insert(target, p);