refactored code from tcpu

src/collections/HashMap.c

@@ -0,0 +1,145 @@
+#include "collections/HashMap.h"
+#include <assert.h>
+
+//TODO: sort bucket keys for binary search
+
+#define __HashMap_HASH_FUNC str_hash32
+#define __HashMapBucket_MAX_LEN 16
+
+static const Array __HashMap_heights = Array_CONST(u32, {
+    17, 31, 61, 127, 257, 521, 1021, 2053, 4099, 8191, 16381, 32771,
+    65521, 131071, 262147, 524287, 1048583, 2097169, 4194319,
+    8388617, 16777213, 33554467, 67108859, 134217757, 268435493
+});
+
+void HashMap_alloc(HashMap* ptr, u32 value_t_size, FreeFunction NULLABLE(value_destructor)){
+    ptr->value_t_size = value_t_size;
+    ptr->value_destructor = value_destructor;
+    ptr->height_n = 0;
+    ptr->height = ((u32*)__HashMap_heights.data)[0];
+    u32 alloc_size = ptr->height * sizeof(HashMapBucket);
+    ptr->table = (HashMapBucket*)malloc(alloc_size);
+    memset(ptr->table, 0, alloc_size);
+}
+
+void HashMap_free(HashMap* ptr){
+    for(u32 i = 0; i < ptr->height; i++){
+        HashMapBucket* bu = &ptr->table[i];
+        u32 len = List_len(&bu->key_hash_list, KeyHash);
+        
+        // free key strings
+        for(u32 j = 0; j < len; j++){
+            KeyHash* kh = (KeyHash*)bu->key_hash_list.data + j;
+            free(kh->key.data);
+        }
+        
+        // destroy values
+        if(ptr->value_destructor){
+            u8* value_ptr = (u8*)bu->value_list.data;
+            u8* end = value_ptr + bu->value_list.size;
+            while(value_ptr < end){
+                ptr->value_destructor(value_ptr);
+                value_ptr += ptr->value_t_size;
+            }
+        }
+
+        free(bu->key_hash_list.data);
+        free(bu->value_list.data);
+    }
+    
+    free(ptr->table);
+}
+
+typedef struct BucketAndIndex {
+    HashMapBucket* bu;
+    i32 i; // -1 if not found
+} BucketAndIndex;
+
+#define BucketAndIndex_null ((BucketAndIndex){ .bu = NULL, .i = -1 })
+
+static BucketAndIndex __HashMap_search(HashMap* ptr, str key, u32 hash){
+    BucketAndIndex r;
+    r.bu = &ptr->table[hash % ptr->height];
+    for(r.i = 0; r.i < (i32)List_len(&r.bu->key_hash_list, KeyHash); r.i++){
+        KeyHash* kh = (KeyHash*)r.bu->key_hash_list.data + r.i;
+        if(kh->hash == hash && str_equals(kh->key, key)){
+            return r;
+        }
+    }
+
+    r.i = -1;
+    return r;
+}
+
+void* NULLABLE(HashMap_tryGetPtr)(HashMap* ptr, str key){
+    u32 hash = __HashMap_HASH_FUNC(key);
+    BucketAndIndex r = __HashMap_search(ptr, key, hash);
+    // key not found
+    if(r.i == -1)
+        return NULL;
+    return ((u8*)r.bu->value_list.data) + r.i * ptr->value_t_size;
+}
+
+
+static void __HashMap_expand(HashMap* ptr){
+    u32 height_expanded_n = ptr->height_n + 1;
+    assert(height_expanded_n >= Array_len(&__HashMap_heights, u32) && "HashMap IS FULL! Fix your code.");
+
+    // alloc new HashMapBucket array
+    u32 height_expanded = ((u32*)__HashMap_heights.data)[height_expanded_n];
+    u32 table_expanded_size = height_expanded * sizeof(HashMapBucket);
+    HashMapBucket* table_expanded = (HashMapBucket*)malloc(table_expanded_size);
+    memset(table_expanded, 0, table_expanded_size);
+
+    // copy values from old buckets to new
+    for(u32 i = 0; i < ptr->height; i++){
+        HashMapBucket* old_bucket = &ptr->table[i];
+        u32 len = List_len(&old_bucket->key_hash_list, KeyHash);
+        
+        for(u32 j = 0; j < len; j++){
+            KeyHash kh = ((KeyHash*)old_bucket->key_hash_list.data)[j];
+            HashMapBucket* new_bucket = &table_expanded[kh.hash % height_expanded];
+            List_push(&new_bucket->key_hash_list, KeyHash, kh);
+            void* old_value_ptr = (u8*)old_bucket->value_list.data + j * ptr->value_t_size;
+            List_push_size(&new_bucket->value_list, old_value_ptr, ptr->value_t_size);
+        }
+        
+        free(old_bucket->key_hash_list.data);
+        free(old_bucket->value_list.data);
+    }
+    free(ptr->table);
+    ptr->table = table_expanded;
+    ptr->height = height_expanded;
+    ptr->height_n = height_expanded_n;
+}
+
+bool HashMap_tryPush(HashMap* ptr, str key, void* value_ptr){
+    u32 hash = __HashMap_HASH_FUNC(key);
+    BucketAndIndex r = __HashMap_search(ptr, key, hash);
+    // found existing item with the same key
+    if(r.i != -1)
+        return false;
+
+    HashMapBucket* bu = r.bu;
+    if(List_len(&bu->key_hash_list, KeyHash) >= __HashMapBucket_MAX_LEN){
+        __HashMap_expand(ptr);
+        bu = &ptr->table[hash % ptr->height];
+    }
+    
+    KeyHash kh = { .key = str_copy(key), .hash = hash };
+    List_push(&bu->key_hash_list, KeyHash, kh);
+    List_push_size(&bu->value_list, value_ptr, ptr->value_t_size);
+    return true;
+}
+
+bool HashMap_tryDelete(HashMap* ptr, str key){
+    u32 hash = __HashMap_HASH_FUNC(key);
+    BucketAndIndex r = __HashMap_search(ptr, key, hash);
+    // key not found
+    if(r.i == -1)
+        return false;
+    
+    List_removeAt(&r.bu->key_hash_list, KeyHash, r.i, 1);
+    List_removeAt_size(&r.bu->value_list, r.i, ptr->value_t_size);
+    return true;
+}

src/collections/List.c

@@ -0,0 +1,39 @@
+#include "collections/List.h"
+
+List List_alloc_size(u32 initial_size){
+    if(initial_size == 0)
+        return List_construct_size(NULL, 0, 0);
+    u32 allocated_size = ALIGN_TO(initial_size, sizeof(void*));
+    return List_construct_size(malloc(allocated_size), 0, allocated_size);
+}
+
+void* List_expand(List* ptr, u32 expansion_size){
+    u32 occupied_size = ptr->size;
+    u32 expanded_alloc_size = ptr->allocated_size;
+    if(expanded_alloc_size == 0)
+        expanded_alloc_size = 64;
+    ptr->size += expansion_size;
+    while(ptr->size > expanded_alloc_size){
+        expanded_alloc_size *= 2;
+    }
+    // if ptr->data is null, realloc acts like malloc
+    ptr->data = realloc(ptr->data, expanded_alloc_size);
+    ptr->allocated_size = expanded_alloc_size;
+    return (u8*)(ptr->data) + occupied_size;
+}
+
+void List_push_size(List* ptr, void* values, u32 size){
+    void* empty_cell_ptr = List_expand(ptr, size);
+    memcpy(empty_cell_ptr, values, size);
+}
+
+bool List_removeAt_size(List* ptr, u32 i, u32 remove_size){
+    if(i + remove_size >= ptr->size)
+        return false;
+    
+    ptr->size -= remove_size;
+    u8* src = (u8*)ptr->data + i + remove_size;
+    u8* dst = (u8*)ptr->data + i;
+    memmove(dst, src, ptr->size - i - remove_size);
+    return true;
+}

src/string/StringBuilder.c

@@ -0,0 +1,53 @@
+#include "string/StringBuilder.h"
+
+void StringBuilder_free(StringBuilder* b){
+    free(b->buffer.data);
+    b->buffer = List_construct_size(NULL, 0, 0);
+}
+
+str StringBuilder_getStr(StringBuilder* b){
+    List_push(&b->buffer, u8, '\0');
+    str result = str_construct((char*)b->buffer.data, b->buffer.size - 1, true);
+    return result;
+}
+
+void StringBuilder_removeFromEnd(StringBuilder* b, u32 count){
+    if(count < b->buffer.size){
+        b->buffer.size -= count;
+    }
+    else{
+        b->buffer.size = 0;
+    }
+}
+
+
+void StringBuilder_append_char(StringBuilder* b, char c){
+    List_push(&b->buffer, u8, c);
+}
+
+
+void StringBuilder_append_string(StringBuilder* b, str s){
+    List_push_size(&b->buffer, s.data, s.size);
+}
+
+void StringBuilder_append_cstr(StringBuilder* b, char* s){
+    StringBuilder_append_string(b, str_construct(s, strlen(s), true));
+}
+
+void StringBuilder_append_i64(StringBuilder* b, i64 n){
+    char buf[32];
+    sprintf(buf, IFWIN("%lli", "%li"), n);
+    StringBuilder_append_cstr(b, buf);
+}
+
+void StringBuilder_append_u64(StringBuilder* b, u64 n){
+    char buf[32];
+    sprintf(buf, IFWIN("%llu", "%lu"), n);
+    StringBuilder_append_cstr(b, buf);
+}
+
+void StringBuilder_append_f64(StringBuilder* b, f64 n){
+    char buf[32];
+    sprintf(buf, "%lf", n);
+    StringBuilder_append_cstr(b, buf);
+}

src/string/cstr.c

@@ -0,0 +1,53 @@
+#include "string/cstr.h"
+#include <stdarg.h>
+
+char* _strcat_malloc(size_t n, cstr str0, ...){
+    va_list argv;
+    va_start(argv, str0);
+    char* heap_ptr = _vstrcat_malloc(n, str0, argv);
+    va_end(argv);
+    return heap_ptr;
+}
+
+char* _vstrcat_malloc(size_t n, cstr str0, va_list argv){
+    size_t str0_len = strlen(str0);
+    size_t total_len = str0_len;
+    cstr* const parts = malloc(sizeof(cstr) * n);
+    size_t* const part_lengths = malloc(sizeof(size_t) * n);
+    for(size_t i = 0; i < n; i++){
+        cstr part = va_arg(argv, cstr);
+        size_t length = strlen(part);
+        parts[i] = part;
+        part_lengths[i] = length;
+        total_len += length;
+    }
+    char* const buf = malloc(total_len + 1);
+    memcpy(buf, str0, str0_len);
+    char* walking_ptr = buf + str0_len;
+    for(size_t i = 0; i < n; i++){
+        memcpy(walking_ptr, parts[i], part_lengths[i]);
+        walking_ptr += part_lengths[i];
+    }
+    buf[total_len] = '\0';
+    free(parts);
+    free(part_lengths);
+    return buf;
+}
+
+char* NULLABLE(sprintf_malloc)(size_t buffer_size, cstr format, ...){
+    va_list argv;
+    va_start(argv, format);
+    char* NULLABLE(heap_ptr) = vsprintf_malloc(buffer_size, format, argv);
+    va_end(argv);
+    return heap_ptr;
+}
+
+char* NULLABLE(vsprintf_malloc)(size_t buffer_size, cstr format, va_list argv){
+    char* buf = malloc(buffer_size);
+    int r = vsprintf(buf, format, argv);
+    if(r < 0){
+        free(buf);
+        return NULL;
+    }
+    return buf;
+}

src/string/str.c

@@ -0,0 +1,125 @@
+#include "string/str.h"
+
+str str_copy(str src){
+    if(src.data == NULL || src.size == 0)
+        return src;
+    
+    str nstr = str_construct((char*)malloc(src.size + 1), src.size, true);
+    memcpy(nstr.data, src.data, src.size);
+    nstr.data[nstr.size] = '\0';
+    return nstr;
+}
+
+bool str_equals(str s0, str s1){
+    if(s0.size != s1.size)
+        return false;
+    
+    for(u32 i = 0; i < s0.size; i++)
+        if(s0.data[i] != s1.data[i]) 
+            return false;
+    
+    return true;
+}
+
+str str_reverse(str s){
+    if(s.data == NULL || s.size == 0)
+        return s;
+    
+    str r = str_construct(malloc(s.size), s.size, s.isZeroTerminated);
+    for(u32 i = 0; i < s.size; i++ )
+        r.data[i] = s.data[s.size - i - 1];
+    return r;
+}
+
+i32 str_seek(str src, str fragment, u32 startIndex){
+    if(src.size == 0 || fragment.size == 0)
+        return -1;
+    
+    for(u32 i = startIndex; i < src.size - fragment.size + 1; i++){
+        for(u32 j = 0;; j++){
+            if(j == fragment.size)
+                return i;
+            if(src.data[i + j] != fragment.data[j])
+                break;
+        }
+    }
+    return -1;
+}
+
+i32 str_seekReverse(str src, str fragment, u32 startIndex){
+    if(src.size == 0 || fragment.size == 0)
+        return -1;
+    
+    if(startIndex > src.size - 1)
+        startIndex = src.size - 1;
+    for(u32 i = startIndex; i >= fragment.size - 1; i--){
+        for(u32 j = 0;; j++){
+            if(j == fragment.size)
+                return i - j + 1;
+            if(src.data[i - j] != fragment.data[fragment.size - 1 - j])
+                break;
+        }
+    }
+    return -1;
+}
+
+i32 str_seekChar(str src, char c, u32 startIndex){
+    for(u32 i = startIndex; i < src.size; i++){
+        if(src.data[i] == c)
+            return i;
+    }
+    return -1;
+}
+
+i32 str_seekCharReverse(str src, char c, u32 startIndex){
+    if(startIndex > src.size - 1)
+        startIndex = src.size - 1;
+    for(u32 i = startIndex; i != (u32)-1; i--){
+        if(src.data[i] == c)
+            return i;
+    }
+    return -1;
+}
+
+bool str_startsWith(str src, str fragment){
+    if(src.size < fragment.size)
+        return false;
+    
+    src.size = fragment.size;
+    return str_equals(src, fragment);
+}
+
+bool str_endsWith(str src, str fragment){
+    if(src.size < fragment.size)
+        return false;
+    
+    src.data = (char*)(src.data + src.size - fragment.size);
+    src.size = fragment.size;
+    return str_equals(src, fragment);
+}
+
+u32 str_hash32(str s){
+    u8* ubuf = (u8*)s.data;
+    u32 hash=0;
+    for (u32 i = 0; i < s.size; i++)
+        hash = (hash<<6) + (hash<<16) - hash + ubuf[i];
+    return hash;
+}
+
+str str_toUpper(str src){
+    str r = str_copy(src);
+    for (u32 i = 0; i < r.size; i++){
+        if(isAlphabeticalLower(r.data[i]))
+            r.data[i] = r.data[i] - 'a' + 'A';
+    }
+    return r;
+}
+
+str str_toLower(str src){
+    str r = str_copy(src);
+    for (u32 i = 0; i < r.size; i++){
+        if(isAlphabeticalUpper(r.data[i]))
+            r.data[i] = r.data[i] - 'A' + 'a';
+    }
+    return r;
+}