11   template class container::GeneralSimpleHashTable <SimpleHashRecord>;
 
   17     minimum_limit(minimum_recordlimit), 
verbose(v)
 
   30   const uint64_t memory_use = memoryUse();
 
   31   if ((
verbose > 1 && size()) || memory_use > (1024*(1ull<<20)))
 
   33     std::cerr << 
"SimpleHashTable size: " << size() << 
" (" 
   34               << memory_use / (1ull<<20) << 
"MB)" 
   35               << 
", cache hit " << table->num_cache_hit
 
   36               << 
", table full " << table->num_record_after_full << 
"\n";
 
   49   minimum_limit = new_limit;
 
   62   if (limit < minimumRecordLimit())
 
   64   return GeneralSimpleHashTable <SimpleHashRecord>::allocate (key);
 
   82   return GeneralSimpleHashTable<SimpleHashRecord>::divSize();
 
   93     record = table->find(key);
 
   94     if (! record || dejavu.find(record) != dejavu.end()) {
 
  101     dejavu.insert(record);
 
  102     out.push_back(best_move);
 
  105   if (! quiesce_start || ! record)
 
  107   *quiesce_start = out.
size();
 
  113     out.push_back(best_move);
 
  116     record = table->find(key);
 
  117     if (! record || dejavu.find(record) != dejavu.end()) {
 
  120     dejavu.insert(record);