Computer-Lab/KeyedItem.cpp at main · berktemel/Computer-Lab · 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
/*
* Title: Heaps, Priority Queues
* Author: Berk Temel
* ID: 22002675
* Section: 2
* Assignment: 3
* Description: Implementation of KeyedItem class, this class is basically the requests, from lecture slides
*/
#include "KeyedItem.h"

KeyedItem::KeyedItem() {

}

KeyedItem::KeyedItem(int id, int priority, int sendTime, int execTime) {
    this->id = id;
    this->priority = priority;
    this->sendTime = sendTime;
    this->execTime = execTime;
}

int KeyedItem::getId() const {
    return id;
}

int KeyedItem::getPriority() const {
    return priority;
}

int KeyedItem::getSendTime() const {
    return sendTime;
}

int KeyedItem::getExecTime() const {
    return execTime;
}

bool KeyedItem::operator > (const KeyedItem &r) const {
    if(currentTime >= this->getSendTime() && currentTime >= r.getSendTime()) {
        if (this->getPriority() < r.getPriority())
            return false;
        else if (this->getPriority() > r.getPriority())
            return true;
        else
            return this->getId() < r.getId();//this->getSendTime() < r.getSendTime();
    } else {
        if (this->getSendTime() > r.getSendTime())
            return false;
        else if (this->getSendTime() < r.getSendTime())
            return true;
        else
            return this->getPriority() > r.getPriority();
    }
}

void KeyedItem::setCurrentTime(int t) {
    currentTime = t;
}

bool KeyedItem::operator < (const KeyedItem &r) const {
    if(currentTime >= this->getSendTime() && currentTime >= r.getSendTime()) {
        if (this->getPriority() < r.getPriority())
            return true;
        else if (this->getPriority() > r.getPriority())
            return false;
        else
            return this->getId() > r.getId();//this->getSendTime() < r.getSendTime();
    } else {
        if (this->getSendTime() > r.getSendTime())
            return true;
        else if (this->getSendTime() < r.getSendTime())
            return false;
        else
            return this->getPriority() < r.getPriority();
    }
}