环形缓冲区-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
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值