| | |
| | | int main () { |
| | | unsigned int i = 0; |
| | | |
| | | |
| | | int key = 2; |
| | | |
| | | struct Item item; |
| | | |
| | | size_t qsize = 1; |
| | | LockFreeQueue<struct Item> *queue = QueueFactory::createQueue<struct Item> (2, qsize); |
| | | size_t qsize = 16; |
| | | LockFreeQueue<struct Item> *queue = QueueFactory::createQueue<struct Item> (key, qsize); |
| | | |
| | | // LockFreeQueue<struct Item> queue(16); |
| | | for(i = 0; i < qsize; i++) { |
| | |
| | | |
| | | i = 0; |
| | | while((queue->pop(item)) ) { |
| | | cout << i << " 出队:" << item.pic << ", " << item.info << endl; |
| | | cout << i << " pop:" << item.pic << ", " << item.info << endl; |
| | | // cout << item.pic << endl; |
| | | |
| | | i++; |
| | | |
| | | } |
| | | |
| | | |
| | | destroy(); |
| | | destroy(key); |
| | | |
| | | } |