IntrusiveDoubleLinkedList.h

// Copyright (c) Stefano Cristiano
// SPDX-License-Identifier: MIT
#pragma once
namespace SC
{
template <typename T>
struct IntrusiveDoubleLinkedList
{
    T* back  = nullptr; // has no next
    T* front = nullptr; // has no prev
 
    [[nodiscard]] bool isEmpty() const { return front == nullptr; }
 
    [[nodiscard]] T* dequeueFront();
 
    void clear();
 
    void appendBack(IntrusiveDoubleLinkedList& other);
 
    void queueBack(T& item);
 
    void remove(T& item);
 
  private:
    void queueBackUnchecked(T& item, T& newBack);
};
} // namespace SC