oreodave/complife
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Basic computational life as a single file done!

Browse Source
This commit is contained in:
Aryadev Chavali
2026-03-10 21:03:19 +00:00
parent 87e84587d8
commit f811665ae9
3 changed files with 365 additions and 67 deletions
Download Patch File Download Diff File Expand all files Collapse all files

69
lib/prick_sv.h
View File

@@ -1,12 +1,12 @@
/* prick_sv.h: String Views.
/* sv.h: String Views.
* Created: 2026-03-01
* Author: Aryadev Chavali
* License: See end of file
* Commentary:
To utilise this library, please put:
#define PRICK_SV_IMPL
#include "prick_sv.h"
#define SV_IMPL
#include "sv.h"
in one of your code units.
This is a simple read-only string view library. It defines some extremely
@@ -14,8 +14,8 @@
require allocation.
*/
#ifndef PRICK_SV_H
#define PRICK_SV_H
#ifndef SV_H
#define SV_H
#include <stdint.h>
@@ -23,79 +23,78 @@ typedef struct
{
uint64_t size;
const char *data;
} prick_sv_t;
} sv_t;
#define PRICK_SV(DATA, SIZE) ((prick_sv_t){.data = (DATA), .size = (SIZE)})
#define PRICK_SV_AUTO(DATA) \
((prick_sv_t){.data = (void *)(DATA), .size = sizeof(DATA) - 1})
#define SV(DATA, SIZE) ((sv_t){.data = (DATA), .size = (SIZE)})
#define SV_AUTO(DATA) ((sv_t){.data = (void *)(DATA), .size = sizeof(DATA) - 1})
// Pretty printers
#define PRICK_SV_FMT(SV) (int)(SV).size, (SV).data
#define PR_PRICK_SV "%.*s"
#define SV_FMT(SV) (int)(SV).size, (SV).data
#define PR_SV "%.*s"
prick_sv_t prick_sv_chop_left(prick_sv_t, uint64_t size);
prick_sv_t prick_sv_chop_right(prick_sv_t, uint64_t size);
prick_sv_t prick_sv_truncate(prick_sv_t, uint64_t newsize);
prick_sv_t prick_sv_substr(prick_sv_t, uint64_t position, uint64_t size);
sv_t sv_chop_left(sv_t, uint64_t size);
sv_t sv_chop_right(sv_t, uint64_t size);
sv_t sv_truncate(sv_t, uint64_t newsize);
sv_t sv_substr(sv_t, uint64_t position, uint64_t size);
prick_sv_t prick_sv_till(prick_sv_t, const char *reject);
prick_sv_t prick_sv_while(prick_sv_t, const char *accept);
sv_t sv_till(sv_t, const char *reject);
sv_t sv_while(sv_t, const char *accept);
#ifdef PRICK_SV_IMPL
#ifdef SV_IMPL
#include <stddef.h>
#include <string.h>
prick_sv_t prick_sv_chop_left(prick_sv_t sv, uint64_t size)
sv_t sv_chop_left(sv_t sv, uint64_t size)
{
if (sv.size <= size)
return PRICK_SV(NULL, 0);
return PRICK_SV(sv.data + size, sv.size - size);
return SV(NULL, 0);
return SV(sv.data + size, sv.size - size);
}
prick_sv_t prick_sv_chop_right(prick_sv_t sv, uint64_t size)
sv_t sv_chop_right(sv_t sv, uint64_t size)
{
if (sv.size <= size)
return PRICK_SV(NULL, 0);
return PRICK_SV(sv.data, sv.size - size);
return SV(NULL, 0);
return SV(sv.data, sv.size - size);
}
prick_sv_t prick_sv_truncate(prick_sv_t sv, uint64_t newsize)
sv_t sv_truncate(sv_t sv, uint64_t newsize)
{
if (newsize > sv.size)
return PRICK_SV(NULL, 0);
return PRICK_SV(sv.data, newsize);
return SV(NULL, 0);
return SV(sv.data, newsize);
}
prick_sv_t prick_sv_substr(prick_sv_t sv, uint64_t position, uint64_t size)
sv_t sv_substr(sv_t sv, uint64_t position, uint64_t size)
{
prick_sv_t result = prick_sv_truncate(prick_sv_chop_left(sv, position), size);
sv_t result = sv_truncate(sv_chop_left(sv, position), size);
return result;
}
prick_sv_t prick_sv_till(prick_sv_t sv, const char *reject)
sv_t sv_till(sv_t sv, const char *reject)
{
if (sv.size == 0 || !sv.data)
return PRICK_SV(NULL, 0);
return SV(NULL, 0);
uint64_t offset;
for (offset = 0; offset < sv.size && strchr(reject, sv.data[offset]) == NULL;
++offset)
continue;
return prick_sv_truncate(sv, offset);
return sv_truncate(sv, offset);
}
prick_sv_t prick_sv_while(prick_sv_t sv, const char *accept)
sv_t sv_while(sv_t sv, const char *accept)
{
if (sv.size == 0 || !sv.data)
return PRICK_SV(NULL, 0);
return SV(NULL, 0);
uint64_t offset;
for (offset = 0; offset < sv.size && strchr(accept, sv.data[offset]) != NULL;
++offset)
continue;
return prick_sv_truncate(sv, offset);
return sv_truncate(sv, offset);
}
#endif

59
lib/prick_vec.h
View File

@@ -30,8 +30,8 @@
#include <stddef.h>
#include <stdint.h>
#define PRICK_VEC_INLINE_CAPACITY 32
#define PRICK_VEC_MULT 2
#define VEC_INLINE_CAPACITY 32
#define VEC_MULT 2
typedef struct
{
@@ -40,48 +40,47 @@ typedef struct
union
{
void *ptr;
alignas(max_align_t) uint8_t inlined[PRICK_VEC_INLINE_CAPACITY];
alignas(max_align_t) uint8_t inlined[VEC_INLINE_CAPACITY];
};
} prick_vec_t;
} vec_t;
static_assert(sizeof(prick_vec_t) == 64,
"Expected sizeof(prick_vec_t) to be 64");
static_assert(sizeof(vec_t) == 64, "Expected sizeof(vec_t) to be 64");
void prick_vec_append(prick_vec_t *vec, const void *const ptr, uint64_t size);
void prick_vec_append_byte(prick_vec_t *vec, uint8_t byte);
void *prick_vec_data(prick_vec_t *vec);
void prick_vec_ensure_capacity(prick_vec_t *vec, uint64_t capacity);
void prick_vec_ensure_free(prick_vec_t *vec, uint64_t size);
void prick_vec_free(prick_vec_t *vec);
void prick_vec_clone(prick_vec_t *v2, prick_vec_t *v1);
void vec_append(vec_t *vec, const void *const ptr, uint64_t size);
void vec_append_byte(vec_t *vec, uint8_t byte);
void *vec_data(vec_t *vec);
void vec_ensure_capacity(vec_t *vec, uint64_t capacity);
void vec_ensure_free(vec_t *vec, uint64_t size);
void vec_free(vec_t *vec);
void vec_clone(vec_t *v2, vec_t *v1);
#define PRICK_VEC_GET(VEC, INDEX, TYPE) (((TYPE *)prick_vec_data(VEC))[INDEX])
#define VEC_GET(VEC, INDEX, TYPE) (((TYPE *)vec_data(VEC))[INDEX])
#ifdef PRICK_VEC_IMPL
#ifdef VEC_IMPL
#define MAX(A, B) ((A) > (B) ? (A) : (B))
#include <stdlib.h>
#include <string.h>
void prick_vec_append(prick_vec_t *vec, const void *const ptr, uint64_t size)
void vec_append(vec_t *vec, const void *const ptr, uint64_t size)
{
if (!vec || !ptr || !size)
return;
prick_vec_ensure_free(vec, size);
memcpy(&PRICK_VEC_GET(vec, vec->size, uint8_t), ptr, size);
vec_ensure_free(vec, size);
memcpy(&VEC_GET(vec, vec->size, uint8_t), ptr, size);
vec->size += size;
}
void prick_vec_append_byte(prick_vec_t *vec, uint8_t byte)
void vec_append_byte(vec_t *vec, uint8_t byte)
{
if (!vec)
return;
prick_vec_ensure_free(vec, 1);
PRICK_VEC_GET(vec, vec->size, uint8_t) = byte;
vec_ensure_free(vec, 1);
VEC_GET(vec, vec->size, uint8_t) = byte;
++vec->size;
}
void *prick_vec_data(prick_vec_t *vec)
void *vec_data(vec_t *vec)
{
if (!vec)
return NULL;
@@ -96,15 +95,15 @@ void *prick_vec_data(prick_vec_t *vec)
}
}
void prick_vec_ensure_capacity(prick_vec_t *vec, uint64_t capacity)
void vec_ensure_capacity(vec_t *vec, uint64_t capacity)
{
if (!vec)
return;
if (vec->capacity == 0)
vec->capacity = PRICK_VEC_INLINE_CAPACITY;
vec->capacity = VEC_INLINE_CAPACITY;
if (vec->capacity < capacity)
{
vec->capacity = MAX(vec->capacity * PRICK_VEC_MULT, capacity);
vec->capacity = MAX(vec->capacity * VEC_MULT, capacity);
if (!vec->not_inlined)
{
// We were a small buffer, and now we cannot be i.e. we need to allocate
@@ -123,14 +122,14 @@ void prick_vec_ensure_capacity(prick_vec_t *vec, uint64_t capacity)
}
}
void prick_vec_ensure_free(prick_vec_t *vec, uint64_t size)
void vec_ensure_free(vec_t *vec, uint64_t size)
{
if (!vec)
return;
prick_vec_ensure_capacity(vec, vec->size + size);
vec_ensure_capacity(vec, vec->size + size);
}
void prick_vec_free(prick_vec_t *vec)
void vec_free(vec_t *vec)
{
if (!vec)
return;
@@ -139,11 +138,11 @@ void prick_vec_free(prick_vec_t *vec)
memset(vec, 1, sizeof(*vec));
}
void prick_vec_clone(prick_vec_t *v2, prick_vec_t *v1)
void vec_clone(vec_t *v2, vec_t *v1)
{
if (!v1 || !v2)
return;
prick_vec_append(v2, prick_vec_data(v1), v1->size);
vec_append(v2, vec_data(v1), v1->size);
}
#undef MAX