geom::brep_edge_container Class Reference

B-rep edge container. More...

#include <brep-edge.hpp>

Inheritance diagram for geom::brep_edge_container:

Public Member Functions
brep_edge *	emplace_back (brep_vertex *a, brep_vertex *b)
	Appends a new edge to the end of the container. More...
void	erase (brep_edge *edge) override
	Erases an edge and all dependent loops and faces. More...
void	clear () noexcept
	Erases all edges and their dependent loops and faces. More...
brep_edge *	find (brep_vertex *a, brep_vertex *b) const
	Finds an edge bounded by vertices a and b (in any order). More...
Public Member Functions inherited from geom::brep_element_container< brep_edge >
constexpr element_type *	operator[] (std::size_t i) const
	Returns a pointer to the element at the specified index. More...
constexpr element_type *	front () const noexcept
	Returns the first element. More...
constexpr element_type *	back () const noexcept
	Returns the last element. More...
constexpr const_iterator	begin () const noexcept
	Returns an iterator to the first element. More...
constexpr const_iterator	cbegin () const noexcept
	Returns an iterator to the first element. More...
constexpr const_iterator	end () const noexcept
	Returns an iterator to the element following the last element. More...
constexpr const_iterator	cend () const noexcept
	Returns an iterator to the element following the last element. More...
constexpr const_reverse_iterator	rbegin () const noexcept
	Returns a reverse iterator to the first element of the reversed container. More...
constexpr const_reverse_iterator	crbegin () const noexcept
	Returns a reverse iterator to the first element of the reversed container. More...
constexpr const_reverse_iterator	rend () const noexcept
	Returns a reverse iterator to the element following the last element of the reversed container. More...
constexpr const_reverse_iterator	crend () const noexcept
	Returns a reverse iterator to the element following the last element of the reversed container. More...
constexpr bool	empty () const noexcept
	Returns true if the container is empty, false otherwise. More...
constexpr std::size_t	size () const noexcept
	Returns the number of elements in the container. More...
const brep_attribute_map &	attributes () const noexcept
	Returns the element attribute map. More...
brep_attribute_map &	attributes () noexcept
	Returns the element attribute map. More...

Friends
class	brep_mesh

Additional Inherited Members
Public Types inherited from geom::brep_element_container< brep_edge >
using	element_type = brep_edge
using	const_reverse_iterator = std::reverse_iterator< const_iterator >
Protected Member Functions inherited from geom::brep_element_container< brep_edge >
	brep_element_container (brep_mesh *mesh) noexcept
	Constructs a B-rep element container. More...
virtual element_type *	emplace_back ()
	Appends a new element to the end of the container. More...
Protected Attributes inherited from geom::brep_element_container< brep_edge >
brep_mesh *	m_mesh

Detailed Description

B-rep edge container.

Definition at line 278 of file brep-edge.hpp.

Member Function Documentation

clear()

void geom::brep_edge_container::clear ( )

noexcept

Erases all edges and their dependent loops and faces.

Definition at line 97 of file brep-edge.cpp.

emplace_back()

brep_edge * geom::brep_edge_container::emplace_back	(	brep_vertex *	a,
		brep_vertex *	b
	)

Appends a new edge to the end of the container.

Parameters

a	First bounding vertex of the edge.
b	Second bounding vertex of the edge.

Returns

Pointer to the new edge.

Definition at line 62 of file brep-edge.cpp.

erase()

void geom::brep_edge_container::erase ( brep_edge *  edge )

overridevirtual

Erases an edge and all dependent loops and faces.

Parameters

edge	Pointer to the edge to erase.

Warning

Invalidates iterators and indices of edges, loops, and faces.

Reimplemented from geom::brep_element_container< brep_edge >.

Definition at line 81 of file brep-edge.cpp.

find()

brep_edge * geom::brep_edge_container::find	(	brep_vertex *	a,
		brep_vertex *	b
	)		const

Finds an edge bounded by vertices a and b (in any order).

Parameters

a	First (or second) bounding vertex of the edge.
b	Second (or first) bounding vertex of the edge.

Returns

Pointer to an edge bounded by vertices a and b, or nullptr if no such edge was found.

Definition at line 105 of file brep-edge.cpp.

Friends And Related Function Documentation

brep_mesh

friend class brep_mesh

friend

Definition at line 316 of file brep-edge.hpp.

---

The documentation for this class was generated from the following files:

• brep-edge.hpp
• brep-edge.cpp