组合模式听说去很玄乎,其实也并不复杂。为什么?大家可以先想一下数据结构里面的二叉树是怎么回事。为什么就是这么一个简单的二叉树节点既可能是叶节点,也可能是父节点?
- typedef struct _NODE
- {
- void* pData;
- struct _NODE* left;
- struct _NODE* right;
- }NODE;
- typedef struct _Object
- {
- struct _Object** ppObject;
- int number;
- void (*operate)(struct _Object* pObject);
- }Object;
- void operate_of_parent(struct _Object* pObject)
- {
- int index;
- assert(NULL != pObject);
- assert(NULL != pObject->ppObject && 0 != pObject->number);
- for(index = 0; index < pObject->number; index ++)
- {
- pObject->ppObject[index]->operate(pObject->ppObject[index]);
- }
- }
- void operate_of_child(struct _Object* pObject)
- {
- assert(NULL != pObject);
- printf("child node!\n");
- }
- void process(struct Object* pObject)
- {
- assert(NULL != pObject);
- pObject->operate(pObject);
- }