eddy/snippets_library
1
0
Fork 0
mirror of https://github.com/eddyem/snippets_library.git synced 2026-03-21 17:21:01 +03:00
Code Issues Packages Projects Releases Wiki Activity

version 0.2.1

Browse Source
This commit is contained in:
Edward Emelianov
2024-11-15 11:42:29 +03:00
parent 511a83e506
commit e77fddc3b8
22 changed files with 1337 additions and 495 deletions
Download Patch File Download Diff File Expand all files Collapse all files

72
fifo_lifo.c
View File

@@ -22,60 +22,60 @@
#include "usefull_macros.h"
/**
* @brief list_push_tail - push data into the tail of a stack (like FIFO)
* @brief sl_list_push_tail - push data into the tail of a stack (like FIFO)
* @param lst (io) - list
* @param v (i) - data to push
* @return pointer to just pused node or NULL in case of error
*/
List *list_push_tail(List **lst, void *v){
List *node;
if(!lst) return NULL;
if((node = MALLOC(List, 1)) == NULL)
return NULL; // allocation error
node->data = v; // insert data
if(!*lst){
*lst = node;
sl_list_t *sl_list_push_tail(sl_list_t **lst, void *v){
sl_list_t *node;
if(!lst) return NULL;
if((node = MALLOC(sl_list_t, 1)) == NULL)
return NULL; // allocation error
node->data = v; // insert data
if(!*lst){
*lst = node;
}else{
(*lst)->last->next = node;
}
(*lst)->last = node;
return node;
(*lst)->last = node;
return node;
}
/**
* @brief list_push - push data into the head of a stack (like LIFO)
* @brief sl_list_push - push data into the head of a stack (like LIFO)
* @param lst (io) - list
* @param v (i) - data to push
* @return pointer to just pused node
*/
List *list_push(List **lst, void *v){
List *node;
if(!lst) return NULL;
if((node = MALLOC(List, 1)) == NULL)
return NULL; // allocation error
node->data = v; // insert data
if(!*lst){
*lst = node;
(*lst)->last = node;
return node;
}
node->next = *lst;
node->last = (*lst)->last;
*lst = node;
return node;
sl_list_t *sl_list_push(sl_list_t **lst, void *v){
sl_list_t *node;
if(!lst) return NULL;
if((node = MALLOC(sl_list_t, 1)) == NULL)
return NULL; // allocation error
node->data = v; // insert data
if(!*lst){
*lst = node;
(*lst)->last = node;
return node;
}
node->next = *lst;
node->last = (*lst)->last;
*lst = node;
return node;
}
/**
* @brief list_pop - get data from head of list. Don't forget to FREE list data after `pop`
* @brief sl_list_pop - get data from head of list. Don't forget to FREE list data after `pop`
* @param lst (io) - list
* @return data from lst head
*/
void *list_pop(List **lst){
void *ret;
List *node = *lst;
if(!lst || !*lst) return NULL;
ret = (*lst)->data;
*lst = (*lst)->next;
FREE(node);
return ret;
void *sl_list_pop(sl_list_t **lst){
void *ret;
sl_list_t *node = *lst;
if(!lst || !*lst) return NULL;
ret = (*lst)->data;
*lst = (*lst)->next;
FREE(node);
return ret;
}