#include "vector.h" #include "../memory/memory.h" #include "string.h" vector_Vector *vector_Create(uintptr_t objectSize) { vector_Vector *vec = kMalloc(sizeof(vector_Vector)); vec->objectSize = objectSize; vec->size = 0; vec->data = 0; vec->data = kMalloc(objectSize); vec->cap = objectSize; return vec; } // Resizes the underlying buffer to a new capacity static inline void __vector_Rebuffer(vector_Vector *vec, uintptr_t newcap) { void *newbuf = kMalloc(newcap); memcpy(newbuf, vec->data, vec->size); kFree(vec->data); vec->data = newbuf; vec->cap = newcap; } void vector_Destroy(vector_Vector *vec) { kFree(vec->data); kFree(vec); } void *vector_Push(vector_Vector *vec, const void *data) { vector_Append(vec, data, 1); return vec->data + vec->size - vec->objectSize; } void vector_Append(vector_Vector *vec, const void *data, uintptr_t n) { uintptr_t oldsize = vec->size, addsize = vec->objectSize * n; vector_Resize(vec, oldsize + addsize); if (data) memcpy(vec->data + oldsize, data, addsize); else memset(vec->data + oldsize, 0, addsize); } void vector_Resize(vector_Vector *vec, uintptr_t size) { uintptr_t newsize = vec->size + size * vec->objectSize; if (newsize > vec->cap) { // grow the buffer exponentially uint64_t newcap = vec->cap; while (newcap < newsize) newcap *= 2; __vector_Rebuffer(vec, newcap); } vec->size = newsize; } uintptr_t vector_Size(vector_Vector *vec) { return vec->size / vec->objectSize; } void vector_Clear(vector_Vector *vec) { vec->size = 0; } void vector_ShrinkBuffer(vector_Vector *vec) { if (vec->size != vec->cap) __vector_Rebuffer(vec, vec->size); } uintptr_t vector_Capacity(vector_Vector *vec) { return vec->cap / vec->objectSize; } void vector_Reserve(vector_Vector *vec, uintptr_t cap) { uintptr_t newcap = vec->objectSize * cap; if (newcap > vec->cap) __vector_Rebuffer(vec, newcap); } void *vector_At(vector_Vector *vec, uintptr_t i) { return vec->data + vec->objectSize * i; } // Data returns the data buffer. void *vector_Data(vector_Vector *vec) { return vec->data; }