#ifndef _CL_HASH2_H
#define _CL_HASH2_H
-#include "cl_hash.h"
-#include "cl_iterator.h"
+#include "base/hash/cl_hash.h"
+#include "base/cl_iterator.h"
namespace cln {
var long index = this->_slots[hashcode(key1,key2) % this->_modulus] - 1;
while (index >= 0) {
if (!(index < this->_size))
- cl_abort();
+ throw runtime_exception();
if (equal(key1,this->_entries[index].entry.key1)
&& equal(key2,this->_entries[index].entry.key2))
return &this->_entries[index].entry.val;
var long index = this->_slots[hcode % this->_modulus] - 1;
while (index >= 0) {
if (!(index < this->_size))
- cl_abort();
+ throw runtime_exception();
if (equal(key1,this->_entries[index].entry.key1)
&& equal(key2,this->_entries[index].entry.key2)) {
this->_entries[index].entry.val = val;
while (*_index > 0) {
var long index = *_index - 1;
if (!(index < this->_size))
- cl_abort();
+ throw runtime_exception();
if (equal(key1,this->_entries[index].entry.key1)
&& equal(key2,this->_entries[index].entry.key2)) {
// Remove _entries[index].entry
if (this->_freelist < -1)
return;
// Can we make room?
- if (_garcol_fun(this))
+ if (this->_garcol_fun(this))
if (this->_freelist < -1)
return;
// No! Have to grow the hash table.
#else
// workaround Sun C++ 4.1 inline function compiler bug
if (this->_freelist >= -1) {
- if (!_garcol_fun(this) || (this->_freelist >= -1))
+ if (!this->_garcol_fun(this) || (this->_freelist >= -1))
grow();
}
#endif