编辑“︁C++ 原子操作”︁（章节）

=== 无锁队列 ===  
原子操作可用于实现高性能无锁队列。以下是一个简化版实现：  

<syntaxhighlight lang="cpp">  
#include <atomic>  
#include <memory>  

template<typename T>  
class LockFreeQueue {  
private:  
    struct Node {  
        std::shared_ptr<T> data;  
        std::atomic<Node*> next;  
        Node(T const& value) : data(std::make_shared<T>(value)), next(nullptr) {}  
    };  

    std::atomic<Node*> head;  
    std::atomic<Node*> tail;  

public:  
    void push(T const& value) {  
        Node* new_node = new Node(value);  
        Node* old_tail = tail.load();  
        while (!tail.compare_exchange_weak(old_tail, new_node)) {  
            old_tail = tail.load();  
        }  
        old_tail->next = new_node;  
    }  

    std::shared_ptr<T> pop() {  
        Node* old_head = head.load();  
        while (old_head && !head.compare_exchange_weak(old_head, old_head->next.load())) {  
            old_head = head.load();  
        }  
        return old_head ? old_head->data : std::shared_ptr<T>();  
    }  
};  
</syntaxhighlight>