pk2i = sparse_array_lookup(sa, key, &idx);
if (pk2i && pk2i->key == key)
{
- FIXME("re adding an existing key\n");
+ FIXME("re-adding an existing key\n");
return NULL;
}
to = vector_add(&sa->key2index, pool);
variance = (double)sq / ht->num_buckets - mean * mean;
FIXME("STATS: elts[num:%-4u size:%u mean:%f] buckets[min:%-4u variance:%+f max:%-4u]\n",
ht->num_elts, ht->num_buckets, mean, min, variance, max);
-#if 1
+
for (i = 0; i < ht->num_buckets; i++)
{
for (len = 0, elt = ht->buckets[i]; elt; elt = elt->next) len++;
if (len == max)
{
- FIXME("Longuest bucket:\n");
+ FIXME("Longest bucket:\n");
for (elt = ht->buckets[i]; elt; elt = elt->next)
FIXME("\t%s\n", elt->name);
break;
}
#endif
-#endif
}
void hash_table_add(struct hash_table* ht, struct hash_table_elt* elt)