Merge pull request #25 from Garz4/main

A
zoningorg · Apr 14, 2024 · 11f6393 · 11f6393
2 parents c4242a1 + f4009f9
commit 11f6393
Show file tree

Hide file tree

Showing 6 changed files with 21 additions and 17 deletions.
diff --git a/DataStructures/inc/array.h b/DataStructures/inc/array.h
@@ -26,8 +26,11 @@ typedef struct __zng_array {
   size_t size;
 } array;
 
+// Every new array needs to be deleted using delete_array(...).
 extern array* new_array(int value);
 
+extern void add_to_array(array*const arr, int value);
+
 extern void delete_array(array* arr);
 
 #endif // __ZNG_ARRAY_H__
diff --git a/DataStructures/inc/linked_list.h b/DataStructures/inc/linked_list.h
@@ -58,11 +58,11 @@ extern void reverse_linked_list(linked_list*const list);
 // By making a copy, deleting that copy is also necessary.
 extern linked_list* copy_linked_list(const linked_list*const list);
 
-extern bool equal_linked_list(
+extern bool are_equal_linked_list(
     const linked_list*const lhs, const linked_list*const rhs);
 
 extern void sort_linked_list(linked_list*const list);
 
-extern bool empty_linked_list(const linked_list*const list);
+extern bool is_empty_linked_list(const linked_list*const list);
 
 #endif // __ZNG_LINKED_LIST_H__
diff --git a/DataStructures/inc/sort_set.h b/DataStructures/inc/sort_set.h
@@ -20,7 +20,6 @@
 #define __ZNG_SORT_SET_H__
 
 #include <stdbool.h>
-#include <stdio.h>
 #include <stdlib.h>
 
 #include "memory.h"
@@ -48,4 +47,6 @@ extern bool exist_in_sort_set(const sort_set*const set, int target);
 
 extern void delete_sort_set(sort_set* list);
 
+extern bool is_empty_sort_set(const sort_set*const set);
+
 #endif // __ZNG_SORT_SET_H__
diff --git a/DataStructures/src/linked_list.c b/DataStructures/src/linked_list.c
@@ -16,9 +16,7 @@
  * https://github.com/zoningorg/zoning/blob/main/LICENSE
  */
 
-#include <stdbool.h>
 #include <stdio.h>
-#include <stdlib.h>
 
 #include "../inc/linked_list.h"
 #include "../inc/memory.h"
@@ -180,7 +178,7 @@ linked_list* copy_linked_list(const linked_list*const list) {
   return copy;
 }
 
-bool equal_linked_list(
+bool are_equal_linked_list(
     const linked_list*const lhs, const linked_list*const rhs) {
   if (lhs == NULL && rhs == NULL) {
     return true;
@@ -205,7 +203,7 @@ bool equal_linked_list(
 
 void sort_linked_list(linked_list*const list) {}
 
-inline bool empty_linked_list(const linked_list*const list) {
+inline bool is_empty_linked_list(const linked_list*const list) {
   return list == NULL
       || list->head == NULL
       || list->tail == NULL

diff --git a/DataStructures/src/sort_set.c b/DataStructures/src/sort_set.c
@@ -16,10 +16,6 @@
  * https://github.com/zoningorg/zoning/blob/main/LICENSE
  */
 
-#include <stdbool.h>
-#include <stdio.h>
-#include <stdlib.h>
-
 #include "../inc/memory.h"
 #include "../inc/sort_set.h"
 
@@ -71,3 +67,9 @@ void delete_sort_set(sort_set* set) {
 
   DEALLOCATE(set);
 }
+
+inline bool is_empty_sort_set(const sort_set*const set) {
+  return set == NULL ||
+         set->root == NULL ||
+         set->size == 0;
+}
diff --git a/DataStructures/test/linked_list_test.c b/DataStructures/test/linked_list_test.c
@@ -38,17 +38,17 @@ int main(void) {
 
   linked_list* list_copy = copy_linked_list(list);
 
-  EXPECT_TRUE(equal_linked_list(list, list));
-  EXPECT_TRUE(equal_linked_list(list, list_copy));
+  EXPECT_TRUE(are_equal_linked_list(list, list));
+  EXPECT_TRUE(are_equal_linked_list(list, list_copy));
   reverse_linked_list(list);
-  EXPECT_FALSE(equal_linked_list(list, list_copy));
+  EXPECT_FALSE(are_equal_linked_list(list, list_copy));
   reverse_linked_list(list_copy);
-  EXPECT_TRUE(equal_linked_list(list, list_copy));
-  EXPECT_TRUE(equal_linked_list(list_copy, list_copy));
+  EXPECT_TRUE(are_equal_linked_list(list, list_copy));
+  EXPECT_TRUE(are_equal_linked_list(list_copy, list_copy));
 
   erase_single_match_linked_list(list_copy, 3);
   EXPECT_FALSE(exist_in_linked_list(list_copy, 3));
-  EXPECT_FALSE(equal_linked_list(list, list_copy));
+  EXPECT_FALSE(are_equal_linked_list(list, list_copy));
 
   linked_list_node* node;
   int curr_element = last_element;