libcdsb/src/array/copy.c

153 lines
4.6 KiB
C
Raw Normal View History

2022-06-02 15:52:43 +03:00
/* This software is licensed by the MIT License, see LICENSE file */
/* Copyright © 2022 Gregory Lirent */
#include "include.h"
#include "../__internal/assert.h"
2022-06-10 12:22:20 +03:00
2022-06-02 15:52:43 +03:00
arr_t array_copy(const arr_t* s) {
arr_t x = { .mem = 0, .size = 0, .type = 0 };
if (s->size > 0) {
x.type = s->type;
x.size = s->size;
if (s->type >= VTYPE_STRING) {
void *p, *v, *e;
void (*init)(void*, const void*);
2022-06-03 11:58:02 +03:00
x.mem = p = malloc(x.size*vtype_size(x.type));
2022-06-02 15:52:43 +03:00
v = s->mem;
e = array_end(&x);
switch (s->type) { default: abort();
case VTYPE_STRING: init = (void*)string_copy_init; break;
case VTYPE_ARRAY: init = (void*) array_copy_init; break;
case VTYPE_LIST: init = (void*) list_copy_init; break;
case VTYPE_MAP: init = (void*) map_copy_init; break;
case VTYPE_SET: init = (void*) vset_copy_init; break;
}
do {
init(p, v);
p += vtype_size(x.type);
v += vtype_size(x.type);
} while (p < e);
2022-06-03 11:58:02 +03:00
} else x.mem = memndup(s->mem, x.size*vtype_size(x.type));
2022-06-02 15:52:43 +03:00
}
return x;
}
2022-06-10 12:22:20 +03:00
2022-06-02 15:52:43 +03:00
arr_t* array_duplicate(const arr_t* s) {
arr_t* x = malloc(sizeof(*x));
if (s->size > 0) {
x->type = s->type;
x->size = s->size;
if (s->type >= VTYPE_STRING) {
void *p, *v, *e;
void (*init)(void*, const void*);
2022-06-03 11:58:02 +03:00
x->mem = p = malloc(x->size*vtype_size(x->type));
2022-06-02 15:52:43 +03:00
v = s->mem;
e = array_end(x);
switch (s->type) { default: abort();
case VTYPE_STRING: init = (void*)string_copy_init; break;
case VTYPE_ARRAY: init = (void*) array_copy_init; break;
case VTYPE_LIST: init = (void*) list_copy_init; break;
case VTYPE_MAP: init = (void*) map_copy_init; break;
case VTYPE_SET: init = (void*) vset_copy_init; break;
}
do {
init(p, v);
p += vtype_size(x->type);
v += vtype_size(x->type);
} while (p < e);
2022-06-03 11:58:02 +03:00
} else x->mem = memndup(s->mem, x->size*vtype_size(x->type));
2022-06-02 15:52:43 +03:00
} else memset(x, 0, sizeof(*x));
return x;
}
2022-06-10 12:22:20 +03:00
2022-06-02 15:52:43 +03:00
void array_copy_init(arr_t* x, const arr_t* s) {
if (s->size > 0) {
x->type = s->type;
x->size = s->size;
if (s->type >= VTYPE_STRING) {
void *p, *v, *e;
void (*init)(void*, const void*);
2022-06-03 11:58:02 +03:00
x->mem = p = malloc(x->size*vtype_size(x->type));
2022-06-02 15:52:43 +03:00
v = s->mem;
e = array_end(x);
switch (s->type) { default: abort();
case VTYPE_STRING: init = (void*)string_copy_init; break;
case VTYPE_ARRAY: init = (void*) array_copy_init; break;
case VTYPE_LIST: init = (void*) list_copy_init; break;
case VTYPE_MAP: init = (void*) map_copy_init; break;
case VTYPE_SET: init = (void*) vset_copy_init; break;
}
do {
init(p, v);
p += vtype_size(x->type);
v += vtype_size(x->type);
} while (p < e);
2022-06-03 11:58:02 +03:00
} else x->mem = memndup(s->mem, x->size*vtype_size(x->type));
2022-06-02 15:52:43 +03:00
} else memset(x, 0, sizeof(*x));
}
2022-06-10 12:22:20 +03:00
size_t array_slice(arr_t* x, arr_t* s, ssize_t i, size_t n, _Bool cut) {
if (!n || !s->size) {
memset(x, 0, sizeof(*x));
return 0;
}
if (i < 0 && (i += s->size) < 0) i = 0;
if (i + n > s->size) n = s->size - (i + 1);
x->type = s->type;
x->size = n;
x->mem = malloc(x->size*vtype_size(x->type));
if (!cut && s->type >= VTYPE_STRING) {
void *p, *v, *e;
void (*init)(void*, const void*);
p = x->mem;
v = array_internal_at(s, i);
e = array_internal_at(x, n);
switch (s->type) { default: abort();
case VTYPE_STRING: init = (void*)string_copy_init; break;
case VTYPE_ARRAY: init = (void*) array_copy_init; break;
case VTYPE_LIST: init = (void*) list_copy_init; break;
case VTYPE_MAP: init = (void*) map_copy_init; break;
case VTYPE_SET: init = (void*) vset_copy_init; break;
}
do {
init(p, v);
p += vtype_size(x->type);
v += vtype_size(x->type);
} while (p < e);
} else memcpy(x->mem, array_internal_at(s, i), n*vtype_size(x->type));
if (cut) array_cut(s, i, n);
return n;
}