How to implement a queue buffer in C++?

2 years ago
Sophia Anderson
1 minute

In C++, queue buffers can be implemented using std::queue from the STL library. std::queue is a container adapter that implements queue functionality based on underlying containers like deque or list. Here is an example code using std::queue to implement a queue buffer.

#include <iostream>
#include <queue>

int main() {
    std::queue<int> cache; // 创建一个整数类型的队列缓存

    // 向缓存中存入数据
    cache.push(1);
    cache.push(2);
    cache.push(3);

    // 读取并删除队列头部的元素
    while (!cache.empty()) {
        int front = cache.front();
        std::cout << front << " ";
        cache.pop();
    }

    return 0;
}

The output is: 1 2 3

In the example code above, a queue of integer type cache objects is first created using std::queue. Data is then stored in the cache using the push function, the front function is used to read the element at the front of the queue, and the pop function is used to remove the element at the front of the queue. Finally, the empty function is used to determine if the cache is empty.

bannerAds