// Michael Rice
// CSCI 2720: Project 3
// Hashlink.cc (linked list of Hashnodes)

#ifndef NULL
const int NULL = 0;
#endif  // NULL

#include <iostream>

#include "Hashlink.h"

using namespace std;

// Constructor
Hashlink::Hashlink(){
  front = NULL;
}

// Destructor
Hashlink::~Hashlink(){
  delete front;
}

// Insert a Hashnode into the linked list
void Hashlink::insert(Hashnode *newNode){
  // Pointer used to search through the list
  Hashnode *P = front;

  // Check to see if node is already in list
  
  // If node IS already in list, simply udpate node;
  // else, insert node into the list


}

// Delete a Hashnode from the linked list
void Hashlink::deleteNode(int key){
  // Pointers used to search through the list
  Hashnode *P = front;
  Hashnode *Q = NULL;

  // Search through list to find node w/ key

  // See if node is at front of list; if so, delete properly and return


}

// Return pointer to front node
Hashnode *Hashlink::getFront(){

}