内容来源:AI电堂的《不可错过的嵌入式C语言工具代码合集》文章。
/*
循环队列
循环队列是一种高效的数据结构,适用于缓冲区和数据流应用。例如串口通信接受缓冲。
*/
typedef struct {
int buffer[SIZE];
int head;
int tail;
int count;
} CircularBuffer;
void push(CircularBuffer *cb, int data) {
if (cb->count < SIZE) {
cb->buffer[cb->head] = data;
cb->head = (cb->head + 1) % SIZE;
cb->count++;
}
}
int pop(CircularBuffer *cb) {
if (cb->count > 0) {
int data = cb->buffer[cb->tail];
cb->tail = (cb->tail + 1) % SIZE;
cb->count--;
return data;
}
return -1; // Buffer is empty
}
/*
位域反转;
该函数将给定的无符号整数的位进行反转,可以用于某些嵌入式系统中的bit操作;
*/
unsigned int reverse_bits(unsigned int num) {
unsigned int numOfBits = sizeof(num) * 8;
unsigned int reverseNum = 0;
for (unsigned int i = 0; i < numOfBits; i++) {
if (num & (1 << i)) {
reverseNum |= (1 << ((numOfBits - 1) - i));
}
}
return reverseNum;
}
/*
获取某一位
*/
int get_bit(Bitset *bitset, int bit) {
return (bitset->bits >> bit) & 1U;
}
/*
二进制查找:用于在已排序的数组中执行二进制查找的函数。
*/
int binary_search(int arr[], int size, int target) {
int left = 0, right = size - 1;
while (left <= right) {
int mid = left + (right - left) / 2;
if (arr[mid] == target) {
return mid;
} else if (arr[mid] < target) {
left = mid + 1;
} else {
right = mid - 1;
}
}
return -1; // Not found
}