unsigned int index = ((_KeyInt)key) >> _Shift;
do {
- index = index & capacitymask;
+ index &= capacitymask;
search = &table[index];
if (search->key == key) {
search->val = val;
unsigned int index = ((_KeyInt)key) >> _Shift;
do {
- index = index&capacitymask;
+ index &= capacitymask;
search = &table[index];
- if (search->key == key) {
+ if (search->key == key)
return search->val;
- }
index++;
} while (search->key);
- return (_Val) 0;
+ return (_Val)0;
}
/** Check whether the table contains a value for the given key. */
unsigned int index = ((_KeyInt)key) >> _Shift;
do {
- index = index & capacitymask;
+ index &= capacitymask;
search = &table[index];
- if (search->key == key) {
+ if (search->key == key)
return true;
- }
index++;
} while (search->key);
return false;
struct hashlistnode<_Key, _Val> *newtable;
unsigned int oldcapacity = capacity;
- if ((newtable = (struct hashlistnode<_Key, _Val> *) _calloc(newsize, sizeof(struct hashlistnode<_Key, _Val>))) == NULL) {
- model_print("Calloc error %s %d\n", __FILE__, __LINE__);
- exit(-1);
+ if ((newtable = (struct hashlistnode<_Key, _Val> *)_calloc(newsize, sizeof(struct hashlistnode<_Key, _Val>))) == NULL) {
+ model_print("calloc error %s %d\n", __FILE__, __LINE__);
+ exit(EXIT_FAILURE);
}
- table = newtable; //Update the global hashtable upon resize()
+ table = newtable; // Update the global hashtable upon resize()
capacity = newsize;
capacitymask = newsize - 1;
- threshold = (unsigned int) (newsize * loadfactor);
+ threshold = (unsigned int)(newsize * loadfactor);
struct hashlistnode<_Key, _Val> *bin = &oldtable[0];
struct hashlistnode<_Key, _Val> *lastbin = &oldtable[oldcapacity];
unsigned int index = ((_KeyInt)key) >> _Shift;
do {
- index = index & capacitymask;
+ index &= capacitymask;
search = &table[index];
index++;
} while (search->key);
search->val = bin->val;
}
- _free(oldtable); //Free the memory of the old hash table
+ _free(oldtable); // Free the memory of the old hash table
}
private: