new method for cleanup

Author: Apmds

include/billboard.h

@@ -5,15 +5,16 @@
 #include "raylib.h"
 
 typedef struct billboard* Billboard;
+typedef const struct billboard* CBillboard;
 
 Billboard BillboardCreate(Texture sprite, int posX, int posY, int size);
 void BillboardDestroy(Billboard* bp);
 
-Texture BillboardGetTexture(const struct billboard* bb);
+Texture BillboardGetTexture(CBillboard bb);
 
-int BillboardGetX(const struct billboard* bb);
-int BillboardGetY(const struct billboard* bb);
-int BillboardGetSize(const struct billboard* bb);
+int BillboardGetX(CBillboard bb);
+int BillboardGetY(CBillboard bb);
+int BillboardGetSize(CBillboard bb);
 
 void BillboardSetX(Billboard bb, int posX);
 void BillboardSetY(Billboard bb, int posY);

include/hashmap.h

@@ -4,7 +4,9 @@
 #define HASHMAP_H
 
 typedef struct hashmap* HashMap;
+typedef const struct hashmap* CHashMap;
 typedef struct hashmapi* HashMapIterator;
+typedef const struct hashmapi* CHashMapIterator;
 
 
 // Creates a HashMap (hashFunc is the function used fir hashing the key)
@@ -15,22 +17,22 @@ void HashMapDestroy(HashMap* mapp);
 
 
 // Puts an item in the HashMap, returning whether or not it was successful
-bool HashMapPut(HashMap map, void* key, void* value);
+bool HashMapPut(CHashMap map, void* key, void* value);
 
 // Returns an item from the HashMap
-void* HashMapGet(const struct hashmap* map, void* key);
+void* HashMapGet(CHashMap map, void* key);
 
 // Returns whether or not the HashMap contains a value for the given key
-bool HashMapContains(const struct hashmap* map, void* key);
+bool HashMapContains(CHashMap map, void* key);
 
 // Removes an item from the HashMap, returning whether or not it was successful
-bool HashMapRemove(const struct hashmap* map, void* key);
+bool HashMapRemove(CHashMap map, void* key);
 
 // Removes an item from the HashMap, returning it
-void* HashMapPop(const struct hashmap* map, void* key);
+void* HashMapPop(CHashMap map, void* key);
 
 // Prints the map in usual format. printFunc (optional) prints the item correctly)
-void HashMapPrint(const struct hashmap* map, bool newline, void (*printFunc) (void* key, void* value));
+void HashMapPrint(CHashMap map, bool newline, void (*printFunc) (void* key, void* value));
 
 
 // Iterating functions
@@ -44,13 +46,13 @@ void HashMapIterDestroy(HashMapIterator* iterp);
 bool HashMapIterGoToNext(HashMapIterator iter);
 
 // Returns whether or not its safe to operate in the current element
-bool HashMapIterCanOperate(const struct hashmapi* iter);
+bool HashMapIterCanOperate(CHashMapIterator iter);
 
 // Returns the current key the iterator is in
-void* HashMapIterGetCurrentKey(HashMapIterator iter);
+void* HashMapIterGetCurrentKey(CHashMapIterator iter);
 
 // Returns the current value the iterator is in
-void* HashMapIterGetCurrentValue(HashMapIterator iter);
+void* HashMapIterGetCurrentValue(CHashMapIterator iter);
 
 
 #endif

include/list.h

@@ -5,6 +5,7 @@
 
 // List type. Pointers stored inside the list are not freed when removing them or destroying the list.
 typedef struct list* List;
+typedef const struct list* CList;
 
 // Creates a List. printFunc (optional) prints an item from the list)
 List ListCreate(void (*printFunc) (void* item));
@@ -62,15 +63,15 @@ void ListMoveToEnd(List list);
 void* ListGetCurrent(List list);
 
 // Returns whether or not the list has a next element
-bool ListHasNext(const struct list* list);
+bool ListHasNext(CList list);
 
 // Returns whether or not its safe to operate in the current list node
-bool ListCanOperate(const struct list* list);
+bool ListCanOperate(CList list);
 
 // Prints the list in the usual format. printFunc (optional) prints the item correctly)
 void ListPrint(List list, bool newline, void (*printFunc) (void* item));
 
 // Returns the size of the list
-int ListGetSize(const struct list* list);
+int ListGetSize(CList list);
 
 #endif

src/billboard.c

@@ -34,25 +34,25 @@ void BillboardDestroy(Billboard* bbp) {
     *bbp = NULL;
 }
 
-Texture BillboardGetTexture(const struct billboard* bb) {
+Texture BillboardGetTexture(CBillboard bb) {
     assert(bb != NULL);
 
     return bb->sprite;
 }
 
-int BillboardGetX(const struct billboard* bb) {
+int BillboardGetX(CBillboard bb) {
     assert(bb != NULL);
 
     return bb->posX;
 }
 
-int BillboardGetY(const struct billboard* bb) {
+int BillboardGetY(CBillboard bb) {
     assert(bb != NULL);
 
     return bb->posY;
 }
 
-int BillboardGetSize(const struct billboard* bb) {
+int BillboardGetSize(CBillboard bb) {
     assert(bb != NULL);
 
     return bb->size;

src/hashmap.c

@@ -74,7 +74,7 @@ void HashMapDestroy(HashMap* mapp) {
 
 
 // Puts an item in the HashMap, returning whether or not it was successful
-bool HashMapPut(HashMap map, void* key, void* value) {
+bool HashMapPut(CHashMap map, void* key, void* value) {
     assert(map != NULL);
     assert(key != NULL);
 
@@ -118,7 +118,7 @@ bool HashMapPut(HashMap map, void* key, void* value) {
 }
 
 // Returns an item from the HashMap
-void* HashMapGet(const struct hashmap* map, void* key) {
+void* HashMapGet(CHashMap map, void* key) {
     assert(map != NULL);
     assert(key != NULL);
 
@@ -148,14 +148,14 @@ void* HashMapGet(const struct hashmap* map, void* key) {
 }
 
 // Returns whether or not the HashMap contains a value for the given key
-bool HashMapContains(const struct hashmap* map, void* key) {
+bool HashMapContains(CHashMap map, void* key) {
     assert(map != NULL);
 
     return HashMapGet(map, key) != NULL;
 }
 
 // Removes an item from the HashMap, returning whether or not it was successful
-bool HashMapRemove(const struct hashmap* map, void* key) {
+bool HashMapRemove(CHashMap map, void* key) {
     assert(map != NULL);
 
     // Get list index
@@ -187,7 +187,7 @@ bool HashMapRemove(const struct hashmap* map, void* key) {
 }
 
 // Removes an item from the HashMap, returning it
-void* HashMapPop(const struct hashmap* map, void* key) {
+void* HashMapPop(CHashMap map, void* key) {
     assert(map != NULL);
 
     // Get list index
@@ -219,7 +219,7 @@ void* HashMapPop(const struct hashmap* map, void* key) {
 }
 
 // Prints the map in usual format. printFunc (optional) prints the item correctly)
-void HashMapPrint(const struct hashmap* map, bool newline, void (*printFunc) (void* key, void* value)) {
+void HashMapPrint(CHashMap map, bool newline, void (*printFunc) (void* key, void* value)) {
     assert(map != NULL);
 
     if (printFunc == NULL) {
@@ -291,7 +291,7 @@ bool HashMapIterGoToNext(HashMapIterator iter) {
         return false;
     }
 
-    List currentList = iter->map->values[iter->currIdxList];
+    CList currentList = iter->map->values[iter->currIdxList];
 
     // If is at end of current list, go to next
     if (++iter->currIdxKey >= ListGetSize(currentList)) {
@@ -304,7 +304,7 @@ bool HashMapIterGoToNext(HashMapIterator iter) {
 }
 
 // Returns whether or not its safe to operate in the current element
-bool HashMapIterCanOperate(const struct hashmapi* iter) {
+bool HashMapIterCanOperate(CHashMapIterator iter) {
     assert(iter != NULL);
     assert(iter->map != NULL);
 
@@ -313,15 +313,15 @@ bool HashMapIterCanOperate(const struct hashmapi* iter) {
 }
 
 // Returns the current key the iterator is in
-void* HashMapIterGetCurrentKey(HashMapIterator iter) {
+void* HashMapIterGetCurrentKey(CHashMapIterator iter) {
     assert(iter != NULL);
     assert(iter->map != NULL);
 
     return HashMapIterCanOperate(iter) ? ((HashMapElement) ListGet(iter->map->values[iter->currIdxList], iter->currIdxKey))->key : NULL;
 }
 
 // Returns the current value the iterator is in
-void* HashMapIterGetCurrentValue(HashMapIterator iter) {
+void* HashMapIterGetCurrentValue(CHashMapIterator iter) {
     assert(iter != NULL);
     assert(iter->map != NULL);
 

src/linkedlist.c

@@ -398,14 +398,14 @@ void* ListGetCurrent(List list) {
 }
 
 // Returns whether or not the list has a next element
-bool ListHasNext(const struct list* list) {
+bool ListHasNext(CList list) {
     assert(list != NULL);
 
     return list->currentNode->nextNode != NULL;
 }
 
 // Returns whether or not its safe to operate in the current list node
-bool ListCanOperate(const struct list* list) {
+bool ListCanOperate(CList list) {
     assert(list != NULL);
 
     return list->currentNode != NULL;
@@ -449,7 +449,7 @@ void ListPrint(List list, bool newline, void (*printFunc) (void* item)) {
     }
 }
 
-int ListGetSize(const struct list* list) {
+int ListGetSize(CList list) {
     assert(list != NULL);
 
     return list->size;