#include #include #include #include template class Vector { public: Vector(const std::size_t size = 5); Vector(const Vector& v); Vector(Vector&& v); ~Vector(); void push_back(const T& value); void pop_back(); void insert(const std::size_t& index, const T& value); void reserve(const std::size_t& size); inline std::size_t length() const; inline std::size_t capacity() const; inline std::size_t getRate() const; inline void setRate(const std::size_t& rate); inline bool isEmpty() const; T& operator[](const std::size_t& index) const; Vector& operator=(const Vector& v); Vector& operator=(Vector&& v); private: std::size_t size; //capacity of v std::size_t count; //count of added elements std::size_t rate; // how much to allocate memory, when the current volume will not be enough T *arr; //heart of vector template friend std::ostream& operator<<(std::ostream& out, const Vector& v); }; int main() { using std::cout; using std::endl; try { Vector v(7); for(int i = 0; i < 9; i++) { v.push_back(i); } cout << "Vector: " << v << endl; cout << "Capacity: " << v.capacity() << endl; cout << "Length : " << v.length() << endl << endl; cout << "Insert some values..." << endl << endl; v.insert(7, 10); v.insert(2, 20); v.insert(4, 15); cout << "Vector: " << v << endl; cout << "Capacity: " << v.capacity() << endl; cout << "Length : " << v.length() << endl << endl; Vector v2(Vector(5)); cout << "Vector created by move-constructor" << endl; for(std::size_t i = 0; i < v2.length(); i++) { cout << v2[i] << " "; } cout << endl << endl; } catch(const char *msg) { cout << msg << endl; } return 0; } //public members { template Vector::Vector(const std::size_t size) :size(size), count(0), rate(5) { arr = new T[size]; } template Vector::Vector(const Vector& v) :size(v.size), count(v.count), rate(v.rate) { arr = new T[size]; memmove(arr, v.arr, sizeof(T) * count); } template Vector::Vector(Vector&& v) :size(v.size), count(v.count), rate(v.rate) { arr = v.arr; v.arr = nullptr; } template Vector::~Vector() { delete[] arr; arr = nullptr; } template void Vector::push_back(const T& value) { if(count == size) { reserve(size + rate); } arr[count++] = value; } template void Vector::pop_back() { if(!count) { return; } count--; } template void Vector::insert(const std::size_t& index, const T& value) { if(index >= count || index < 0) { throw "Incorrect index!"; } if(count == size) { reserve(size + rate); } for(std::size_t i = count - 1; i >= index; i--) { arr[i + 1] = arr[i]; } arr[index] = value; count++; } template void Vector::reserve(const std::size_t& size) { if(size <= 0) { return; } this->size = size; T *new_arr = new T[size]; memmove(new_arr, arr, sizeof(T) * count); delete arr; arr = new_arr; } template inline std::size_t Vector::length() const { return count; } template inline std::size_t Vector::capacity() const { return size; } template inline std::size_t Vector::getRate() const { return rate; } template inline void Vector::setRate(const std::size_t& rate) { if(rate <= 0) { return; } this->rate = rate; } template inline bool Vector::isEmpty() const { return !count; } template T& Vector::operator[](const std::size_t& index) const { if(index >= count) { throw std::out_of_range("Index out of range!"); } return arr[index]; } template Vector& Vector::operator=(const Vector& v) { if(this == &v) { return *this; } size = v.size; count = v.count; rate = v.rate; delete[] arr; arr = new T[size]; memmove(arr, v.arr, count * sizeof(T)); return *this; } template Vector& Vector::operator=(Vector&& v) { if(this == &v) { return *this; } size = v.size; count = v.count; rate = v.rate; arr = v.arr; v.arr = nullptr; return *this; } //} public members //friends { template std::ostream& operator<<(std::ostream& out, const Vector& v) { for(std::size_t i = 0; i < v.length(); i++) { out << v[i] << " "; } return out; } //} friends

Vector class template