Revision 76cefba1
ID | 76cefba1ddbc3bddf37a16ccea1ad0a74a6d74cc |
Merged scheduler implementations and modified order structrure class
scout/libscout/src/helper_classes/Order.cpp | ||
---|---|---|
2 | 2 |
|
3 | 3 |
using namespace std; |
4 | 4 |
|
5 |
/** @Brief: Default order constructor */ |
|
6 |
Order::Order() |
|
5 |
/** @Brief: Regular order constructor */ |
|
6 |
Order::Order(int order_id, Address order_source, Address order_dest, Time order_deadline, Time order_start_time, Path order_path, Time order_est_time) |
|
7 |
{ |
|
8 |
id = order_id; |
|
9 |
source = order_source; |
|
10 |
dest = order_dest; |
|
11 |
start_time = order_start_time; |
|
12 |
path = order_path; |
|
13 |
est_time = order_est_time; |
|
14 |
} |
|
15 |
|
|
16 |
/** @Brief: Get order ID */ |
|
17 |
int Order::getid() const |
|
7 | 18 |
{ |
8 |
orderID = 0; |
|
9 |
orderSource = 0; |
|
10 |
orderDest = 0; |
|
11 |
orderDeadline = 0; |
|
12 |
orderStartTime = 0; |
|
13 |
orderPath = 0; |
|
14 |
orderEstTime = 0; |
|
19 |
return id; |
|
20 |
} |
|
21 |
|
|
22 |
Address get_source() const |
|
23 |
{ |
|
24 |
return source; |
|
15 | 25 |
} |
16 | 26 |
|
17 |
/** @Brief: Regular order constructor */ |
|
18 |
Order::Order(int ID, Address source, Address dest, Time deadline, Time start_time, Path path, Time est_time) { |
|
19 |
orderID = ID; |
|
20 |
orderSource = source; |
|
21 |
orderDest = dest; |
|
22 |
orderDeadline = deadline; |
|
23 |
orderStartTime = start_time; |
|
24 |
orderPath = path; |
|
25 |
orderEstTime = est_time; |
|
27 |
Address get_dest() const |
|
28 |
{ |
|
29 |
return dest; |
|
26 | 30 |
} |
27 | 31 |
|
28 |
/** @Brief: Get priority for the PQWrapper */
|
|
29 |
double Order::getpriority() const {
|
|
30 |
return orderDeadline - orderStartTime;
|
|
32 |
Time get_start_time() const
|
|
33 |
{
|
|
34 |
return start_time;
|
|
31 | 35 |
} |
32 | 36 |
|
33 |
/** @Brief: Get order ID */
|
|
34 |
int Order::getid() const {
|
|
35 |
return orderID;
|
|
36 |
}
|
|
37 |
Path get_path() const
|
|
38 |
{ |
|
39 |
return path;
|
|
40 |
} |
|
37 | 41 |
|
38 |
/** @Brief: Order comparison function for PQWrapper */ |
|
39 |
bool CompareOrder::operator()(Order& o1, Order& o2) { |
|
40 |
return o1.getpriority() > o2.getpriority(); |
|
42 |
void set_path(Path order_path) |
|
43 |
{ |
|
44 |
path = order_path; |
|
45 |
return; |
|
46 |
} |
|
47 |
/** @Brief: Order comparison function for PQWrapper |
|
48 |
* NOTE: In order to have a min priority queue, using c++'s pq |
|
49 |
* implementation, the compare function must return true if |
|
50 |
* o1 is greater than o2. |
|
51 |
*/ |
|
52 |
bool CompareOrder::operator()(Order& o1, Order& o2) |
|
53 |
{ |
|
54 |
int pq_value1 = o1.get_start_time + MAX_WAIT_TIME - o1.get_est_time(); |
|
55 |
int pq_value2 = o2.get_start_time + MAX_WAIT_TIME - o2.get_est_time(); |
|
56 |
return pq_value1 > pq_value2; |
|
41 | 57 |
} |
58 |
|
Also available in: Unified diff