[结构型模式] 组合模式的理解

[img]http://api5.yunpan.360.cn/intf.php?method=File.getThumbByNid&qid=108635719&nid=13770720602900189&size=800_600&devtype=web&v=1.0.1&rtick=14661274232904&sign=a6d71dec6fdfbffe90b9be688816ccac&[/img]
[img]http://api5.yunpan.360.cn/intf.php?method=File.getThumbByNid&qid=108635719&nid=14661242779482160&size=800_600&devtype=web&v=1.0.1&rtick=14661273536626&sign=fabd0750ea471512fed0e2be83e612a2&[/img]
[img]http://api5.yunpan.360.cn/intf.php?method=File.getThumbByNid&qid=108635719&nid=14661242779484083&size=800_600&devtype=web&v=1.0.1&rtick=14661273539268&sign=e407cb0902d92bc067476cc736d198cd&[/img]
[color=red][b]头文件[/b][/color]

//CompositePattern.h

#ifndef COMPOSITE_PATTERN_H
#define COMPOSITE_PATTERN_H

#include <Windows.h>
#include <iostream>
#include <string>
#include <vector>
using namespace std;

namespace CompositePattern
{
//
//
class Component
{
public:
Component(string name);
virtual ~Component();
virtual void Operation() = 0;
virtual void Add(Component *) = 0;
virtual void Remove(Component *) = 0;
virtual Component *GetChild(int) = 0;
virtual string GetName();
virtual void Print() = 0;
protected:
string m_strCompname;
};

class Leaf : public Component
{
public:
Leaf(string name);
virtual void Operation();
virtual void Add(Component *pComponent);
virtual void Remove(Component *pComponent);
virtual Component *GetChild(int index);
virtual void Print();
};
class Composite : public Component
{
public:
Composite(string name);
virtual ~Composite();
virtual void Operation();
virtual void Add(Component *pComponent);
virtual void Remove(Component *pComponent);
virtual Component *GetChild(int index);
virtual void Print();

private:
vector<Component*> m_vecComp;
};

//
void CompositePattern_Test();
}

#endif


[color=red][b]实现[/b][/color]

#include "CompositePattern.h"
#include <iostream>
using namespace std;

namespace CompositePattern
{
//
Component::Component(string name)
: m_strCompname(name)
{ }

Component::~Component(){}

//
string Component::GetName()
{
return m_strCompname;
}

Leaf::Leaf(string name) : Component(name)
{}
void Leaf::Operation()
{
cout<<"I'm "<<m_strCompname<<endl;
}
void Leaf::Add(Component *pComponent){}
void Leaf::Remove(Component *pComponent){}
Component* Leaf::GetChild(int index)
{
return NULL;
}
void Leaf::Print(){}


//
Composite::Composite(string name)
: Component(name)
{}

Composite::~Composite()
{
vector<Component *>::iterator it = m_vecComp.begin();
while (it != m_vecComp.end())
{
if (*it != NULL)
{
cout<<"----delete "<<(*it)->GetName()<<"----"<<endl;
delete *it;
*it = NULL;
}
m_vecComp.erase(it);
it = m_vecComp.begin();
}
}
void Composite::Operation()
{
cout<<"I'm "<<m_strCompname<<endl;
}
void Composite::Add(Component *pComponent)
{
m_vecComp.push_back(pComponent);
}
void Composite::Remove(Component *pComponent)
{
for (vector<Component *>::iterator it = m_vecComp.begin(); it != m_vecComp.end(); ++it)
{
if ((*it)->GetName() == pComponent->GetName())
{
if (*it != NULL)
{
delete *it;
*it = NULL;
}
m_vecComp.erase(it);
break;
}
}
}
Component* Composite::GetChild(int index)
{
if (index > m_vecComp.size())
{
return NULL;
}
return m_vecComp[index - 1];
}
void Composite::Print()
{
for (vector<Component *>::iterator it = m_vecComp.begin(); it != m_vecComp.end(); ++it)
{
cout<<(*it)->GetName()<<endl;
}
}


//
void CompositePattern_Test()
{
Component *pNode = new Composite("Beijing Head Office");
Component *pNodeHr = new Leaf("Beijing Human Resources Department");
Component *pSubNodeSh = new Composite("Shanghai Branch");
Component *pSubNodeCd = new Composite("Chengdu Branch");
Component *pSubNodeBt = new Composite("Baotou Branch");
pNode->Add(pNodeHr);
pNode->Add(pSubNodeSh);
pNode->Add(pSubNodeCd);
pNode->Add(pSubNodeBt);
pNode->Print();
Component *pSubNodeShHr = new Leaf("Shanghai Human Resources Department");
Component *pSubNodeShCg = new Leaf("Shanghai Purchasing Department");
Component *pSubNodeShXs = new Leaf("Shanghai Sales department");
Component *pSubNodeShZb = new Leaf("Shanghai Quality supervision Department");
pSubNodeSh->Add(pSubNodeShHr);
pSubNodeSh->Add(pSubNodeShCg);
pSubNodeSh->Add(pSubNodeShXs);
pSubNodeSh->Add(pSubNodeShZb);
pNode->Print();

// 公司不景气,需要关闭上海质量监督部门
pSubNodeSh->Remove(pSubNodeShZb);
if (pNode != NULL)
{
delete pNode;
pNode = NULL;
}
}
}


[color=red][b]客户端[/b][/color]

#include "CompositePattern.h"


#include <iostream>
using namespace std;
using namespace CompositePattern;

void main()
{
CompositePattern_Test();
}

[color=red][b]运行结果[/b][/color]
[img]http://api5.yunpan.360.cn/intf.php?method=File.getThumbByNid&qid=108635719&nid=14661273539458364&size=800_600&devtype=web&v=1.0.1&rtick=14661273536102&sign=57f18e16003114a4041dab091cdf5b1e&[/img]
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值