basic_queue.hpp

#pragma once
 
#include <cstddef>
#include <cstdint>
 
#include "queue_base.hpp"
#include "queue_typed_base.hpp"
 
namespace LibXR
{
template <typename Data>
class Queue final : public QueueTypedBase<Queue<Data>, Data>, public QueueBase
{
 public:
  using ValueType = Data;  
  using QueueTypedBase<Queue<Data>, Data>::Pop;
  using QueueTypedBase<Queue<Data>, Data>::Push;
 
  explicit Queue(size_t length) : QueueBase(sizeof(Data), length) {}
 
  Queue(size_t length, uint8_t* buffer) : QueueBase(sizeof(Data), length, buffer) {}
 
  Data& operator[](int32_t index)
  {
    if (index >= 0)
    {
      index = (head_ + index) % length_;
    }
    else
    {
      index = (tail_ + index + length_) % length_;
    }
 
    return *reinterpret_cast<Data*>(&queue_array_[index * ELEMENT_SIZE]);
  }
 
  ErrorCode Peek(Data& data) { return QueueBase::PeekBytes(&data); }
 
  ErrorCode PushBatch(const Data* data, size_t size)
  {
    return QueueBase::PushBatchBytes(data, size);
  }
 
  ErrorCode PopBatch(Data* data, size_t size)
  {
    return QueueBase::PopBatchBytes(data, size);
  }
 
  ErrorCode PeekBatch(Data* data, size_t size)
  {
    return QueueBase::PeekBatchBytes(data, size);
  }
 
  ErrorCode Overwrite(const Data& data) { return QueueBase::OverwriteBytes(&data); }
 
  [[nodiscard]] size_t MaxSize() const { return QueueBase::MaxSize(); }
};
}  // namespace LibXR