mirror of
https://github.com/hrydgard/ppsspp.git
synced 2025-04-02 11:01:50 -04:00
87 lines
2.2 KiB
C++
87 lines
2.2 KiB
C++
// Copyright (c) 2024- PPSSPP Project.
|
|
|
|
// This program is free software: you can redistribute it and/or modify
|
|
// it under the terms of the GNU General Public License as published by
|
|
// the Free Software Foundation, version 2.0 or later versions.
|
|
|
|
// This program is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU General Public License 2.0 for more details.
|
|
|
|
// A copy of the GPL 2.0 should have been included with the program.
|
|
// If not, see http://www.gnu.org/licenses/
|
|
|
|
// Official git repository and contact information can be found at
|
|
// https://github.com/hrydgard/ppsspp and http://www.ppsspp.org/.
|
|
|
|
#pragma once
|
|
|
|
#include <vector>
|
|
|
|
#include "Common/CommonTypes.h"
|
|
|
|
|
|
template <typename T>
|
|
struct CyclicBuffer {
|
|
std::vector<T> buffer;
|
|
u32 current_index;
|
|
bool overflow;
|
|
|
|
explicit CyclicBuffer(u32 capacity) : buffer(capacity, T()), current_index(0), overflow(false) {}
|
|
|
|
CyclicBuffer(): buffer(), current_index(0), overflow(false) {}
|
|
|
|
void push_back(const T& value);
|
|
void push_back(T&& value);
|
|
|
|
void clear();
|
|
void resize(u32 new_capacity);
|
|
|
|
std::vector<T> get_content() const;
|
|
};
|
|
|
|
template<typename T>
|
|
std::vector<T> CyclicBuffer<T>::get_content() const {
|
|
if (!overflow) {
|
|
return std::vector<T>(buffer.begin(), buffer.begin() + current_index);
|
|
}
|
|
|
|
std::vector<T> ans;
|
|
ans.reserve(buffer.size());
|
|
std::copy(buffer.begin() + current_index, buffer.end(), std::back_inserter(ans));
|
|
std::copy(buffer.begin(), buffer.begin() + current_index, std::back_inserter(ans));
|
|
return ans;
|
|
}
|
|
|
|
template <typename T>
|
|
void CyclicBuffer<T>::push_back(const T& value) {
|
|
buffer[current_index] = value;
|
|
++current_index;
|
|
if (current_index == buffer.size()) {
|
|
current_index = 0;
|
|
overflow = true;
|
|
}
|
|
}
|
|
|
|
template <typename T>
|
|
void CyclicBuffer<T>::push_back(T&& value) {
|
|
buffer[current_index] = std::move(value);
|
|
++current_index;
|
|
if (current_index == buffer.size()) {
|
|
current_index = 0;
|
|
overflow = true;
|
|
}
|
|
}
|
|
|
|
template <typename T>
|
|
void CyclicBuffer<T>::clear() {
|
|
buffer.clear();
|
|
current_index = 0;
|
|
overflow = false;
|
|
}
|
|
|
|
template <typename T>
|
|
void CyclicBuffer<T>::resize(u32 new_capacity) {
|
|
buffer.resize(new_capacity);
|
|
}
|