3 * File name: ir/adt/pmap.c
4 * Purpose: Datentyp: Vereinfachte Map (hash-map) zum Speichern von
5 * Zeigern/Adressen -> Zeigern/Adressen.
6 * Author: Hubert Schmid
10 * Copyright: (c) 2002 Universität Karlsruhe
11 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
22 int dummy; /* dummy entry */
26 #define INITIAL_SLOTS 64
28 /** map a pmap into a set */
29 #define M2S(map) (set *)(map)
32 * compare the keys of two entry pairs
34 static int pmap_entry_cmp(const void *p1, const void *p2, size_t size) {
35 const pmap_entry *entry1 = p1;
36 const pmap_entry *entry2 = p2;
38 return entry1->key != entry2->key;
41 /* Creates a new empty map with an initial number of slots. */
42 pmap *pmap_create_ex(int slots) {
43 return (pmap *)new_set(pmap_entry_cmp, slots);
46 pmap *pmap_create(void) {
47 return pmap_create_ex(INITIAL_SLOTS);
50 void pmap_destroy(pmap *map) {
55 void pmap_insert(pmap *map, void *key, void *value) {
59 p = set_insert(M2S(map), &entry, sizeof(pmap_entry), HASH_PTR(key));
64 int pmap_contains(pmap *map, void *key) {
65 return set_find(M2S(map), &key, sizeof(pmap_entry), HASH_PTR(key)) != NULL;
69 pmap_entry * pmap_find(pmap *map, void *key) {
70 return (pmap_entry *)set_find(M2S(map), &key, sizeof(pmap_entry), HASH_PTR(key));
74 void * pmap_get(pmap *map, void *key) {
75 pmap_entry * entry = pmap_find(map, key);
76 return entry == NULL ? NULL : entry->value;
80 pmap_entry *pmap_first(pmap *map) {
81 return (pmap_entry *) set_first(M2S(map));
85 pmap_entry *pmap_next(pmap *map) {
86 return (pmap_entry *) set_next(M2S(map));
90 void pmap_break(pmap *map) {