使用过C++的朋友大概对迭代器模式都不会太陌生。这主要是因为我们在编写代码的时候离不开迭代器,队列有迭代器,向量也有迭代器。那么,为什么要迭代器呢?这主要是为了提炼一种通用的数据访问方法。
比如说,现在有一个数据的容器,
- typedef struct _Container
- {
- int* pData;
- int size;
- int length;
- Interator* (*create_new_interator)(struct _Container* pContainer);
- int (*get_first)(struct _Container* pContainer);
- int (*get_last)(struct _Container* pContainer);
- }Container;
- typedef struct _Interator
- {
- void* pVector;
- int index;
- int(* get_first)(struct _Interator* pInterator);
- int(* get_last)(struct _Interator* pInterator);
- }Interator;
- int vector_get_first(struct _Container* pContainer)
- {
- assert(NULL != pContainer);
- return pContainer->pData[0];
- }
- int vector_get_last(struct _Container* pContainer)
- {
- assert(NULL != pContainer);
- return pContainer->pData[pContainer->size -1];
- }
- int vector_interator_get_first(struct _Interator* pInterator)
- {
- Container* pContainer;
- assert(NULL != pInterator && NULL != pInterator->pVector);
- pContainer = (struct _Container*) (pInterator->pVector);
- return pContainer ->get_first(pContainer);
- }
- int vector_interator_get_last(struct _Interator* pInterator)
- {
- Container* pContainer;
- assert(NULL != pInterator && NULL != pInterator->pVector);
- pContainer = (struct _Container*) (pInterator->pVector);
- return pContainer ->get_last(pContainer);
- }