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

Fix typos in source

This commit is contained in:
Nick Chambers 2022-11-25 00:42:39 -06:00
parent 137547c456
commit 282e9665e2
2 changed files with 4 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
include/ordinary.h
View File

@ -28,7 +28,7 @@ struct ordinary_node *ordinary_list_find(struct ordinary_list *list, callback cb
uint8_t ordinary_list_for(struct ordinary_list *list, callback cb); uint8_t ordinary_list_for(struct ordinary_list *list, callback cb);
struct ordinary_node *ordinary_list_add(struct ordinary_list *list, void *val); struct ordinary_node *ordinary_list_add(struct ordinary_list *list, void *val);
void ordinary_list_move(struct standard_list *dst, struct standard_list *src, struct standard_node *node); void ordinary_list_move(struct ordinary_list *dst, struct ordinary_list *src, struct ordinary_node *node);
struct ordinary_node *ordinary_list_pop(struct ordinary_list *list); struct ordinary_node *ordinary_list_pop(struct ordinary_list *list);
void ordinary_list_drop(struct ordinary_list *list, struct ordinary_node *node); void ordinary_list_drop(struct ordinary_list *list, struct ordinary_node *node);

7
src/ordinary.c
View File

@ -67,7 +67,7 @@ uint8_t ordinary_list_for(struct ordinary_list *list, callback cb) {
uint32_t idx = 0, res = 0; uint32_t idx = 0, res = 0;
for(; node; node = node->next) { for(; node; node = node->next) {
res |= cb(list, idx); res |= cb(node, idx);
if(list->limit) { if(list->limit) {
idx += 1; idx += 1;
@ -110,13 +110,11 @@ struct ordinary_node *ordinary_list_add(struct ordinary_list *list, void *val) {
node->prev = NULL; node->prev = NULL;
node->next = NULL; node->next = NULL;
node->val = val; node->val = val;
ordinary_list_insert(list, node); ordinary_list_insert(list, node);
return node; return node;
} }
uint8_t ordinary_list_mov(struct standard_list *dst, struct standard_list *src, struct standard_node *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)) { if(ordinary_list_full(dst) || ordinary_list_empty(src)) {
return 0; return 0;
} }
@ -135,6 +133,7 @@ uint8_t ordinary_list_mov(struct standard_list *dst, struct standard_list *src,
} }
ordinary_list_insert(dst, node); ordinary_list_insert(dst, node);
return 1;
} }
struct ordinary_node *ordinary_list_pop(struct ordinary_list *list) { struct ordinary_node *ordinary_list_pop(struct ordinary_list *list) {