67 lines
4.0 KiB
C
67 lines
4.0 KiB
C
#pragma once
|
|
#include <stdbool.h>
|
|
#include <gc/cord.h>
|
|
|
|
#include "util.h"
|
|
#include "datatypes.h"
|
|
#include "functions.h"
|
|
#include "types.h"
|
|
|
|
// Convert negative indices to back-indexed without branching: index0 = index + (index < 0)*(len+1)) - 1
|
|
#define $Array_get(type, x, i, filename, start, end) *({ \
|
|
const array_t $arr = x; int64_t $index = (int64_t)(i); \
|
|
int64_t $off = $index + ($index < 0) * ($arr.length + 1) - 1; \
|
|
if (__builtin_expect($off < 0 || $off >= $arr.length, 0)) \
|
|
fail_source(filename, start, end, "Invalid array index: %r (array has length %ld)\n", Int__as_text(&$index, USE_COLOR, NULL), $arr.length); \
|
|
(type*)($arr.data + $arr.stride * $off);})
|
|
#define $Array_get_unchecked(type, x, i) *({ const array_t $arr = x; int64_t $index = (int64_t)(i); \
|
|
int64_t $off = $index + ($index < 0) * ($arr.length + 1) - 1; \
|
|
(type*)($arr.data + $arr.stride * $off);})
|
|
#define $is_atomic(x) _Generic(x, bool: true, int8_t: true, int16_t: true, int32_t: true, int64_t: true, float: true, double: true, default: false)
|
|
#define $TypedArray(t, ...) ({ t $items[] = {__VA_ARGS__}; \
|
|
(array_t){.length=sizeof($items)/sizeof($items[0]), \
|
|
.stride=(int64_t)&$items[1] - (int64_t)&$items[0], \
|
|
.data=memcpy(GC_MALLOC(sizeof($items)), $items, sizeof($items)), \
|
|
.atomic=0, \
|
|
.data_refcount=1}; })
|
|
#define $TypedArrayN(t, N, ...) ({ t $items[N] = {__VA_ARGS__}; \
|
|
(array_t){.length=N, \
|
|
.stride=(int64_t)&$items[1] - (int64_t)&$items[0], \
|
|
.data=memcpy(GC_MALLOC(sizeof($items)), $items, sizeof($items)), \
|
|
.atomic=0, \
|
|
.data_refcount=1}; })
|
|
#define $Array(x, ...) ({ __typeof(x) $items[] = {x, __VA_ARGS__}; \
|
|
(array_t){.length=sizeof($items)/sizeof($items[0]), \
|
|
.stride=(int64_t)&$items[1] - (int64_t)&$items[0], \
|
|
.data=memcpy($is_atomic(x) ? GC_MALLOC_ATOMIC(sizeof($items)) : GC_MALLOC(sizeof($items)), $items, sizeof($items)), \
|
|
.atomic=$is_atomic(x), \
|
|
.data_refcount=1}; })
|
|
#define $ARRAY_INCREF(arr) (arr).data_refcount |= ((arr).data_refcount << 1) | 1
|
|
#define $ARRAY_DECREF(arr) (arr).data_refcount &= 2
|
|
#define $ARRAY_FOREACH(arr_expr, i, item_type, x, body, else_body) {\
|
|
array_t $arr = arr_expr; \
|
|
$ARRAY_INCREF($arr); \
|
|
if ($arr.length == 0) else_body \
|
|
else for (int64_t i = 1; i <= $arr.length; i++) { item_type x = *(item_type*)($arr.data + (i-1)*$arr.stride); body } \
|
|
$ARRAY_DECREF($arr); \
|
|
}
|
|
|
|
#define Array__insert_value(arr, item_expr, index, type) ({ __typeof(item_expr) $item = item_expr; Array__insert(arr, &$item, index, type); })
|
|
void Array__insert(array_t *arr, const void *item, int64_t index, const TypeInfo *type);
|
|
void Array__insert_all(array_t *arr, array_t to_insert, int64_t index, const TypeInfo *type);
|
|
void Array__remove(array_t *arr, int64_t index, int64_t count, const TypeInfo *type);
|
|
void Array__sort(array_t *arr, const TypeInfo *type);
|
|
void Array__shuffle(array_t *arr, const TypeInfo *type);
|
|
void *Array__random(array_t arr);
|
|
void Array__clear(array_t *array);
|
|
void Array__compact(array_t *arr, const TypeInfo *type);
|
|
bool Array__contains(array_t array, void *item, const TypeInfo *type);
|
|
array_t Array__slice(array_t *array, int64_t first, int64_t length, int64_t stride, const TypeInfo *type);
|
|
array_t Array__concat(array_t x, array_t y, const TypeInfo *type);
|
|
uint32_t Array__hash(const array_t *arr, const TypeInfo *type);
|
|
int32_t Array__compare(const array_t *x, const array_t *y, const TypeInfo *type);
|
|
bool Array__equal(const array_t *x, const array_t *y, const TypeInfo *type);
|
|
CORD Array__as_text(const array_t *arr, bool colorize, const TypeInfo *type);
|
|
|
|
// vim: ts=4 sw=0 et cino=L2,l1,(0,W4,m1,\:0
|