mirror of
https://github.com/SerenityOS/serenity
synced 2024-09-06 17:06:31 +00:00
270 lines
6.3 KiB
C++
270 lines
6.3 KiB
C++
/*
|
|
* Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are met:
|
|
*
|
|
* 1. Redistributions of source code must retain the above copyright notice, this
|
|
* list of conditions and the following disclaimer.
|
|
*
|
|
* 2. Redistributions in binary form must reproduce the above copyright notice,
|
|
* this list of conditions and the following disclaimer in the documentation
|
|
* and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
|
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
|
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
|
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <AK/Assertions.h>
|
|
#include <AK/Types.h>
|
|
|
|
namespace AK {
|
|
|
|
template<typename T>
|
|
class InlineLinkedList;
|
|
|
|
template<typename T>
|
|
class InlineLinkedListIterator {
|
|
public:
|
|
bool operator!=(const InlineLinkedListIterator& other) const { return m_node != other.m_node; }
|
|
bool operator==(const InlineLinkedListIterator& other) const { return m_node == other.m_node; }
|
|
InlineLinkedListIterator& operator++()
|
|
{
|
|
m_node = m_node->next();
|
|
return *this;
|
|
}
|
|
T& operator*() { return *m_node; }
|
|
T* operator->() { return m_node; }
|
|
bool is_end() const { return !m_node; }
|
|
static InlineLinkedListIterator universal_end() { return InlineLinkedListIterator(nullptr); }
|
|
|
|
private:
|
|
friend InlineLinkedList<T>;
|
|
explicit InlineLinkedListIterator(T* node)
|
|
: m_node(node)
|
|
{
|
|
}
|
|
T* m_node;
|
|
};
|
|
|
|
template<typename T>
|
|
class InlineLinkedListNode {
|
|
public:
|
|
InlineLinkedListNode();
|
|
|
|
void set_prev(T*);
|
|
void set_next(T*);
|
|
|
|
T* prev() const;
|
|
T* next() const;
|
|
};
|
|
|
|
template<typename T>
|
|
inline InlineLinkedListNode<T>::InlineLinkedListNode()
|
|
{
|
|
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() {}
|
|
|
|
bool is_empty() const { return !m_head; }
|
|
size_t size_slow() const;
|
|
void clear();
|
|
|
|
T* head() const { return m_head; }
|
|
T* remove_head();
|
|
T* remove_tail();
|
|
|
|
T* tail() const { return m_tail; }
|
|
|
|
void prepend(T*);
|
|
void append(T*);
|
|
void remove(T*);
|
|
void append(InlineLinkedList<T>&);
|
|
|
|
bool contains_slow(T* value) const
|
|
{
|
|
for (T* node = m_head; node; node = node->next()) {
|
|
if (node == value)
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
using Iterator = InlineLinkedListIterator<T>;
|
|
friend Iterator;
|
|
Iterator begin() { return Iterator(m_head); }
|
|
Iterator end() { return Iterator::universal_end(); }
|
|
|
|
using ConstIterator = InlineLinkedListIterator<const T>;
|
|
friend ConstIterator;
|
|
ConstIterator begin() const { return ConstIterator(m_head); }
|
|
ConstIterator end() const { return ConstIterator::universal_end(); }
|
|
|
|
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;
|
|
node->set_prev(0);
|
|
node->set_next(0);
|
|
return;
|
|
}
|
|
|
|
ASSERT(m_tail);
|
|
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;
|
|
node->set_prev(0);
|
|
node->set_next(0);
|
|
return;
|
|
}
|
|
|
|
ASSERT(m_head);
|
|
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);
|
|
node->prev()->set_next(node->next());
|
|
} else {
|
|
ASSERT(node == m_head);
|
|
m_head = node->next();
|
|
}
|
|
|
|
if (node->next()) {
|
|
ASSERT(node != m_tail);
|
|
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());
|
|
T* other_head = other.head();
|
|
T* other_tail = other.tail();
|
|
other.clear();
|
|
|
|
ASSERT(!m_tail->next());
|
|
m_tail->set_next(other_head);
|
|
ASSERT(!other_head->prev());
|
|
other_head->set_prev(m_tail);
|
|
m_tail = other_tail;
|
|
}
|
|
|
|
}
|
|
|
|
using AK::InlineLinkedList;
|
|
using AK::InlineLinkedListNode;
|