C++無鎖隊(duì)列的實(shí)現(xiàn)代碼

2020-02-24 14:31:56

字體：大中小

供稿：網(wǎng)友

武林技術(shù)頻道的編輯今天在這里給出的是C++無鎖隊(duì)列的實(shí)現(xiàn)代碼，主要用于一個(gè)線程讀取數(shù)據(jù)另外一個(gè)線程寫數(shù)據(jù)，下面就和武林技術(shù)小編一起來增長(zhǎng)見識(shí)，體驗(yàn)學(xué)習(xí)C++的樂趣吧。

#ifndef LOCK_FREE_QUEUE_H_
#define LOCK_FREE_QUEUE_H_

//不加鎖隊(duì)列，適合一個(gè)線程讀取，一個(gè)線程寫
#include <list>
template <typename T>
class LockFreeQueue
{
??? public:
??????? LockFreeQueue()
??????? {
???????????? list.push_back(T());//分割節(jié)點(diǎn)
???????????? iHead = list.begin();
???????????? iTail = list.end();
??????? };

?????? void Produce(const T& t) //存消息
?????? {
??????????? list.push_back(t);
??????????? iTail = list.end();
??????????? list.erase(list.begin(), iHead);
?????? };

?????? bool Consume(T& t) //取消息
?????? {
??????????? typename TList::iterator iNext = iHead;
??????????? ++iNext;
?????????? if (iNext != iTail)
?????????? {
??????????????? iHead = iNext;
??????????????? t = *iHead;
??????????????? return true;
?????????? }
?????????? return false;
?????? };

?????? bool Peek(T& t) //查看消息不刪除
?????? {
??????????? typename TList::iterator iNext = iHead;
??????????? ++iNext;
??????????? if (iNext != iTail)
??????????? {
??????????????? t = *iNext;
??????????????? return true;
??????????? }
??????????? return false;
?????? }

?????? bool IsEmpty()
?????? {
?????????? typename TList::iterator iNext = iHead;
????????? ++iNext;
????????? if (iNext != iTail)
????????? {
?????????????? return false;
????????? }
????????? else
????????? {
?????????????? return true;
????????? }
?????? }

?????? int GetMaxSize()
?????? {
?????????? return list.max_size();
?????? };

????? private:
?????????? typedef std::list<T> TList;
?????????? TList list;
?????????? typename TList::iterator iHead, iTail;
};
#endif