emileclarkb/hammer
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

make hashtable keys const

Browse source
This commit is contained in:
Sven M. Hallberg 2013-04-30 17:44:54 +02:00
parent 24ed1bec53
commit 109d60fca3
2 changed files with 9 additions and 9 deletions
Download patch file Download diff file Expand all files Collapse all files

8
src/datastructures.c
View file

@ -116,7 +116,7 @@ HHashTable* h_hashtable_new(HArena *arena, HEqualFunc equalFunc, HHashFunc hashF
return ht;
}
void* h_hashtable_get(HHashTable* ht, void* key) {
void* h_hashtable_get(HHashTable* ht, const void* key) {
HHashValue hashval = ht->hashFunc(key);
#ifdef CONSISTENCY_CHECK
assert((ht->capacity & (ht->capacity - 1)) == 0); // capacity is a power of 2
@ -134,7 +134,7 @@ void* h_hashtable_get(HHashTable* ht, void* key) {
return NULL;
}
void h_hashtable_put(HHashTable* ht, void* key, void* value) {
void h_hashtable_put(HHashTable* ht, const void* key, void* value) {
// # Start with a rebalancing
//h_hashtable_ensure_capacity(ht, ht->used + 1);
@ -166,7 +166,7 @@ void h_hashtable_put(HHashTable* ht, void* key, void* value) {
hte->hashval = hashval;
}
int h_hashtable_present(HHashTable* ht, void* key) {
int h_hashtable_present(HHashTable* ht, const void* key) {
HHashValue hashval = ht->hashFunc(key);
#ifdef CONSISTENCY_CHECK
assert((ht->capacity & (ht->capacity - 1)) == 0); // capacity is a power of 2
@ -182,7 +182,7 @@ int h_hashtable_present(HHashTable* ht, void* key) {
}
return false;
}
void h_hashtable_del(HHashTable* ht, void* key) {
void h_hashtable_del(HHashTable* ht, const void* key) {
HHashValue hashval = ht->hashFunc(key);
#ifdef CONSISTENCY_CHECK
assert((ht->capacity & (ht->capacity - 1)) == 0); // capacity is a power of 2

10
src/internal.h
View file

@ -96,7 +96,7 @@ typedef bool (*HEqualFunc)(const void* key1, const void* key2);
typedef struct HHashTableEntry_ {
struct HHashTableEntry_ *next;
void* key;
const void* key;
void* value;
HHashValue hashval;
} HHashTableEntry;
@ -248,10 +248,10 @@ HSlist* h_slist_remove_all(HSlist *slist, const void* item);
void h_slist_free(HSlist *slist);
HHashTable* h_hashtable_new(HArena *arena, HEqualFunc equalFunc, HHashFunc hashFunc);
void* h_hashtable_get(HHashTable* ht, void* key);
void h_hashtable_put(HHashTable* ht, void* key, void* value);
int h_hashtable_present(HHashTable* ht, void* key);
void h_hashtable_del(HHashTable* ht, void* key);
void* h_hashtable_get(HHashTable* ht, const void* key);
void h_hashtable_put(HHashTable* ht, const void* key, void* value);
int h_hashtable_present(HHashTable* ht, const void* key);
void h_hashtable_del(HHashTable* ht, const void* key);
void h_hashtable_free(HHashTable* ht);
static inline bool h_hashtable_empty(HHashTable* ht) { return (ht->used == 0); }