brep-element-container.hpp

Go to the documentation of this file.

/*
 * Copyright (C) 2023  Christopher J. Howard
 *
 * This file is part of Antkeeper source code.
 *
 * Antkeeper source code is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * Antkeeper source code is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with Antkeeper source code.  If not, see <http://www.gnu.org/licenses/>.
 */
 
#ifndef ANTKEEPER_GEOM_BREP_ELEMENT_CONTAINER_HPP
#define ANTKEEPER_GEOM_BREP_ELEMENT_CONTAINER_HPP
 
#include <engine/geom/brep/brep-attribute-map.hpp>
#include <engine/utility/hash/fnv1a.hpp>
#include <cstddef>
#include <iterator>
#include <memory>
#include <vector>
 
namespace geom {
template <class T>
class brep_element_container
{
public:
    friend class brep_mesh;
    
    using element_type = T;
    
    struct const_iterator
    {
    public:
        using iterator_category = std::random_access_iterator_tag;
        using iterator_concept = std::random_access_iterator_tag;
        using difference_type = std::ptrdiff_t;
        using value_type = element_type*;
        using pointer = const value_type*;
        using reference = const value_type&;
        
        [[nodiscard]] inline constexpr value_type operator*() const noexcept
        {
            return m_it->get();
        }
        
        [[nodiscard]] inline constexpr value_type operator->() const noexcept
        {
            return m_it->get();
        }
        
        [[nodiscard]] inline constexpr value_type operator[](difference_type i) const noexcept
        {
            return m_it[i]->get();
        }
        
        inline const_iterator& operator++() noexcept
        {
            ++m_it;
            return *this;
        }
        
        [[nodiscard]] inline const_iterator operator++(int) noexcept
        {
            const_iterator tmp = *this;
            ++(*this);
            return tmp;
        }
        
        inline const_iterator& operator--() noexcept
        {
            --m_it;
            return *this;
        }
        
        [[nodiscard]] inline const_iterator operator--(int) noexcept
        {
            const_iterator tmp = *this;
            --(*this);
            return tmp;
        }
        
        inline const_iterator& operator+=(difference_type n) noexcept
        {
            m_it += n;
            return *this;
        }
        
        inline const_iterator& operator-=(difference_type n) noexcept
        {
            m_it -= n;
            return *this;
        }
        
        [[nodiscard]] inline bool operator==(const const_iterator& other) const noexcept
        {
            return m_it == other.m_it;
        };
        
        [[nodiscard]] inline std::weak_ordering operator<=>(const const_iterator& other) const noexcept
        {
            return m_it <=> other.m_it;
        }
        
        [[nodiscard]] inline difference_type operator-(const const_iterator& rhs) const noexcept
        {
            return m_it - rhs.m_it;
        }
        
        [[nodiscard]] inline const_iterator operator+(difference_type n) const noexcept
        {
            return const_iterator{m_it + n};
        }
        
        [[nodiscard]] inline const_iterator operator-(difference_type n) const noexcept
        {
            return const_iterator{m_it - n};
        }
        
        [[nodiscard]] friend const_iterator operator+(difference_type lhs, const const_iterator& rhs) noexcept
        {
            return const_iterator{lhs + rhs.m_it};
        }
        
        [[nodiscard]] friend const_iterator operator-(difference_type lhs, const const_iterator& rhs) noexcept
        {
            return const_iterator{lhs - rhs.m_it};
        }
        
    private:
        friend class brep_element_container;
        
        std::vector<std::unique_ptr<element_type>>::const_iterator m_it;
    };
    
    using const_reverse_iterator = std::reverse_iterator<const_iterator>;
    
    
    [[nodiscard]] inline constexpr element_type* operator[](std::size_t i) const
    {
        return m_elements[i].get();
    }
    
    [[nodiscard]] inline constexpr element_type* front() const noexcept
    {
        return m_elements.front().get();
    }
    
    [[nodiscard]] inline constexpr element_type* back() const noexcept
    {
        return m_elements.back().get();
    }
    
    
    [[nodiscard]] inline constexpr const_iterator begin() const noexcept
    {
        const_iterator it;
        it.m_it = m_elements.begin();
        return it;
    }
    [[nodiscard]] inline constexpr const_iterator cbegin() const noexcept
    {
        return begin();
    }
    
    [[nodiscard]] inline constexpr const_iterator end() const noexcept
    {
        const_iterator it;
        it.m_it = m_elements.end();
        return it;
    }
    [[nodiscard]] inline constexpr const_iterator cend() const noexcept
    {
        return end();
    }
    
    [[nodiscard]] inline constexpr const_reverse_iterator rbegin() const noexcept
    {
        return std::make_reverse_iterator(end());
    }
    [[nodiscard]] inline constexpr const_reverse_iterator crbegin() const noexcept
    {
        return rbegin();
    }
    
    [[nodiscard]] inline constexpr const_reverse_iterator rend() const noexcept
    {
        return std::make_reverse_iterator(begin());
    }
    [[nodiscard]] inline constexpr const_reverse_iterator crend() const noexcept
    {
        return rend();
    }
    
    
    [[nodiscard]] inline constexpr bool empty() const noexcept
    {
        return m_elements.empty();
    }
    
    [[nodiscard]] inline constexpr std::size_t size() const noexcept
    {
        return m_elements.size();
    }
    
    
    [[nodiscard]] const brep_attribute_map& attributes() const noexcept
    {
        return m_attribute_map;
    }
    [[nodiscard]] brep_attribute_map& attributes() noexcept
    {
        return m_attribute_map;
    }
    
    
protected:
    friend class brep_mesh;
    
    inline explicit brep_element_container(brep_mesh* mesh) noexcept:
        m_mesh(mesh)
    {}
    
    
    virtual void erase(element_type* element)
    {
        const auto index = element->m_index;
        
        for (auto& [key, values]: m_attribute_map.m_attributes)
        {
            values->erase(index);
        }
        --m_attribute_map.m_element_count;
        
        m_elements.back()->m_index = index;
        m_elements[index] = std::move(m_elements.back());
        m_elements.pop_back();
    }
    
    virtual element_type* emplace_back()
    {
        for (auto& [key, values]: m_attribute_map.m_attributes)
        {
            values->emplace_back();
        }
        ++m_attribute_map.m_element_count;
        
        return m_elements.emplace_back(std::make_unique<element_type>()).get();
    }
    
    
    brep_mesh* m_mesh;
    
private:
    std::vector<std::unique_ptr<element_type>> m_elements;
    brep_attribute_map m_attribute_map;
};
 
} // namespace geom
 
#endif // ANTKEEPER_GEOM_BREP_ELEMENT_CONTAINER_HPP