Repository navigation
Expand file tree
/
Copy pathelementset.h
More file actions
87 lines (76 loc) · 1.9 KB
/
Copy pathelementset.h
File metadata and controls
87 lines (76 loc) · 1.9 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
85
86
87
#ifndef ELEMENTSET_H
#define ELEMENTSET_H
#include "element.h"
#include <vector>
class ElementSet{
public:
vector<Element> elements;
ElementSet()
{
}
ElementSet(const Element &element)
{
push_back(element);
}
ElementSet(const Element& e1, const Element& e2) {
push_back(e1);
push_back(e2);
}
ElementSet& operator = (const ElementSet& element) {
if(this != &element) {
clear();
for (unsigned int i = 0;i < element.elements.size();i++)
{
push_back(element.elements[i]);
}
}
return *this;
}
void clear()
{
elements.clear();
}
ElementSet& operator + (const Element& element) {
push_back(element);
return *this;
}
friend ElementSet operator + (const Element& left, const Element& right) {
return ElementSet(left, right);
}
void push_back(const Element& element) {
elements.push_back(element);
}
int size() const
{
return elements.size();
}
bool equal(const ElementSet& element) const {
if (element.size() != this->size())
return false;
for (int i = 0;i < element.size();i++)
{
if (element.elements[i] != this->elements[i])
return false;
}
return true;
}
bool operator == (const ElementSet& element) const {
return equal(element);
}
bool operator != (const ElementSet& element) const {
return !this->equal(element);
}
const Element& operator [] (int pos) const {
return elements.at(pos);
}
Element& operator [] (int pos) {
return elements.at(pos);
}
};
ElementSet Element::operator + (const Element & left) {
Element a;
a.name = this->name;
a.type = this->type;
return ElementSet(a, left);
}
#endif // ELEMENTSET_H