update Vector.h

Author: bitdove

README.md

@@ -22,11 +22,11 @@ Remember that each data has its own trade-offs. And you need to pay attention mo
 `B` - Beginner, `A` - Advanced
 
 * `B` [Array](data-structures/Array)
-  * `B` [Static Array](data-structures/Array/include/Array.h)
-  * `B` [Dynamic Array](data-structures/Array/include/Vector.h)
+  * `B` Static Array
+  * `B` Dynamic Array
 * `B` [Linked List](data-structures/LinkedList)
-  * `B` [Singly Linked List](data-structures/LinkedList/include/SinglyLinkedList.h)
-  * `B` [Doubly Linked List](data-structures/LinkedList/include/DoublyLinkedList.h)
+  * `B` Singly Linked List
+  * `B` Doubly Linked List
 * `B` [Queue](data-structures/Queue)
 * `B` [Stack](data-structures/Stack)
 

README.zh-CN.md

@@ -19,8 +19,11 @@
 `B` - 初学者， `A` - 进阶
 
 * `B` [数组](data-structures/Array)
-* `B` [单链表](data-structures/LinkedList)
-* `B` [双链表](data-structures/DoublyLinkedList)
+  * `B` 静态数组
+  * `B` 动态数组
+* `B` [链表](data-structures/LinkedList)
+  * `B` 单向链表
+  * `B` 双向链表
 * `B` [队列](data-structures/Queue)
 * `B` [栈](data-structures/Stack)
 

data-structures/Array/README.md

@@ -1,3 +1,5 @@
 # 数组
 
-![数组](./assets/array.png)
+![数组](./assets/array.png)
+
+![Vector](./assets/vector.png)

data-structures/Array/__test__/test_Array.cpp

@@ -1,8 +1,10 @@
-#include "../include/Array.h"
 #include <cassert>
 #include <iostream>
+#include "../include/Array.h"
+#include "../include/Vector.h"
 
-void test_array() {
+void test_array(){
+  std::cout << "*****Array Test Begin*****" << std::endl;
   Array<int, 0> arr_0;
   assert(arr_0.size() == 0);
   assert(arr_0.empty() == true);
@@ -41,9 +43,20 @@ void test_array() {
   }
   std::cout << std::endl;
   std::cout << "All tests passed!" << std::endl;
+  std::cout << "*****Array Test End*****" << std::endl;
+}
+
+void test_vector(){
+  std::cout << "*****Vector Test Begin*****" << std::endl;
+
+
+
+  std::cout << "*****Vector Test End*****" << std::endl;
 }
 
 int main() {
   test_array();
+  std::cout << std::endl;
+  test_vector();
   return 0;
 }

data-structures/Array/assets/vector.png

@@ -1,5 +1,129 @@
 #ifndef VECTOR_H
 #define VECTOR_H
 
+#include <cstddef>
+#include <stdexcept>
+
+template <typename T>
+class Vector{
+  public:
+    Vector();
+    Vector(size_t N);
+    Vector(size_t N, const T& value);
+    ~Vector();
+  public:
+    // Capacity
+    bool empty() const {return _start == _finish;}
+    size_t size() const {return static_cast<size_t>(_finish - _start);};
+    size_t capacity() const {return static_cast<size_t>(_end_of_storage - _start);};
+    void shrink_to_fit();
+    // Element access
+    T& front();
+    T& back();
+    T& at(const size_t index);
+    T& operator[](const size_t index);
+    // Modifiers
+    void clear();
+    void resize(const size_t count);
+    void insert(const size_t index);
+    void erase(const size_t index);
+    void push_back(const T &value);
+    void pop_back();
+  private:
+    void _reallocate(const size_t new_capacity);
+  private:
+    T *_start;
+    T *_finish;
+    T *_end_of_storage;
+};
+
+//Constructor and Destructor
+template <typename T>
+Vector<T>::Vector(){
+  _start = nullptr;
+  _finish = nullptr;
+  _end_of_storage = nullptr;
+}
+
+template <typename T>
+Vector<T>::Vector(size_t N){
+  if(N > 0){
+    _start = new T[N];
+    _finish = _start;
+    _end_of_storage = _start + N;
+  }
+  else{
+    _start = nullptr;
+    _finish = nullptr;
+    _end_of_storage = nullptr;
+  }
+}
+
+template <typename T>
+Vector<T>::Vector(size_t N, const T &value){
+  if(N > 0){
+    _start = new T[N];
+    _finish = _start + N;
+    _end_of_storage = _finish;
+    for(size_t i = 0; i < N; ++i){
+      _start[i] = value;
+    }
+  }
+  else{
+    _start = nullptr;
+    _finish = nullptr;
+    _end_of_storage = nullptr;
+  }
+}
+
+template <typename T>
+Vector<T>::~Vector(){
+  delete[] _start;
+  _start = nullptr;
+  _finish = nullptr;
+  _end_of_storage = nullptr;
+}
+
+template <typename T>
+void Vector<T>::shrink_to_fit(){
+  if(_finish == _end_of_storage){
+    return;
+  }
+  while(_end_of_storage != _finish){
+    T* del = _end_of_storage - 1;
+    delete del;
+    --_end_of_storage;
+  }
+}
+
+// Elements access
+template <typename T>
+T& Vector<T>::front(){
+  if(_start == _finish){
+    throw std::underflow_error("front(): This Vector is empty.");
+  }
+  return _start[0];
+}
+
+template <typename T>
+T &Vector<T>::back(){
+  if(_start == _finish){
+    throw std::underflow_error("back(): This Vector is empty.");
+  }
+  return *(_finish - 1);  
+}
+
+template <typename T>
+T &Vector<T>::at(const size_t index){
+  if(index >= size()){
+    throw std::out_of_range("at(): Index out of range.");
+  }
+  return _start[index];
+}
+
+template <typename T>
+T& Vector<T>::operator[](const size_t index){
+  return _start[index];
+}
 
 #endif // VECTOR_H