// license:GPL-2.0+ // copyright-holders:Couriersud /* * plists.h * */ #pragma once #ifndef PLISTS_H_ #define PLISTS_H_ #include "pstring.h" #include namespace plib { /* ---------------------------------------------------------------------------------------- * uninitialised_array_t: * fixed size array allowing to override constructor and initialize * members by placement new. * * Use with care. This template is provided to improve locality of storage * in high frequency applications. It should not be used for anything else. * ---------------------------------------------------------------------------------------- */ template class uninitialised_array_t { public: typedef C* iterator; typedef const C* const_iterator; uninitialised_array_t() { } ~uninitialised_array_t() { for (std::size_t i=0; i(&m_buf[index]); } const C& operator[](const std::size_t &index) const noexcept { return *reinterpret_cast(&m_buf[index]); } template void emplace(const std::size_t index, Args&&... args) { // allocate on buffer new (&m_buf[index]) C(std::forward(args)...); } iterator begin() const noexcept { return reinterpret_cast(&m_buf[0]); } iterator end() const noexcept { return reinterpret_cast(&m_buf[N]); } iterator begin() noexcept { return reinterpret_cast(&m_buf[0]); } iterator end() noexcept { return reinterpret_cast(&m_buf[N]); } const_iterator cbegin() const noexcept { return reinterpret_cast(&m_buf[0]); } const_iterator cend() const noexcept { return reinterpret_cast(&m_buf[N]); } protected: private: /* ensure proper alignment */ typename std::aligned_storage::type m_buf[N]; }; // ---------------------------------------------------------------------------------------- // plinkedlist_t: a simple linked list // the list allows insertions / deletions if used properly // ---------------------------------------------------------------------------------------- template class linkedlist_t { public: struct element_t { public: friend class linkedlist_t; constexpr element_t() : m_next(nullptr) {} constexpr element_t(const element_t &rhs) = delete; constexpr element_t(element_t &&rhs) = delete; constexpr LC *next() const noexcept { return m_next; } protected: ~element_t() = default; private: LC * m_next; }; struct iter_t final : public std::iterator { private: LC* p; public: explicit constexpr iter_t(LC* x) noexcept : p(x) { } explicit constexpr iter_t(const iter_t &rhs) noexcept : p(rhs.p) { } iter_t(iter_t &&rhs) noexcept { std::swap(*this, rhs); } iter_t& operator=(const iter_t &rhs) { iter_t t(rhs); std::swap(*this, t); return *this; } iter_t& operator=(iter_t &&rhs) { std::swap(*this, rhs); return *this; } iter_t& operator++() noexcept {p = p->next();return *this;} iter_t operator++(int) noexcept {iter_t tmp(*this); operator++(); return tmp;} constexpr bool operator==(const iter_t& rhs) const noexcept {return p == rhs.p;} constexpr bool operator!=(const iter_t& rhs) const noexcept {return p != rhs.p;} /* constexpr */ LC& operator*() noexcept {return *p;} /* constexpr */ LC* operator->() noexcept {return p;} constexpr LC& operator*() const noexcept {return *p;} constexpr LC* operator->() const noexcept {return p;} }; constexpr linkedlist_t() : m_head(nullptr) {} constexpr iter_t begin() const noexcept { return iter_t(m_head); } constexpr iter_t end() const noexcept { return iter_t(nullptr); } void push_front(LC *elem) noexcept { elem->m_next = m_head; m_head = elem; } void push_back(LC *elem) noexcept { LC **p = &m_head; while (*p != nullptr) { p = &((*p)->m_next); } *p = elem; elem->m_next = nullptr; } void remove(const LC *elem) noexcept { auto p = &m_head; for ( ; *p != elem; p = &((*p)->m_next)) { //nl_assert(*p != nullptr); } (*p) = elem->m_next; } LC *front() const noexcept { return m_head; } void clear() noexcept { m_head = nullptr; } constexpr bool empty() const noexcept { return (m_head == nullptr); } private: LC *m_head; }; } #endif /* PLISTS_H_ */