| | |
| | | struct Item item; |
| | | |
| | | size_t qsize = 16; |
| | | LockFreeQueue<struct Item> *queue = QueueFactory::createQueue<struct Item> (key, qsize); |
| | | |
| | | //LockFreeQueue<struct Item> *queue = QueueFactory::createQueue<struct Item> (key, qsize); |
| | | SHMQueue<struct Item> *queue = new SHMQueue<struct Item>(key, 16); |
| | | // LockFreeQueue<struct Item> queue(16); |
| | | for(i = 0; i < qsize; i++) { |
| | | |
| | |
| | | } |
| | | } |
| | | |
| | | // for(i = 0; i < qsize; i++) { |
| | | for(i = 0; i < qsize; i++) { |
| | | |
| | | // //queue.dequeue(item); |
| | | //queue.dequeue(item); |
| | | |
| | | // item = (*queue)[i]; |
| | | // cout << "i=" << i << " item " << item.pic << "," << item.info << endl; |
| | | // } |
| | | item = (*queue)[i]; |
| | | cout << "i=" << i << " item " << item.pic << "," << item.info << endl; |
| | | } |
| | | |
| | | |
| | | |
| | |
| | | i++; |
| | | } |
| | | |
| | | |
| | | destroy(key); |
| | | delete queue; |
| | | mm_destroy(); |
| | | |
| | | } |