Hash.cpp

#pragma once
#include <cstring>
#include <iostream>
#include "datatype.hpp"

//#include "binary_Heap.cpp"
#include "tempfile.cpp"
using namespace std;

class Hash_map
{
public:
    LinkedList *l1;
    int size = 5;   //used in case more categories are added to the heap(to increase size)
    Heap *hashPtr;  //for udemy courses
    Heap *hashPtr2; //for coursera courses
    bool is_Occupied[100];
    Hash_map()
    {
        hashPtr = new Heap[size];
        hashPtr2 = new Heap[100];
        is_Occupied[100]={false};
    }
    int HashFunc(string str) //Hash function for udemy data set
    {
        if (str.compare("business finance") == 0)
            return 1;   
        else if (str.compare("graphic design") == 0)
            return 2;
        else if (str.compare("musical instruments") == 0)
            return 3;
        else if (str.compare("web development") == 0)
            return 4;
        else
            return 5;
    }
    int HashFuncC(string str) //Hash function for coursera
    {
        int ascii1 = 0;
        int ascii2 = 0;
        int ascii3 = 0;
        int length = 0;
        int hashval;
        char c;
        size_t i = 0;
        ascii1 = (int)str[0];
        ascii2 = (int)str[1];
        ascii3 = (int)str[2];
        hashval = ((ascii1*ascii1*ascii1)+(ascii2*ascii2)+(ascii3))%100;//hashing algorithm
        if(!is_Occupied[hashval])//for collisions
        return hashval;
        while(!is_Occupied[hashval]==true)//quadratic hashing
        {
            i++;
            hashval=hashval + (i*i);
        }
        return hashval;
        
    }
    void inserthash(int index, Course *obj) //to be used when adding new hash maps;
    {
        hashPtr[index - 1].insert(obj, obj->data.rating);
    }
    void inserthash2(int index, Course *obj) //to be used when adding new hash maps;
    {
        hashPtr2[index].insert(obj, obj->data.rating);
    }

    void searchMap(string str) //searchesudemy courses
    {
        int index = HashFunc(str);
        LinkedList *newList = new LinkedList();
        hashPtr[index - 1].returnList(newList);
        cout << "Display first how many results?(Press 0 if you wish to display all)" << endl;
        int count = 0;
        cin >> count;
        newList->printList(count, 0);
    }
    void searchMapC(string str) //searches coursera courses
    {
        string str1;
        int index = HashFuncC(str);
        if (! hashPtr2[index].is_empty() )
            str1  = hashPtr2[index].root->node->data.tags[0];
        int len = str.length();
        str1 = str1.substr(0,len);
        transform(str1.begin(), str1.end(), str1.begin(), ::tolower);
        if (str != str1)
        {
            cout << "No results found. Please refine your query." << endl;
            return;
        }

        LinkedList *newList = new LinkedList();
        if (! hashPtr2[index].is_empty() )
            hashPtr2[index].returnList(newList);
        //cout << "Display first how many results?(Press 0 if you wish to display all)" << endl;
        int count = 2;
        //cin >> count;
        newList->printList(count, 0);
    }
};

/*
#pragma once
#include <cstring>
#include <iostream>
#include "datatype.hpp"

//#include "binary_Heap.cpp"
#include "tempfile.cpp"
using namespace std;



class Hash_map
{
public:
    LinkedList *l1;
    int size = 5;   //used in case more categories are added to the heap(to increase size)
    Heap *hashPtr;  //for udemy courses
    Heap *hashPtr2; //for coursera courses
    Heap* temp;
    bool is_occupied[100]={false};
    Hash_map()
    {
        hashPtr2 = new Heap[100];
    }
    int HashFunc(string str) //Hash function for udemy data set
    {
        if (str.compare("business finance") == 0)
            return 1;   
        else if (str.compare("graphic design") == 0)
            return 2;
        else if (str.compare("musical instruments") == 0)
            return 3;
        else if (str.compare("web development") == 0)
            return 4;
        else
            return 5;
    }
    int HashFuncC(string str) //Hash function for coursera
    {
        int ascii1 = 0;
        int ascii2 = 0;
        int ascii3 = 0;
        int length = 0;
        int hashval;
        char c;
        size_t i = 0;
        ascii1 = (int)str[0];
        ascii2 = (int)str[1];
        ascii3 = (int)str[2];
        hashval = ((ascii1*ascii1*ascii1)+(ascii2*ascii2*ascii2)+(ascii3*ascii3*ascii3))%100;
        cout<<"Hello"<<endl;
        if(!is_occupied[hashval])
        return hashval;
        while(!is_occupied[hashval]==true)
        {
            i++;
            hashval=hashval + (i*i);
        }
        return hashval;
        
        
    }
    void inserthash(int index, Course *obj) //to be used when adding new hash maps;
    {
        hashPtr[index - 1].insert(obj, obj->data.rating);
    }
    void inserthash2(int index, Course *obj) //to be used when adding new hash maps;
    {
        cout<<"Hello1"<<endl;
        hashPtr2[index].insert(obj,obj->data.rating);
       
    }

    void searchMap(string str) //searchesudemy courses
    {
        int index = HashFunc(str);
        LinkedList *newList = new LinkedList();
        hashPtr[index - 1].returnList(newList);
        cout << "Display first how many results?(Press 0 if you wish to display all)" << endl;
        int count = 0;
        cin >> count;
        newList->printList(count, 0);
    }
    void searchMapC(string str) //searches coursera courses
    {
        int index = HashFuncC(str);
        string str1  = hashPtr2[index].root->node->data.tags[0];
        size_t i = 0;
        for (; i < str.length(); i++)
        {
            if(isspace(str[i]))
                break;
        }
        str1 = str1.substr(0,i);
        transform(str1.begin(), str1.end(), str1.begin(), ::tolower);
        if (str != str1)
        {
            cout << "No results found. Please refine your query." << endl;
            return;
        }

        LinkedList *newList = new LinkedList();
        hashPtr2[index].returnList(newList);
        cout << "Display first how many results?(Press 0 if you wish to display all)" << endl;
        int count = 0;
        cin >> count;
        newList->printList(count, 0);
    }
};
*/