Cpp-in-Embedded-Systems/Chapter18/cib/libs/stdx/intrusive_list.hpp

#pragma once

#include <stdx/detail/list_common.hpp>

#include <cstddef>
#if __cplusplus < 202002L
#include <iterator>
#endif
#include <type_traits>

namespace stdx {
inline namespace v1 {
template <STDX_DOUBLE_LINKABLE NodeType,
          template <typename> typename P = node_policy::checked>
class intrusive_list {
    friend P<NodeType>;

    template <typename N> struct iterator_t {
        using difference_type = std::ptrdiff_t;
        using value_type = N;
        using pointer = value_type *;
        using reference = value_type &;
#if __cplusplus < 202002L
        using iterator_category = std::forward_iterator_tag;
#endif

        constexpr iterator_t() = default;
        constexpr explicit iterator_t(pointer n) : node{n} {}

        constexpr auto operator*() -> reference { return *node; }
        constexpr auto operator*() const -> reference { return *node; }
        constexpr auto operator->() -> pointer { return node; }
        constexpr auto operator->() const -> pointer { return node; }

        constexpr auto operator++() -> iterator_t & {
            node = node->next;
            return *this;
        }
        constexpr auto operator++(int) -> iterator_t {
            auto tmp = *this;
            ++(*this);
            return tmp;
        }

      private:
        pointer node{};

#if __cpp_impl_three_way_comparison < 201907L
        friend constexpr auto operator==(iterator_t lhs,
                                         iterator_t rhs) -> bool {
            return lhs.node == rhs.node;
        }
        friend constexpr auto operator!=(iterator_t lhs,
                                         iterator_t rhs) -> bool {
            return not(lhs == rhs);
        }
#else
        friend constexpr auto operator==(iterator_t,
                                         iterator_t) -> bool = default;
#endif
    };

  public:
    using value_type = NodeType;
    using size_type = std::size_t;
    using difference_type = std::ptrdiff_t;
    using reference = value_type &;
    using const_reference = value_type const &;
    using pointer = value_type *;
    using const_pointer = value_type const *;
    using iterator = iterator_t<value_type>;
    using const_iterator = iterator_t<value_type const>;

  private:
    pointer head{};
    pointer tail{};

    constexpr auto unchecked_push_front(pointer n) -> void {
        if (head != nullptr) {
            head->prev = n;
        }
        n->next = head;
        head = n;
        n->prev = nullptr;
        if (tail == nullptr) {
            tail = n;
        }
    }

    constexpr auto unchecked_push_back(pointer n) -> void {
        if (tail != nullptr) {
            tail->next = n;
        }
        n->prev = tail;
        tail = n;
        n->next = nullptr;
        if (head == nullptr) {
            head = n;
        }
    }

    constexpr auto unchecked_insert(iterator it, pointer n) -> void {
        if (it != end()) {
            auto p = it.operator->();
            n->next = p;
            n->prev = p->prev;
            p->prev = n;
        } else {
            n->prev = tail;
            tail = n;
        }
        if (n->prev) {
            n->prev->next = n;
        } else {
            head = n;
        }
    }

  public:
    constexpr auto begin() -> iterator { return iterator{head}; }
    constexpr auto begin() const -> const_iterator {
        return const_iterator{head};
    }
    constexpr auto cbegin() const -> const_iterator {
        return const_iterator{head};
    }
    constexpr auto end() -> iterator { return {}; }
    constexpr auto end() const -> const_iterator { return {}; }
    constexpr auto cend() const -> const_iterator { return {}; }

    constexpr auto front() const -> reference { return *head; }
    constexpr auto back() const -> reference { return *tail; }

    constexpr auto push_front(pointer n) -> void {
        P<NodeType>::push_front(*this, n);
    }
    constexpr auto push_back(pointer n) -> void {
        P<NodeType>::push_back(*this, n);
    }
    constexpr auto insert(iterator it, pointer n) -> void {
        if (empty()) {
            push_back(n);
        } else {
            P<NodeType>::insert(*this, it, n);
        }
    }

    constexpr auto pop_front() -> pointer {
        pointer poppedNode = head;
        head = head->next;

        if (head == nullptr) {
            tail = nullptr;
        } else {
            head->prev = nullptr;
        }

        P<NodeType>::on_pop(poppedNode);
        return poppedNode;
    }

    constexpr auto pop_back() -> pointer {
        pointer poppedNode = tail;
        tail = tail->prev;

        if (tail == nullptr) {
            head = nullptr;
        } else {
            tail->next = nullptr;
        }

        P<NodeType>::on_pop(poppedNode);
        return poppedNode;
    }

    [[nodiscard]] constexpr auto empty() const -> bool {
        return head == nullptr;
    }

    constexpr auto clear() -> void {
        P<NodeType>::on_clear(head);
        head = nullptr;
        tail = nullptr;
    }

    constexpr auto remove(pointer n) -> void {
        pointer nextNode = n->next;
        pointer prevNode = n->prev;

        if (prevNode == nullptr) {
            head = nextNode;
        } else {
            prevNode->next = nextNode;
        }

        if (nextNode == nullptr) {
            tail = prevNode;
        } else {
            nextNode->prev = prevNode;
        }
        P<NodeType>::on_pop(n);
    }
};

#undef STDX_DOUBLE_LINKABLE
} // namespace v1
} // namespace stdx