libcdsb/src/list/access.c

121 lines
2.5 KiB
C
Raw Normal View History

2022-06-04 21:59:26 +03:00
/* This software is licensed by the MIT License, see LICENSE file */
/* Copyright © 2022 Gregory Lirent */
#include "include.h"
2022-08-22 14:18:38 +03:00
static void libcdsb_builtin_cut(list_t* s, lnode_t* cur) {
2022-06-04 21:59:26 +03:00
2022-06-08 20:59:07 +03:00
vnode_free(&cur->node, cur->type);
2022-06-04 21:59:26 +03:00
if (!is_null(cur->prev)) {
cur->prev->next = cur->next;
} else s->first = cur->next;
if (!is_null(cur->next)) {
cur->next->prev = cur->prev;
} else s->last = cur->prev;
free(cur);
}
/*#####################################################################################################################*/
2022-06-09 16:29:10 +03:00
int libcdsb_list_get(vtype_list* x, ssize_t i, void* _, list_access_callback callback, bool cut) {
2022-06-04 21:59:26 +03:00
ldir_t dir;
lnode_t* c;
2022-06-08 20:59:07 +03:00
size_t n;
2022-06-04 21:59:26 +03:00
if (i < 0) {
2022-06-08 20:59:07 +03:00
n = ~i;
2022-06-04 21:59:26 +03:00
dir = LD_PREV;
2022-06-08 20:59:07 +03:00
} else {
n = i;
dir = LD_NEXT;
}
2022-06-04 21:59:26 +03:00
c = ldir_dir((lnode_t*)x, dir);
2022-06-08 20:59:07 +03:00
while (n && !is_null(c)) {
2022-06-04 21:59:26 +03:00
c = ldir_dir(c, dir);
2022-06-08 20:59:07 +03:00
--n;
2022-06-04 21:59:26 +03:00
}
2022-06-08 20:59:07 +03:00
if (n || is_null(c)) return -1;
2022-06-04 21:59:26 +03:00
2023-03-23 13:53:46 +03:00
i = (callback) ? callback(libcdsb_variable_build(vnode_peek(&c->node, c->type), c->type), i, _) : 0;
2022-06-04 21:59:26 +03:00
2022-08-22 14:18:38 +03:00
if (cut) libcdsb_builtin_cut(x, c);
2022-06-04 21:59:26 +03:00
2022-06-08 20:59:07 +03:00
return i;
}
2022-06-04 21:59:26 +03:00
2023-03-23 13:53:46 +03:00
int libcdsb_list_find(vtype_list* x, vtype_variable value, void* _, list_access_callback callback, bool r, bool cut) {
2022-06-08 20:59:07 +03:00
ldir_t dir;
lnode_t* c;
ssize_t i;
int cmp;
2022-06-04 21:59:26 +03:00
2022-06-08 20:59:07 +03:00
dir = r ? LD_PREV : LD_NEXT;
c = ldir_dir((lnode_t*)x, dir);
i = 0;
2022-06-04 21:59:26 +03:00
2022-06-08 20:59:07 +03:00
while (!is_null(c)) {
2023-03-23 13:53:46 +03:00
cmp = vtype_compare(vnode_peek(&c->node, c->type), c->type, value.pointer, value.type);
2022-06-04 21:59:26 +03:00
2022-06-08 20:59:07 +03:00
if (cmp == 0) {
2023-03-23 13:53:46 +03:00
i = (callback) ? callback(libcdsb_variable_build(vnode_peek(&c->node, c->type), c->type), (r)?~i:i, _) : 0;
2022-06-04 21:59:26 +03:00
2022-08-22 14:18:38 +03:00
if (cut) libcdsb_builtin_cut(x, c);
2022-06-05 18:36:48 +03:00
2022-06-08 20:59:07 +03:00
return i;
}
2022-06-05 18:36:48 +03:00
2022-06-08 20:59:07 +03:00
c = ldir_dir(c, dir);
++i;
}
return -1;
}
2022-06-05 18:36:48 +03:00
2022-06-09 16:29:10 +03:00
int libcdsb_list_foreach(vtype_list* x, void* data, list_access_callback callback, bool flush) {
2022-06-05 18:36:48 +03:00
lnode_t* n;
2022-06-05 18:36:48 +03:00
lnode_t* c;
size_t i;
2022-06-05 18:36:48 +03:00
int r;
c = x->first;
i = 0;
2022-06-05 18:36:48 +03:00
while (!is_null(c)) {
2023-03-23 13:53:46 +03:00
if ((r = callback(libcdsb_variable_build(vnode_peek(&c->node, c->type), c->type), i, data)) != 0)
break;
n = c->next;
2022-06-08 20:59:07 +03:00
if (flush) {
vnode_free(&c->node, c->type);
free(c);
}
c = n;
++i;
}
if (flush) {
while(!is_null(c)) {
n = c->next;
vnode_free(&c->node, c->type);
free(c);
c = n;
}
memset(x, 0, sizeof(*x));
2022-06-05 18:36:48 +03:00
}
return 0;
}