chenzongxiong/Leakage-Control
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

leakage

Browse Source
This commit is contained in:
chenzongxiong
2026-01-22 19:24:33 +08:00
commit b94a28aacf
130 changed files with 127880 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

192
calib_board/usr/algo/algo_queue.c Normal file
View File

@@ -0,0 +1,192 @@
#include "algo_queue.h"
/* <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>е<EFBFBD>i<EFBFBD><69>Ԫ<EFBFBD>صĵ<D8B5>ַ */
#define at(i) (((char *)(queue->base))+(i)*(queue->dsize))
/* <20><><EFBFBD>ݸ<EFBFBD>ֵ<EFBFBD><D6B5><EFBFBD><EFBFBD>Դ<EFBFBD><D4B4>ַs<D6B7><73><EFBFBD><EFBFBD><EFBFBD>ݸ<EFBFBD><DDB8>Ƶ<EFBFBD>Ŀ<EFBFBD><C4BF><EFBFBD><EFBFBD>ַd */
#define assign(d, s) memcpy((d), (s), queue->dsize)
/* <20><>ȡ<EFBFBD><C8A1><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>߼<EFBFBD>λ<EFBFBD><CEBB>i<EFBFBD><69>Ԫ<EFBFBD>ص<EFBFBD>ַ<EFBFBD><D6B7><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ѭ<EFBFBD><D1AD><EFBFBD><EFBFBD><EFBFBD>У<EFBFBD> */
#define qa(i) at((queue->head + queue->capacity + (i)) % (queue->capacity))
/* <20><><EFBFBD><EFBFBD><EFBFBD>ڴ渴<DAB4>ƺ<EFBFBD><C6BA><EFBFBD> */
static void* memcpy(void* dest, const void* src, int n)
{
char* dst = dest;
const char* s = src;
while (n--) *dst++ = *s++;
return dest;
}
/* <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>д<EFBFBD>index<65><78>ʼ<EFBFBD><CABC>size<7A><65>Ԫ<EFBFBD><D4AA><EFBFBD><EFBFBD>ǰ<EFBFBD>ƶ<EFBFBD>һλ */
static void move_forward(queue queue, int index, int size)
{
for (int i = index; i < index + size; i++) assign(qa(i - 1), qa(i));
}
/* <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>д<EFBFBD>index<65><78>ʼ<EFBFBD><CABC>size<7A><65>Ԫ<EFBFBD><D4AA><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ƶ<EFBFBD>һλ */
static void move_backward(queue queue, int index, int size)
{
for (int i = index + size; i > index; i--) assign(qa(i), qa(i - 1));
}
/**
* \brief <20><>׼<EFBFBD><D7BC><EFBFBD>Ӳ<EFBFBD><D3B2><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>β<EFBFBD><CEB2><EFBFBD>ӣ<EFBFBD>
* \param[in] queue: <20><><EFBFBD>ж<EFBFBD><D0B6><EFBFBD>ָ<EFBFBD><D6B8>
* \param[in] data: <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݵ<EFBFBD>ַ<EFBFBD><D6B7>NULL<4C><4C>ʾ<EFBFBD><CABE><EFBFBD>ƶ<EFBFBD>ָ<EFBFBD>룩
* \return 1=<3D>ɹ<EFBFBD>, 0=ʧ<>ܣ<EFBFBD><DCA3><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ч<EFBFBD><D0A7><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
*
* \details <20>ڶ<EFBFBD><DAB6><EFBFBD>β<EFBFBD><CEB2><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ԫ<EFBFBD>ء<EFBFBD><D8A1><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʧ<EFBFBD>ܡ<EFBFBD>
* <20><>data<74><61>ΪNULLʱ<4C><CAB1><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݸ<EFBFBD><DDB8>Ƶ<EFBFBD><C6B5><EFBFBD><EFBFBD>д洢<D0B4><E6B4A2><EFBFBD><EFBFBD>
* <20><><EFBFBD><EFBFBD>βָ<CEB2><D6B8><EFBFBD>Ͷ<EFBFBD><CDB6>д<EFBFBD>С<EFBFBD><D0A1>
*/
int queue_push(queue queue, void* data)
{
if (!queue) return 0; // <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ָ<EFBFBD><D6B8><EFBFBD><EFBFBD>Ч<EFBFBD><D0A7>
if (queue->size == queue->capacity) return 0; // <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
if (data) assign(at(queue->tail), data); // <20><><EFBFBD>ݸ<EFBFBD><DDB8>Ƶ<EFBFBD><C6B5><EFBFBD>β
queue->tail = (queue->tail + 1) % queue->capacity; // <20><><EFBFBD><EFBFBD>βָ<CEB2>루ѭ<EBA3A8><D1AD><EFBFBD><EFBFBD>
queue->size++; // <20><><EFBFBD><EFBFBD>Ԫ<EFBFBD><D4AA><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
return 1;
}
/**
* \brief ǿ<><C7BF><EFBFBD><EFBFBD><EFBFBD>Ӳ<EFBFBD><D3B2><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʽ<EFBFBD><CABD><EFBFBD>ӣ<EFBFBD>
* \param[in] queue: <20><><EFBFBD>ж<EFBFBD><D0B6><EFBFBD>ָ<EFBFBD><D6B8>
* \param[in] data: <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݵ<EFBFBD>ַ<EFBFBD><D6B7>NULL<4C><4C>ʾ<EFBFBD><CABE><EFBFBD>ƶ<EFBFBD>ָ<EFBFBD>룩
* \return 1=<3D>ɹ<EFBFBD>, 0=ʧ<>ܣ<EFBFBD><DCA3><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Чʱ<D0A7><CAB1>
*
* \details <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>δ<EFBFBD><CEB4>ʱ<EFBFBD><CAB1>ͬ<EFBFBD><CDAC>queue_push()<29><>
* <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʱ<EFBFBD><CAB1><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݣ<EFBFBD><DDA3><EFBFBD>ͷ<EFBFBD><CDB7><EFBFBD>ݣ<EFBFBD><DDA3><EFBFBD>
* ʵ<><CAB5>ѭ<EFBFBD><D1AD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ч<EFBFBD><D0A7><EFBFBD><EFBFBD>
*/
int queue_push2(queue queue, void* data)
{
if (!queue) return 0;
if (queue->size < queue->capacity) return queue_push(queue, data); // <20><><EFBFBD><EFBFBD>δ<EFBFBD><CEB4>ʱ<EFBFBD><CAB1><EFBFBD>ñ<EFBFBD>׼<EFBFBD><D7BC><EFBFBD><EFBFBD>
// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʱ<EFBFBD><CAB1><EFBFBD>Ƕ<EFBFBD>ͷ<EFBFBD><CDB7><EFBFBD>ݣ<EFBFBD>ʵ<EFBFBD><CAB5>ѭ<EFBFBD><D1AD><EFBFBD><EFBFBD><EFBFBD>ǣ<EFBFBD>
if (data) assign(at(queue->tail), data);
queue->tail = (queue->tail + 1) % queue->capacity;
queue->head = (queue->head + 1) % queue->capacity; // ͷָ<CDB7><D6B8><EFBFBD><EFBFBD><EFBFBD>ƣ<EFBFBD><C6A3><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݣ<EFBFBD>
return 1;
}
/**
* \brief <20><><EFBFBD>Ӳ<EFBFBD><D3B2><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ͷ<EFBFBD>Ƴ<EFBFBD><C6B3><EFBFBD>
* \param[in] queue: <20><><EFBFBD>ж<EFBFBD><D0B6><EFBFBD>ָ<EFBFBD><D6B8>
* \param[out] data: <20><><EFBFBD>ݽ<EFBFBD><DDBD>յ<EFBFBD>ַ<EFBFBD><D6B7>NULL<4C><4C>ʾ<EFBFBD><CABE><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݣ<EFBFBD>
* \return 1=<3D>ɹ<EFBFBD>, 0=ʧ<>ܣ<EFBFBD><DCA3><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ч<EFBFBD><D0A7>Ϊ<EFBFBD>գ<EFBFBD>
*
* \details <20>Ӷ<EFBFBD><D3B6><EFBFBD>ͷ<EFBFBD><CDB7><EFBFBD>Ƴ<EFBFBD>Ԫ<EFBFBD>ء<EFBFBD><D8A1><EFBFBD><EFBFBD><EFBFBD>data<74><61>ΪNULL<4C><4C>
* <20><><EFBFBD>Ƴ<EFBFBD><C6B3><EFBFBD>Ԫ<EFBFBD>ظ<EFBFBD><D8B8>Ƶ<EFBFBD>ָ<EFBFBD><D6B8><EFBFBD><EFBFBD>ַ<EFBFBD><D6B7>
* <20><><EFBFBD><EFBFBD>ͷָ<CDB7><D6B8><EFBFBD>Ͷ<EFBFBD><CDB6>д<EFBFBD>С<EFBFBD><D0A1>
*/
int queue_pop(queue queue, void* data)
{
if (!queue) return 0;
if (queue->size == 0) return 0; // <20><><EFBFBD><EFBFBD>Ϊ<EFBFBD><CEAA>
if (data) assign(data, at(queue->head)); // <20><><EFBFBD>ƶ<EFBFBD>ͷ<EFBFBD><CDB7><EFBFBD>ݵ<EFBFBD><DDB5><EFBFBD><EFBFBD><EFBFBD>
queue->head = (queue->head + 1) % queue->capacity; // <20><><EFBFBD><EFBFBD>ͷָ<CDB7>루ѭ<EBA3A8><D1AD><EFBFBD><EFBFBD>
queue->size--; // <20><><EFBFBD><EFBFBD>Ԫ<EFBFBD><D4AA><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
return 1;
}
/**
* \brief ָ<><D6B8>λ<EFBFBD>ò<EFBFBD><C3B2><EFBFBD>Ԫ<EFBFBD><D4AA>
* \param[in] queue: <20><><EFBFBD>ж<EFBFBD><D0B6><EFBFBD>ָ<EFBFBD><D6B8>
* \param[in] index: <20><><EFBFBD><EFBFBD>λ<EFBFBD><CEBB><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>0=<3D><>ͷ, size=<3D><>β<EFBFBD><CEB2>
* \param[in] data: <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݵ<EFBFBD>ַ<EFBFBD><D6B7>NULL<4C><4C>ʾ<EFBFBD><CABE><EFBFBD>ճ<EFBFBD>λ<EFBFBD>ã<EFBFBD>
* \return 1=<3D>ɹ<EFBFBD>, 0=ʧ<>ܣ<EFBFBD><DCA3><EFBFBD><EFBFBD><EFBFBD>Խ<EFBFBD><D4BD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
*
* \details <20><>ָ<EFBFBD><D6B8>λ<EFBFBD>ò<EFBFBD><C3B2><EFBFBD><EFBFBD><EFBFBD>Ԫ<EFBFBD>أ<EFBFBD><D8A3><EFBFBD><EFBFBD><EFBFBD>Ԫ<EFBFBD>غ<EFBFBD><D8BA>ơ<EFBFBD>
* <20>Զ<EFBFBD>ѡ<EFBFBD><D1A1><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ƶ<EFBFBD><C6B6><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ǰ<EFBFBD>ƻ<EFBFBD><C6BB><EFBFBD><EFBFBD><EFBFBD>Ԫ<EFBFBD>أ<EFBFBD><D8A3><EFBFBD>
* ʱ<>临<EFBFBD>Ӷ<EFBFBD>O(min(index, size-index))<29><>
*/
int queue_insert(queue queue, int index, void* data)
{
if (!queue) return 0;
if (index < 0 || index > queue->size) return 0; // <20><><EFBFBD><EFBFBD>Խ<EFBFBD><D4BD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
if (queue->size == queue->capacity) return 0; // <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
// <20><><EFBFBD>ݲ<EFBFBD><DDB2><EFBFBD>λ<EFBFBD><CEBB>ѡ<EFBFBD><D1A1><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ƶ<EFBFBD><C6B6><EFBFBD><EFBFBD><EFBFBD>
if (index <= queue->size / 2) {
// <20><>ǰ<EFBFBD>ƶ<EFBFBD>ǰ<EFBFBD>벿<EFBFBD><EBB2BF>Ԫ<EFBFBD><D4AA>
move_forward(queue, 0, index);
queue->head = (queue->head + queue->capacity - 1) % queue->capacity; // ͷָ<CDB7><D6B8>ǰ<EFBFBD><C7B0>
} else {
// <20><><EFBFBD><EFBFBD><EFBFBD>ƶ<EFBFBD><C6B6><EFBFBD><EFBFBD>벿<EFBFBD><EBB2BF>Ԫ<EFBFBD><D4AA>
move_backward(queue, index, queue->size - index);
queue->tail = (queue->tail + 1) % queue->capacity; // βָ<CEB2><D6B8><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
}
// <20>ڿճ<DABF><D5B3><EFBFBD>λ<EFBFBD>ò<EFBFBD><C3B2><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
if (data) assign(at((queue->head + index) % (queue->capacity)), data);
queue->size++;
return 1;
}
/**
* \brief ָ<><D6B8>λ<EFBFBD><CEBB>ɾ<EFBFBD><C9BE>Ԫ<EFBFBD><D4AA>
* \param[in] queue: <20><><EFBFBD>ж<EFBFBD><D0B6><EFBFBD>ָ<EFBFBD><D6B8>
* \param[in] index: ɾ<><C9BE>λ<EFBFBD><CEBB><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>0=<3D><>ͷ, size-1=<3D><>β<EFBFBD><CEB2>
* \param[out] data: <20><><EFBFBD>ݽ<EFBFBD><DDBD>յ<EFBFBD>ַ<EFBFBD><D6B7>NULL<4C><4C>ʾ<EFBFBD><CABE><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݣ<EFBFBD>
* \return 1=<3D>ɹ<EFBFBD>, 0=ʧ<>ܣ<EFBFBD><DCA3><EFBFBD><EFBFBD><EFBFBD>Խ<EFBFBD><D4BD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ϊ<EFBFBD>գ<EFBFBD>
*
* \details ɾ<><C9BE>ָ<EFBFBD><D6B8>λ<EFBFBD><CEBB>Ԫ<EFBFBD>أ<EFBFBD><D8A3><EFBFBD><EFBFBD><EFBFBD>Ԫ<EFBFBD><D4AA>ǰ<EFBFBD>ơ<EFBFBD>
* <20>Զ<EFBFBD>ѡ<EFBFBD><D1A1><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ƶ<EFBFBD><C6B6><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
* ʱ<>临<EFBFBD>Ӷ<EFBFBD>O(min(index, size-index))<29><>
*/
int queue_erase(queue queue, int index, void* data)
{
if (!queue) return 0;
if (index < 0 || index >= queue->size) return 0; // <20><><EFBFBD><EFBFBD>Խ<EFBFBD><D4BD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
if (queue->size == 0) return 0; // <20><><EFBFBD><EFBFBD>Ϊ<EFBFBD><CEAA>
// <20><><EFBFBD>汻ɾ<E6B1BB><C9BE>Ԫ<EFBFBD>أ<EFBFBD><D8A3><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ҫ<EFBFBD><D2AA>
if (data) assign(data, at((queue->head + index) % (queue->capacity)));
// <20><><EFBFBD><EFBFBD>ɾ<EFBFBD><C9BE>λ<EFBFBD><CEBB>ѡ<EFBFBD><D1A1><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ƶ<EFBFBD><C6B6><EFBFBD><EFBFBD><EFBFBD>
if (index <= queue->size / 2) {
// <20><><EFBFBD><EFBFBD><EFBFBD>ƶ<EFBFBD>ǰ<EFBFBD>벿<EFBFBD><EBB2BF>Ԫ<EFBFBD><D4AA>
move_backward(queue, 0, index);
queue->head = (queue->head + 1) % queue->capacity; // ͷָ<CDB7><D6B8><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
} else {
// <20><>ǰ<EFBFBD>ƶ<EFBFBD><C6B6><EFBFBD><EFBFBD>벿<EFBFBD><EBB2BF>Ԫ<EFBFBD><D4AA>
move_forward(queue, index + 1, queue->size - index - 1);
queue->tail = (queue->tail + queue->capacity - 1) % queue->capacity; // βָ<CEB2><D6B8>ǰ<EFBFBD><C7B0>
}
queue->size--;
return 1;
}
/**
* \brief <20><><EFBFBD>ն<EFBFBD><D5B6><EFBFBD>
* \param[in] queue: <20><><EFBFBD>ж<EFBFBD><D0B6><EFBFBD>ָ<EFBFBD><D6B8>
*
* \details <20><><EFBFBD>ö<EFBFBD><C3B6><EFBFBD>״̬<D7B4><CCAC>ͷβָ<CEB2><D6B8><EFBFBD><EFBFBD><EFBFBD>㣬<EFBFBD><E3A3AC>С<EFBFBD><D0A1><EFBFBD>㣩<EFBFBD><E3A3A9>
* <20><><EFBFBD>ͷŴ洢<C5B4>ڴ棬<DAB4><E6A3AC><EFBFBD>ֶ<EFBFBD><D6B6><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>䡣
*/
void queue_clear(queue queue)
{
if (!queue) return;
queue->tail = 0;
queue->head = 0;
queue->size = 0;
}
/**
* \brief <20><>ȡԪ<C8A1>ص<EFBFBD>ַ
* \param[in] queue: <20><><EFBFBD>ж<EFBFBD><D0B6><EFBFBD>ָ<EFBFBD><D6B8>
* \param[in] index: Ԫ<><D4AA><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>0=<3D><>ͷ, size-1=<3D><>β<EFBFBD><CEB2>
* \return Ԫ<>ص<EFBFBD>ַ<EFBFBD><D6B7>ʧ<EFBFBD>ܷ<EFBFBD><DCB7><EFBFBD>NULL<4C><4C>
*
* \details <20><>ȡ<EFBFBD><C8A1><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ָ<EFBFBD><D6B8>λ<EFBFBD><CEBB>Ԫ<EFBFBD>ص<EFBFBD>ֱ<EFBFBD><D6B1>ָ<EFBFBD>롣
* <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ֱ<EFBFBD><D6B1><EFBFBD>޸<EFBFBD>Ԫ<EFBFBD><D4AA>ֵ<EFBFBD><D6B5><EFBFBD><EFBFBD><EFBFBD>踴<EFBFBD>ƣ<EFBFBD><C6A3><EFBFBD>
* \warning <20><><EFBFBD>ص<EFBFBD>ָ<EFBFBD><D6B8><EFBFBD>ڶ<EFBFBD><DAB6>нṹ<D0BD>޸ĺ<DEB8><C4BA><EFBFBD><EFBFBD><EFBFBD>ʧЧ<CAA7><D0A7>
*/
void* queue_data(queue queue, int index)
{
if (!queue) return 0;
if (index < 0 || index >= queue->size) return 0; // <20><><EFBFBD><EFBFBD>Խ<EFBFBD><D4BD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
return (void*)at((queue->head + index) % (queue->capacity));
}

119
calib_board/usr/algo/algo_queue.h Normal file
View File

@@ -0,0 +1,119 @@
#ifndef _ALGO_QUEUE_H_
#define _ALGO_QUEUE_H_
/* <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ͷ<EFBFBD><CDB6><EFBFBD> */
typedef struct QUEUE
{
void* base; /* <20><><EFBFBD>ݴ洢<DDB4><E6B4A2><EFBFBD>Ļ<EFBFBD><C4BB><EFBFBD>ַ */
int dsize; /* ÿ<><C3BF><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ԫ<EFBFBD>صĴ<D8B5>С<EFBFBD><D0A1><EFBFBD>ֽڣ<D6BD> */
int capacity; /* <20><><EFBFBD>е<EFBFBD><D0B5><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ԫ<EFBFBD><D4AA><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> */
int size; /* <20><>ǰ<EFBFBD><C7B0><EFBFBD><EFBFBD><EFBFBD>е<EFBFBD>Ԫ<EFBFBD><D4AA><EFBFBD><EFBFBD><EFBFBD><EFBFBD> */
int head; /* <20><>ͷ<EFBFBD><CDB7><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ָ<EFBFBD><D6B8><EFBFBD><EFBFBD>һ<EFBFBD><D2BB>Ԫ<EFBFBD>أ<EFBFBD> */
int tail; /* <20><>β<EFBFBD><CEB2><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ָ<EFBFBD><D6B8><EFBFBD><EFBFBD>һ<EFBFBD><D2BB><EFBFBD><EFBFBD><EFBFBD><EFBFBD>λ<EFBFBD>ã<EFBFBD> */
} *queue; // <20><><EFBFBD><EFBFBD>queueΪָ<CEAA><D6B8><EFBFBD>ýṹ<C3BD><E1B9B9>ָ<EFBFBD><D6B8><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
/**
* \brief <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʼ<EFBFBD><CABC>һ<EFBFBD><D2BB><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
* \param[in] type: <20><><EFBFBD><EFBFBD>Ԫ<EFBFBD>ص<EFBFBD><D8B5><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
* \param[in] capacity: <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
* \return <20><>ʼ<EFBFBD><CABC><EFBFBD><EFBFBD><EFBFBD>ɵĶ<C9B5><C4B6>ж<EFBFBD><D0B6><EFBFBD>
*
* \note ʹ<>ø<EFBFBD><C3B8><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ջ<EFBFBD>ϴ<EFBFBD><CFB4><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ж<EFBFBD><D0B6><EFBFBD>
* \example queue(int, 10) <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ϊ10<31><30><EFBFBD><EFBFBD><EFBFBD>Ͷ<EFBFBD><CDB6><EFBFBD>
*/
#define queue(type, capacity) (&(struct QUEUE){(type[capacity]){0},sizeof(type),capacity,0,0,0})
// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
int queue_push(queue queue, void* data);
int queue_push2(queue queue, void* data);
int queue_pop(queue queue, void* data);
int queue_insert(queue queue, int index, void* data);
int queue_erase(queue queue, int index, void* data);
void queue_clear(queue queue);
void* queue_data(queue queue, int index);
/**
* \brief <20><><EFBFBD>ʶ<EFBFBD><CAB6><EFBFBD>ָ<EFBFBD><D6B8>λ<EFBFBD>õ<EFBFBD>Ԫ<EFBFBD><D4AA>
* \param[in] queue: <20><><EFBFBD>ж<EFBFBD><D0B6><EFBFBD>
* \param[in] type: Ԫ<><D4AA><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
* \param[in] i: Ԫ<><D4AA>λ<EFBFBD><CEBB><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>0-based<65><64>
* \return ָ<><D6B8>Ԫ<EFBFBD>ص<EFBFBD><D8B5><EFBFBD>ֵ<EFBFBD><D6B5><EFBFBD><EFBFBD>
*
* \example queue_at(q, int, 0) = 42; // <20><><EFBFBD>ö<EFBFBD><C3B6><EFBFBD>Ԫ<EFBFBD><D4AA>
*/
#define queue_at(queue, type, i) (*(type *)queue_data((queue),(i)))
/**
* \brief <20>ڶ<EFBFBD>ͷ<EFBFBD><CDB7><EFBFBD><EFBFBD>Ԫ<EFBFBD><D4AA>
* \param[in] queue: <20><><EFBFBD>ж<EFBFBD><D0B6><EFBFBD>
* \param[in] data: <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݵ<EFBFBD>ַ<EFBFBD><D6B7>NULL<4C><4C>ʾ<EFBFBD><CABE><EFBFBD><EFBFBD>ֵ<EFBFBD><D6B5>
* \return <20><><EFBFBD><EFBFBD><EFBFBD>ɹ<EFBFBD>״̬<D7B4><CCAC>1<EFBFBD>ɹ<EFBFBD>/0ʧ<30>ܣ<EFBFBD>
*/
#define queue_push_front(queue, data) queue_insert((queue), 0, data)
/**
* \brief <20>ڶ<EFBFBD>β<EFBFBD><CEB2><EFBFBD><EFBFBD>Ԫ<EFBFBD><D4AA>
* \param[in] queue: <20><><EFBFBD>ж<EFBFBD><D0B6><EFBFBD>
* \param[in] data: <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݵ<EFBFBD>ַ<EFBFBD><D6B7>NULL<4C><4C>ʾ<EFBFBD><CABE><EFBFBD><EFBFBD>ֵ<EFBFBD><D6B5>
* \return <20><><EFBFBD><EFBFBD><EFBFBD>ɹ<EFBFBD>״̬<D7B4><CCAC>1<EFBFBD>ɹ<EFBFBD>/0ʧ<30>ܣ<EFBFBD>
*/
#define queue_push_back(queue, data) queue_push2((queue), data)
/**
* \brief <20>Ӷ<EFBFBD>ͷ<EFBFBD><CDB7><EFBFBD><EFBFBD>Ԫ<EFBFBD><D4AA>
* \param[in] queue: <20><><EFBFBD>ж<EFBFBD><D0B6><EFBFBD>
* \param[out] data: <20><><EFBFBD>յ<EFBFBD><D5B5><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݵĵ<DDB5>ַ<EFBFBD><D6B7>NULL<4C><4C>ʾ<EFBFBD><CABE><EFBFBD><EFBFBD><EFBFBD>棩
* \return <20><><EFBFBD><EFBFBD><EFBFBD>ɹ<EFBFBD>״̬<D7B4><CCAC>1<EFBFBD>ɹ<EFBFBD>/0ʧ<30>ܣ<EFBFBD>
*/
#define queue_pop_front(queue, data) queue_pop((queue), data)
/**
* \brief <20>Ӷ<EFBFBD>β<EFBFBD><CEB2><EFBFBD><EFBFBD>Ԫ<EFBFBD><D4AA>
* \param[in] queue: <20><><EFBFBD>ж<EFBFBD><D0B6><EFBFBD>
* \param[out] data: <20><><EFBFBD>յ<EFBFBD><D5B5><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݵĵ<DDB5>ַ<EFBFBD><D6B7>NULL<4C><4C>ʾ<EFBFBD><CABE><EFBFBD><EFBFBD><EFBFBD>棩
* \return <20><><EFBFBD><EFBFBD><EFBFBD>ɹ<EFBFBD>״̬<D7B4><CCAC>1<EFBFBD>ɹ<EFBFBD>/0ʧ<30>ܣ<EFBFBD>
*/
#define queue_pop_back(queue, data) queue_erase((queue), (queue)->size - 1, data)
/**
* \brief <20><>ȡ<EFBFBD><C8A1><EFBFBD>е<EFBFBD>ǰԪ<C7B0><D4AA><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
* \param[in] queue: <20><><EFBFBD>ж<EFBFBD><D0B6><EFBFBD>
* \return <20><><EFBFBD><EFBFBD><EFBFBD>е<EFBFBD>Ԫ<EFBFBD><D4AA><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
*/
#define queue_size(queue) ((queue)->size)
/**
* \brief <20><>ȡ<EFBFBD><C8A1><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
* \param[in] queue: <20><><EFBFBD>ж<EFBFBD><D0B6><EFBFBD>
* \return <20><><EFBFBD>е<EFBFBD><D0B5><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
*/
#define queue_capacity(queue) ((queue)->capacity)
/**
* \brief <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ƿ<EFBFBD>Ϊ<EFBFBD><CEAA>
* \param[in] queue: <20><><EFBFBD>ж<EFBFBD><D0B6><EFBFBD>
* \return 0<><30>ʾ<EFBFBD>ǿգ<C7BF><D5A3><EFBFBD>0<EFBFBD><30>ʾ<EFBFBD><CABE>
*/
#define queue_empty(queue) ((queue)->size == 0)
/**
* \brief <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ƿ<EFBFBD><C7B7><EFBFBD><EFBFBD><EFBFBD>
* \param[in] queue: <20><><EFBFBD>ж<EFBFBD><D0B6><EFBFBD>
* \return 0<><30>ʾδ<CABE><CEB4><EFBFBD><EFBFBD><EFBFBD><EFBFBD>0<EFBFBD><30>ʾ<EFBFBD><CABE><EFBFBD><EFBFBD>
*/
#define queue_full(queue) ((queue)->size == (queue)->capacity)
/**
* \brief <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ĵ<EFBFBD>ַ<EFBFBD><D6B7>װ
* \param[in] type: <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ͣ<EFBFBD><CDA3><EFBFBD>int/float<61>ȣ<EFBFBD>
* \param[in] value: <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ֵ
* \return <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ֵ<EFBFBD><D6B5><EFBFBD><EFBFBD>ʱ<EFBFBD><CAB1><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ַ
*
* \note <20><><EFBFBD>ڽ<EFBFBD><DABD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ת<EFBFBD><D7AA>Ϊָ<CEAA><D6B8><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
* \example queue_push(q, literal(int, 42));
*/
#ifndef literal
#define literal(type, value) ((type[1]){value})
#endif
#endif