blob: b83027fcf8ad007b095ab2275a23710449356c9b (
plain) (
blame)
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
|
#pragma once
template <class T>
class Set {
T* elements;
unsigned size;
void free();
void copyFrom(const Set& other);
public:
Set();
~Set();
Set(const Set& other);
Set& operator=(const Set& other);
Set(Set&& other);
Set& operator=(Set&& other);
Set& operator+=(const Set& right);
template <class U>
friend Set<U> operator+(const Set<U>& left, const Set<U>& right);
Set& operator*=(const Set& right);
template <class U>
friend Set<U> operator*(const Set<U>& left, const Set<U>& right);
Set& operator-=(const Set& right);
template <class U>
friend Set operator-(const Set& left, const Set& right);
};
template <class T>
void Set<T>::free() {
delete[] elements;
}
template <class T>
void Set<T>::copyFrom(const Set& other) {
this->size = other.size;
this->elements = new T[size];
for (int i = 0; i < size; i++) {
this->elements[i] = other.elements[i];
}
}
template <class T>
Set<T>::Set() {
elements = nullptr;
size = 0;
}
template <class T>
Set<T>::~Set() {
delete[] elements;
}
template <class T>
Set<T>::Set(const Set& other) {
copyFrom(other);
}
template <class T>
Set<T>& Set<T>::operator=(const Set<T>& other) {
if (this != &other) {
free();
copyFrom(other);
}
return *this;
}
template <class T>
Set<T>::Set(Set<T>&& other) {
this->size = other.size;
this->elements = other.elements;
other.elements = nullptr;
}
template <class T>
Set<T>& Set<T>::operator=(Set<T>&& other) {
if (this != &other) {
free();
this->size = other.size;
this->elements = other.elements;
other.elements = nullptr;
}
return *this;
}
template <class T>
Set<T>& Set<T>::operator+=(const Set<T>& right) {
T* biggerArray = new T[size + right.size];
for (int i = 0; i < size; i++) {
biggerArray[i] = elements[i];
}
for (int i = 0; i < right.size; i++) {
biggerArray[i+size] = right.elements[i];
}
delete[] elements;
elements = biggerArray;
size += right.size;
return *this;
}
template <class T>
Set<T> operator+(const Set<T>& left, const Set<T>& right) {
Set<T> setUnion = left;
setUnion += right;
return setUnion;
}
template <class T>
Set<T>& Set<T>::operator*=(const Set<T>& right) {
T* commonArray = new T[size];
unsigned commonCount = 0;
for (int i = 0; i < size; i++) {
for (int j = 0; j < right.size; j++) {
if (elements[i] == right.elements[j]) {
commonArray[commonCount++] = elements[i];
break;
}
}
}
size = commonCount;
delete[] elements;
elements = new T[size];
for (int i = 0; i < size; i++) {
elements[i] = commonArray[i];
}
delete[] commonArray;
return *this;
}
template <class T>
Set<T> operator*(const Set<T>& left, const Set<T>& right) {
Set<T> setIntersection = left;
setIntersection *= right;
return setIntersection;
}
template <class T>
Set<T>& Set<T>::operator-=(const Set& right) {
Set complement = right * (*this);
*this = complement;
return *this;
}
template <class T>
Set<T> operator-(const Set<T>& left, const Set<T>& right) {
Set<T> setComplement = left;
setComplement -= right;
return setComplement;
}
|
