mirror of
https://github.com/SerenityOS/serenity
synced 2024-07-21 10:05:32 +00:00
1682f0b760
SPDX License Identifiers are a more compact / standardized way of representing file license information. See: https://spdx.dev/resources/use/#identifiers This was done with the `ambr` search and replace tool. ambr --no-parent-ignore --key-from-file --rep-from-file key.txt rep.txt *
45 lines
958 B
C++
45 lines
958 B
C++
/*
|
|
* Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
|
|
*
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <AK/CircularQueue.h>
|
|
#include <AK/Types.h>
|
|
|
|
namespace AK {
|
|
|
|
template<typename T, size_t Capacity>
|
|
class CircularDeque : public CircularQueue<T, Capacity> {
|
|
public:
|
|
template<typename U = T>
|
|
void enqueue_begin(U&& value)
|
|
{
|
|
const auto new_head = (this->m_head - 1 + Capacity) % Capacity;
|
|
auto& slot = this->elements()[new_head];
|
|
if (this->m_size == Capacity)
|
|
slot.~T();
|
|
else
|
|
++this->m_size;
|
|
|
|
new (&slot) T(forward<U>(value));
|
|
this->m_head = new_head;
|
|
}
|
|
|
|
T dequeue_end()
|
|
{
|
|
VERIFY(!this->is_empty());
|
|
auto& slot = this->elements()[(this->m_head + this->m_size - 1) % Capacity];
|
|
T value = move(slot);
|
|
slot.~T();
|
|
this->m_size--;
|
|
return value;
|
|
}
|
|
};
|
|
|
|
}
|
|
|
|
using AK::CircularDeque;
|