代码拉取完成,页面将自动刷新
同步操作将从 Gitee 极速下载/MazuCC 强制同步,此操作会覆盖自 Fork 仓库以来所做的任何修改,且无法恢复!!!
确定后同步将在后台操作,完成时将刷新页面,请耐心等待。
#ifndef MAZUCC_LIST_H
#define MAZUCC_LIST_H
#include <stdbool.h>
#include <stdlib.h>
typedef struct __ListNode {
void *elem;
struct __ListNode *next, *prev;
} ListNode;
typedef struct {
int len;
ListNode *head, *tail;
} List;
typedef struct {
ListNode *ptr;
} Iter;
#define EMPTY_LIST ((List){.len = 0, .head = NULL, .tail = NULL})
static inline List *make_list(void)
{
List *r = malloc(sizeof(List));
r->len = 0;
r->head = r->tail = NULL;
return r;
}
static inline void *make_node(void *elem)
{
ListNode *r = malloc(sizeof(ListNode));
r->elem = elem;
r->next = NULL;
r->prev = NULL;
return r;
}
static inline void list_push(List *list, void *elem)
{
ListNode *node = make_node(elem);
if (!list->head) {
list->head = node;
} else {
list->tail->next = node;
node->prev = list->tail;
}
list->tail = node;
list->len++;
}
static inline void *list_pop(List *list)
{
if (!list->head)
return NULL;
ListNode *tail = list->tail;
void *r = tail->elem;
list->tail = tail->prev;
if (list->tail)
list->tail->next = NULL;
else
list->head = NULL;
free(tail);
return r;
}
static void list_unshift(List *list, void *elem)
{
ListNode *node = make_node(elem);
node->next = list->head;
if (list->head)
list->head->prev = node;
list->head = node;
if (!list->tail)
list->tail = node;
list->len++;
}
static inline Iter list_iter(void *ptr)
{
return (Iter){
.ptr = ((List *) ptr)->head,
};
}
static inline bool iter_end(const Iter iter)
{
return !iter.ptr;
}
static inline void *iter_next(Iter *iter)
{
if (!iter->ptr)
return NULL;
void *r = iter->ptr->elem;
iter->ptr = iter->ptr->next;
return r;
}
static inline List *list_reverse(List *list)
{
List *r = make_list();
for (Iter i = list_iter(list); !iter_end(i);)
list_unshift(r, iter_next(&i));
return r;
}
static inline int list_len(List *list)
{
return list->len;
}
#define list_safe_next(node) ((node) ? (node)->next : NULL)
#define list_for_each_safe(node, tmp, list) \
for ((node) = (list)->head, (tmp) = list_safe_next(node); (node); \
(node) = (tmp), (tmp) = list_safe_next(node))
static inline void list_free(List *list)
{
ListNode *node, *tmp;
list_for_each_safe (node, tmp, list) {
free(node->elem);
free(node);
}
}
#endif /* MAZUCC_LIST_H */
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。