implemented insert function

Author: Levi-B4

DSDoublyLL/dsdoublyll.h

@@ -18,6 +18,13 @@ class DSDoublyLL{
      */
     DSDoublyLL(const T* data, const int size);
 
+    /**
+     * @brief DSDoublyLL - copy constructor
+     * @param other - reference of list to copy
+     */
+    DSDoublyLL(const DSDoublyLL<T>& other);
+
+
     /**
      * @brief getNumIndexes - Getter: numIndexes
      * @return numIndexes
@@ -146,6 +153,17 @@ DSDoublyLL<T>::DSDoublyLL(const T* data, const int size){
     }
 }
 
+/**
+ * @brief DSDoublyLL - copy constructor
+ * @param other - reference to the list to copy
+ */
+template <class T>
+DSDoublyLL<T>::DSDoublyLL(const DSDoublyLL& other){
+    for(DSNode<T>* n = other.head; n != nullptr; n = n->next){
+        pushBack(n->data);
+    }
+}
+
 
 /**
  * @brief getNumIndexes - Getter: numIndexes
@@ -214,21 +232,22 @@ void DSDoublyLL<T>::insert(int index, T data){
 
     //ToDo: throw an "index out of bounds" error
     DSNode<T>* current = head;
-    for(int count = 0; count < index - 1; current = current->next){
-        count++;
+    for(int i = 0; i < index - 1; i++){
+        current = current->next;
     }
 
-    if(current->next == nullptr){
-        tail = newNode;
-        current->next = newNode;
-        newNode->prev = current;
-    } else {
-        current->next->prev = newNode;
-        newNode->next = current->next;
+    newNode->next = current->next;
+    newNode->prev = current;
 
-        current->next = newNode;
-        newNode->prev = current;
+    current->next = newNode;
+
+    if(newNode->next == nullptr){
+        tail = newNode;
+    }else {
+        newNode->next->prev = newNode;
     }
+
+    numIndexes++;
 }
 
 /**

test.cpp

@@ -415,18 +415,16 @@ TEST_CASE("Data_Structures_Doubly_Linked_List", "[Doubly_Linked_List][Data_Struc
         numList4.insert(3, 3);
         numList4.insert(5, 5);
 
-        for (int i = 0; i < numList4.size(); i++) {
-            std::cout << "Element " << i << ": " << numList4[i] << std::endl;
-        }
+        REQUIRE(numList4 == numList3);
 
-        numList4.remove(5);
+        /*numList4.remove(5);
         numList4.remove(1);
         numList4.remove(0);
         numList4.remove(0);
 
         numList4.insert(2, 5);
 
-        REQUIRE(numList4 == numList2);
+        REQUIRE(numList4 == numList2);*/
     }
 
     SECTION("Other Operators"){