107 lines
2.6 KiB
C++
107 lines
2.6 KiB
C++
/*
|
|
* Created by Brett on 26/12/22.
|
|
* Licensed under GNU General Public License V3.0
|
|
* See LICENSE file for license detail
|
|
*/
|
|
|
|
#ifndef BLT_QUEUES_H
|
|
#define BLT_QUEUES_H
|
|
|
|
/**
|
|
* Do no use any queue in this file. They are slower than std::queue.
|
|
*/
|
|
namespace BLT {
|
|
|
|
template<typename T>
|
|
struct node {
|
|
T t;
|
|
node* next;
|
|
node(const T& t, node* next){
|
|
this->t = t;
|
|
this->next = next;
|
|
}
|
|
};
|
|
|
|
template<typename T>
|
|
class flat_queue {
|
|
private:
|
|
int size = 16;
|
|
int insertIndex = 0;
|
|
int headIndex = 0;
|
|
T* data = new T[size];
|
|
|
|
void expand(int newSize){
|
|
auto tempData = new T[newSize];
|
|
for (int i = 0; i < size - headIndex; i++)
|
|
tempData[i] = data[i + headIndex];
|
|
delete[] data;
|
|
insertIndex = size - headIndex;
|
|
headIndex = 0;
|
|
data = tempData;
|
|
size = newSize;
|
|
}
|
|
|
|
public:
|
|
|
|
void push(const T& t) {
|
|
if (insertIndex >= size){
|
|
expand(size * 2);
|
|
}
|
|
data[insertIndex++] = t;
|
|
}
|
|
|
|
[[nodiscard]] const T& front() const {
|
|
return data[headIndex];
|
|
}
|
|
|
|
void pop() {
|
|
headIndex++;
|
|
// queue is empty. Clear old data.
|
|
if (headIndex >= size){
|
|
delete[] data;
|
|
data = new T[size];
|
|
}
|
|
}
|
|
|
|
~flat_queue() {
|
|
delete[](data);
|
|
}
|
|
};
|
|
|
|
template<typename T>
|
|
class node_queue {
|
|
private:
|
|
node<T>* head;
|
|
public:
|
|
|
|
void push(const T& t) {
|
|
if (head == nullptr)
|
|
head = new node<T>(t, nullptr);
|
|
else
|
|
head = new node<T>(t, head);
|
|
}
|
|
|
|
[[nodiscard]] const T& front() const {
|
|
return head->t;
|
|
}
|
|
|
|
void pop() {
|
|
auto nextNode = head->next;
|
|
delete(head);
|
|
head = nextNode;
|
|
}
|
|
|
|
~node_queue() {
|
|
auto next = head;
|
|
while (next != nullptr){
|
|
auto nextNode = next->next;
|
|
delete(next);
|
|
next = nextNode;
|
|
}
|
|
}
|
|
};
|
|
|
|
}
|
|
|
|
#endif //BLT_QUEUES_H
|