zoukankan      html  css  js  c++  java
  • boost::lockfree::queue

    #include <boost/thread/thread.hpp>
    #include <boost/lockfree/queue.hpp>
    #include <iostream>
    
    #include <boost/atomic.hpp>
    
    boost::atomic_int producer_count(0);
    boost::atomic_int consumer_count(0);
    
    boost::lockfree::queue<int> queue(128);//无锁的多生产者多消费者队列
    
    const int iterations = 10000;
    const int producer_thread_count = 4;
    const int consumer_thread_count = 4;
    
    void producer(void)
    {
        for (int i = 0; i != iterations; ++i) {
            int value = ++producer_count;
            while (!queue.push(value))
                ;
        }
    }
    
    boost::atomic<bool> done (false);
    void consumer(void)
    {
        int value;
        while (!done) {
            while (queue.pop(value))
                ++consumer_count;
        }
    
        while (queue.pop(value))
            ++consumer_count;
    }
    
    int main(int argc, char* argv[])
    {
        using namespace std;
        cout << "boost::lockfree::queue is ";
        if (!queue.is_lock_free())
            cout << "not ";
        cout << "lockfree" << endl;
    
        boost::thread_group producer_threads, consumer_threads;//线程组
    
        for (int i = 0; i != producer_thread_count; ++i)
            producer_threads.create_thread(producer);
    
        for (int i = 0; i != consumer_thread_count; ++i)
            consumer_threads.create_thread(consumer);
    
        producer_threads.join_all();
        done = true;
    
        consumer_threads.join_all();
    
        cout << "produced " << producer_count << " objects." << endl;
        cout << "consumed " << consumer_count << " objects." << endl;
        getchar();
    }
  • 相关阅读:
    Docker Private Registry
    Dockerfile
    docker存储卷
    392. 判断子序列
    1576. 替换所有的问号
    270. 最接近的二叉搜索树值
    292. Nim 游戏
    680. 验证回文字符串 Ⅱ
    876. 链表的中间结点
    543. 二叉树的直径
  • 原文地址:https://www.cnblogs.com/zzyoucan/p/3828566.html
Copyright © 2011-2022 走看看