如何在 C 中打印哈希 Table?

How do I Print a Hash Table in C?

我有一个用 C 编写的程序可以创建哈希 [​​=14=]。我想知道它是什么,但我不确定如何打印或显示它。我已经粘贴了下面的程序。我对散列 tables 比较陌生,所以非常感谢任何帮助!

#include <stdlib.h>
#include <string.h>
#include <stdio.h>

#define TABLE_SIZE  7
#define NUM_INPUTS  7

int hash( char *s )
        /* Note, this is a horrible hash function.  It's here for
                instructional purposes */
{
        return strlen( s ) % TABLE_SIZE ;
}

typedef struct entry
{
        char *key;
        int     val;
        struct entry *next;
} entry;

entry* table[ TABLE_SIZE ] = { NULL };

void insert( char *s, int v )
        /* this insert is NOT checking for duplicates.  :/ */
{
        int h = hash( s );
        entry *t = (entry*) malloc( sizeof( entry ));

        t->key = s;
        t->val = v;
        t->next = table[h];
        table[h] = t;
}

void clean_table()
{
        entry *p, *q;
        int i;

        for( i=0; i<TABLE_SIZE; ++i )
        {
                for( p=table[i]; p!=NULL; p=q )
                {
                        q = p->next;
                        free( p );
                }
        }       // for each entry
}       // clean_table

int main()
{
        char* keyList[] = { "Jaga", "Jesse", "Cos", "Kate", "Nash", "Vera",
                "Bob" };

        int valList[] = { 24, 78, 86, 28, 11, 99, 38 };

        int i;

        for( i=0; i<NUM_INPUTS; ++i )
                insert( keyList[i], valList[i] );

        /* what does the table look like here? */

        clean_table();

        return( 0 );
}   

这是 C 语言中的简单哈希 Table 的示例。它实际上不做任何错误处理,所以这根本不适合生产,但它应该有助于看到 example of a working implementation. Here 是另一个 post 帮助某人通过 C 中的哈希 table 实现工作。

根据评论中的要求,所需的搜索功能如下所示:

int search(const char* key, int* out_val)
{
    // Find the hash index into the table.
    const int index = hash(key);

    // Now do a linear search through the linked list.
    for (struct entry* node = table[index]; node; node = node->next)
    {
         // If we find a node with a matching key:
         if (strcmp(node->key, key) == 0)
         {
              // Output the value and return 1 for success.
              *out_val = node->val;
              return 1;
         }
    }
    // We didn't find anything. Return 0 for failure.
    return 0;
}