bslathi19/cc65
1
0
Fork 0
Code Issues Pull Requests Actions 1 Packages Projects Releases Wiki Activity

Cosmetic changes

Browse Source 
git-svn-id: svn://svn.cc65.org/cc65/trunk@2559 b7a2c559-68d2-44c3-8de9-860c34a00d81
This commit is contained in:
cuz
2003-10-22 18:47:05 +00:00
parent a34f75d0fb
commit 5e07b14e8d
2 changed files with 13 additions and 13 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
src/common/hashtab.c
View File

@@ -74,7 +74,7 @@ static void HT_Alloc (HashTable* T)
HashNode* HT_Find (const HashTable* T, const void* Index)
HashNode* HT_Find (const HashTable* T, const void* Key)
/* Find the node with the given index */
{
unsigned Hash;
@@ -86,7 +86,7 @@ HashNode* HT_Find (const HashTable* T, const void* Index)
}
/* Generate the hash over the index */
Hash = T->Func->GenHash (Index);
Hash = T->Func->GenHash (Key);
/* Search for the entry in the given chain */
N = T->Table[Hash % T->Slots];
@@ -96,7 +96,7 @@ HashNode* HT_Find (const HashTable* T, const void* Index)
* if it is not really necessary.
*/
if (N->Hash == Hash &&
T->Func->Compare (Index, T->Func->GetIndex (N->Entry))) {
T->Func->Compare (Key, T->Func->GetIndex (N->Entry))) {
/* Found */
break;
}
@@ -111,11 +111,11 @@ HashNode* HT_Find (const HashTable* T, const void* Index)
void* HT_FindEntry (const HashTable* T, const void* Index)
void* HT_FindEntry (const HashTable* T, const void* Key)
/* Find the node with the given index and return the corresponding entry */
{
/* First, search for the hash node */
HashNode* N = HT_Find (T, Index);
HashNode* N = HT_Find (T, Key);
/* Convert the node into an entry if necessary */
return N? N->Entry : 0;