zoukankan      html  css  js  c++  java
  • C+= concurrent_queue 线程安全测试

    更推荐使用:http://www.boost.org/doc/libs/1_56_0/doc/html/boost/lockfree/queue.html


    #include <include/tbb/tbb.h> #include <pthread.h> #include <iostream> using namespace std; #define NUM_THREAD 10 class person { public: person() { } person(int name, unsigned int thread_num){ this->name = name; this->thread_num = thread_num; } void print() { printf("%u %u ", thread_num, name); } private: int name; unsigned int thread_num; }; tbb::strict_ppl::concurrent_queue<person*> que; void* consumer(void* arg) { cout << arg << endl; while(true) { if(que.empty()) { cout << '.' << flush; sleep(1); } person* p; if(que.try_pop(p)) { p->print(); } } } void* producer(void* arg) { cout << arg << endl; unsigned int thread_num =(unsigned int)pthread_self(); for(int i=0; i<10; i++) { person* p = new person(i, thread_num); que.push(p); } } int main() { pthread_t tids_c[NUM_THREAD]; for(int i=0; i<NUM_THREAD; i++) { int ret = pthread_create(&tids_c[i], NULL, consumer, NULL); if(ret != 0) { cout << "start consumer failed" << endl; return -1; } } pthread_t tids[NUM_THREAD]; for(int i=0; i<NUM_THREAD; i++) { int ret = pthread_create(&tids[i], NULL, producer, NULL); if(ret != 0) { cout << "start produer failed" << endl; return -1; } } for(int i=0; i<NUM_THREAD; i++){ pthread_join(tids[i], NULL); pthread_join(tids_c[i], NULL); } cout << "exit" << endl; } /* vim: set ts=4 sw=4 sts=4 tw=100 */
    dic = {}
    with open('log.txt') as f:
        while True:
            line = f.readline()
            if not line:
                break;
            line = line.strip()
    
            arr = line.split('	')
            key = arr[1]
    
            if key not in dic:
                dic[key] = 1
            else:
                dic[key] += 1
    
        for key in dic:
            print key, dic[key]

  • 相关阅读:
    CodeForces Round #288 Div.2
    POJ 3660 Cow Contest【传递闭包】
    ZOJ 3321 Circle【并查集】
    CF 286(div 2) B Mr. Kitayuta's Colorful Graph【传递闭包】
    CF 287(div 2) B Amr and Pins
    HDU 2122 Ice_cream’s world III【最小生成树】
    HDU 1233 还是畅通工程【最小生成树】
    奶牛接力 矩阵乘法
    家谱 并差集
    昂贵的聘礼 最短路 dijkstra
  • 原文地址:https://www.cnblogs.com/i80386/p/4487441.html
Copyright © 2011-2022 走看看