ladybird/AK/InlineLinkedList.h

207 lines
3.8 KiB
C
Raw Normal View History

#pragma once
#include "Assertions.h"
2018-12-03 00:18:54 +00:00
#include "Types.h"
namespace AK {
template<typename T>
class InlineLinkedListNode {
public:
2018-10-17 08:55:43 +00:00
InlineLinkedListNode();
2018-12-21 01:10:45 +00:00
void set_prev(T*);
void set_next(T*);
T* prev() const;
T* next() const;
};
template<typename T>
inline InlineLinkedListNode<T>::InlineLinkedListNode()
{
2018-12-21 01:10:45 +00:00
set_prev(0);
set_next(0);
}
template<typename T>
inline void InlineLinkedListNode<T>::set_prev(T* prev)
{
static_cast<T*>(this)->m_prev = prev;
}
template<typename T>
inline void InlineLinkedListNode<T>::set_next(T* next)
{
static_cast<T*>(this)->m_next = next;
}
template<typename T>
inline T* InlineLinkedListNode<T>::prev() const
{
return static_cast<const T*>(this)->m_prev;
}
template<typename T>
inline T* InlineLinkedListNode<T>::next() const
{
return static_cast<const T*>(this)->m_next;
}
template<typename T>
class InlineLinkedList {
public:
InlineLinkedList() {}
2018-12-21 01:10:45 +00:00
bool is_empty() const { return !m_head; }
size_t size_slow() const;
void clear();
T* head() const { return m_head; }
2018-12-21 01:10:45 +00:00
T* remove_head();
T* remove_tail();
T* tail() const { return m_tail; }
void prepend(T*);
void append(T*);
void remove(T*);
2018-10-17 08:55:43 +00:00
void append(InlineLinkedList<T>&);
2018-12-21 01:10:45 +00:00
bool contains_slow(T* value) const
{
for (T* node = m_head; node; node = node->next()) {
if (node == value)
return true;
}
return false;
}
private:
T* m_head { nullptr };
T* m_tail { nullptr };
};
template<typename T>
inline size_t InlineLinkedList<T>::size_slow() const
{
size_t size = 0;
for (T* node = m_head; node; node = node->next())
++size;
return size;
}
template<typename T>
inline void InlineLinkedList<T>::clear()
{
m_head = 0;
m_tail = 0;
}
template<typename T>
inline void InlineLinkedList<T>::prepend(T* node)
{
if (!m_head) {
ASSERT(!m_tail);
m_head = node;
m_tail = node;
2018-12-21 01:10:45 +00:00
node->set_prev(0);
node->set_next(0);
return;
}
ASSERT(m_tail);
2018-12-21 01:10:45 +00:00
m_head->set_prev(node);
node->set_next(m_head);
node->set_prev(0);
m_head = node;
}
template<typename T>
inline void InlineLinkedList<T>::append(T* node)
{
if (!m_tail) {
ASSERT(!m_head);
m_head = node;
m_tail = node;
2018-12-21 01:10:45 +00:00
node->set_prev(0);
node->set_next(0);
return;
}
ASSERT(m_head);
2018-12-21 01:10:45 +00:00
m_tail->set_next(node);
node->set_prev(m_tail);
node->set_next(0);
m_tail = node;
}
template<typename T>
inline void InlineLinkedList<T>::remove(T* node)
{
if (node->prev()) {
ASSERT(node != m_head);
2018-12-21 01:10:45 +00:00
node->prev()->set_next(node->next());
} else {
ASSERT(node == m_head);
m_head = node->next();
}
if (node->next()) {
ASSERT(node != m_tail);
2018-12-21 01:10:45 +00:00
node->next()->set_prev(node->prev());
} else {
ASSERT(node == m_tail);
m_tail = node->prev();
}
}
template<typename T>
inline T* InlineLinkedList<T>::remove_head()
{
T* node = head();
if (node)
remove(node);
return node;
}
template<typename T>
inline T* InlineLinkedList<T>::remove_tail()
{
T* node = tail();
if (node)
remove(node);
return node;
}
template<typename T>
inline void InlineLinkedList<T>::append(InlineLinkedList<T>& other)
{
if (!other.head())
return;
if (!head()) {
m_head = other.head();
m_tail = other.tail();
other.clear();
return;
}
ASSERT(tail());
ASSERT(other.head());
2018-12-21 01:10:45 +00:00
T* other_head = other.head();
T* other_tail = other.tail();
other.clear();
ASSERT(!m_tail->next());
2018-12-21 01:10:45 +00:00
m_tail->set_next(other_head);
ASSERT(!other_head->prev());
other_head->set_prev(m_tail);
m_tail = other_tail;
}
2018-12-03 00:18:54 +00:00
}
using AK::InlineLinkedList;
using AK::InlineLinkedListNode;