Repository navigation
Expand file tree
/
Copy pathLimit.cpp
More file actions
84 lines (77 loc) · 2.02 KB
/
Copy pathLimit.cpp
File metadata and controls
84 lines (77 loc) · 2.02 KB
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
#include "Limit.h"
#include<stdexcept>
#include <iostream>
// Initializes Limit
Limit::Limit(Order *ord)
: price(ord->price), lowerPrice(nullptr), higherPrice(nullptr), volumeTotal(ord->quantity), headOrder(ord), tailOrder(ord) {
if (ord == nullptr) {
throw std::invalid_argument("Cannot create Limit with null Order.");
}
ord->limit = this;
}
// Adds order to limit.
void Limit::ladd(Order *ord) {
if (isEmpty()) { // which conditinal to use?
headOrder = tailOrder = ord;
} else {
tailOrder->nextOrder = ord;
ord->prevOrder = tailOrder;
tailOrder = ord;
}
volumeTotal += ord->quantity;
}
// Removes order from Limit
void Limit::remove(Order *ord) {
if (isEmpty()){
throw std::invalid_argument("Limit is empty.");
}
if (ord == headOrder){
headOrder = headOrder->nextOrder;
if (headOrder) {
headOrder->prevOrder = nullptr;
} else {
tailOrder = nullptr;
}
} else if (ord == tailOrder) {
tailOrder = tailOrder->prevOrder;
if (tailOrder) {
tailOrder->nextOrder = nullptr;
} else {
headOrder = nullptr;
}
} else {
if (ord->prevOrder) {
ord->prevOrder->nextOrder = ord->nextOrder;
}
if (ord->nextOrder) {
ord->nextOrder->prevOrder = ord->prevOrder;
}
}
ord->limit = nullptr;
ord->prevOrder = nullptr;
ord->nextOrder = nullptr;
volumeTotal -= ord->quantity;
}
// Checks if Limit is empty
bool Limit::isEmpty() {
if (headOrder==nullptr) {
return true;
} else {
return false;
}
}
// Prints values in Limit
void Limit::printLimit() {
if (isEmpty()) {
throw std::invalid_argument("Limit is empty");
} else {
Order *curr = headOrder;
while(curr != nullptr) {
std::cout << std::to_string(curr->price) + " ";
Order *next = curr->nextOrder;
curr = next;
}
}
}
Limit::~Limit(){
}