-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathcomposite.cpp
More file actions
78 lines (71 loc) · 1.4 KB
/
composite.cpp
File metadata and controls
78 lines (71 loc) · 1.4 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
//通过组合关系定义类间的关联关系,实现了将对象组合成树形结构,最终实现类的复用
#include <iostream>
#include <list>
#include <string>
#include <algorithm>
class Componet
{
public:
virtual void process() = 0;
virtual ~Componet() {}
};
class Composite : public Componet
{
std::string name;
std::list<Componet*> elements;
public:
Composite(const std::string& s) : name(s)
{
std::cout << "Composite Construct!" << std::endl;
}
void add(Componet* element)
{
elements.emplace_back(element);
}
void remove(Componet* element)
{
elements.remove(element);
}
void process()
{
std::cout << "This is Composite!" << std::endl;
for (const auto& e : elements)
{
e->process();
}
}
};
class Leaf : public Componet
{
std::string name;
public:
Leaf(std::string s) :name(s)
{
std::cout << "Leaf Construct!" << std::endl;
}
void process()
{
std::cout << "This is leaf!" << std::endl;
}
};
//int main()
//{
// Composite root("root");
// Composite treeNode1("treeNode1");
// Composite treeNode2("treeNode2");
// Composite treeNode3("treeNode3");
// Composite treeNode4("treeNode4");
//
// Leaf left1("left1");
// Leaf left2("left2");
//
// root.add(&treeNode1);
// treeNode1.add(&treeNode2);
// treeNode2.add(&left1);
//
// root.add(&treeNode3);
// treeNode3.add(&treeNode4);
// treeNode4.add(&left2);
//
// root.process();
//}