uplime/ordinary
uplime
/
ordinary
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Break functions into modules

This commit is contained in:
Nick Chambers 2022-11-25 01:01:04 -06:00
parent 282e9665e2
commit 671b003a9c
4 changed files with 159 additions and 156 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
src/examine.c Normal file
View File

@ -0,0 +1,9 @@
#include <ordinary.h>
uint8_t ordinary_list_empty(struct ordinary_list *list) {
return !list->head;
}
uint8_t ordinary_list_full(struct ordinary_list *list) {
return !list->limit || list->count == list->limit;
}

47
src/iter.c Normal file
View File

@ -0,0 +1,47 @@
#include <ordinary.h>
struct ordinary_node *ordinary_list_at(struct ordinary_list *list, uint32_t idx) {
struct ordinary_node *node = list->head;
for(; node; node = node->next) {
idx -= 1;
if(!idx) {
return node;
}
}
return NULL;
}
struct ordinary_node *ordinary_list_find(struct ordinary_list *list, callback cb) {
struct ordinary_node *node = list->head;
uint32_t idx = 0;
for(; node; node = node->next) {
if(cb(node, idx)) {
return node;
}
if(list->limit) {
idx += 1;
}
}
return NULL;
}
uint8_t ordinary_list_for(struct ordinary_list *list, callback cb) {
struct ordinary_node *node = list->head;
uint32_t idx = 0, res = 0;
for(; node; node = node->next) {
res |= cb(node, idx);
if(list->limit) {
idx += 1;
}
}
return res;
}

103
src/maint.c Normal file
View File

@ -0,0 +1,103 @@
#include <ordinary.h>
static void ordinary_list_insert(struct ordinary_list *list, struct ordinary_node *node) {
if(!list->head) {
list->head = node;
list->tail = node;
} else if(list->head == list->tail) {
list->tail = node;
list->head->next = list->tail;
list->tail->prev = list->head;
} else {
list->tail->next = node;
node->prev = list->tail;
list->tail = node;
}
if(list->limit) {
list->count += 1;
}
}
struct ordinary_node *ordinary_list_add(struct ordinary_list *list, void *val) {
if(ordinary_list_full(list)) {
return NULL;
}
struct ordinary_node *node = malloc(sizeof(struct ordinary_node));
if(!node) {
return NULL;
}
node->prev = NULL;
node->next = NULL;
node->val = val;
ordinary_list_insert(list, node);
return node;
}
uint8_t ordinary_list_mov(struct ordinary_list *dst, struct ordinary_list *src, struct ordinary_node *node) {
if(ordinary_list_full(dst) || ordinary_list_empty(src)) {
return 0;
}
struct ordinary_node *prev = node->prev;
struct ordinary_node *next = node->next;
if(prev) {
prev->next = next;
node->prev = NULL;
}
if(next) {
next->prev = prev;
node->next = NULL;
}
ordinary_list_insert(dst, node);
return 1;
}
struct ordinary_node *ordinary_list_pop(struct ordinary_list *list) {
if(ordinary_list_empty(list)) {
return NULL;
}
struct ordinary_node *node = list->tail;
if(list->head == list->tail) {
list->head = NULL;
list->tail = NULL;
} else {
list->tail = list->tail->prev;
list->tail->next = NULL;
}
if(list->limit) {
list->count -= 1;
}
return node;
}
void ordinary_list_rem(struct ordinary_list *list, struct ordinary_node *node) {
struct ordinary_node *prev = node->prev;
struct ordinary_node *next = node->next;
if(prev) {
prev->next = next;
node->prev = NULL;
}
if(next) {
next->prev = prev;
node->next = NULL;
}
free(node);
if(list->limit) {
list->count -= 1;
}
}

156
src/ordinary.c
View File

@ -22,159 +22,3 @@ void ordinary_list_delete(struct ordinary_list *list) {
list->count = 0;
list->limit = 0;
}
uint8_t ordinary_list_empty(struct ordinary_list *list) {
return !list->head;
}
uint8_t ordinary_list_full(struct ordinary_list *list) {
return !list->limit || list->count == list->limit;
}
struct ordinary_node *ordinary_list_at(struct ordinary_list *list, uint32_t idx) {
struct ordinary_node *node = list->head;
for(; node; node = node->next) {
idx -= 1;
if(!idx) {
return node;
}
}
return NULL;
}
struct ordinary_node *ordinary_list_find(struct ordinary_list *list, callback cb) {
struct ordinary_node *node = list->head;
uint32_t idx = 0;
for(; node; node = node->next) {
if(cb(node, idx)) {
return node;
}
if(list->limit) {
idx += 1;
}
}
return NULL;
}
uint8_t ordinary_list_for(struct ordinary_list *list, callback cb) {
struct ordinary_node *node = list->head;
uint32_t idx = 0, res = 0;
for(; node; node = node->next) {
res |= cb(node, idx);
if(list->limit) {
idx += 1;
}
}
return res;
}
static void ordinary_list_insert(struct ordinary_list *list, struct ordinary_node *node) {
if(!list->head) {
list->head = node;
list->tail = node;
} else if(list->head == list->tail) {
list->tail = node;
list->head->next = list->tail;
list->tail->prev = list->head;
} else {
list->tail->next = node;
node->prev = list->tail;
list->tail = node;
}
if(list->limit) {
list->count += 1;
}
}
struct ordinary_node *ordinary_list_add(struct ordinary_list *list, void *val) {
if(ordinary_list_full(list)) {
return NULL;
}
struct ordinary_node *node = malloc(sizeof(struct ordinary_node));
if(!node) {
return NULL;
}
node->prev = NULL;
node->next = NULL;
node->val = val;
ordinary_list_insert(list, node);
return node;
}
uint8_t ordinary_list_mov(struct ordinary_list *dst, struct ordinary_list *src, struct ordinary_node *node) {
if(ordinary_list_full(dst) || ordinary_list_empty(src)) {
return 0;
}
struct ordinary_node *prev = node->prev;
struct ordinary_node *next = node->next;
if(prev) {
prev->next = next;
node->prev = NULL;
}
if(next) {
next->prev = prev;
node->next = NULL;
}
ordinary_list_insert(dst, node);
return 1;
}
struct ordinary_node *ordinary_list_pop(struct ordinary_list *list) {
if(ordinary_list_empty(list)) {
return NULL;
}
struct ordinary_node *node = list->tail;
if(list->head == list->tail) {
list->head = NULL;
list->tail = NULL;
} else {
list->tail = list->tail->prev;
list->tail->next = NULL;
}
if(list->limit) {
list->count -= 1;
}
return node;
}
void ordinary_list_rem(struct ordinary_list *list, struct ordinary_node *node) {
struct ordinary_node *prev = node->prev;
struct ordinary_node *next = node->next;
if(prev) {
prev->next = next;
node->prev = NULL;
}
if(next) {
next->prev = prev;
node->next = NULL;
}
free(node);
if(list->limit) {
list->count -= 1;
}
}