【头文件】
#ifndef MYVECTOR_H
#define MYVECTOR_H
#include <iostream>
using namespace std;
template <class T>
class MyVector {
private:
T* data;
size_t Size;
size_t Capacity;
public:
MyVector() {
Size = 0;
Capacity = 100;
data = new T[Capacity];
}
~MyVector() {
Size = Capacity = 0;
delete[]data;
data = nullptr;
}
T operator [] (const unsigned int index) {
return data[index];
}
void push_back(const T m_data) {
if (Size == Capacity) {
T* tmp = new T[Capacity * 2];
memcpy(tmp, data, Capacity * sizeof(T));
delete data;
data = tmp;
Capacity *= 2;
}
data[Size++] = m_data;
}
void pop_back() { --Size; }
size_t size() { return Size; }
size_t capacity() { return Capacity; }
public:
class Iterator {
private:
T* it;
public:
Iterator() { it = nullptr; }
Iterator(T* m_it) { it = m_it; }
~Iterator() { it = nullptr; }
Iterator operator = (const Iterator m_it){
it = m_it.it;
return *this;
}
void operator ++ () { it = it + 1; }
bool operator == (const Iterator m_it) {
return it == m_it.it;
}
bool operator != (const Iterator m_it) {
return it != m_it.it;
}
T operator * () { return *it; }
};
Iterator begin() {
return Iterator(&data[0]);
}
Iterator end() {
return Iterator(&data[Size]);
}
};
#endif
【演示文件】
#include "MyVector.h"
using namespace std;
int main() {
MyVector<int> v;
for (int i = 0; i < 300; ++i) v.push_back(i);
for (MyVector<int>::Iterator it = v.begin();it != v.end() ; ++it) {
cout << *it << endl;
}
return 0;
}
【运行结果】
欢迎指正