环形缓冲区-boost circular buffer & 读写锁(shared_mutex)

在涉及到缓存差值点数据的时候,一般会使用circular_buffer来实现。

It is a kind of sequence similar to std::list or std::deque. It supports random access iterators, constant time insert and erase operations at the beginning or the end of the buffer and interoperability with std algorithms.

cb

#include <boost/thread/locks.hpp>
#include <boost/thread/shared_mutex.hpp>  // 读写锁
#include <boost/circular_buffer.hpp>
template<typename T>
class MyCircularBuffer
{
public:
    MyCircularBuffer(int size) :
            buffer_(size)
    {
    };
    bool push_back(const T& item)
    {
        boost::unique_lock< boost::shared_mutex > write_lock(buffer_mutex_);
        if (buffer_.capacity() == 0)
            return false;

        if (!buffer_.full())
        {
            buffer_.push_back(item);
            return true;
        }
    };
    bool push_front(const T& item)
    {
        boost::unique_lock< boost::shared_mutex > write_lock(buffer_mutex_);
        if (buffer_.capacity() == 0)
            return false;
        buffer_.push_front(item);
        return true;
    };
    void clear()
    {
        boost::unique_lock< boost::shared_mutex > write_lock(buffer_mutex_);
        buffer_.clear();
    };
    T& front()
    {
        boost::shared_lock< boost::shared_mutex > read_lock(buffer_mutex_);
        return buffer_.front();
    };
    void pop_front()
    {
        boost::unique_lock< boost::shared_mutex > write_lock(buffer_mutex_);
        buffer_.pop_front();
    };
    void pop_back()
    {
        boost::unique_lock< boost::shared_mutex > write_lock(buffer_mutex_);
        buffer_.pop_back();
    };
    unsigned int size()
    {
        boost::shared_lock< boost::shared_mutex > read_lock(buffer_mutex_);
        return buffer_.size();
    };
    bool empty()
    {
        boost::shared_lock< boost::shared_mutex > read_lock(buffer_mutex_);
        return buffer_.empty();
    };
    bool full()
    {
        boost::shared_lock< boost::shared_mutex > read_lock(buffer_mutex_);
        return buffer_.full();
    };
    T& at(size_t index)
    {
        boost::shared_lock< boost::shared_mutex > read_lock(buffer_mutex_);
        try
        {
            buffer_.at(index);
        }
        catch(std::out_of_range& ex)
        {
            throw(ex);
        }
        return buffer_[index];
    };
    T& operator[](size_t index)
    {
        boost::shared_lock< boost::shared_mutex > read_lock(buffer_mutex_);
        return buffer_[index];
    };
private:
    boost::circular_buffer<T> buffer_;
    boost::shared_mutex  buffer_mutex_;

};

example:

#include <boost/circular_buffer.hpp>
#include <iostream>

int main()
{
  typedef boost::circular_buffer<int> circular_buffer;
  circular_buffer cb{3};  // c++11 统一初始化方式

  std::cout << cb.capacity() << '\n';
  std::cout << cb.size() << '\n';

  cb.push_back(0);
  cb.push_back(1);
  cb.push_back(2);

  std::cout << cb.size() << '\n';

  cb.push_back(3);
  cb.push_back(4);
  cb.push_back(5);

  std::cout << cb.size() << '\n';

  for (int i : cb)
    std::cout << i << '\n';
}
  • 1
    点赞
  • 7
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
回答: 代码片段中的`pthread_mutex_lock(&search_flag_mutex)`是用于对互斥锁进行加锁操作的语句。这是一个多线程编程中常用的函数,用于保护共享资源,防止多个线程同时访问导致数据不一致的问题。在C语言中,`pthread_mutex_lock`函数会尝试加锁,如果锁已经被其他线程占用,则当前线程会被阻塞,直到获得锁为止。在C中,标准库`std::mutex`只是对`pthread_mutex_t`的一个封装,提供了更便捷的操作方式,例如`lock()`函数用于加锁,`unlock()`函数用于解锁。而`pthread_mutex_lock`函数则是直接调用了操作系统提供的API对互斥锁进行操作。<span class="em">1</span><span class="em">2</span><span class="em">3</span> #### 引用[.reference_title] - *1* [pthread_mutex_lock](https://blog.csdn.net/wmzjzwlzs/article/details/128128030)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v92^chatsearchT3_1"}}] [.reference_item style="max-width: 33.333333333333336%"] - *2* [__pthread_mutex_lock_full](https://blog.csdn.net/wmzjzwlzs/article/details/131581081)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v92^chatsearchT3_1"}}] [.reference_item style="max-width: 33.333333333333336%"] - *3* [std:mutex和pthread_mutex_t区别 && <mutex>介绍](https://blog.csdn.net/weixin_51190277/article/details/126268745)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v92^chatsearchT3_1"}}] [.reference_item style="max-width: 33.333333333333336%"] [ .reference_list ]
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值