added unordered euals to doublyll

Author: Levi-B4

DSAdjList/dsadjlist.h

@@ -117,6 +117,8 @@ DSDoublyLL<T> DSAdjList<T>::GetConnectedNodes(T nodeData){
             return output;
         }
     }
+
+    return DSDoublyLL<T>();
 }
 
 /**
@@ -201,7 +203,7 @@ bool DSAdjList<T>::contains(T query)
  */
 template <class T>
 DSAdjList<T>& DSAdjList<T>::operator=(const DSAdjList<T>& other){
-    data = other.list;
+    data = other.data;
 }
 
 /**

DSDoublyLL/dsdoublyll.h

@@ -155,6 +155,8 @@ class DSDoublyLL{
      */
     int size() const;
 
+    bool unorderedEquals(const DSDoublyLL<T>& other) const;
+
     /**
      * @brief DSDoublyLL::operator [] - returns data at passed index
      * @param index - index to retrieve data
@@ -560,6 +562,49 @@ int DSDoublyLL<T>::size() const
     return numIndexes;
 }
 
+template<class T>
+bool DSDoublyLL<T>::unorderedEquals(const DSDoublyLL<T> &other) const
+{
+    if(numIndexes != other.numIndexes){
+        return false;
+    }
+
+    if(numIndexes == 0){
+        return true;
+    }
+
+    DSDoublyLL<T> temp = other;
+
+    // iterate through list1
+
+    // if index is in list 2 itterate list 1 and remove from list 2
+
+    for(DSNode<T>* i = head; i != nullptr; i = i->next){
+        DSNode<T>* match = nullptr;
+
+        for(DSNode<T>* j = temp.head; j != nullptr; j = j->next){
+            if(i->data == j->data){
+                match = j;
+                break;
+            }
+        }
+
+        if(match == nullptr){
+            return false;
+        }
+
+        if(match == temp.head){
+            temp.head = match->next;
+        } else{
+            match->prev->next = match->next;
+        }
+
+        delete match;
+    }
+
+    return true;
+}
+
 /**
  * @brief DSDoublyLL::operator [] - returns data of node at passed index
  * @param index - index to retrieve data

test.cpp

@@ -282,15 +282,13 @@ TEST_CASE("Data_Structures_Doubly_Linked_List", "[Doubly_Linked_List][Data_Struc
     int arr2StartSize = 3;
     const int intArray3[6] = {0, 1, 2, 3, 4, 5};
     int arr3StartSize = 6;
-
-    const int intArray4[3] = {1,2,4};
+    const int intArray4[3] = {1, 2, 4};
     int arr4StartSize = 3;
+    const int intArray5[6] = {4, 5, 3, 2, 1, 0};
+    int arr5StartSize = 6;
 
-    DSDoublyLL<int> numList1;
+    DSDoublyLL<int> numList1, numList2, numList3, numList4, numList5;
     DSDoublyLL<int> numList1Copy;
-    DSDoublyLL<int> numList2;
-    DSDoublyLL<int> numList3;
-    DSDoublyLL<int> numList4;
 
     for(int element : intArray1){
         numList1.pushBack(element);
@@ -303,6 +301,7 @@ TEST_CASE("Data_Structures_Doubly_Linked_List", "[Doubly_Linked_List][Data_Struc
 
     numList3 = DSDoublyLL<int>(intArray3, arr3StartSize);
     numList4 = DSDoublyLL<int>(intArray4, arr4StartSize);
+    numList5 = DSDoublyLL<int>(intArray5, arr5StartSize);
 
 
     SECTION("Comparison Operators"){
@@ -317,6 +316,8 @@ TEST_CASE("Data_Structures_Doubly_Linked_List", "[Doubly_Linked_List][Data_Struc
         numList1 = numList1Copy;
 
         REQUIRE(numList1 != numList2);
+
+        REQUIRE(numList3.unorderedEquals(numList5));
     }
 
     SECTION("indexing"){