(cache)[Wandbox]三へ( へ՞ਊ ՞)へﾊｯﾊｯ

Load template

Warnings

Optimization

Verbose

Compiler options:

Runtime options...

🐕 Corporate Sponsors:

🐶 Personal Sponsors:

About sponsors(Japanese)

created by

anonymous

1 minute ago

​x
 
#include <stdio.h>
#include <stdlib.h>
​
typedef struct hashElem{
    char *key;
    int freq;
}hashElem;
​
struct hashTable{
    int N;
    hashElem **array;
};
​
int hash(char *key, int i){//hash function to find the position in the hashtable
    int sum=0;
    while( *key!='\0' ){
        sum = sum + *key;
        key++;
    }
    return (sum+i)%m;
}
​
struct hashTable *createHashTable(){
    struct hashTable *ht=malloc(sizeof(struct hashTable));
    if( ht==NULL )
        printf("Error in memory allocation.\n");
​
    ht->N = 0;
    ht->array=malloc(m*sizeof(hashElem *));
    if( ht->array==NULL )
        printf("Error in memory allocation.\n");
    for(int i=0; i<m; i++ )
        ht->array[i] = NULL;
    return ht;
}
​
void printHashTable(struct hashTable *ht){
    printf("Printing hash table:\n");
    for(int i=0; i<m; i++)
        if( ht->array[i]!=NULL )
            printf("%s: %d\n", ht->array[i]->key, ht->array[i]->freq); //line of the warning!
    printf("---------end.\n");
}
​
int insert(struct hashTable *ht, keyType key){ //insert function... which is a mess but should work
    int index;
    int i=0;
    int collision=1;
    while( collision && i<m ){
        index = hash(key, i);
        if( ht->array[index]!=NULL ){
            if( ht->array[index]!=key ){
                collision=1;
                i++;              //if it finds a collision it tries the next free space so i++
            }else
                ht->array[index]->freq++;
        }else{
            collision = 0;
            hashElem *s;
            s=malloc(sizeof(hashElem));
            s->freq++;
            s->key = key;
            ht->array[index] = s;
            ht->N++;
        }
    }
    if( collision==1 )
        return -1;
    else
        return 1;
}
​

Editor settings:

Smart Indent

$ gcc prog.c -Wall -Wextra -std=gnu11

Stdin

Run (or Ctrl+Enter)

#permlink

Code

Start

prog.c: In function 'hash':
prog.c:20:20: error: 'm' undeclared (first use in this function)
   20 |     return (sum+i)%m;
      |                    ^
prog.c:20:20: note: each undeclared identifier is reported only once for each function it appears in
prog.c: In function 'createHashTable':
prog.c:29:22: error: 'm' undeclared (first use in this function)
   29 |     ht->array=malloc(m*sizeof(hashElem *));
      |                      ^
prog.c: In function 'printHashTable':
prog.c:39:20: error: 'm' undeclared (first use in this function)
   39 |     for(int i=0; i<m; i++)
      |                    ^
prog.c: At top level:
prog.c:45:34: error: unknown type name 'keyType'
   45 | int insert(struct hashTable *ht, keyType key){ //insert function... which is a mess but should work
      |                                  ^~~~~~~
prog.c: In function 'hash':
prog.c:21:1: warning: control reaches end of non-void function [-Wreturn-type]
   21 | }
      | ^

Finish

No Wrap