Ensure that all provided data structures are standalone and do not require the rest...

diff --git a/.gitignore b/.gitignore
index be55fce347f67146f116782210cf8748b02d67cf..a39158efa92bac6da4b3ca1fc42b21a78b9fc07f 100644 (file)
--- a/.gitignore
+++ b/.gitignore
@@ -33,3 +33,6 @@
 .rsconscache
 test_libc
 test_libc.exe
+*.d
+.ninja_deps
+.ninja_log

diff --git a/source/data/bstree.c b/source/data/bstree.c
index 2ba4eeb9c754ece30e646341711890a193cf13df..882cd91536ea0dd4e309a059f09d22221aa3d5d3 100644 (file)
--- a/source/data/bstree.c
+++ b/source/data/bstree.c
@@ -1,5 +1,7 @@
 #include <data/bstree.h>
 
+
+
 void bstree_init(bstree_t* tree, bstree_cmpfn_t cmpfn, bool allow_dups)
 {
     tree->root = NULL;

diff --git a/source/data/bstree.h b/source/data/bstree.h
index 0c029ce004c5da58607831adccdb1fe9a284c501..c8cbd889fd744f1eff73eb09c98ee06b812c1f7f 100644 (file)
--- a/source/data/bstree.h
+++ b/source/data/bstree.h
@@ -4,7 +4,8 @@
 #ifndef BSTREE_H
 #define BSTREE_H
 
-#include <carl.h>
+#include <stddef.h>
+#include <stdbool.h>
 
 typedef struct bstree_node_t {
     struct bstree_node_t* left;

diff --git a/source/data/list.h b/source/data/list.h
index 6615891146cdf8b056f4e91933e1438001c77f31..544be636d7ece4d3c8dc9182d58f0fa1c2024263 100644 (file)
--- a/source/data/list.h
+++ b/source/data/list.h
@@ -4,7 +4,8 @@
 #ifndef LIST_H
 #define LIST_H
 
-#include <carl.h>
+#include <stddef.h>
+#include <stdbool.h>
 
 typedef struct list_node_t {
     struct list_node_t* next;

diff --git a/source/data/slist.h b/source/data/slist.h
index 19cbfd32e899669bbf47483d47e5b65267777681..b441e564c5c11be41cb173a05e0e664600bc6e05 100644 (file)
--- a/source/data/slist.h
+++ b/source/data/slist.h
@@ -4,7 +4,8 @@
 #ifndef SLIST_H
 #define SLIST_H
 
-#include <carl.h>
+#include <stddef.h>
+#include <stdbool.h>
 
 typedef struct slist_node_t {
     struct slist_node_t* next;

diff --git a/source/data/vec.c b/source/data/vec.c
index 1f2735245bd4976866737a4d6150a6070ed391d9..23374f79a083bb6f6644171e8877eea20643b4ae 100644 (file)
--- a/source/data/vec.c
+++ b/source/data/vec.c
@@ -2,6 +2,8 @@
   @file vec.c
 */
 #include <data/vec.h>
+#include <stdlib.h>
+#include <string.h>
 
 #ifndef DEFAULT_VEC_CAPACITY
 #define DEFAULT_VEC_CAPACITY (size_t)8

diff --git a/source/data/vec.h b/source/data/vec.h
index ce4a123c6b789843c73cc903307188b918b167e3..e9029476a1295c6d690542c57512168d6699ad25 100644 (file)
--- a/source/data/vec.h
+++ b/source/data/vec.h
@@ -4,7 +4,9 @@
 #ifndef VEC_H
 #define VEC_H
 
-#include <carl.h>
+#include <stddef.h>
+#include <stdbool.h>
+#include <stdint.h>
 
 typedef struct {
     size_t   elem_count;

diff --git a/tests/data/bstree.c b/tests/data/bstree.c
index f05a703e3d5d9aa36c911a6d10ecd444c3176ac1..dbf9be96bc7a9b99eeb027e56b9371cbaf4ef00b 100644 (file)
--- a/tests/data/bstree.c
+++ b/tests/data/bstree.c
@@ -4,6 +4,7 @@
 
 // File To Test
 #include <data/bstree.h>
+#include <carl.h>
 
 typedef struct {
     bstree_node_t node;