[자료구조_Day4]Chained Hash Tables

#include <stdio.h>
#include <stdlib.h>
#include"list.h"
#include<string.h>
#include<stdlib.h>
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
List * make_bucket(int *size);
void find_node(List *list,int size);
void auto_data(List* list,int size);
int list_menu(void) {
 
    int i;
 
    do {
 
        printf("\n\nLinked List Menu\n");
 
        printf("1. Insert node\n");
 
        printf("2. Display all node\n");
        
        printf("3. find node\n");
 
        printf("4. auto data\n");
    
        printf("0. Quit\n");
 
        printf("Input Operation : ");
 
        scanf("%d", &i);
 
    } while(i<0 || i>10);
 
    return i;
 
}
 
void start(List* hash,int size) {
 
    int i;
 
    void *data;
 
 
    while((i=list_menu())!=0) {
 
        switch(i) {
 
 
            case 1 :
                isert_node(hash,size);
            break;
 
            case 2 :
                for(i=0;i<size;i++)
                {
                    printf("\n>>hash[%d]>> ",i);
                    if((hash+i)->head==NULL)
                    {
                        printf("- empty",i);
                        continue;
                    }
                
                    print_list(hash+i);    
                }
            break;
            case 3 :
                find_node(hash,size);
            break;
            case 4:
                auto_data(hash,size);
                break;
        }
 
    }
    exit(0);
 
}
 
 
void print_list(List *list) {
    
    ListElmt *element;
    element=list_head(list);
 
    while(element){
        
        printf("%s  ",list_data(element));
 
        element=element->next;
    }
}
 
void main(void) {
 
 
    List *hash;
    int size=0;
    
    hash=make_bucket(&size);
    start(hash,size);
 
}
List * make_bucket(int *size)
{
    int i;
    printf("#버킷 크기 입력 :");
    fflush(stdin);
    scanf("%d",size);
    
    List * n_hash=(List *)malloc(sizeof(List)*(*size));
    
    for(i=0;i<*size;i++)
    {
        list_init(n_hash+i,free);
    }
    printf("\n#Bucket[%d]\n",*size);
    return n_hash;
    
}
 
void isert_node(List* list,int size)
{
    char temp[100];
    char * str;
 
        printf(">Input data : ");
        fflush(stdin);
        gets(temp); 
        str = (char *)malloc(sizeof(temp)+1);
        strcpy(str,temp);
    
    
    int num = rand()%size;
    
    if(list[num].tail==NULL)
    {
        if(list_ins_next(list+num, NULL, str)==-1)
        {
            printf("no data\n");
            return;
        }
    }
    else
    {
            if(list_ins_next(list+num, list[num].tail, str)==-1)
        {
            printf("no data\n");
            return;
        }
    }
    return;    
}
 
void auto_data(List* list,int size)
{
    char temp[100];
    char * str;
    int input,i;
    int num;
        printf(">Input data 개수 : ");
        fflush(stdin);
        scanf("%d",&input);
 
 
        for(i=0;i<input;i++)
        { 
            str = (char *)malloc(sizeof(temp)+1);
            strcpy(str,itoa(rand()%1000,temp,10));
        
        num = atoi(str)%size;
 
    
    if(list[num].tail==NULL)
    {
        if(list_ins_next(list+num, NULL, str)==-1)
        {
            printf("no data\n");
            return;
        }
    }
    else
    {
            if(list_ins_next(list+num, list[num].tail, str)==-1)
        {
            printf("no data\n");
            return;
        }
    }
}
    return;    
}
 
void find_node(List *list,int size){
    int key,count=1;
    
    char temp[100];
    char * str;
 
        printf(">Input data : ");
        fflush(stdin);
        gets(temp); 
        str = (char *)malloc(sizeof(temp)+1);
        strcpy(str,temp);
        
    key=str[0]%size;
    ListElmt *element=list[key].head;
    
    while(1){
        if(!strcmp((char*)element->data,str)){
            printf("# data는 hash[%d]의 %d번째 노드에 있습니다.\n\n",key,count);
            return ;    
        }
        if(element->next==NULL){
            printf("# not find...\n");
            return ;
        }
        element=list_next(element);
        count++;
    }
}