main.cpp

/*
CSE 310 Hash Function DIY Contest
Instructor: Yiran "Lawrence" Luo
Your name(s): Eric Everett
Your team alias: Team Eric Everett
*/

#include <iostream>
#include <iomanip>
#include <string>
#include "hash.h"

using namespace std;

int main() {

    int k = 0;
    int n = 0;
    string texts[500];

    // WARNING: Start of the tokenizer that loads the input from std::cin, DO NOT change this part!
    cin >> k;
    string line;
    getline(cin, line);

    while (getline(cin, line)) {
        texts[n] = line;
        n++;
    }
    // WARNING: End of the tokenizer, DO NOT change this part!

    // By this point, k is the # of slots, and n is the # of tokens to fit in
    // texts[] stores the input sequence of tokens/keys to be inserted into your hash table

    // The template is able to be compiled by running 
    //   make
    //   ./encoder < inputs/sample_input.txt
    // which puts out the placeholders only.

    // Your time to shine starts now

    // Create a new hash table with k slots
    HashTable hashtable(k); 


    // Insert the texts into the hash table
    for (int i = 0; i < n; i++) {
        hashtable.insert(texts[i]);
    }

    cout << "==== Printing the contents of the first 5 slots ====" << endl;
    // Print the contents of the first 5 slots
    hashtable.print_first_five_slots();

    cout << "==== Printing the slot lengths ====" << endl;
    // Print the lengths of the slots
    hashtable.print_slot_lengths();

    cout << "==== Printing the standard variance =====" << endl;
    // Print the standard variance
    hashtable.print_standard_deviation();

    return 0;
}