Face sets. More...
#include <ogdf/basic/FaceSet.h>
Public Types | |
using | ListType = typename std::conditional< SupportFastSizeQuery, List< face >, ListPure< face > >::type |
Public Member Functions | |
FaceSet (const CombinatorialEmbedding &E) | |
Creates an empty face set associated with combinatorial embedding E . | |
template<bool OtherSupportsFastSizeQuery> | |
FaceSet (const FaceSet< OtherSupportsFastSizeQuery > &other) | |
Copy constructor. | |
void | clear () |
Removes all faces from this set-. | |
const ConstCombinatorialEmbedding & | embeddingOf () const |
Returns the associated combinatorial embedding. | |
const ListType & | faces () const |
Returns a reference to the list of faces contained in this set. | |
void | insert (face f) |
Inserts face f into this set. | |
bool | isMember (face f) const |
Returns true iff face f is contained in this set. | |
template<bool OtherSupportsFastSizeQuery> | |
FaceSet & | operator= (const FaceSet< OtherSupportsFastSizeQuery > &other) |
Assignment operator. | |
void | remove (face f) |
Removes face f from this set. | |
int | size () const |
Returns the number of faces in this set. | |
Private Attributes | |
ListType | m_faces |
The list of faces contained in this set. | |
FaceArray< ListIterator< face > > | m_it |
m_it[f] contains the list iterator pointing to f if f is contained in S, or an invalid list iterator otherwise. | |
Face sets.
Maintains a subset of faces contained in an associated combinatorial embedding. Provides efficient operations for testing membership, iteration, insertion and deletion of elements, as well as clearing the set.
SupportFastSizeQuery | Whether this set supports querying it's size in constant instead of linear time (in the size). |
using ogdf::FaceSet< SupportFastSizeQuery >::ListType = typename std::conditional<SupportFastSizeQuery, List<face>, ListPure<face> >::type |
|
inlineexplicit |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
private |
|
private |