-
Notifications
You must be signed in to change notification settings - Fork 0
/
Container.hpp
163 lines (140 loc) · 2.9 KB
/
Container.hpp
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
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
//
// Container.hpp
// Exam
//
// Created by Alexander Ignatov on 8.06.21.
//
#ifndef Container_hpp
#define Container_hpp
template<typename T>
class Container {
protected:
T* elements;
unsigned length;
void copyOtherContainer(const Container<T>&);
int findIndexOf(const T&) const;
public:
Container();
Container(const Container<T>&);
Container<T>& operator=(const Container<T>&);
virtual ~Container();
bool member(const T&) const;
virtual bool add(const T&) = 0;
bool remove(const T&);
int size() const;
T& operator[] (int i);
};
template<typename T>
Container<T>::Container() : length(0), elements(nullptr)
{
}
template<typename T>
void Container<T>::copyOtherContainer(const Container<T>& rhs)
{
if (!rhs.elements)
{
elements = nullptr;
return;
}
elements = new T[rhs.length];
for (int i = 0; i < rhs.length; i++) {
elements[i] = rhs.elements[i];
}
}
template<typename T>
Container<T>::Container(const Container<T>& rhs) : length(rhs.length)
{
copyOtherContainer(rhs);
}
template<typename T>
Container<T>& Container<T>::operator=(const Container<T>& rhs)
{
if (this != &rhs)
{
delete[] elements;
length = rhs.length;
copyOtherContainer(rhs);
}
return *this;
}
template<typename T>
Container<T>::~Container()
{
delete[] elements;
}
template<typename T>
bool Container<T>::member(const T& toFind) const
{
return findIndexOf(toFind) != -1;
}
template<typename T>
int Container<T>::findIndexOf(const T& element) const
{
for(int i = 0; i < length; i++)
{
if (elements[i] == element)
{
return i;
}
}
return -1;
}
template<typename T>
bool Container<T>::remove(const T& toRemove)
{
if (!elements)
{
return false;
}
if (length == 1 && elements[0] == toRemove)
{
delete elements[0];
elements = nullptr;
length = 0;
return true;
}
int index = findIndexOf(toRemove);
if (index == -1)
{
return false;
}
T* newArray = new T[length - 1];
int idx = 0;
for(int i = 0; i < length - 1; i++)
{
if (idx != index)
{
newArray[i] = elements[idx];
idx++;
}
}
length--;
delete[] elements;
elements = newArray;
return true;
}
template<typename T>
int Container<T>::size() const
{
return length;
}
template<typename T>
T& Container<T>::operator[] (int i)
{
return elements[i];
}
template<typename T>
bool Container<T>::add(const T& element)
{
T* newArray = new T[this->length + 1];
for (int i = 0; i < this->length; i++)
{
newArray[i] = this->elements[i];
}
newArray[this->length] = element;
this->length++;
delete[] this->elements;
this->elements = newArray;
return true;
}
#endif /* Container_hpp */