#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
using namespace std;
#include <string>
//容器
template <class T>
class MyArr
{
int m_Capacity;
int m_Size;
T*t;
public:
typedef T* iterator;
MyArr()
{
m_Capacity = 10;
m_Size = 10;
t = new T[m_Capacity];
for (int i = 0; i < m_Capacity; i++)
{
t[i] = i + 1;
}
}
//迭代器
T* begin()
{
return t;
}
T* end()
{
return t + m_Size - 1;
}
};
//算法
template <class T>
void printMyArr(T begin,T end)
{
for (;begin<=end;begin++)
{
cout << *begin << endl;
}
}
void test()
{
MyArr<int>arr;
MyArr<int>::iterator begin = arr.begin();
MyArr<int>::iterator end = arr.end();
printMyArr(begin, end);
}
int main()
{
test();
system("pause");
return 0;
}
STL原理
最新推荐文章于 2022-08-07 14:49:24 发布