brep-edge.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_EDGE_HPP
#define ANTKEEPER_GEOM_BREP_EDGE_HPP
 
#include <engine/geom/brep/brep-loop.hpp>
#include <engine/geom/brep/brep-element-container.hpp>
#include <array>
#include <cstddef>
#include <iterator>
 
namespace geom {
 
class brep_vertex;
class brep_loop;
template <class T>
class brep_element_container;
 
class brep_edge_loop_list
{
public:
    friend class brep_mesh;
    friend class brep_face_container;
    
    struct const_iterator
    {
    public:
        friend class brep_edge_loop_list;
        
        using iterator_category = std::bidirectional_iterator_tag;
        using iterator_concept = std::bidirectional_iterator_tag;
        using difference_type = std::ptrdiff_t;
        using value_type = brep_loop*;
        using pointer = const value_type*;
        using reference = const value_type&;
        
        [[nodiscard]] inline constexpr value_type operator*() const noexcept
        {
            return m_loop;
        }
        
        [[nodiscard]] inline constexpr value_type operator->() const noexcept
        {
            return m_loop;
        }
        
        inline const_iterator& operator++() noexcept
        {
            m_loop = m_loop->m_edge_next;
            ++m_position;
            return *this;
        }
        
        [[nodiscard]] inline const_iterator operator++(int) noexcept
        {
            const_iterator tmp = *this;
            ++(*this);
            return tmp;
        }
        
        inline const_iterator& operator--() noexcept
        {
            m_loop = m_loop->m_edge_previous;
            --m_position;
            return *this;
        }
        
        [[nodiscard]] inline const_iterator operator--(int) noexcept
        {
            const_iterator tmp = *this;
            --(*this);
            return tmp;
        }
        
        [[nodiscard]] inline bool operator==(const const_iterator& other) const noexcept
        {
            return m_position == other.m_position;
        };
        
        [[nodiscard]] inline std::weak_ordering operator<=>(const const_iterator& other) const noexcept
        {
            return m_position <=> other.m_position;
        }
        
        [[nodiscard]] inline difference_type operator-(const const_iterator& rhs) const noexcept
        {
            return m_position - rhs.m_position;
        }
        
    private:
        brep_loop* m_loop;
        std::ptrdiff_t m_position;
    };
    
    using const_reverse_iterator = std::reverse_iterator<const_iterator>;
    
    
    [[nodiscard]] inline brep_loop* front() const noexcept
    {
        return m_head;
    }
    
    [[nodiscard]] inline brep_loop* back() const noexcept
    {
        return m_head->m_edge_previous;
    }
    
    
    [[nodiscard]] inline constexpr const_iterator begin() const noexcept
    {
        const_iterator it;
        it.m_loop = m_head;
        it.m_position = 0;
        
        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_loop = m_head;
        it.m_position = static_cast<std::ptrdiff_t>(m_size);
        
        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_size;
    }
    
    [[nodiscard]] inline constexpr std::size_t size() const noexcept
    {
        return m_size;
    }
    
    
    void push_back(brep_loop* loop);
    
    void remove(brep_loop* loop);
    
    
private:
    brep_loop* m_head{};
    std::size_t m_size{};
};
 
class brep_edge
{
public:
    friend class brep_mesh;
    friend class brep_vertex_edge_list;
    friend class brep_element_container<brep_edge>;
    friend class brep_edge_container;
    friend class brep_face_container;
    
    [[nodiscard]] inline constexpr std::size_t index() const noexcept
    {
        return m_index;
    }
    
    [[nodiscard]] inline constexpr const std::array<brep_vertex*, 2>& vertices() const noexcept
    {
        return m_vertices;
    }
    
    [[nodiscard]] inline constexpr const brep_edge_loop_list& loops() const noexcept
    {
        return m_loops;
    }
    
private:
    std::size_t m_index;
    std::array<brep_vertex*, 2> m_vertices;
    std::array<brep_edge*, 2> m_vertex_next;
    std::array<brep_edge*, 2> m_vertex_previous;
    brep_edge_loop_list m_loops;
};
 
class brep_edge_container: public brep_element_container<brep_edge>
{
public:
    brep_edge* emplace_back(brep_vertex* a, brep_vertex* b);
    
    void erase(brep_edge* edge) override;
    
    void clear() noexcept;
    
    [[nodiscard]] brep_edge* find(brep_vertex* a, brep_vertex* b) const;
    
private:
    friend class brep_mesh;
    
    inline explicit brep_edge_container(brep_mesh* mesh) noexcept:
        brep_element_container<brep_edge>(mesh)
    {}
};
 
} // namespace geom
 
#endif // ANTKEEPER_GEOM_BREP_EDGE_HPP