* Copyright: (c) 2002 Universität Karlsruhe
* Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
*/
+#ifdef HAVE_CONFIG_H
+# include "config.h"
+#endif
#include "pmap.h"
struct pmap {
- int dummy; /* dummy entry */
+ int dummy; /* dummy entry */
};
* compare the keys of two entry pairs
*/
static int pmap_entry_cmp(const void *p1, const void *p2, size_t size) {
- const pmap_entry *entry1 = p1;
- const pmap_entry *entry2 = p2;
+ const pmap_entry *entry1 = p1;
+ const pmap_entry *entry2 = p2;
- return entry1->key != entry2->key;
+ return entry1->key != entry2->key;
}
/* Creates a new empty map with an initial number of slots. */
pmap *pmap_create_ex(int slots) {
- return (pmap *)new_set(pmap_entry_cmp, slots);
+ return (pmap *)new_set(pmap_entry_cmp, slots);
}
pmap *pmap_create(void) {
- return pmap_create_ex(INITIAL_SLOTS);
+ return pmap_create_ex(INITIAL_SLOTS);
}
void pmap_destroy(pmap *map) {
- del_set(M2S(map));
+ del_set(M2S(map));
}
+void pmap_insert(pmap *map, const void *key, void *value) {
+ pmap_entry entry, *p;
-void pmap_insert(pmap *map, void *key, void *value) {
- pmap_entry entry, *p;
-
- entry.key = key;
- p = set_insert(M2S(map), &entry, sizeof(pmap_entry), HASH_PTR(key));
- p->value = value;
+ entry.key = key;
+ p = set_insert(M2S(map), &entry, sizeof(pmap_entry), HASH_PTR(key));
+ p->value = value;
}
-
-int pmap_contains(pmap *map, void *key) {
- return set_find(M2S(map), &key, sizeof(pmap_entry), HASH_PTR(key)) != NULL;
+int pmap_contains(pmap *map, const void *key) {
+ return set_find(M2S(map), &key, sizeof(pmap_entry), HASH_PTR(key)) != NULL;
}
-
-pmap_entry * pmap_find(pmap *map, void *key) {
- return (pmap_entry *)set_find(M2S(map), &key, sizeof(pmap_entry), HASH_PTR(key));
+pmap_entry * pmap_find(pmap *map, const void *key) {
+ return (pmap_entry *)set_find(M2S(map), &key, sizeof(pmap_entry), HASH_PTR(key));
}
-void * pmap_get(pmap *map, void *key) {
- pmap_entry * entry = pmap_find(map, key);
- return entry == NULL ? NULL : entry->value;
+void * pmap_get(pmap *map, const void *key) {
+ pmap_entry * entry = pmap_find(map, key);
+ return entry == NULL ? NULL : entry->value;
}
int pmap_count(pmap *map) {
}
pmap_entry *pmap_first(pmap *map) {
- return (pmap_entry *) set_first(M2S(map));
+ return (pmap_entry *) set_first(M2S(map));
}
-
pmap_entry *pmap_next(pmap *map) {
- return (pmap_entry *) set_next(M2S(map));
+ return (pmap_entry *) set_next(M2S(map));
}
-
void pmap_break(pmap *map) {
- set_break(M2S(map));
+ set_break(M2S(map));
}