Algorithm | Vector

 1 template<class T>
 2 class XVector {
 3 public:
 4     XVector(int cacheSize):cacheSize(cacheSize), count(0) {
 5         data = new T[cacheSize];
 6     }
 7     XVector():cacheSize(100), count(0) {
 8         data = new T[cacheSize];
 9     }
10 
11     ~XVector() { 
12         delete[] data;
13     }
14 
15     void push_back(T val) {
16         if (count >= cacheSize) {
17             cacheSize <<= 1;
18             T* copy = new T[cacheSize];
19             memcpy(copy, data, sizeof(T) * count);
20             delete[] data;
21             data = copy;
22         }
23         data[count++] = val;
24     }
25 
26     void pop_back() {
27         count--;
28     }
29 
30     int size() const {
31         return count;
32     }
33 
34     T& operator[](int index) {
35         //return const_cast<T&>(operator[](index));
36         return const_cast<T&>((static_cast<const XVector<T>&>(*this))[index]);
37     }
38     
39     const T& operator[](int index) const {
40         return data[index];
41     }
42 
43 private:
44     int count;
45     int cacheSize;
46     T *data;
47 };