组合模式是一种树形递归结构code
在须要用到递归构建树形的组合结构,component
1.好比文件夹,文件夹里面能够有文件夹,文件,文件夹还能够有文件 文件夹递归
2.好比多级菜单
it
3.好比解析XML文件的时候
io
就可使用组合模式class
例1gc
class Component { public: virtual void Operation(){}; virtual void Add(Component *component){} virtual void Remove(Component *component){} virtual Component*GetChild(int index){ return nullptr; } }; class Leaf :public Component { virtual void Operation(){}; }; class Compsoite :public Component { public: virtual void Operation(){} virtual void Add(Component *component) { _queue.push_back(component); } virtual void Remove(Component *component) { auto iter = std::find(_queue.begin(), _queue.end(), component); if (iter != _queue.end()) { _queue.erase(iter); } } virtual Component*GetChild(int index) { return _queue[index]; } private: vector<Component*> _queue; }; int main(int argc, char *argv[]) { Compsoite* root = new Compsoite; auto leaf_1 = new Leaf; auto leaf_2 = new Leaf; auto tree_1 = new Compsoite; root->Add(leaf_1); root->Add(tree_1); root->Add(leaf_2); tree_1->Add(new Leaf); system("pause"); return 0; }
例2queue
Lite2D中的Node类im