#pragma once#include <list> // 組合中的抽象基類 class Component { public: Component(){} virtual ~Component(){} // 純虛函數,只提供接口,沒有默認的實現 virtual void Operation() = 0; // 虛函數,提供接口,有默認的實現就是什么都不做 virtual void Add(Component* pChild); virtual void Remove(Component* pChild); virtual Component* GetChild(int nIndex); }; // 派生自Component,是其中的葉子組件的基類 class Leaf : public Component { public: Leaf(){} virtual ~Leaf(){} virtual void Operation(); }; // 派生自Component,是其中的含有子件的組件的基類 class Composite : public Component { public: Composite(){} virtual ~Composite(); virtual void Operation(); virtual void Add(Component* pChild); virtual void Remove(Component* pChild); virtual Component* GetChild(int nIndex); private: // 采用list 容器去保存子組件 std::list<Component*> m_ListOfComponent; };
#include "StdAfx.h" #include "composite_impl.h"#include <iostream> #include <algorithm> /*--------------------- Component 成員函數的實現 ---------------------*/ void Component::Add(Component* pChild) { } void Component::Remove(Component* pChild) { } Component* Component::GetChild(int nIndex) { return NULL; } /*--------------------- Leaf 成員函數的實現 ---------------------*/ void Leaf::Operation() { std::cout << "Operation by leaf "<<this<<std::endl; } /*--------------------- Composite 成員函數的實現 ---------------------*/ Composite::~Composite() { for (std::list<Component*>::iterator iter = m_ListOfComponent.begin();iter != m_ListOfComponent.end(); ++iter) {delete *iter;} } void Composite::Add(Component* pChild) { m_ListOfComponent.push_back(pChild); } void Composite::Remove(Component* pChild) { std::list<Component*>::iterator iter = find(m_ListOfComponent.begin(), m_ListOfComponent.end(), pChild); if (m_ListOfComponent.end() != iter) { m_ListOfComponent.erase(iter); } } Component* Composite::GetChild(int nIndex) { if (nIndex <= 0 || nIndex > m_ListOfComponent.size()) return NULL; Component *pTmp = NULL;int index = 1;for (std::list<Component*>::iterator iter = m_ListOfComponent.begin();iter != m_ListOfComponent.end(); ++iter,++index) { if (index == nIndex){pTmp = *iter;break;}} return pTmp; } void Composite::Operation() { std::cout << "Operation by Composite "<<this<<std::endl; std::list<Component*>::iterator iter1, iter2; for (iter1 = m_ListOfComponent.begin(), iter2 = m_ListOfComponent.end(); iter1 != iter2; ++iter1) { (*iter1)->Operation(); } }
// Composite.cpp : 定義控制臺應用程序的入口點。 //#include "stdafx.h"#include "composite_impl.h" #include <stdlib.h> #include <iostream>//將對象組合成樹形結構以表示部分-整體”的層次結構。 //Composite 使得用戶對單個對象和組合對象的使用具有一致性。int _tmain(int argc, _TCHAR* argv[]) {Leaf *pLeaf1 = new Leaf(); Leaf *pLeaf2 = new Leaf(); Composite* pComposite = new Composite;std::cout<<"Add two Leaf"<<std::endl;pComposite->Add(pLeaf1); pComposite->Add(pLeaf2); pComposite->Operation(); std::cout<<"GetChild(index = 2)"<<std::endl;pComposite->GetChild(2)->Operation(); delete pComposite; system("pause");return 0; }

總結

以上是生活随笔為你收集整理的设计模式-结构型-组成的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。