Search-Engine/Hash.cpp at master · nabi-noor/Search-Engine · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
#include "Hash.h"
#include "Movie.h"
//************************************************************************
//comstructor for Hash class
Hash::Hash()
{
    for (int i = 0; i < 101; i++)
        hashTable[i] = new LinkedList();
}

//*************************************************************************
// Hash function definition

int Hash::hash(int key)
{
    return key%101;
}


//*************************************************************************
//Function to add an object in hash table

void Hash::add(Movie key)
{
    int i = hash((key.getRating())*10);
    hashTable[i]->addToStart(key);
}


//**************************************************************************
// Print hash table
void Hash::print(int i)
{       i = hash(i);
        if(hashTable[i]->getHead() == NULL)
        {
            cout<< i << '\t' <<'X'<< endl;
        }

        else
        {
            cout << i << '\t';
            hashTable[i]->printList();
        }

}

Node Hash::searchMax(int rating)
{
    int max = 0;
    Node maxNode;
    int i = hash(rating);
    if(hashTable[i]->getHead() != NULL)
    {
        Node* temp = hashTable[i]->getHead();
        while(temp != NULL)
        {
            if(temp->getData().getVotes() > max)
            {
                max = temp->getData().getVotes();
                maxNode = *temp;
            }
            temp = temp->getNext();
        }
        return maxNode;
    }
}

Node Hash::searchMin(int rating)
{
    int min = 100000;
    Node minNode;
    int i = hash(rating);
    if(hashTable[i]->getHead() != NULL)
    {
        Node* temp = hashTable[i]->getHead();
        while(temp != NULL)
        {
            if(temp->getData().getVotes() < min)
            {
                min = temp->getData().getVotes();
                minNode = *temp;
            }
            temp = temp->getNext();
        }
        return minNode;
    }
}
int Hash::getSize(int key)
{
    return hashTable[hash(key)]->getSize();
}