Timerix/tlibc
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

HashMapKeyValue.value -> value_ptr

Browse Source
This commit is contained in:
Timerix
2025-12-02 20:06:02 +05:00
parent 17d2d1c38d
commit 0d422cd7e5
3 changed files with 6 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
include/tlibc/algorithms.h
View File

@@ -3,9 +3,9 @@
/// USAGE insertionSort(list.data, list.len, .id) /// USAGE insertionSort(list.data, list.len, .id)
#define insertionSort_inline(arr, n, field) \ #define insertionSort_inline(arr, n, field) \
for(i32 i = 1, j; i < n; i++) { \ for(i32 i = 1, j; i < (i32)n; i++) { \
j = i; \ j = i; \
while( j > 0 && arr[j - 1]##field > arr[i]##field){\ while( j > 0 && arr[j - 1]field > arr[i]field){\
arr[j] = arr[j - 1]; \ arr[j] = arr[j - 1]; \
j--; \ j--; \
} \ } \
@@ -17,12 +17,12 @@
i32 high = n - 1; \ i32 high = n - 1; \
while (low <= high) { \ while (low <= high) { \
i32 mid = low + (high - low) / 2; \ i32 mid = low + (high - low) / 2; \
if (arr[mid]##field == key) { \ if (arr[mid]field == key) { \
out_index = mid; \ out_index = mid; \
break; \ break; \
} \ } \
/* choose left or right half */ \ /* choose left or right half */ \
if (arr[mid]##field < key) \ if (arr[mid]field < key) \
low = mid + 1; \ low = mid + 1; \
else high = mid - 1; \ else high = mid - 1; \
} \ } \

2
include/tlibc/collections/HashMap.h
View File

@@ -43,7 +43,7 @@ typedef struct HashMapIter {
typedef struct HashMapKeyValue { typedef struct HashMapKeyValue {
str key; str key;
void* value; void* value_ptr;
} HashMapKeyValue; } HashMapKeyValue;
static inline HashMapIter HashMapIter_create(const HashMap_* table){ static inline HashMapIter HashMapIter_create(const HashMap_* table){

2
src/collections/HashMap.c
View File

@@ -225,6 +225,6 @@ bool HashMapIter_getCurrent(HashMapIter* self, HashMapKeyValue* kv){
return false; return false;
kv->key = bu->key_hash_list.data[self->elem_n].key; kv->key = bu->key_hash_list.data[self->elem_n].key;
kv->value = (u8*)bu->value_list.data + self->map->value_t_size * self->elem_n; kv->value_ptr = (u8*)bu->value_list.data + self->map->value_t_size * self->elem_n;
return true; return true;
} }