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

constify read-only hashtable methods

Browse source
This commit is contained in:
Sven M. Hallberg 2013-05-08 17:01:23 +02:00
parent f00060b2bd
commit 1631e9c08f
2 changed files with 5 additions and 5 deletions
Download patch file Download diff file Expand all files Collapse all files

4
src/datastructures.c
View file

@ -116,7 +116,7 @@ HHashTable* h_hashtable_new(HArena *arena, HEqualFunc equalFunc, HHashFunc hashF
return ht; return ht;
} }
void* h_hashtable_get(HHashTable* ht, const void* key) { void* h_hashtable_get(const HHashTable* ht, const void* key) {
HHashValue hashval = ht->hashFunc(key); HHashValue hashval = ht->hashFunc(key);
#ifdef CONSISTENCY_CHECK #ifdef CONSISTENCY_CHECK
assert((ht->capacity & (ht->capacity - 1)) == 0); // capacity is a power of 2 assert((ht->capacity & (ht->capacity - 1)) == 0); // capacity is a power of 2
@ -180,7 +180,7 @@ void h_hashtable_update(HHashTable *dst, const HHashTable *src) {
} }
} }
int h_hashtable_present(HHashTable* ht, const void* key) { int h_hashtable_present(const HHashTable* ht, const void* key) {
HHashValue hashval = ht->hashFunc(key); HHashValue hashval = ht->hashFunc(key);
#ifdef CONSISTENCY_CHECK #ifdef CONSISTENCY_CHECK
assert((ht->capacity & (ht->capacity - 1)) == 0); // capacity is a power of 2 assert((ht->capacity & (ht->capacity - 1)) == 0); // capacity is a power of 2

6
src/internal.h
View file

@ -248,13 +248,13 @@ HSlist* h_slist_remove_all(HSlist *slist, const void* item);
void h_slist_free(HSlist *slist); void h_slist_free(HSlist *slist);
HHashTable* h_hashtable_new(HArena *arena, HEqualFunc equalFunc, HHashFunc hashFunc); HHashTable* h_hashtable_new(HArena *arena, HEqualFunc equalFunc, HHashFunc hashFunc);
void* h_hashtable_get(HHashTable* ht, const void* key); void* h_hashtable_get(const HHashTable* ht, const void* key);
void h_hashtable_put(HHashTable* ht, const void* key, void* value); void h_hashtable_put(HHashTable* ht, const void* key, void* value);
void h_hashtable_update(HHashTable* dst, const HHashTable *src); void h_hashtable_update(HHashTable* dst, const HHashTable *src);
int h_hashtable_present(HHashTable* ht, const void* key); int h_hashtable_present(const HHashTable* ht, const void* key);
void h_hashtable_del(HHashTable* ht, const void* key); void h_hashtable_del(HHashTable* ht, const void* key);
void h_hashtable_free(HHashTable* ht); void h_hashtable_free(HHashTable* ht);
static inline bool h_hashtable_empty(HHashTable* ht) { return (ht->used == 0); } static inline bool h_hashtable_empty(const HHashTable* ht) { return (ht->used == 0); }
typedef HHashTable HHashSet; typedef HHashTable HHashSet;
#define h_hashset_new(a,eq,hash) h_hashtable_new(a,eq,hash) #define h_hashset_new(a,eq,hash) h_hashtable_new(a,eq,hash)