mirror of https://github.com/pvnis/srsRAN_4G.git
You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
51 lines
1.1 KiB
C++
51 lines
1.1 KiB
C++
/**
|
|
*
|
|
* \section COPYRIGHT
|
|
*
|
|
* Copyright 2013-2020 Software Radio Systems Limited
|
|
*
|
|
* By using this file, you agree to the terms and conditions set
|
|
* forth in the LICENSE file which can be found at the top level of
|
|
* the distribution.
|
|
*
|
|
*/
|
|
|
|
#ifndef SRSLTE_CIRCULAR_ARRAY_H
|
|
#define SRSLTE_CIRCULAR_ARRAY_H
|
|
|
|
#include <array>
|
|
|
|
/**
|
|
*
|
|
* @file circular_array.h
|
|
*
|
|
* @brief Helper class to safely access elements of a std::array
|
|
*
|
|
* Protects from out-of-bounds access by applying modulo of it's length
|
|
* when using the [] operator for element access.
|
|
*
|
|
* This is useful for circular data structures, like TTIs or SNs.
|
|
*/
|
|
|
|
namespace srslte {
|
|
|
|
template <typename T, std::size_t N>
|
|
class circular_array
|
|
{
|
|
std::array<T, N> data{};
|
|
|
|
public:
|
|
T& operator[](std::size_t pos) { return data[pos % N]; }
|
|
const T& operator[](std::size_t pos) const { return data[pos % N]; }
|
|
|
|
T* begin() { return data.begin(); }
|
|
const T* begin() const { return data.begin(); }
|
|
|
|
T* end() { return data.end(); }
|
|
const T* end() const { return data.end(); }
|
|
};
|
|
|
|
} // namespace srslte
|
|
|
|
#endif // SRSLTE_CIRCULAR_ARRAY_H
|