10 #ifndef SMALLSTACK_TYPE_HPP
11 #define SMALLSTACK_TYPE_HPP
20 template<
typename Titem,
typename Tindex, Tindex Tgrowth_step, Tindex Tmax_size>
23 inline SimplePool() : first_unused(0), first_free(0) {}
30 inline std::mutex &
GetMutex() {
return this->mutex; }
36 inline Titem &
Get(Tindex index) {
return this->data[index]; }
44 Tindex index = this->FindFirstFree();
45 if (index < Tmax_size) {
46 this->data[index].valid =
true;
47 this->first_free = index + 1;
48 this->first_unused = std::max(this->first_unused, this->first_free);
59 this->data[index].valid =
false;
60 this->first_free = std::min(this->first_free, index);
65 inline Tindex FindFirstFree()
67 Tindex index = this->first_free;
68 for (; index < this->first_unused; index++) {
69 if (!this->data[index].
valid)
return index;
72 if (index >= this->data.size() && index < Tmax_size) {
73 this->data.resize(index + 1);
86 std::vector<SimplePoolPoolItem> data;
93 template <
typename Titem,
typename Tindex>
134 template <
typename Titem,
typename Tindex, Titem Tinval
id, Tindex Tgrowth_step, Tindex Tmax_size>
161 while (this->
next != Tmax_size) this->
Pop();
177 if (
this == &other)
return *
this;
178 while (this->
next != Tmax_size) this->
Pop();
192 inline void Push(
const Titem &item)
194 if (this->
value != Tinvalid) {
195 std::lock_guard<std::mutex>
lock(SmallStack::GetPool().GetMutex());
196 Tindex new_item = SmallStack::GetPool().
Create();
197 if (new_item != Tmax_size) {
202 this->
next = new_item;
214 Titem ret = this->
value;
215 if (this->
next == Tmax_size) {
216 this->
value = Tinvalid;
218 std::lock_guard<std::mutex>
lock(SmallStack::GetPool().GetMutex());
226 if (popped.
next != Tmax_size) {
227 ++(SmallStack::GetPool().
Get(popped.
next).branch_count);
245 return this->
value == Tinvalid && this->
next == Tmax_size;
255 if (item == Tinvalid || item == this->
value)
return true;
256 if (this->
next != Tmax_size) {
257 std::lock_guard<std::mutex>
lock(SmallStack::GetPool().GetMutex());
261 static_cast<const Item *
>(&SmallStack::GetPool().
Get(in_list->
next)));
262 if (in_list->
value == item)
return true;
263 }
while (in_list->
next != Tmax_size);
269 static SmallStackPool &GetPool()
271 static SmallStackPool pool;
280 if (this->
next != Tmax_size) {
281 std::lock_guard<std::mutex>
lock(SmallStack::GetPool().GetMutex());
282 ++(SmallStack::GetPool().
Get(this->
next).branch_count);
A simplified pool which stores values instead of pointers and doesn't redefine operator new/delete.
Titem & Get(Tindex index)
Get the item at position index.
std::mutex & GetMutex()
Get the mutex.
Tindex Create()
Create a new item and return its index.
void Destroy(Tindex index)
Destroy (or rather invalidate) the item at the given index.
Minimal stack that uses a pool to avoid pointers.
bool Contains(const Titem &item) const
Check if the given item is contained in the stack.
void Branch()
Create a branch in the pool if necessary.
Titem Pop()
Pop an item from the stack.
SmallStack(const SmallStack &other)
Shallow copy the stack, marking the first item as branched.
SmallStack(const Titem &value=Tinvalid)
Constructor for a stack with one or two items in it.
bool IsEmpty() const
Check if the stack is empty.
void Push(const Titem &item)
Pushes a new item onto the stack if there is still space in the underlying pool.
SmallStack & operator=(const SmallStack &other)
Shallow copy the stack, marking the first item as branched.
~SmallStack()
Remove the head of stack and all other items members that are unique to it.
uint8_t valid
Bits indicating what variable is valid (for each bit, 0 is invalid, 1 is valid).
Base class for SmallStack.
Titem value
Value of current item.
Tindex next
Pool index of next item.
SmallStackItem(const Titem &value, Tindex next)
Create a new item.
SmallStack item that can be kept in a pool.
Tindex branch_count
Number of branches in the tree structure this item is parent of.
std::mutex lock
synchronization for playback status fields