|
| const std::vector< Vertex > & | vertices () const |
| | Return const reference to the RawSimplex vector.
|
| |
|
const std::vector< Edge > & | edges () const |
| |
|
const std::vector< Face > & | faces () const |
| |
|
const std::vector< Tet > & | tets () const |
| |
|
void | reserve_vertices (size_t new_capacity) |
| |
|
void | reserve_edges (size_t new_capacity) |
| |
|
void | reserve_faces (size_t new_capacity) |
| |
|
void | reserve_tets (size_t new_capacity) |
| |
| void | add (const Vertex &s) |
| | Add simplex to the collection.
|
| |
|
void | add (const Edge &s) |
| |
|
void | add (const Face &s) |
| |
|
void | add (const Tet &s) |
| |
| void | add_with_faces (const Edge &s) |
| | Add the simplex and its faces to the collection.
|
| |
|
void | add_with_faces (const Face &s) |
| |
|
void | add_with_faces (const Tet &s) |
| |
|
void | add (const RawSimplexCollection &simplex_collection) |
| |
|
void | sort_and_clean () |
| | Sort simplex vector and remove duplicates.
|
| |
| bool | contains (const Vertex &simplex) const |
| | Check if simplex is contained in collection.
|
| |
|
bool | contains (const Edge &simplex) const |
| |
|
bool | contains (const Face &simplex) const |
| |
|
bool | contains (const Tet &simplex) const |
| |
|
std::vector< Face > | faces_with_edge (const Edge &e) const |
| |
|
size_t | size () const |
| |
|
bool | operator== (const RawSimplexCollection &that) const |
| |
|
bool | operator!= (const RawSimplexCollection &that) const |
| |
|
|
std::vector< Vertex > | m_v |
| |
|
std::vector< Edge > | m_e |
| |
|
std::vector< Face > | m_f |
| |
|
std::vector< Tet > | m_t |
| |
◆ add()
| void wmtk::simplex::RawSimplexCollection::add |
( |
const Vertex & |
s | ) |
|
|
inline |
Add simplex to the collection.
There is no sorting or any check if the simplex already exists.
◆ add_with_faces()
| void wmtk::simplex::RawSimplexCollection::add_with_faces |
( |
const Edge & |
s | ) |
|
|
inline |
Add the simplex and its faces to the collection.
There is no sorting or any check if the simplex already exists.
◆ are_simplex_collections_equal()
Check if the two simplex collections are equal.
The collections must be cleaned and sorted.
◆ contains()
| bool wmtk::simplex::RawSimplexCollection::contains |
( |
const Vertex & |
simplex | ) |
const |
|
inline |
Check if simplex is contained in collection.
Collection musst be sorted! Peform sort_and_clean before calling this function.
◆ get_intersection()
Get intersection of two simplex collections.
The collections must be sorted!
◆ get_union()
Get union of two simplex collections.
The collections must be sorted!
◆ vertices()
| const std::vector< Vertex > & wmtk::simplex::RawSimplexCollection::vertices |
( |
| ) |
const |
Return const reference to the RawSimplex vector.
Return vector of all vertices.
The documentation for this class was generated from the following files:
- /home/runner/work/wildmeshing-toolkit/wildmeshing-toolkit/src/wmtk/simplex/RawSimplexCollection.hpp
- /home/runner/work/wildmeshing-toolkit/wildmeshing-toolkit/src/wmtk/simplex/RawSimplexCollection.cpp