Refactored putEntry method to return index

src/main.c

@@ -12,16 +12,16 @@ int main(int argc, char *argv[]) {
         return 1;
     }
 
-    int8_t put_result = putEntry(&c, (cache_entry){ .ttl = 100, .value = 42 });
-    if (put_result == -1) {
+    uint32_t index = putEntry(&c, (cache_entry){ .ttl = 100, .value = 42 });
+    if (index == -1) {
         printf("Unable to put entry into cache\n");
         free(c.entries);
         return 1;
     }
 
-    cache_entry* returned = getEntry(&c, 0);
+    cache_entry* returned = getEntry(&c, index);
     if (returned == NULL) {
-        printf("Could not get entry at index 0 from cache\n");
+        printf("Could not get entry at index %d from cache\n", index);
         free(c.entries);
         return 1;
     }

src/structure/cache.c

@@ -9,15 +9,15 @@ cache_entry* getEntry(cache* ptr, uint32_t index) {
     return &ptr->entries[index];
 }
 
-int8_t putEntry(cache* ptr, cache_entry entry) {
+uint32_t putEntry(cache* ptr, cache_entry entry) {
     if (ptr == NULL
         || ptr->count >= ptr->allocatedSize
         || ptr->entries == NULL
         || ptr->entries == MAP_FAILED) {
         return -1;
     }
     ptr->entries[ptr->count++] = entry;
-    return 0;
+    return ptr->count - 1;
 }
 
 void* allocateEntries(cache* ptr, size_t size) {

src/structure/cache.h

@@ -16,7 +16,7 @@ typedef struct {
 } cache;
 
 cache_entry* getEntry(cache* ptr, uint32_t index);
-int8_t putEntry(cache* ptr, cache_entry entry);
+uint32_t putEntry(cache* ptr, cache_entry entry);
 
 void* allocateEntries(cache* ptr, size_t count);
 int8_t freeEntries(cache* ptr);