blob: 88e95e348024be73515a64f814388765a5d8d8c2 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
|
#pragma once
#include "Assertions.h"
#include "Types.h"
namespace AK {
template<typename T, size_t Capacity>
class CircularQueue {
public:
CircularQueue()
{
for (size_t i = 0; i < Capacity; ++i)
m_elements[i] = T();
}
bool is_empty() const { return !m_size; }
size_t size() const { return m_size; }
size_t capacity() const { return Capacity; }
void dump() const
{
kprintf("CircularQueue<%zu>:\n", Capacity);
kprintf(" size: %zu\n", m_size);
for (size_t i = 0; i < Capacity; ++i) {
kprintf(" [%zu] %d %c\n", i, m_elements[i], i == m_head ? '*' : ' ');
}
}
void enqueue(const T& t)
{
m_elements[(m_head + m_size) % Capacity] = t;
if (m_size == Capacity)
m_head = (m_head + 1) % Capacity;
else
++m_size;
}
T dequeue()
{
ASSERT(!is_empty());
T value = m_elements[m_head];
m_head = (m_head + 1) % Capacity;
--m_size;
return value;
}
private:
T m_elements[Capacity];
size_t m_size { 0 };
size_t m_head { 0 };
};
}
using AK::CircularQueue;
|
