Load

/****************************************************************************
 * dictionary.c
 *
 * Computer Science 50
 * Problem Set 6
 *
 * Implements a dictionary's functionality.
 ***************************************************************************/
#include <stdio.h>
#include <stdbool.h>
#include <stdlib.h>
#include "dictionary.h"
#include <ctype.h>
#include <string.h>
#define SIZE  26


typedef struct node
{
    char word[LENGTH + 1];
    struct node* next;
}
node;

// Make a hash table
node* hashtable[SIZE];

 /**
 * Returns true if word is in dictionary else false.
 */
bool check(const char* word)
{
    // TODO

    return false;
}

/**
 * Loads dictionary into memory.  Returns true if successful else false.
 */

int table_pos(const char* word)
{
    int table_pos = 0;
    int hash;
    for (int i = 0; word[i] != '\0'; i++)
    {
       // check if word is alpha
        if (isalpha(word[i]))
        {
            hash = word[i] - 'a';
        }
        else
        {
            hash = 26;
        }
     table_pos = hash % SIZE;
    }
    return table_pos;
}

bool load(const char* dictionary)
{
    // TODO
    // do some prep work
    FILE* inptr = fopen(dictionary,"r");
    if (inptr == NULL)
    {
        printf("Could not open %s.\n", dictionary);
        return 2;
    }
    // Make a new word
   char temp_word[LENGTH + 1];

    //while there are words available
     while (fscanf(inptr,"%s\n",temp_word) != 0)
     {
          node* new_node = malloc(sizeof(node));
          strcpy(new_node->word,temp_word);
          int x = table_pos(new_node->word);

          // get it into that list
          new_node->next = hashtable[x];
          hashtable[x] = new_node;

     }

     //do some cleanup work

     fclose(inptr);
     return true;
 }

/**
 * Returns number of words in dictionary if loaded else 0 if not yet loaded.
 */
unsigned int size(void)
{
    // TODO
    return 0;
}

/**
 * Unloads dictionary from memory.  Returns true if successful else false.
 */
bool unload(void)
{
    // TODO
    return false;
}