mirrors/SDL
1
0
Fork 0
mirror of https://github.com/libsdl-org/SDL.git synced 2025-09-25 20:48:29 +00:00
Code Issues Packages Projects Releases Wiki Activity

hashtable: Moved over to single-line comments.

Browse Source
This commit is contained in:
Ryan C. Gordon
2023-10-15 15:41:04 -04:00
parent 1c6d996108
commit 8df68b4120
1 changed files with 10 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
src/SDL_hashtable.c
View File

@@ -46,7 +46,7 @@ SDL_HashTable *SDL_CreateHashTable(void *data, const Uint32 num_buckets, const S
{ {
SDL_HashTable *table; SDL_HashTable *table;
/* num_buckets must be a power of two so we get a solid block of bits to mask hash values against. */ // num_buckets must be a power of two so we get a solid block of bits to mask hash values against.
if ((num_buckets == 0) || ((num_buckets & (num_buckets - 1)) != 0)) { if ((num_buckets == 0) || ((num_buckets & (num_buckets - 1)) != 0)) {
SDL_SetError("num_buckets must be a power of two"); SDL_SetError("num_buckets must be a power of two");
return NULL; return NULL;
@@ -89,7 +89,7 @@ SDL_bool SDL_InsertIntoHashTable(SDL_HashTable *table, const void *key, const vo
return SDL_FALSE; return SDL_FALSE;
} }
/* !!! FIXME: grow and rehash table if it gets too saturated. */ // !!! FIXME: grow and rehash table if it gets too saturated.
item = (SDL_HashItem *) SDL_malloc(sizeof (SDL_HashItem)); item = (SDL_HashItem *) SDL_malloc(sizeof (SDL_HashItem));
if (item == NULL) { if (item == NULL) {
SDL_OutOfMemory(); SDL_OutOfMemory();
@@ -161,7 +161,7 @@ SDL_bool SDL_IterateHashTableKey(const SDL_HashTable *table, const void *key, co
item = item->next; item = item->next;
} }
/* no more matches. */ // no more matches.
*_value = NULL; *_value = NULL;
*iter = NULL; *iter = NULL;
return SDL_FALSE; return SDL_FALSE;
@@ -181,10 +181,10 @@ SDL_bool SDL_IterateHashTable(const SDL_HashTable *table, const void **_key, con
} }
while (!item && (idx < table->table_len)) { while (!item && (idx < table->table_len)) {
item = table->table[idx++]; /* skip empty buckets... */ item = table->table[idx++]; // skip empty buckets...
} }
if (item == NULL) { /* no more matches? */ if (item == NULL) { // no more matches?
*_key = NULL; *_key = NULL;
*iter = NULL; *iter = NULL;
return SDL_FALSE; return SDL_FALSE;
@@ -233,7 +233,7 @@ void SDL_DestroyHashTable(SDL_HashTable *table)
} }
} }
/* this is djb's xor hashing function. */ // this is djb's xor hashing function.
static SDL_INLINE Uint32 hash_string_djbxor(const char *str, size_t len) static SDL_INLINE Uint32 hash_string_djbxor(const char *str, size_t len)
{ {
Uint32 hash = 5381; Uint32 hash = 5381;
@@ -252,14 +252,14 @@ Uint32 SDL_HashString(const void *key, void *data)
SDL_bool SDL_KeyMatchString(const void *a, const void *b, void *data) SDL_bool SDL_KeyMatchString(const void *a, const void *b, void *data)
{ {
if (a == b) { if (a == b) {
return SDL_TRUE; /* same pointer, must match. */ return SDL_TRUE; // same pointer, must match.
} else if (!a || !b) { } else if (!a || !b) {
return SDL_FALSE; /* one pointer is NULL (and first test shows they aren't the same pointer), must not match. */ return SDL_FALSE; // one pointer is NULL (and first test shows they aren't the same pointer), must not match.
} }
return (SDL_strcmp((const char *)a, (const char *)b) == 0) ? SDL_TRUE : SDL_FALSE; /* Check against actual string contents. */ return (SDL_strcmp((const char *)a, (const char *)b) == 0) ? SDL_TRUE : SDL_FALSE; // Check against actual string contents.
} }
/* We assume we can fit the ID in the key directly */ // We assume we can fit the ID in the key directly
SDL_COMPILE_TIME_ASSERT(SDL_HashID_KeySize, sizeof(Uint32) <= sizeof(const void *)); SDL_COMPILE_TIME_ASSERT(SDL_HashID_KeySize, sizeof(Uint32) <= sizeof(const void *));
Uint32 SDL_HashID(const void *key, void *unused) Uint32 SDL_HashID(const void *key, void *unused)