代码拉取完成,页面将自动刷新
同步操作将从 蔡东赟/beanstalkd-win 强制同步,此操作会覆盖自 Fork 仓库以来所做的任何修改,且无法恢复!!!
确定后同步将在后台操作,完成时将刷新页面,请耐心等待。
#include <stdint.h>
#include <string.h>
#include <stdlib.h>
#include "dat.h"
void
ms_init(ms a, ms_event_fn oninsert, ms_event_fn onremove)
{
a->used = a->cap = a->last = 0;
a->items = NULL;
a->oninsert = oninsert;
a->onremove = onremove;
}
static void
grow(ms a)
{
void **nitems;
size_t ncap = (a->cap << 1) ? : 1;
nitems = malloc(ncap * sizeof(void *));
if (!nitems) return;
memcpy(nitems, a->items, a->used * sizeof(void *));
free(a->items);
a->items = nitems;
a->cap = ncap;
}
int
ms_append(ms a, void *item)
{
if (a->used >= a->cap) grow(a);
if (a->used >= a->cap) return 0;
a->items[a->used++] = item;
if (a->oninsert) a->oninsert(a, item, a->used - 1);
return 1;
}
static int
ms_delete(ms a, size_t i)
{
void *item;
if (i >= a->used) return 0;
item = a->items[i];
a->items[i] = a->items[--a->used];
/* it has already been removed now */
if (a->onremove) a->onremove(a, item, i);
return 1;
}
void
ms_clear(ms a)
{
while (ms_delete(a, 0));
free(a->items);
ms_init(a, a->oninsert, a->onremove);
}
int
ms_remove(ms a, void *item)
{
size_t i;
for (i = 0; i < a->used; i++) {
if (a->items[i] == item) return ms_delete(a, i);
}
return 0;
}
int
ms_contains(ms a, void *item)
{
size_t i;
for (i = 0; i < a->used; i++) {
if (a->items[i] == item) return 1;
}
return 0;
}
void *
ms_take(ms a)
{
void *item;
if (!a->used) return NULL;
a->last = a->last % a->used;
item = a->items[a->last];
ms_delete(a, a->last);
++a->last;
return item;
}
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。