Algorithmic-Trading-Program-Using-Technical-Analysis/LinkedList.cpp at master · walternate/Algorithmic-Trading-Program-Using-Technical-Analysis · 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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
#include "LinkedList.h"

LinkedList::Node::Node(Share data)
{
	value = data;
	next = NULL;
}

LinkedList::LinkedList()
{
	head_ = NULL;
	size_ = 0;
}

LinkedList::~LinkedList()
{
	Node* nodePtr = head_;
	Node* nextNode = NULL;
	while (nodePtr != NULL)
	{
		nextNode = nodePtr->next;
		delete nodePtr;
		nodePtr = nextNode;
		size_--;
	}
	nextNode = NULL;
}

unsigned int LinkedList::size() const
{
	return size_;
}

bool LinkedList::empty() const
{
	if (size_ == 0)
		return true;
	else
		return false;
}

Share LinkedList::select(unsigned int index) const
{
	Node* nodePtr = head_;
	Share val;
	for (int i = 0; i <= index; i++)
	{
		val = nodePtr->value;
		nodePtr = nodePtr->next;
	}
	return val;
}

unsigned int LinkedList::search(Share value) const
{
	Node* nodePtr = head_;
	for (int i = 0; i < size_; i++)
	{
		if (nodePtr->value == value)
			return i;
		else
			nodePtr = nodePtr->next;
	}
}

//
LinkedList::Node* LinkedList::getNode(unsigned int index) const
{
	Node* nodePtr = head_;
	for (int i = 0; i < index; i++)
		nodePtr = nodePtr->next;
	return nodePtr;
}

void LinkedList::insert_front(Share value)
{
	if (size_ == 0)
	{
		Node* newNode = new Node(value);
		head_ = newNode;
		newNode->next = NULL;
	}
	else
	{
		Node* newNode = new Node(value);
		Node* nextNode = head_;
		head_ = newNode;
		newNode->next = nextNode;
	}
	size_++;
	return;
}

void LinkedList::remove(unsigned int index)
{
	if (index == 0)
		return remove_front();
	else
	{
		Node* delNode = head_;
		Node* nextNode = NULL;
		Node* prevNode = NULL;
		for (int i = 0; i < index; i++)
		{
			nextNode = delNode->next->next;
			prevNode = delNode;
			delNode = delNode->next;
		}
		delete delNode;
		prevNode->next = nextNode;
		size_--;
		return;
	}
}

void LinkedList::remove_front()
{
	if (size_ == 1)
	{
		Node* delNode = head_;
		delete delNode;
		head_ = NULL;
	}
	else
	{
		Node* delNode = head_;
		head_ = delNode->next;
		delete delNode;
	}
	size_--;
	return;
}