|
CGAL 4.9 - Combinatorial Maps
|
|
CGAL 4.9 - Combinatorial Maps
|
The concept CombinatorialMap defines a d-dimensional combinatorial map.
Creation | |
| CombinatorialMap () | |
| Default constructor creating an empty combinatorial map. | |
| template<typename CMap > | |
| CombinatorialMap (const CMap &cmap) | |
| Construct a new combinatorial map from another one. More... | |
| CombinatorialMap () | |
| Default constructor creating an empty combinatorial map. | |
| template<typename CMap > | |
| CombinatorialMap (const CMap &cmap) | |
| Construct a new combinatorial map from another one. More... | |
Types | |
| typedef unspecified_type | Dart |
Dart type, a model of the Dart concept. | |
| typedef unspecified_type | Dart_handle |
Dart handle type, equal to Dart::Dart_handle. | |
| typedef unspecified_type | Dart_const_handle |
Dart const handle type, equal to Dart::Dart_const_handle. | |
| typedef unspecified_type | size_type |
| Size type (an unsigned integral type). | |
| typedef unspecified_type | Dart |
Dart type, a model of the Dart concept. | |
| typedef unspecified_type | Dart_handle |
Dart handle type, equal to Dart::Dart_handle. | |
| typedef unspecified_type | Dart_const_handle |
Dart const handle type, equal to Dart::Dart_const_handle. | |
| typedef unspecified_type | size_type |
| Size type (an unsigned integral type). | |
Constants | |
| static unsigned int | dimension |
The dimension d of the combinatorial map, equal to Dart::dimension. | |
| static size_type | NB_MARKS |
| The number of available Boolean marks of the combinatorial map. | |
| Dart_handle | null_dart_handle |
| The null dart handle constant. More... | |
Types for Attributes | |
| typedef unspecified_type | Attributes |
| The tuple of cell attributes. More... | |
| template<unsigned int i> | |
| using | Attribute_type = unspecified_type |
Attribute_type<i>::type is the type of i-attributes, a model of CellAttribute concept. More... | |
| template<unsigned int i> | |
| using | Attribute_handle = unspecified_type |
Attribute_handle<i>::type is a handle to i-attributes, equal to Dart::Attribute_handle<i>::type . More... | |
| template<unsigned int i> | |
| using | Attribute_const_handle = unspecified_type |
Attribute_handle<i>::type is a const handle to i-attributes, equal to Dart::Attribute_const_handle<i>::type . More... | |
| typedef unspecified_type | Attributes |
| The tuple of cell attributes. More... | |
| template<unsigned int i> | |
| using | Attribute_type = unspecified_type |
Attribute_type<i>::type is the type of i-attributes, a model of CellAttribute concept. More... | |
| template<unsigned int i> | |
| using | Attribute_handle = unspecified_type |
Attribute_handle<i>::type is a handle to i-attributes, equal to Dart::Attribute_handle<i>::type . More... | |
| template<unsigned int i> | |
| using | Attribute_const_handle = unspecified_type |
Attribute_handle<i>::type is a const handle to i-attributes, equal to Dart::Attribute_const_handle<i>::type . More... | |
Range Types | |
| typedef unspecified_type | Dart_range |
| Range of all the darts of the combinatorial map. More... | |
| typedef unspecified_type | Dart_const_range |
| Const range of all the darts of the combinatorial map. More... | |
| template<unsigned int i> | |
| using | Attribute_range = unspecified_type |
Attribute_range<i>::type is the range of all the i-attributes. More... | |
| template<unsigned int i> | |
| using | Attribute_const_range = unspecified_type |
Attribute_const_range<i>::type is the const range of all the i-attributes. More... | |
| template<unsigned int... Beta> | |
| using | Dart_of_orbit_range = unspecified_type |
Range of all the darts of the <Beta...> orbit. More... | |
| template<unsigned int... Beta> | |
| using | Dart_of_orbit_const_range = unspecified_type |
Const range of all the darts of the <Beta...> orbit. More... | |
| template<unsigned int i, unsigned int dim = dimension> | |
| using | Dart_of_cell_range = unspecified_type |
| Range of all the darts of an i-cell. More... | |
| template<unsigned int i, unsigned int dim = dimension> | |
| using | Dart_of_cell_const_range = unspecified_type |
| Const range of all the darts of the i-cell. More... | |
| template<unsigned int i, unsigned int j, unsigned int dim = dimension> | |
| using | One_dart_per_incident_cell_range = unspecified_type |
| Range of one dart of each i-cell incident to one j-cell. More... | |
| template<unsigned int i, unsigned int j, unsigned int dim = dimension> | |
| using | One_dart_per_incident_cell_const_range = unspecified_type |
| Const range of one dart of each i-cell incident to one j-cell. More... | |
| template<unsigned int i, unsigned int dim = dimension> | |
| using | One_dart_per_cell_range = unspecified_type |
| Range of one dart of each i-cell of the combinatorial map. More... | |
| template<unsigned int i, unsigned int dim = dimension> | |
| using | One_dart_per_cell_const_range = unspecified_type |
| Const range of one dart of each i-cell of the combinatorial map. More... | |
| typedef unspecified_type | Dart_range |
| Range of all the darts of the combinatorial map. More... | |
| typedef unspecified_type | Dart_const_range |
| Const range of all the darts of the combinatorial map. More... | |
| template<unsigned int i> | |
| using | Attribute_range = unspecified_type |
Attribute_range<i>::type is the range of all the i-attributes. More... | |
| template<unsigned int i> | |
| using | Attribute_const_range = unspecified_type |
Attribute_const_range<i>::type is the const range of all the i-attributes. More... | |
| template<unsigned int... Beta> | |
| using | Dart_of_orbit_range = unspecified_type |
Range of all the darts of the <Beta...> orbit. More... | |
| template<unsigned int... Beta> | |
| using | Dart_of_orbit_const_range = unspecified_type |
Const range of all the darts of the <Beta...> orbit. More... | |
| template<unsigned int i, unsigned int dim = dimension> | |
| using | Dart_of_cell_range = unspecified_type |
| Range of all the darts of an i-cell. More... | |
| template<unsigned int i, unsigned int dim = dimension> | |
| using | Dart_of_cell_const_range = unspecified_type |
| Const range of all the darts of the i-cell. More... | |
| template<unsigned int i, unsigned int j, unsigned int dim = dimension> | |
| using | One_dart_per_incident_cell_range = unspecified_type |
| Range of one dart of each i-cell incident to one j-cell. More... | |
| template<unsigned int i, unsigned int j, unsigned int dim = dimension> | |
| using | One_dart_per_incident_cell_const_range = unspecified_type |
| Const range of one dart of each i-cell incident to one j-cell. More... | |
| template<unsigned int i, unsigned int dim = dimension> | |
| using | One_dart_per_cell_range = unspecified_type |
| Range of one dart of each i-cell of the combinatorial map. More... | |
| template<unsigned int i, unsigned int dim = dimension> | |
| using | One_dart_per_cell_const_range = unspecified_type |
| Const range of one dart of each i-cell of the combinatorial map. More... | |
Access Member Functions | |
| bool | is_empty () const |
| Returns true iff the combinatorial map is empty, i.e. it contains no dart. | |
| bool | is_valid () const |
| Returns true iff the combinatorial map is valid. More... | |
| bool | is_without_boundary (unsigned int i) const |
| Returns true iff the combinatorial map is without i-boundary. More... | |
| bool | is_without_boundary () const |
| Returns true iff the combinatorial map is without boundary in all dimensions. | |
| size_type | number_of_darts () const |
| Returns the number of darts in the combinatorial map. | |
| template<unsigned int i> | |
| size_type | number_of_attributes () const |
| Returns the number of i-attributes in the combinatorial map. More... | |
| bool | is_dart_used (Dart_const_handle dh) const |
| Returns true if dh points to a used dart (i.e. valid). | |
| Dart_handle | beta (Dart_handle dh, int i, int j) |
Returns \( \beta_j\)( \( \beta_i\)(*dh)). More... | |
| Dart_const_handle | beta (Dart_const_handle dh, int i, int j) const |
Returns \( \beta_j\)( \( \beta_i\)(*dh)). More... | |
| template<int i, int j> | |
| Dart_handle | beta (Dart_handle dh) |
Returns \( \beta_j\)( \( \beta_i\)(*dh)). More... | |
| template<int i, int j> | |
| Dart_const_handle | beta (Dart_const_handle dh) const |
Returns \( \beta_j\)( \( \beta_i\)(*dh)). More... | |
| bool | is_free (Dart_const_handle dh, unsigned int i) const |
Returns true iff dart *dh is i-free. More... | |
| template<unsigned int i> | |
| bool | is_free (Dart_const_handle dh) const |
Returns true iff dart *dh is i-free. More... | |
| int | highest_nonfree_dimension (Dart_const_handle dh) const |
Returns the highest dimension i such that dart *dh is not i-free. More... | |
| Dart_handle | opposite (Dart_handle dh) |
Returns a handle to a dart belonging to the same edge than dart *dh, and not to the same vertex. More... | |
| Dart_const_handle | opposite (Dart_const_handle dh) const |
Returns a const handle to a dart belonging to the same edge than dart *dh, and not to the same vertex, when the dart is const. More... | |
| Dart_handle | other_extremity (Dart_handle dh) |
Returns a handle to a dart belonging to the other vertex of the edge containing dart *dh (but contrary to opposite() not necessarily to the same edge). More... | |
| Dart_const_handle | other_extremity (Dart_const_handle dh) const |
Returns a const handle to a dart belonging to the other vertex of the edge containing dart *dh, when the dart is const (but contrary to opposite() not necessarily to the same edge). More... | |
| std::ostream & | display_characteristics (std::ostream &os) const |
Displays on os the number of elements of the combinatorial map. More... | |
| bool | is_empty () const |
| Returns true iff the combinatorial map is empty, i.e. it contains no dart. | |
| bool | is_valid () const |
| Returns true iff the combinatorial map is valid. More... | |
| bool | is_without_boundary (unsigned int i) const |
| Returns true iff the combinatorial map is without i-boundary. More... | |
| bool | is_without_boundary () const |
| Returns true iff the combinatorial map is without boundary in all dimensions. | |
| size_type | number_of_darts () const |
| Returns the number of darts in the combinatorial map. | |
| template<unsigned int i> | |
| size_type | number_of_attributes () const |
| Returns the number of i-attributes in the combinatorial map. More... | |
| bool | is_dart_used (Dart_const_handle dh) const |
| Returns true if dh points to a used dart (i.e. valid). | |
| Dart_handle | beta (Dart_handle dh, int i, int j) |
Returns \( \beta_j\)( \( \beta_i\)(*dh)). More... | |
| Dart_const_handle | beta (Dart_const_handle dh, int i, int j) const |
Returns \( \beta_j\)( \( \beta_i\)(*dh)). More... | |
| template<int i, int j> | |
| Dart_handle | beta (Dart_handle dh) |
Returns \( \beta_j\)( \( \beta_i\)(*dh)). More... | |
| template<int i, int j> | |
| Dart_const_handle | beta (Dart_const_handle dh) const |
Returns \( \beta_j\)( \( \beta_i\)(*dh)). More... | |
| bool | is_free (Dart_const_handle dh, unsigned int i) const |
Returns true iff dart *dh is i-free. More... | |
| template<unsigned int i> | |
| bool | is_free (Dart_const_handle dh) const |
Returns true iff dart *dh is i-free. More... | |
| int | highest_nonfree_dimension (Dart_const_handle dh) const |
Returns the highest dimension i such that dart *dh is not i-free. More... | |
| Dart_handle | opposite (Dart_handle dh) |
Returns a handle to a dart belonging to the same edge than dart *dh, and not to the same vertex. More... | |
| Dart_const_handle | opposite (Dart_const_handle dh) const |
Returns a const handle to a dart belonging to the same edge than dart *dh, and not to the same vertex, when the dart is const. More... | |
| Dart_handle | other_extremity (Dart_handle dh) |
Returns a handle to a dart belonging to the other vertex of the edge containing dart *dh (but contrary to opposite() not necessarily to the same edge). More... | |
| Dart_const_handle | other_extremity (Dart_const_handle dh) const |
Returns a const handle to a dart belonging to the other vertex of the edge containing dart *dh, when the dart is const (but contrary to opposite() not necessarily to the same edge). More... | |
| std::ostream & | display_characteristics (std::ostream &os) const |
Displays on os the number of elements of the combinatorial map. More... | |
Attributes Access Member Functions | |
| template<unsigned int i> | |
| Attribute_handle< i >::type | attribute (Dart_handle dh) |
Returns a handle to the i-attribute associated to dart *dh. More... | |
| template<unsigned int i> | |
| Attribute_const_handle< i >::type | attribute (Dart_const_handle dh) const |
Returns a const handle to the i-attribute associated to dart *dh, when the dart is const. More... | |
| template<unsigned int i> | |
| Dart_handle | dart_of_attribute (typename Attribute_handle< i >::type ah) |
Returns one dart of the cell associated to the i-attribute *ah. More... | |
| template<unsigned int i> | |
| Dart_const_handle | dart_of_attribute (typename Attribute_const_handle< i >::type ah) const |
Returns one dart of the cell associated to the const i-attribute *ah. More... | |
| template<unsigned int i> | |
| Attribute_type< i >::type::Info & | info_of_attribute (typename Attribute_handle< i >::type ah) |
Returns the information of the i-attribute *ah. More... | |
| template<unsigned int i> | |
| const Attribute_type< i > ::type::Info & | info_of_attribute (typename Attribute_const_handle< i >::type ah) const |
Returns the information of the const i-attribute *ah. More... | |
| template<unsigned int i> | |
| Attribute_type< i >::type::Info & | info (Dart_handle adart) |
A shorcut for info_of_attribute<i>(attribute<i>(adart)). More... | |
| template<unsigned int i> | |
| const Attribute_type< i > ::type::Info & | info (Dart_const_handle adart) const |
A shorcut for info_of_attribute<i>(attribute<i>(adart)) for const handle. More... | |
| template<unsigned int i> | |
| Dart_handle & | dart (Dart_handle adart) |
A shorcut for dart_of_attribute<i>(attribute<i>(adart)). More... | |
| template<unsigned int i> | |
| Dart_const_handle | dart (Dart_const_handle adart) const |
A shorcut for dart_of_attribute<i>(attribute<i>(adart)) for const handle. More... | |
| template<unsigned int i> | |
| bool | is_attribute_used (typename Attribute_const_handle< i >::type ah) const |
| Returns true if ah points to a used i-attribute (i.e. valid). More... | |
| template<unsigned int i> | |
| Attribute_handle< i >::type | attribute (Dart_handle dh) |
Returns a handle to the i-attribute associated to dart *dh. More... | |
| template<unsigned int i> | |
| Attribute_const_handle< i >::type | attribute (Dart_const_handle dh) const |
Returns a const handle to the i-attribute associated to dart *dh, when the dart is const. More... | |
| template<unsigned int i> | |
| Dart_handle | dart_of_attribute (typename Attribute_handle< i >::type ah) |
Returns one dart of the cell associated to the i-attribute *ah. More... | |
| template<unsigned int i> | |
| Dart_const_handle | dart_of_attribute (typename Attribute_const_handle< i >::type ah) const |
Returns one dart of the cell associated to the const i-attribute *ah. More... | |
| template<unsigned int i> | |
| Attribute_type< i >::type::Info & | info_of_attribute (typename Attribute_handle< i >::type ah) |
Returns the information of the i-attribute *ah. More... | |
| template<unsigned int i> | |
| const Attribute_type< i > ::type::Info & | info_of_attribute (typename Attribute_const_handle< i >::type ah) const |
Returns the information of the const i-attribute *ah. More... | |
| template<unsigned int i> | |
| Attribute_type< i >::type::Info & | info (Dart_handle adart) |
A shorcut for info_of_attribute<i>(attribute<i>(adart)). More... | |
| template<unsigned int i> | |
| const Attribute_type< i > ::type::Info & | info (Dart_const_handle adart) const |
A shorcut for info_of_attribute<i>(attribute<i>(adart)) for const handle. More... | |
| template<unsigned int i> | |
| Dart_handle & | dart (Dart_handle adart) |
A shorcut for dart_of_attribute<i>(attribute<i>(adart)). More... | |
| template<unsigned int i> | |
| Dart_const_handle | dart (Dart_const_handle adart) const |
A shorcut for dart_of_attribute<i>(attribute<i>(adart)) for const handle. More... | |
| template<unsigned int i> | |
| bool | is_attribute_used (typename Attribute_const_handle< i >::type ah) const |
| Returns true if ah points to a used i-attribute (i.e. valid). More... | |
Transformations Between Handles and Instances | |
| Dart_handle | dart_handle (Dart &d) |
Returns the dart handle of d. More... | |
| Dart_const_handle | dart_handle (const Dart &d) const |
Returns the dart const handle of d. More... | |
| Dart_handle | dart_handle (Dart &d) |
Returns the dart handle of d. More... | |
| Dart_const_handle | dart_handle (const Dart &d) const |
Returns the dart const handle of d. More... | |
Range Access Member Functions | |
| Dart_range & | darts () |
| Returns a range of all the darts in the combinatorial map. | |
| Dart_const_range & | darts () const |
| Returns a const range of all the darts in the combinatorial map. | |
| template<unsigned int i> | |
| Attribute_range< i >::type & | attributes () |
| Returns a range of all the i-attributes in the combinatorial map. More... | |
| template<unsigned int i> | |
| Attribute_const_range< i >::type & | attributes () const |
| Returns a const range of all the i-attributes in the combinatorial map. More... | |
| template<unsigned int... Beta> | |
| Dart_of_orbit_range | darts_of_orbit (Dart_handle dh) |
Returns a range of all the darts of the orbit <Beta...>(*dh). More... | |
| template<unsigned int... Beta> | |
| Dart_of_orbit_const_range | darts_of_orbit (Dart_const_handle dh) const |
Returns a const range of all the darts of the orbit <Beta...>(*dh). More... | |
| template<unsigned int i, unsigned int dim = dimension> | |
| Dart_of_cell_range | darts_of_cell (Dart_handle dh) |
Returns a range of all the darts of the i-cell containing *dh. More... | |
| template<unsigned int i, unsigned int dim = dimension> | |
| Dart_of_cell_const_range | darts_of_cell (Dart_const_handle dh) const |
Returns a const range of all the darts of the i-cell containing *dh. More... | |
| template<unsigned int i, unsigned int j, unsigned int dim = dimension> | |
| One_dart_per_incident_cell_range | one_dart_per_incident_cell (Dart_handle dh) |
Returns a range of one dart of each i-cell incident to the j-cell containing *dh. More... | |
| template<unsigned int i, unsigned int j, unsigned int dim = dimension> | |
| One_dart_per_incident_cell_const_range | one_dart_per_incident_cell (Dart_const_handle dh) const |
Returns a const range of one dart of each i-cell incident to the j-cell containing *dh. More... | |
| template<unsigned int i, unsigned int dim = dimension> | |
| One_dart_per_cell_range | one_dart_per_cell () |
| Returns a range of one dart of each i-cell in the combinatorial map. More... | |
| template<unsigned int i, unsigned int dim = dimension> | |
| One_dart_per_cell_const_range | one_dart_per_cell () const |
| Returns a const range of one dart of each i-cell in the combinatorial map. More... | |
| Dart_range & | darts () |
| Returns a range of all the darts in the combinatorial map. | |
| Dart_const_range & | darts () const |
| Returns a const range of all the darts in the combinatorial map. | |
| template<unsigned int i> | |
| Attribute_range< i >::type & | attributes () |
| Returns a range of all the i-attributes in the combinatorial map. More... | |
| template<unsigned int i> | |
| Attribute_const_range< i >::type & | attributes () const |
| Returns a const range of all the i-attributes in the combinatorial map. More... | |
| template<unsigned int... Beta> | |
| Dart_of_orbit_range | darts_of_orbit (Dart_handle dh) |
Returns a range of all the darts of the orbit <Beta...>(*dh). More... | |
| template<unsigned int... Beta> | |
| Dart_of_orbit_const_range | darts_of_orbit (Dart_const_handle dh) const |
Returns a const range of all the darts of the orbit <Beta...>(*dh). More... | |
| template<unsigned int i, unsigned int dim = dimension> | |
| Dart_of_cell_range | darts_of_cell (Dart_handle dh) |
Returns a range of all the darts of the i-cell containing *dh. More... | |
| template<unsigned int i, unsigned int dim = dimension> | |
| Dart_of_cell_const_range | darts_of_cell (Dart_const_handle dh) const |
Returns a const range of all the darts of the i-cell containing *dh. More... | |
| template<unsigned int i, unsigned int j, unsigned int dim = dimension> | |
| One_dart_per_incident_cell_range | one_dart_per_incident_cell (Dart_handle dh) |
Returns a range of one dart of each i-cell incident to the j-cell containing *dh. More... | |
| template<unsigned int i, unsigned int j, unsigned int dim = dimension> | |
| One_dart_per_incident_cell_const_range | one_dart_per_incident_cell (Dart_const_handle dh) const |
Returns a const range of one dart of each i-cell incident to the j-cell containing *dh. More... | |
| template<unsigned int i, unsigned int dim = dimension> | |
| One_dart_per_cell_range | one_dart_per_cell () |
| Returns a range of one dart of each i-cell in the combinatorial map. More... | |
| template<unsigned int i, unsigned int dim = dimension> | |
| One_dart_per_cell_const_range | one_dart_per_cell () const |
| Returns a const range of one dart of each i-cell in the combinatorial map. More... | |
Modifiers | |
| template<typename T1 > | |
| Dart_handle | create_dart (T1 t1) |
| Creates a new dart in the combinatorial map, and returns the corresponding handle. More... | |
| void | erase_dart (Dart_handle dh) |
Removes *dh from the combinatorial map. More... | |
| template<unsigned int i, typename T1 > | |
| Attribute_handle< i >::type | create_attribute (T1 t1) |
| Creates a new i-attribute in the combinatorial map, and returns the corresponding handle. More... | |
| template<unsigned int i> | |
| void | erase_attribute (Attribute_handle< i >::type ah) |
Removes the i-attribute *ah from the combinatorial map. More... | |
| template<unsigned int i> | |
| void | set_attribute (Dart_handle dh, Attribute_handle< i >::type ah) |
Associates the i-attribute of all the darts of the i-cell containing *dh to *ah. More... | |
| void | clear () |
| Deletes all the darts and all the attributes of the combinatorial map. | |
| CombinatorialMap & | operator= (const CombinatorialMap &cmap) |
| Assignment operator. More... | |
| void | swap (CombinatorialMap &cmap) |
Swap the current combinatorial map with cmap. More... | |
| template<typename T1 > | |
| Dart_handle | create_dart (T1 t1) |
| Creates a new dart in the combinatorial map, and returns the corresponding handle. More... | |
| void | erase_dart (Dart_handle dh) |
Removes *dh from the combinatorial map. More... | |
| template<unsigned int i, typename T1 > | |
| Attribute_handle< i >::type | create_attribute (T1 t1) |
| Creates a new i-attribute in the combinatorial map, and returns the corresponding handle. More... | |
| template<unsigned int i> | |
| void | erase_attribute (Attribute_handle< i >::type ah) |
Removes the i-attribute *ah from the combinatorial map. More... | |
| template<unsigned int i> | |
| void | set_attribute (Dart_handle dh, Attribute_handle< i >::type ah) |
Associates the i-attribute of all the darts of the i-cell containing *dh to *ah. More... | |
| void | clear () |
| Deletes all the darts and all the attributes of the combinatorial map. | |
| CombinatorialMap & | operator= (const CombinatorialMap &cmap) |
| Assignment operator. More... | |
| void | swap (CombinatorialMap &cmap) |
Swap the current combinatorial map with cmap. More... | |
Attributes management | |
| bool | are_attributes_automatically_managed () const |
| Returns the status of the management of the attributes of the combinatorial map. More... | |
| void | set_automatic_attributes_management (bool update_attributes) |
| Set the status of the managment of the attributes of the combinatorial map. More... | |
| void | correct_invalid_attributes () |
| Correct the invalid attributes of the combinatorial map. More... | |
| bool | are_attributes_automatically_managed () const |
| Returns the status of the management of the attributes of the combinatorial map. More... | |
| void | set_automatic_attributes_management (bool update_attributes) |
| Set the status of the managment of the attributes of the combinatorial map. More... | |
| void | correct_invalid_attributes () |
| Correct the invalid attributes of the combinatorial map. More... | |
Operations | |
| template<unsigned int i> | |
| bool | is_sewable (Dart_const_handle dh1, Dart_const_handle dh2) const |
Returns true iff *dh1 can be i-sewn with *dh2 by keeping the combinatorial map valid. More... | |
| template<unsigned int i> | |
| void | sew (Dart_handle dh1, Dart_handle dh2) |
i-sew darts *dh1 and *dh2, by keeping the combinatorial map valid. More... | |
| template<unsigned int i> | |
| void | unsew (Dart_handle dh) |
i-unsew darts *dh and \( \beta_i\)(*dh), by keeping the combinatorial map valid. More... | |
| template<unsigned int i> | |
| void | link_beta (Dart_handle dh1, Dart_handle dh2) |
Links *dh1 and *dh2 by \( \beta_i\). More... | |
| template<unsigned int i> | |
| void | unlink_beta (Dart_handle dh) |
Unlinks *dh and \( \beta_i\)(*dh) by \( \beta_i\). More... | |
| void | reverse_orientation () |
| Reverse the orientation (swap \( \beta_0\) and \( \beta_1\) links) of the entire map. | |
| void | reverse_orientation_connected_component (Dart_handle adart) |
| Reverse the orientation (swap \( \beta_0\) and \( \beta_1\) links) of the connected component containing the given dart. | |
| Dart_handle | insert_cell_0_in_cell_1 (Dart_handle dh) |
Inserts a 0-cell in the 1-cell containing dh. More... | |
| Dart_handle | insert_cell_0_in_cell_2 (Dart_handle dh) |
Inserts a 0-cell in the 2-cell containing dh. More... | |
| Dart_handle | insert_cell_1_in_cell_2 (Dart_handle dh1, Dart_handle dh2) |
Inserts a 1-cell in the 2-cell containing dh1 and dh2. More... | |
| template<class InputIterator > | |
| Dart_handle | insert_cell_2_in_cell_3 (InputIterator afirst, InputIterator alast) |
Inserts a 2-cell along the path of 1-cells containing darts given by the range [afirst,alast). More... | |
| Dart_handle | insert_dangling_cell_1_in_cell_2 (Dart_handle dh) |
Inserts a 1-cell in a the 2-cell containing dh, the 1-cell being attached only by one of its extremity to the 0-cell containing dh. More... | |
| bool | is_insertable_cell_1_in_cell_2 (Dart_const_handle dh1, Dart_const_handle dh2) |
Returns true iff it is possible to insert a 1-cell in the combinatorial map between dh1 and dh2. More... | |
| template<class InputIterator > | |
| bool | is_insertable_cell_2_in_cell_3 (InputIterator afirst, InputIterator alast) |
Returns true iff it is possible to insert a 2-cell in the combinatorial map along the path of darts given by the range [afirst,alast). More... | |
| template<unsigned int i> | |
| bool | is_removable (Dart_const_handle dh) |
Returns true iff the i-cell containing dh can be removed. More... | |
| template<unsigned int i> | |
| size_type | remove_cell (Dart_handle dh) |
Removes the i-cell containing dh. More... | |
| template<unsigned int i> | |
| bool | is_sewable (Dart_const_handle dh1, Dart_const_handle dh2) const |
Returns true iff *dh1 can be i-sewn with *dh2 by keeping the combinatorial map valid. More... | |
| template<unsigned int i> | |
| void | sew (Dart_handle dh1, Dart_handle dh2) |
i-sew darts *dh1 and *dh2, by keeping the combinatorial map valid. More... | |
| template<unsigned int i> | |
| void | unsew (Dart_handle dh) |
i-unsew darts *dh and \( \beta_i\)(*dh), by keeping the combinatorial map valid. More... | |
| template<unsigned int i> | |
| void | link_beta (Dart_handle dh1, Dart_handle dh2) |
Links *dh1 and *dh2 by \( \beta_i\). More... | |
| template<unsigned int i> | |
| void | unlink_beta (Dart_handle dh) |
Unlinks *dh and \( \beta_i\)(*dh) by \( \beta_i\). More... | |
| void | reverse_orientation () |
| Reverse the orientation (swap \( \beta_0\) and \( \beta_1\) links) of the entire map. | |
| void | reverse_orientation_connected_component (Dart_handle adart) |
| Reverse the orientation (swap \( \beta_0\) and \( \beta_1\) links) of the connected component containing the given dart. | |
| Dart_handle | insert_cell_0_in_cell_1 (Dart_handle dh) |
Inserts a 0-cell in the 1-cell containing dh. More... | |
| Dart_handle | insert_cell_0_in_cell_2 (Dart_handle dh) |
Inserts a 0-cell in the 2-cell containing dh. More... | |
| Dart_handle | insert_cell_1_in_cell_2 (Dart_handle dh1, Dart_handle dh2) |
Inserts a 1-cell in the 2-cell containing dh1 and dh2. More... | |
| template<class InputIterator > | |
| Dart_handle | insert_cell_2_in_cell_3 (InputIterator afirst, InputIterator alast) |
Inserts a 2-cell along the path of 1-cells containing darts given by the range [afirst,alast). More... | |
| Dart_handle | insert_dangling_cell_1_in_cell_2 (Dart_handle dh) |
Inserts a 1-cell in a the 2-cell containing dh, the 1-cell being attached only by one of its extremity to the 0-cell containing dh. More... | |
| bool | is_insertable_cell_1_in_cell_2 (Dart_const_handle dh1, Dart_const_handle dh2) |
Returns true iff it is possible to insert a 1-cell in the combinatorial map between dh1 and dh2. More... | |
| template<class InputIterator > | |
| bool | is_insertable_cell_2_in_cell_3 (InputIterator afirst, InputIterator alast) |
Returns true iff it is possible to insert a 2-cell in the combinatorial map along the path of darts given by the range [afirst,alast). More... | |
| template<unsigned int i> | |
| bool | is_removable (Dart_const_handle dh) |
Returns true iff the i-cell containing dh can be removed. More... | |
| template<unsigned int i> | |
| size_type | remove_cell (Dart_handle dh) |
Removes the i-cell containing dh. More... | |
Dynamic Onmerge/Onsplit functors | |
| template<int i> | |
| boost::function< void(typename Attribute_type< i >::type &, typename Attribute_type< i > ::type &)> & | onsplit_function () |
| Return the current dynamic onsplit function associated with i-attributes. More... | |
| template<int i> | |
| const boost::function< void(typename Attribute_type< i >::type &, typename Attribute_type< i > ::type &)> & | onsplit_function () const |
| Return the current dynamic onsplit function associated with i-attributes, when *this is const. More... | |
| template<int i> | |
| boost::function< void(typename Attribute_type< i >::type &, typename Attribute_type< i > ::type &)> & | onmerge_function () |
| Return the current dynamic onmerge function associated with i-attributes. More... | |
| template<int i> | |
| const boost::function< void(typename Attribute_type< i >::type &, typename Attribute_type< i > ::type &)> & | onmerge_function () const |
| Return the current dynamic onmerge function associated with i-attributes, when *this is const. More... | |
| template<int i> | |
| boost::function< void(typename Attribute_type< i >::type &, typename Attribute_type< i > ::type &)> & | onsplit_function () |
| Return the current dynamic onsplit function associated with i-attributes. More... | |
| template<int i> | |
| const boost::function< void(typename Attribute_type< i >::type &, typename Attribute_type< i > ::type &)> & | onsplit_function () const |
| Return the current dynamic onsplit function associated with i-attributes, when *this is const. More... | |
| template<int i> | |
| boost::function< void(typename Attribute_type< i >::type &, typename Attribute_type< i > ::type &)> & | onmerge_function () |
| Return the current dynamic onmerge function associated with i-attributes. More... | |
| template<int i> | |
| const boost::function< void(typename Attribute_type< i >::type &, typename Attribute_type< i > ::type &)> & | onmerge_function () const |
| Return the current dynamic onmerge function associated with i-attributes, when *this is const. More... | |
Boolean Marks | |
| size_type | get_new_mark () const |
| Reserves a new mark. More... | |
| bool | is_reserved (size_type m) const |
Returns true iff m is a reserved mark of the combinatorial map. More... | |
| bool | is_marked (Dart_const_handle dh, size_type m) const |
Returns true iff *dh is marked for m. More... | |
| void | mark (Dart_const_handle dh, size_type m) const |
Marks *dh for m. More... | |
| void | unmark (Dart_const_handle dh, size_type m) const |
Unmarks *dh for the mark m. More... | |
| void | negate_mark (size_type m) const |
Inverse the mark m for all the darts of the combinatorial map. More... | |
| void | unmark_all (size_type m) const |
Unmarks all the darts of the combinatorial map for m. More... | |
| size_type | number_of_marked_darts (size_type m) const |
Returns the number of marked darts for m. More... | |
| size_type | number_of_unmarked_darts (size_type m) const |
Return the number of unmarked darts for m. More... | |
| void | free_mark (size_type m) const |
Frees mark m. More... | |
| size_type | get_new_mark () const |
| Reserves a new mark. More... | |
| bool | is_reserved (size_type m) const |
Returns true iff m is a reserved mark of the combinatorial map. More... | |
| bool | is_marked (Dart_const_handle dh, size_type m) const |
Returns true iff *dh is marked for m. More... | |
| void | mark (Dart_const_handle dh, size_type m) const |
Marks *dh for m. More... | |
| void | unmark (Dart_const_handle dh, size_type m) const |
Unmarks *dh for the mark m. More... | |
| void | negate_mark (size_type m) const |
Inverse the mark m for all the darts of the combinatorial map. More... | |
| void | unmark_all (size_type m) const |
Unmarks all the darts of the combinatorial map for m. More... | |
| size_type | number_of_marked_darts (size_type m) const |
Returns the number of marked darts for m. More... | |
| size_type | number_of_unmarked_darts (size_type m) const |
Return the number of unmarked darts for m. More... | |
| void | free_mark (size_type m) const |
Frees mark m. More... | |
Constructions | |
| Dart_handle | make_combinatorial_hexahedron () |
| Creates a combinatorial hexahedron (six combinatorial quadrangles linked together by \( \beta_2\)), and adds it in the combinatorial map. More... | |
| Dart_handle | make_combinatorial_polygon (unsigned int lg) |
Creates a combinatorial polygon of length lg (lg darts linked by \( \beta_1\)), and adds it in the combinatorial map. More... | |
| Dart_handle | make_combinatorial_tetrahedron () |
| Creates a combinatorial tetrahedron (four combinatorial triangles linked together by \( \beta_2\)), and adds it in the combinatorial map. More... | |
| Dart_handle | make_edge () |
| Creates an isolated edge (two darts linked by \( \beta_2\)) and adds it in the combinatorial map. More... | |
| Dart_handle | make_combinatorial_hexahedron () |
| Creates a combinatorial hexahedron (six combinatorial quadrangles linked together by \( \beta_2\)), and adds it in the combinatorial map. More... | |
| Dart_handle | make_combinatorial_polygon (unsigned int lg) |
Creates a combinatorial polygon of length lg (lg darts linked by \( \beta_1\)), and adds it in the combinatorial map. More... | |
| Dart_handle | make_combinatorial_tetrahedron () |
| Creates a combinatorial tetrahedron (four combinatorial triangles linked together by \( \beta_2\)), and adds it in the combinatorial map. More... | |
| Dart_handle | make_edge () |
| Creates an isolated edge (two darts linked by \( \beta_2\)) and adds it in the combinatorial map. More... | |
| using CombinatorialMap::Attribute_const_handle = unspecified_type |
Attribute_handle<i>::type is a const handle to i-attributes, equal to Dart::Attribute_const_handle<i>::type .
| using CombinatorialMap::Attribute_const_handle = unspecified_type |
Attribute_handle<i>::type is a const handle to i-attributes, equal to Dart::Attribute_const_handle<i>::type .
| using CombinatorialMap::Attribute_const_range = unspecified_type |
Attribute_const_range<i>::type is the const range of all the i-attributes.
Attribute_const_range<i>::type is a model of ConstRange concept, its iterator type is bidirectional and its value type is Attribute_type<i>::type.
| using CombinatorialMap::Attribute_const_range = unspecified_type |
Attribute_const_range<i>::type is the const range of all the i-attributes.
Attribute_const_range<i>::type is a model of ConstRange concept, its iterator type is bidirectional and its value type is Attribute_type<i>::type.
| using CombinatorialMap::Attribute_handle = unspecified_type |
Attribute_handle<i>::type is a handle to i-attributes, equal to Dart::Attribute_handle<i>::type .
| using CombinatorialMap::Attribute_handle = unspecified_type |
Attribute_handle<i>::type is a handle to i-attributes, equal to Dart::Attribute_handle<i>::type .
| using CombinatorialMap::Attribute_range = unspecified_type |
Attribute_range<i>::type is the range of all the i-attributes.
Attribute_range<i>::type is a model of Range concept, its iterator type is bidirectional and its value type is Attribute_type<i>::type .
| using CombinatorialMap::Attribute_range = unspecified_type |
Attribute_range<i>::type is the range of all the i-attributes.
Attribute_range<i>::type is a model of Range concept, its iterator type is bidirectional and its value type is Attribute_type<i>::type .
| using CombinatorialMap::Attribute_type = unspecified_type |
Attribute_type<i>::type is the type of i-attributes, a model of CellAttribute concept.
Attribute_type<i>::type::Dart_handle is equal to Dart_handle, and Attribute_type<i>::type::Dart_const_handle is equal to Dart_const_handle.
void. | using CombinatorialMap::Attribute_type = unspecified_type |
Attribute_type<i>::type is the type of i-attributes, a model of CellAttribute concept.
Attribute_type<i>::type::Dart_handle is equal to Dart_handle, and Attribute_type<i>::type::Dart_const_handle is equal to Dart_const_handle.
void. The tuple of cell attributes.
It contains at most dimension+1 types (one for each possible cell of the combinatorial map). Each type of the tuple must be either a model of the CellAttribute concept or void. The first type corresponds to 0-attributes, the second to 1-attributes and so on. If the i th type in the tuple is void, (i-1)-attributes are disabled. Otherwise, (i-1)-attributes are enabled and have the given type. If the size of the tuple is k, with k \( <\)dimension+1, \( \forall\)i: k \( \leq\)i \( \leq\)dimension, i-attributes are disabled.
The tuple of cell attributes.
It contains at most dimension+1 types (one for each possible cell of the combinatorial map). Each type of the tuple must be either a model of the CellAttribute concept or void. The first type corresponds to 0-attributes, the second to 1-attributes and so on. If the i th type in the tuple is void, (i-1)-attributes are disabled. Otherwise, (i-1)-attributes are enabled and have the given type. If the size of the tuple is k, with k \( <\)dimension+1, \( \forall\)i: k \( \leq\)i \( \leq\)dimension, i-attributes are disabled.
Const range of all the darts of the combinatorial map.
This type is a model of ConstRange concept, its iterator type is bidirectional and its value type is Dart.
Const range of all the darts of the combinatorial map.
This type is a model of ConstRange concept, its iterator type is bidirectional and its value type is Dart.
| using CombinatorialMap::Dart_of_cell_const_range = unspecified_type |
Const range of all the darts of the i-cell.
Cells are considered in dim dimension, with 0 \( \leq\)i \( \leq\)dim+1 and 0 \( \leq\)dim \( \leq\)dimension. If i==dim+1, range of all the darts of a connected component. This type is a model of ConstRange concept, its iterator type is forward and its value type is Dart.
| using CombinatorialMap::Dart_of_cell_const_range = unspecified_type |
Const range of all the darts of the i-cell.
Cells are considered in dim dimension, with 0 \( \leq\)i \( \leq\)dim+1 and 0 \( \leq\)dim \( \leq\)dimension. If i==dim+1, range of all the darts of a connected component. This type is a model of ConstRange concept, its iterator type is forward and its value type is Dart.
| using CombinatorialMap::Dart_of_cell_range = unspecified_type |
Range of all the darts of an i-cell.
Cells are considered in dim dimension, with 0 \( \leq\)i \( \leq\)dim+1 and 0 \( \leq\)dim \( \leq\)dimension. If i==dim+1, range of all the darts of a connected component. This type is a model of Range concept, its iterator type is forward and its value type is Dart.
| using CombinatorialMap::Dart_of_cell_range = unspecified_type |
Range of all the darts of an i-cell.
Cells are considered in dim dimension, with 0 \( \leq\)i \( \leq\)dim+1 and 0 \( \leq\)dim \( \leq\)dimension. If i==dim+1, range of all the darts of a connected component. This type is a model of Range concept, its iterator type is forward and its value type is Dart.
| using CombinatorialMap::Dart_of_orbit_const_range = unspecified_type |
Const range of all the darts of the <Beta...> orbit.
This type is a model of ConstRange concept, its iterator type is forward and its value type is Dart.
| using CombinatorialMap::Dart_of_orbit_const_range = unspecified_type |
Const range of all the darts of the <Beta...> orbit.
This type is a model of ConstRange concept, its iterator type is forward and its value type is Dart.
| using CombinatorialMap::Dart_of_orbit_range = unspecified_type |
| using CombinatorialMap::Dart_of_orbit_range = unspecified_type |
| using CombinatorialMap::One_dart_per_cell_const_range = unspecified_type |
Const range of one dart of each i-cell of the combinatorial map.
Cells are considered in dim dimension, with 0 \( \leq\)i \( \leq\)dim+1 and 0 \( \leq\)dim \( \leq\)dimension. If i==dim+1, consider each connected component instead of each i-cell. This type is a model of ConstRange concept, its iterator type is forward and its value type is Dart.
| using CombinatorialMap::One_dart_per_cell_const_range = unspecified_type |
Const range of one dart of each i-cell of the combinatorial map.
Cells are considered in dim dimension, with 0 \( \leq\)i \( \leq\)dim+1 and 0 \( \leq\)dim \( \leq\)dimension. If i==dim+1, consider each connected component instead of each i-cell. This type is a model of ConstRange concept, its iterator type is forward and its value type is Dart.
| using CombinatorialMap::One_dart_per_cell_range = unspecified_type |
Range of one dart of each i-cell of the combinatorial map.
Cells are considered in dim dimension, with 0 \( \leq\)i \( \leq\)dim+1 and 0 \( \leq\)dim \( \leq\)dimension. If i==dim+1, consider each connected component instead of each i-cell. This type is a model of Range concept, its iterator type is forward and its value type is Dart.
| using CombinatorialMap::One_dart_per_cell_range = unspecified_type |
Range of one dart of each i-cell of the combinatorial map.
Cells are considered in dim dimension, with 0 \( \leq\)i \( \leq\)dim+1 and 0 \( \leq\)dim \( \leq\)dimension. If i==dim+1, consider each connected component instead of each i-cell. This type is a model of Range concept, its iterator type is forward and its value type is Dart.
| using CombinatorialMap::One_dart_per_incident_cell_const_range = unspecified_type |
Const range of one dart of each i-cell incident to one j-cell.
Cells are considered in dim dimension, with 0 \( \leq\)i \( \leq\)dim+1, 0 \( \leq\)j \( \leq\)dim+1 and 0 \( \leq\)dim \( \leq\)dimension. If i==dim+1, consider each connected component instead of each i-cell. If j==dim+1, consider one connected component instead of one j-cell. This type is a model of ConstRange concept, its iterator type is forward and its value type is Dart.
| using CombinatorialMap::One_dart_per_incident_cell_const_range = unspecified_type |
Const range of one dart of each i-cell incident to one j-cell.
Cells are considered in dim dimension, with 0 \( \leq\)i \( \leq\)dim+1, 0 \( \leq\)j \( \leq\)dim+1 and 0 \( \leq\)dim \( \leq\)dimension. If i==dim+1, consider each connected component instead of each i-cell. If j==dim+1, consider one connected component instead of one j-cell. This type is a model of ConstRange concept, its iterator type is forward and its value type is Dart.
| using CombinatorialMap::One_dart_per_incident_cell_range = unspecified_type |
Range of one dart of each i-cell incident to one j-cell.
Cells are considered in dim dimension, with 0 \( \leq\)i \( \leq\)dim+1, 0 \( \leq\)j \( \leq\)dim+1 and 0 \( \leq\)dim \( \leq\)dimension. If i==dim+1, consider each connected component instead of each i-cell. If j==dim+1, consider one connected component instead of one j-cell. This type is a model of Range concept, its iterator type is forward and its value type is Dart.
| using CombinatorialMap::One_dart_per_incident_cell_range = unspecified_type |
Range of one dart of each i-cell incident to one j-cell.
Cells are considered in dim dimension, with 0 \( \leq\)i \( \leq\)dim+1, 0 \( \leq\)j \( \leq\)dim+1 and 0 \( \leq\)dim \( \leq\)dimension. If i==dim+1, consider each connected component instead of each i-cell. If j==dim+1, consider one connected component instead of one j-cell. This type is a model of Range concept, its iterator type is forward and its value type is Dart.
| CombinatorialMap::CombinatorialMap | ( | const CMap & | cmap) |
Construct a new combinatorial map from another one.
The new combinatorial map is created by copying the darts and the non void attributes of cmap. CMap must be a model of CombinatorialMap concept, which can be defined with a different dimension and/or different attributes than *this. In this case, only permutations that are common to cmap and *this, and only non void i-attributes of cmap whose info type is the same to the info of non void i-attributes of *this, are copied.
| CombinatorialMap::CombinatorialMap | ( | const CMap & | cmap) |
Construct a new combinatorial map from another one.
The new combinatorial map is created by copying the darts and the non void attributes of cmap. CMap must be a model of CombinatorialMap concept, which can be defined with a different dimension and/or different attributes than *this. In this case, only permutations that are common to cmap and *this, and only non void i-attributes of cmap whose info type is the same to the info of non void i-attributes of *this, are copied.
| bool CombinatorialMap::are_attributes_automatically_managed | ( | ) | const |
Returns the status of the management of the attributes of the combinatorial map.
true if the high level operations update the non void attributes (default value); false otherwise.
| bool CombinatorialMap::are_attributes_automatically_managed | ( | ) | const |
Returns the status of the management of the attributes of the combinatorial map.
true if the high level operations update the non void attributes (default value); false otherwise.
| Attribute_handle<i>::type CombinatorialMap::attribute | ( | Dart_handle | dh) |
Returns a handle to the i-attribute associated to dart *dh.
void. | Attribute_handle<i>::type CombinatorialMap::attribute | ( | Dart_handle | dh) |
Returns a handle to the i-attribute associated to dart *dh.
void. | Attribute_const_handle<i>::type CombinatorialMap::attribute | ( | Dart_const_handle | dh) | const |
Returns a const handle to the i-attribute associated to dart *dh, when the dart is const.
void. | Attribute_const_handle<i>::type CombinatorialMap::attribute | ( | Dart_const_handle | dh) | const |
Returns a const handle to the i-attribute associated to dart *dh, when the dart is const.
void. | Attribute_range<i>::type& CombinatorialMap::attributes | ( | ) |
Returns a range of all the i-attributes in the combinatorial map.
| Attribute_range<i>::type& CombinatorialMap::attributes | ( | ) |
Returns a range of all the i-attributes in the combinatorial map.
| Attribute_const_range<i>::type& CombinatorialMap::attributes | ( | ) | const |
Returns a const range of all the i-attributes in the combinatorial map.
| Attribute_const_range<i>::type& CombinatorialMap::attributes | ( | ) | const |
Returns a const range of all the i-attributes in the combinatorial map.
| Dart_handle CombinatorialMap::beta | ( | Dart_handle | dh, |
| int | i, | ||
| int | j | ||
| ) |
Returns \( \beta_j\)( \( \beta_i\)(*dh)).
Overloads of this member function are defined that take from one to nine integer as arguments. For each function, betas are applied in the same order as their indices are given as parameters.
For example beta(dh,1)= \( \beta_1\)(*dh), and beta(dh,1,2,3,0)= \( \beta_0\)( \( \beta_3\)( \( \beta_2\)( \( \beta_1\)(*dh)))).
| Dart_handle CombinatorialMap::beta | ( | Dart_handle | dh, |
| int | i, | ||
| int | j | ||
| ) |
Returns \( \beta_j\)( \( \beta_i\)(*dh)).
Overloads of this member function are defined that take from one to nine integer as arguments. For each function, betas are applied in the same order as their indices are given as parameters.
For example beta(dh,1)= \( \beta_1\)(*dh), and beta(dh,1,2,3,0)= \( \beta_0\)( \( \beta_3\)( \( \beta_2\)( \( \beta_1\)(*dh)))).
| Dart_const_handle CombinatorialMap::beta | ( | Dart_const_handle | dh, |
| int | i, | ||
| int | j | ||
| ) | const |
| Dart_const_handle CombinatorialMap::beta | ( | Dart_const_handle | dh, |
| int | i, | ||
| int | j | ||
| ) | const |
| Dart_handle CombinatorialMap::beta | ( | Dart_handle | dh) |
Returns \( \beta_j\)( \( \beta_i\)(*dh)).
Overloads of this member function are defined that take from one to nine integer as template arguments. For each function, betas are applied in the same order as their indices are given as template arguments.
For example beta<1>(dh)= \( \beta_1\)(*dh), and beta<1,2,3,0>(dh)= \( \beta_0\)( \( \beta_3\)( \( \beta_2\)( \( \beta_1\)(*dh)))).
| Dart_handle CombinatorialMap::beta | ( | Dart_handle | dh) |
Returns \( \beta_j\)( \( \beta_i\)(*dh)).
Overloads of this member function are defined that take from one to nine integer as template arguments. For each function, betas are applied in the same order as their indices are given as template arguments.
For example beta<1>(dh)= \( \beta_1\)(*dh), and beta<1,2,3,0>(dh)= \( \beta_0\)( \( \beta_3\)( \( \beta_2\)( \( \beta_1\)(*dh)))).
| Dart_const_handle CombinatorialMap::beta | ( | Dart_const_handle | dh) | const |
| Dart_const_handle CombinatorialMap::beta | ( | Dart_const_handle | dh) | const |
| void CombinatorialMap::correct_invalid_attributes | ( | ) |
Correct the invalid attributes of the combinatorial map.
We can have invalid attribute either if we have called set_automatic_attributes_management(false) before to use some modification operations or if we have modified the combinatorial map by using low level operations.
\( \forall i \), 0 \( \leq \) i \( \leq \) dimension such that the i-attributes are non void, \( \forall \) d \( \in\)darts():
d2 in the same i-cell than d with a different i-attribute, then the i-attribute of d2 is set to the i-attribute of d;d2 in a different i-cell than d with the same i-attribute, then the i-attribute of all the darts in i-cell(d) is set to a new i-attribute (copy of the original attribute);dart_of_attribute(d) \( \in \) i-cell(d). | void CombinatorialMap::correct_invalid_attributes | ( | ) |
Correct the invalid attributes of the combinatorial map.
We can have invalid attribute either if we have called set_automatic_attributes_management(false) before to use some modification operations or if we have modified the combinatorial map by using low level operations.
\( \forall i \), 0 \( \leq \) i \( \leq \) dimension such that the i-attributes are non void, \( \forall \) d \( \in\)darts():
d2 in the same i-cell than d with a different i-attribute, then the i-attribute of d2 is set to the i-attribute of d;d2 in a different i-cell than d with the same i-attribute, then the i-attribute of all the darts in i-cell(d) is set to a new i-attribute (copy of the original attribute);dart_of_attribute(d) \( \in \) i-cell(d). | Attribute_handle<i>::type CombinatorialMap::create_attribute | ( | T1 | t1) |
Creates a new i-attribute in the combinatorial map, and returns the corresponding handle.
Calls the constructor of i-attribute having T1 as parameter. Overloads of this member function are defined that take from zero to nine arguments. With zero argument, create_attribute<i>() creates a new i-attribute by using the default constructor.
| Attribute_handle<i>::type CombinatorialMap::create_attribute | ( | T1 | t1) |
Creates a new i-attribute in the combinatorial map, and returns the corresponding handle.
Calls the constructor of i-attribute having T1 as parameter. Overloads of this member function are defined that take from zero to nine arguments. With zero argument, create_attribute<i>() creates a new i-attribute by using the default constructor.
| Dart_handle CombinatorialMap::create_dart | ( | T1 | t1) |
Creates a new dart in the combinatorial map, and returns the corresponding handle.
Calls the constructor of dart having T1 as parameter. A new dart is initialized to be i-free, \( \forall\)i: 0 \( \leq\)i \( \leq\)dimension, and to have no associated attribute for each non void attribute. Overloads of this member function are defined that take from zero to nine arguments. With zero argument, create_dart() creates a new dart by using the default constructor.
| Dart_handle CombinatorialMap::create_dart | ( | T1 | t1) |
Creates a new dart in the combinatorial map, and returns the corresponding handle.
Calls the constructor of dart having T1 as parameter. A new dart is initialized to be i-free, \( \forall\)i: 0 \( \leq\)i \( \leq\)dimension, and to have no associated attribute for each non void attribute. Overloads of this member function are defined that take from zero to nine arguments. With zero argument, create_dart() creates a new dart by using the default constructor.
| Dart_handle& CombinatorialMap::dart | ( | Dart_handle | adart) |
A shorcut for dart_of_attribute<i>(attribute<i>(adart)).
attribute<i>(adart)!=NULL. | Dart_handle& CombinatorialMap::dart | ( | Dart_handle | adart) |
A shorcut for dart_of_attribute<i>(attribute<i>(adart)).
attribute<i>(adart)!=NULL. | Dart_const_handle CombinatorialMap::dart | ( | Dart_const_handle | adart) | const |
A shorcut for dart_of_attribute<i>(attribute<i>(adart)) for const handle.
attribute<i>(adart)!=NULL. | Dart_const_handle CombinatorialMap::dart | ( | Dart_const_handle | adart) | const |
A shorcut for dart_of_attribute<i>(attribute<i>(adart)) for const handle.
attribute<i>(adart)!=NULL. | Dart_handle CombinatorialMap::dart_handle | ( | Dart & | d) |
Returns the dart handle of d.
d \( \in\)darts(). | Dart_handle CombinatorialMap::dart_handle | ( | Dart & | d) |
Returns the dart handle of d.
d \( \in\)darts(). | Dart_const_handle CombinatorialMap::dart_handle | ( | const Dart & | d) | const |
Returns the dart const handle of d.
d \( \in\)darts(). | Dart_const_handle CombinatorialMap::dart_handle | ( | const Dart & | d) | const |
Returns the dart const handle of d.
d \( \in\)darts(). | Dart_handle CombinatorialMap::dart_of_attribute | ( | typename Attribute_handle< i >::type | ah) |
Returns one dart of the cell associated to the i-attribute *ah.
NULL if Supports_cell_dart of i-attributes is equal to Tag_false.
void and ah!=NULL. | Dart_handle CombinatorialMap::dart_of_attribute | ( | typename Attribute_handle< i >::type | ah) |
Returns one dart of the cell associated to the i-attribute *ah.
NULL if Supports_cell_dart of i-attributes is equal to Tag_false.
void and ah!=NULL. | Dart_const_handle CombinatorialMap::dart_of_attribute | ( | typename Attribute_const_handle< i >::type | ah) | const |
Returns one dart of the cell associated to the const i-attribute *ah.
NULL if Supports_cell_dart of i-attributes is equal to Tag_false.
void and ah!=NULL. | Dart_const_handle CombinatorialMap::dart_of_attribute | ( | typename Attribute_const_handle< i >::type | ah) | const |
Returns one dart of the cell associated to the const i-attribute *ah.
NULL if Supports_cell_dart of i-attributes is equal to Tag_false.
void and ah!=NULL. | Dart_of_cell_range CombinatorialMap::darts_of_cell | ( | Dart_handle | dh) |
Returns a range of all the darts of the i-cell containing *dh.
The first element in the range points onto *dh. i-cells are considered in dim dimension. If i==dim+1, range of all the darts of the connected component containing dh.
| Dart_of_cell_range CombinatorialMap::darts_of_cell | ( | Dart_handle | dh) |
Returns a range of all the darts of the i-cell containing *dh.
The first element in the range points onto *dh. i-cells are considered in dim dimension. If i==dim+1, range of all the darts of the connected component containing dh.
| Dart_of_cell_const_range CombinatorialMap::darts_of_cell | ( | Dart_const_handle | dh) | const |
Returns a const range of all the darts of the i-cell containing *dh.
The first element in the range points onto *dh. i-cells are considered in dim dimension. If i==dim+1, const range of all the darts of the connected component containing *dh.
| Dart_of_cell_const_range CombinatorialMap::darts_of_cell | ( | Dart_const_handle | dh) | const |
Returns a const range of all the darts of the i-cell containing *dh.
The first element in the range points onto *dh. i-cells are considered in dim dimension. If i==dim+1, const range of all the darts of the connected component containing *dh.
| Dart_of_orbit_range CombinatorialMap::darts_of_orbit | ( | Dart_handle | dh) |
Returns a range of all the darts of the orbit <Beta...>(*dh).
The first element in the range points onto *dh.
| Dart_of_orbit_range CombinatorialMap::darts_of_orbit | ( | Dart_handle | dh) |
Returns a range of all the darts of the orbit <Beta...>(*dh).
The first element in the range points onto *dh.
| Dart_of_orbit_const_range CombinatorialMap::darts_of_orbit | ( | Dart_const_handle | dh) | const |
Returns a const range of all the darts of the orbit <Beta...>(*dh).
The first element in the range points onto *dh.
| Dart_of_orbit_const_range CombinatorialMap::darts_of_orbit | ( | Dart_const_handle | dh) | const |
Returns a const range of all the darts of the orbit <Beta...>(*dh).
The first element in the range points onto *dh.
| std::ostream& CombinatorialMap::display_characteristics | ( | std::ostream & | os) | const |
Displays on os the number of elements of the combinatorial map.
Its number of darts, its number of i-cells, for each i, 0 \( \leq\)i \( \leq\)dimension, and its number of connected components.
Example of output for a 3D combinatorial map containing two disjoint combinatorial tetrahedra:
#Darts=24, #0-cells=8, #1-cells=12, #2-cells=8, #3-cells=2, #ccs=2
| std::ostream& CombinatorialMap::display_characteristics | ( | std::ostream & | os) | const |
Displays on os the number of elements of the combinatorial map.
Its number of darts, its number of i-cells, for each i, 0 \( \leq\)i \( \leq\)dimension, and its number of connected components.
Example of output for a 3D combinatorial map containing two disjoint combinatorial tetrahedra:
#Darts=24, #0-cells=8, #1-cells=12, #2-cells=8, #3-cells=2, #ccs=2
| void CombinatorialMap::erase_attribute | ( | Attribute_handle< i >::type | ah) |
Removes the i-attribute *ah from the combinatorial map.
*ah \( \in\)attributes<i>(). | void CombinatorialMap::erase_attribute | ( | Attribute_handle< i >::type | ah) |
Removes the i-attribute *ah from the combinatorial map.
*ah \( \in\)attributes<i>(). | void CombinatorialMap::erase_dart | ( | Dart_handle | dh) |
Removes *dh from the combinatorial map.
*dh \( \in\)darts(). | void CombinatorialMap::erase_dart | ( | Dart_handle | dh) |
Removes *dh from the combinatorial map.
*dh \( \in\)darts(). | void CombinatorialMap::free_mark | ( | size_type | m) | const |
Frees mark m.
| void CombinatorialMap::free_mark | ( | size_type | m) | const |
Frees mark m.
| size_type CombinatorialMap::get_new_mark | ( | ) | const |
Reserves a new mark.
Returns its index. If there is no more available free mark, throw the exception Exception_no_more_available_mark.
| size_type CombinatorialMap::get_new_mark | ( | ) | const |
Reserves a new mark.
Returns its index. If there is no more available free mark, throw the exception Exception_no_more_available_mark.
| int CombinatorialMap::highest_nonfree_dimension | ( | Dart_const_handle | dh) | const |
Returns the highest dimension i such that dart *dh is not i-free.
-1 if dh is free for any dimension.
| int CombinatorialMap::highest_nonfree_dimension | ( | Dart_const_handle | dh) | const |
Returns the highest dimension i such that dart *dh is not i-free.
-1 if dh is free for any dimension.
| Attribute_type<i>::type::Info& CombinatorialMap::info | ( | Dart_handle | adart) |
A shorcut for info_of_attribute<i>(attribute<i>(adart)).
(adart)!=NULL. | Attribute_type<i>::type::Info& CombinatorialMap::info | ( | Dart_handle | adart) |
A shorcut for info_of_attribute<i>(attribute<i>(adart)).
(adart)!=NULL. | const Attribute_type<i>::type::Info& CombinatorialMap::info | ( | Dart_const_handle | adart) | const |
A shorcut for info_of_attribute<i>(attribute<i>(adart)) for const handle.
attribute<i>(adart)!=NULL. | const Attribute_type<i>::type::Info& CombinatorialMap::info | ( | Dart_const_handle | adart) | const |
A shorcut for info_of_attribute<i>(attribute<i>(adart)) for const handle.
attribute<i>(adart)!=NULL. | Attribute_type<i>::type::Info& CombinatorialMap::info_of_attribute | ( | typename Attribute_handle< i >::type | ah) |
| Attribute_type<i>::type::Info& CombinatorialMap::info_of_attribute | ( | typename Attribute_handle< i >::type | ah) |
| const Attribute_type<i>::type::Info& CombinatorialMap::info_of_attribute | ( | typename Attribute_const_handle< i >::type | ah) | const |
| const Attribute_type<i>::type::Info& CombinatorialMap::info_of_attribute | ( | typename Attribute_const_handle< i >::type | ah) | const |
| Dart_handle CombinatorialMap::insert_cell_0_in_cell_1 | ( | Dart_handle | dh) |
Inserts a 0-cell in the 1-cell containing dh.
Returns a handle on one dart belonging to the new 0-cell.
See example in Figure 27.11.
If are_attributes_automatically_managed()==true, if 1-attributes are non void, Attribute_type<1>::type::On_split(a,a') is called, with a the original 1-attribute associated with dh and a' the new 1-attribute created during the operation. If set, the dynamic onsplit function of 1-attributes is also called on a and a'.
If are_attributes_automatically_managed()==false, non void attributes are not updated; thus the combinatorial map can be no more valid after this operation.
| Dart_handle CombinatorialMap::insert_cell_0_in_cell_1 | ( | Dart_handle | dh) |
Inserts a 0-cell in the 1-cell containing dh.
Returns a handle on one dart belonging to the new 0-cell.
See example in Figure 27.11.
If are_attributes_automatically_managed()==true, if 1-attributes are non void, Attribute_type<1>::type::On_split(a,a') is called, with a the original 1-attribute associated with dh and a' the new 1-attribute created during the operation. If set, the dynamic onsplit function of 1-attributes is also called on a and a'.
If are_attributes_automatically_managed()==false, non void attributes are not updated; thus the combinatorial map can be no more valid after this operation.
| Dart_handle CombinatorialMap::insert_cell_0_in_cell_2 | ( | Dart_handle | dh) |
Inserts a 0-cell in the 2-cell containing dh.
The 2-cell is split in triangles, one for each initial edge of the facet. Returns a handle on one dart belonging to the new 0-cell.
See example in Figure 27.12.
If are_attributes_automatically_managed()==true, if 2-attributes are non void, Attribute_type<2>::type::On_split(a,a') is called, with a the original 2-attribute associated with dh and a' each new 2-attribute created during the operation. If set, the dynamic onsplit function of 2-attributes is also called on a and a'.
If are_attributes_automatically_managed()==false, non void attributes are not updated; thus the combinatorial map can be no more valid after this operation.
| Dart_handle CombinatorialMap::insert_cell_0_in_cell_2 | ( | Dart_handle | dh) |
Inserts a 0-cell in the 2-cell containing dh.
The 2-cell is split in triangles, one for each initial edge of the facet. Returns a handle on one dart belonging to the new 0-cell.
See example in Figure 27.12.
If are_attributes_automatically_managed()==true, if 2-attributes are non void, Attribute_type<2>::type::On_split(a,a') is called, with a the original 2-attribute associated with dh and a' each new 2-attribute created during the operation. If set, the dynamic onsplit function of 2-attributes is also called on a and a'.
If are_attributes_automatically_managed()==false, non void attributes are not updated; thus the combinatorial map can be no more valid after this operation.
| Dart_handle CombinatorialMap::insert_cell_1_in_cell_2 | ( | Dart_handle | dh1, |
| Dart_handle | dh2 | ||
| ) |
Inserts a 1-cell in the 2-cell containing dh1 and dh2.
Returns \( \beta_0\)(dh1), a handle on one dart belonging to the new 1-cell.
is_insertable_cell_1_in_cell_2(dh1,dh2).See example in Figure 27.13.
If are_attributes_automatically_managed()==true, if 2-attributes are non void, Attribute_type<2>::type::On_split(a,a') is called, with a the original 2-attribute associated with dh and a' the new 2-attribute created during the operation. If set, the dynamic onsplit function of 2-attributes is also called on a and a'.
If are_attributes_automatically_managed()==false, non void attributes are not updated; thus the combinatorial map can be no more valid after this operation.
| Dart_handle CombinatorialMap::insert_cell_1_in_cell_2 | ( | Dart_handle | dh1, |
| Dart_handle | dh2 | ||
| ) |
Inserts a 1-cell in the 2-cell containing dh1 and dh2.
Returns \( \beta_0\)(dh1), a handle on one dart belonging to the new 1-cell.
is_insertable_cell_1_in_cell_2(dh1,dh2).See example in Figure 27.13.
If are_attributes_automatically_managed()==true, if 2-attributes are non void, Attribute_type<2>::type::On_split(a,a') is called, with a the original 2-attribute associated with dh and a' the new 2-attribute created during the operation. If set, the dynamic onsplit function of 2-attributes is also called on a and a'.
If are_attributes_automatically_managed()==false, non void attributes are not updated; thus the combinatorial map can be no more valid after this operation.
| Dart_handle CombinatorialMap::insert_cell_2_in_cell_3 | ( | InputIterator | afirst, |
| InputIterator | alast | ||
| ) |
Inserts a 2-cell along the path of 1-cells containing darts given by the range [afirst,alast).
Returns a handle on one dart belonging to the new 2-cell.
is_insertable_cell_2_in_cell_3(afirst,alast).See example in Figure 27.14.
If are_attributes_automatically_managed()==true, if 3-attributes are non void, Attribute_type<3>::type::On_split(a,a') is called, with a the original 3-attribute associated with dh and a' the new 3-attribute created during the operation. If set, the dynamic onsplit function of 3-attributes is also called on a and a'.
If are_attributes_automatically_managed()==false, non void attributes are not updated; thus the combinatorial map can be no more valid after this operation.
| Dart_handle CombinatorialMap::insert_cell_2_in_cell_3 | ( | InputIterator | afirst, |
| InputIterator | alast | ||
| ) |
Inserts a 2-cell along the path of 1-cells containing darts given by the range [afirst,alast).
Returns a handle on one dart belonging to the new 2-cell.
is_insertable_cell_2_in_cell_3(afirst,alast).See example in Figure 27.14.
If are_attributes_automatically_managed()==true, if 3-attributes are non void, Attribute_type<3>::type::On_split(a,a') is called, with a the original 3-attribute associated with dh and a' the new 3-attribute created during the operation. If set, the dynamic onsplit function of 3-attributes is also called on a and a'.
If are_attributes_automatically_managed()==false, non void attributes are not updated; thus the combinatorial map can be no more valid after this operation.
| Dart_handle CombinatorialMap::insert_dangling_cell_1_in_cell_2 | ( | Dart_handle | dh) |
Inserts a 1-cell in a the 2-cell containing dh, the 1-cell being attached only by one of its extremity to the 0-cell containing dh.
Returns a handle on the dart belonging to the new 1-cell and to the new 0-cell.
See example in Figure 27.13.
If are_attributes_automatically_managed()==false, non void attributes are not updated; thus the combinatorial map can be no more valid after this operation.
| Dart_handle CombinatorialMap::insert_dangling_cell_1_in_cell_2 | ( | Dart_handle | dh) |
Inserts a 1-cell in a the 2-cell containing dh, the 1-cell being attached only by one of its extremity to the 0-cell containing dh.
Returns a handle on the dart belonging to the new 1-cell and to the new 0-cell.
See example in Figure 27.13.
If are_attributes_automatically_managed()==false, non void attributes are not updated; thus the combinatorial map can be no more valid after this operation.
| bool CombinatorialMap::is_attribute_used | ( | typename Attribute_const_handle< i >::type | ah) | const |
Returns true if ah points to a used i-attribute (i.e. valid).
void. | bool CombinatorialMap::is_attribute_used | ( | typename Attribute_const_handle< i >::type | ah) | const |
Returns true if ah points to a used i-attribute (i.e. valid).
void. | bool CombinatorialMap::is_free | ( | Dart_const_handle | dh, |
| unsigned int | i | ||
| ) | const |
Returns true iff dart *dh is i-free.
| bool CombinatorialMap::is_free | ( | Dart_const_handle | dh, |
| unsigned int | i | ||
| ) | const |
Returns true iff dart *dh is i-free.
| bool CombinatorialMap::is_free | ( | Dart_const_handle | dh) | const |
Returns true iff dart *dh is i-free.
| bool CombinatorialMap::is_free | ( | Dart_const_handle | dh) | const |
Returns true iff dart *dh is i-free.
| bool CombinatorialMap::is_insertable_cell_1_in_cell_2 | ( | Dart_const_handle | dh1, |
| Dart_const_handle | dh2 | ||
| ) |
Returns true iff it is possible to insert a 1-cell in the combinatorial map between dh1 and dh2.
This is possible if dh1 \( \neq\)dh2 and dh1 \( \in\) \( \langle{}\) \( \beta_1\) \( \rangle{}\)(dh2).
| bool CombinatorialMap::is_insertable_cell_1_in_cell_2 | ( | Dart_const_handle | dh1, |
| Dart_const_handle | dh2 | ||
| ) |
Returns true iff it is possible to insert a 1-cell in the combinatorial map between dh1 and dh2.
This is possible if dh1 \( \neq\)dh2 and dh1 \( \in\) \( \langle{}\) \( \beta_1\) \( \rangle{}\)(dh2).
| bool CombinatorialMap::is_insertable_cell_2_in_cell_3 | ( | InputIterator | afirst, |
| InputIterator | alast | ||
| ) |
Returns true iff it is possible to insert a 2-cell in the combinatorial map along the path of darts given by the range [afirst,alast).
The 2-cell can be inserted iff each couple of consecutive darts of the path a1 and a2 belong to the same vertex and the same volume, and if the path is closed.
| bool CombinatorialMap::is_insertable_cell_2_in_cell_3 | ( | InputIterator | afirst, |
| InputIterator | alast | ||
| ) |
Returns true iff it is possible to insert a 2-cell in the combinatorial map along the path of darts given by the range [afirst,alast).
The 2-cell can be inserted iff each couple of consecutive darts of the path a1 and a2 belong to the same vertex and the same volume, and if the path is closed.
| bool CombinatorialMap::is_marked | ( | Dart_const_handle | dh, |
| size_type | m | ||
| ) | const |
Returns true iff *dh is marked for m.
*dh \( \in\)darts(). | bool CombinatorialMap::is_marked | ( | Dart_const_handle | dh, |
| size_type | m | ||
| ) | const |
Returns true iff *dh is marked for m.
*dh \( \in\)darts(). | bool CombinatorialMap::is_removable | ( | Dart_const_handle | dh) |
Returns true iff the i-cell containing dh can be removed.
An i-cell can be removed if i==dimension or if i==dimension-1 or if i \( <\)dimension-1 and the i-cell containing dh is incident to at most two (i+1)-cells.
remove_cell<i> | bool CombinatorialMap::is_removable | ( | Dart_const_handle | dh) |
Returns true iff the i-cell containing dh can be removed.
An i-cell can be removed if i==dimension or if i==dimension-1 or if i \( <\)dimension-1 and the i-cell containing dh is incident to at most two (i+1)-cells.
remove_cell<i> | bool CombinatorialMap::is_reserved | ( | size_type | m) | const |
Returns true iff m is a reserved mark of the combinatorial map.
| bool CombinatorialMap::is_reserved | ( | size_type | m) | const |
Returns true iff m is a reserved mark of the combinatorial map.
| bool CombinatorialMap::is_sewable | ( | Dart_const_handle | dh1, |
| Dart_const_handle | dh2 | ||
| ) | const |
Returns true iff *dh1 can be i-sewn with *dh2 by keeping the combinatorial map valid.
This is true if there is a bijection f between all the darts of the orbit D1= \( \langle{}\) \( \beta_1\), \( \ldots\), \( \beta_{i-2}\), \( \beta_{i+2}\), \( \ldots\), \( \beta_d\) \( \rangle{}\)(*dh1) and D2= \( \langle{}\) \( \beta_1\), \( \ldots\), \( \beta_{i-2}\), \( \beta_{i+2}\), \( \ldots\), \( \beta_d\) \( \rangle{}\)(*dh2) satisfying: f(*dh1)=*dh2, and for all e \( \in\)D1, for all j \( \in\){1, \( \ldots\),i-2,i+2, \( \ldots\),d}, f( \( \beta_j\)(e))= \( \beta_j^{-1}\)(f(e)).
| bool CombinatorialMap::is_sewable | ( | Dart_const_handle | dh1, |
| Dart_const_handle | dh2 | ||
| ) | const |
Returns true iff *dh1 can be i-sewn with *dh2 by keeping the combinatorial map valid.
This is true if there is a bijection f between all the darts of the orbit D1= \( \langle{}\) \( \beta_1\), \( \ldots\), \( \beta_{i-2}\), \( \beta_{i+2}\), \( \ldots\), \( \beta_d\) \( \rangle{}\)(*dh1) and D2= \( \langle{}\) \( \beta_1\), \( \ldots\), \( \beta_{i-2}\), \( \beta_{i+2}\), \( \ldots\), \( \beta_d\) \( \rangle{}\)(*dh2) satisfying: f(*dh1)=*dh2, and for all e \( \in\)D1, for all j \( \in\){1, \( \ldots\),i-2,i+2, \( \ldots\),d}, f( \( \beta_j\)(e))= \( \beta_j^{-1}\)(f(e)).
| bool CombinatorialMap::is_valid | ( | ) | const |
Returns true iff the combinatorial map is valid.
A combinatorial map is valid (see Sections Combinatorial Map and Darts and Combinatorial Map Properties) if for all its darts d \(\in\)darts():
d is 0-free, or \( \beta_1(\beta_0(d))=d\);d is 1-free, or \( \beta_0(\beta_1(d))=d\);d is i-free, or \( \beta_i(\beta_i(d))=d\);| bool CombinatorialMap::is_valid | ( | ) | const |
Returns true iff the combinatorial map is valid.
A combinatorial map is valid (see Sections Combinatorial Map and Darts and Combinatorial Map Properties) if for all its darts d \(\in\)darts():
d is 0-free, or \( \beta_1(\beta_0(d))=d\);d is 1-free, or \( \beta_0(\beta_1(d))=d\);d is i-free, or \( \beta_i(\beta_i(d))=d\);| bool CombinatorialMap::is_without_boundary | ( | unsigned int | i) | const |
Returns true iff the combinatorial map is without i-boundary.
The map is without i-boundary if there is no i-free dart.
| bool CombinatorialMap::is_without_boundary | ( | unsigned int | i) | const |
Returns true iff the combinatorial map is without i-boundary.
The map is without i-boundary if there is no i-free dart.
| void CombinatorialMap::link_beta | ( | Dart_handle | dh1, |
| Dart_handle | dh2 | ||
| ) |
Links *dh1 and *dh2 by \( \beta_i\).
The combinatorial map can be no more valid after this operation. If are_attributes_automatically_managed()==true, non void attributes of *dh1 and *dh2 are updated: if one dart has an attribute and the second dart not, the non null attribute is associated to the dart having a null attribute. If both darts have an attribute, the attribute of *dh1 is associated to *dh2.
| void CombinatorialMap::link_beta | ( | Dart_handle | dh1, |
| Dart_handle | dh2 | ||
| ) |
Links *dh1 and *dh2 by \( \beta_i\).
The combinatorial map can be no more valid after this operation. If are_attributes_automatically_managed()==true, non void attributes of *dh1 and *dh2 are updated: if one dart has an attribute and the second dart not, the non null attribute is associated to the dart having a null attribute. If both darts have an attribute, the attribute of *dh1 is associated to *dh2.
| Dart_handle CombinatorialMap::make_combinatorial_hexahedron | ( | ) |
Creates a combinatorial hexahedron (six combinatorial quadrangles linked together by \( \beta_2\)), and adds it in the combinatorial map.
Returns a handle on one dart of this combinatorial hexahedron.
dimension \(\geq\) 2.| Dart_handle CombinatorialMap::make_combinatorial_hexahedron | ( | ) |
Creates a combinatorial hexahedron (six combinatorial quadrangles linked together by \( \beta_2\)), and adds it in the combinatorial map.
Returns a handle on one dart of this combinatorial hexahedron.
dimension \(\geq\) 2.| Dart_handle CombinatorialMap::make_combinatorial_polygon | ( | unsigned int | lg) |
Creates a combinatorial polygon of length lg (lg darts linked by \( \beta_1\)), and adds it in the combinatorial map.
Returns a handle on one dart of this combinatorial polygon.
dimension \( \geq\) 1 and lg \( >\) 0.| Dart_handle CombinatorialMap::make_combinatorial_polygon | ( | unsigned int | lg) |
Creates a combinatorial polygon of length lg (lg darts linked by \( \beta_1\)), and adds it in the combinatorial map.
Returns a handle on one dart of this combinatorial polygon.
dimension \( \geq\) 1 and lg \( >\) 0.| Dart_handle CombinatorialMap::make_combinatorial_tetrahedron | ( | ) |
Creates a combinatorial tetrahedron (four combinatorial triangles linked together by \( \beta_2\)), and adds it in the combinatorial map.
Returns a handle on one dart of this combinatorial tetrahedron.
dimension \( \geq\) 2.| Dart_handle CombinatorialMap::make_combinatorial_tetrahedron | ( | ) |
Creates a combinatorial tetrahedron (four combinatorial triangles linked together by \( \beta_2\)), and adds it in the combinatorial map.
Returns a handle on one dart of this combinatorial tetrahedron.
dimension \( \geq\) 2.| Dart_handle CombinatorialMap::make_edge | ( | ) |
Creates an isolated edge (two darts linked by \( \beta_2\)) and adds it in the combinatorial map.
Returns a handle on one dart of this edge.
dimension \( \geq\) 2.| Dart_handle CombinatorialMap::make_edge | ( | ) |
Creates an isolated edge (two darts linked by \( \beta_2\)) and adds it in the combinatorial map.
Returns a handle on one dart of this edge.
dimension \( \geq\) 2.| void CombinatorialMap::mark | ( | Dart_const_handle | dh, |
| size_type | m | ||
| ) | const |
Marks *dh for m.
*dh \( \in\)darts(). | void CombinatorialMap::mark | ( | Dart_const_handle | dh, |
| size_type | m | ||
| ) | const |
Marks *dh for m.
*dh \( \in\)darts(). | void CombinatorialMap::negate_mark | ( | size_type | m) | const |
Inverse the mark m for all the darts of the combinatorial map.
All the marked darts become unmarked and all the unmarked darts become marked.
| void CombinatorialMap::negate_mark | ( | size_type | m) | const |
Inverse the mark m for all the darts of the combinatorial map.
All the marked darts become unmarked and all the unmarked darts become marked.
| size_type CombinatorialMap::number_of_attributes | ( | ) | const |
Returns the number of i-attributes in the combinatorial map.
| size_type CombinatorialMap::number_of_attributes | ( | ) | const |
Returns the number of i-attributes in the combinatorial map.
Returns the number of marked darts for m.
Returns the number of marked darts for m.
Return the number of unmarked darts for m.
Return the number of unmarked darts for m.
| One_dart_per_cell_range CombinatorialMap::one_dart_per_cell | ( | ) |
Returns a range of one dart of each i-cell in the combinatorial map.
Cells are considered in dim dimension. If i==dim+1, range of one dart of each connected component in the combinatorial map.
| One_dart_per_cell_range CombinatorialMap::one_dart_per_cell | ( | ) |
Returns a range of one dart of each i-cell in the combinatorial map.
Cells are considered in dim dimension. If i==dim+1, range of one dart of each connected component in the combinatorial map.
| One_dart_per_cell_const_range CombinatorialMap::one_dart_per_cell | ( | ) | const |
Returns a const range of one dart of each i-cell in the combinatorial map.
Cells are considered in dim dimension. If i==dim+1, const range of one dart of each connected component in the combinatorial map.
| One_dart_per_cell_const_range CombinatorialMap::one_dart_per_cell | ( | ) | const |
Returns a const range of one dart of each i-cell in the combinatorial map.
Cells are considered in dim dimension. If i==dim+1, const range of one dart of each connected component in the combinatorial map.
| One_dart_per_incident_cell_range CombinatorialMap::one_dart_per_incident_cell | ( | Dart_handle | dh) |
Returns a range of one dart of each i-cell incident to the j-cell containing *dh.
The first element in the range points onto *dh. Cells are considered in dim dimension. If i==dim+1, consider each connected component instead of each i-cell. If j==dim+1, consider the connected component containing *dh instead of the j-cell.
| One_dart_per_incident_cell_range CombinatorialMap::one_dart_per_incident_cell | ( | Dart_handle | dh) |
Returns a range of one dart of each i-cell incident to the j-cell containing *dh.
The first element in the range points onto *dh. Cells are considered in dim dimension. If i==dim+1, consider each connected component instead of each i-cell. If j==dim+1, consider the connected component containing *dh instead of the j-cell.
| One_dart_per_incident_cell_const_range CombinatorialMap::one_dart_per_incident_cell | ( | Dart_const_handle | dh) | const |
Returns a const range of one dart of each i-cell incident to the j-cell containing *dh.
The first element in the range points onto *dh. Cells are considered in dim dimension. If i==dim+1, consider each connected component instead of each i-cell. If j==dim+1, consider the connected component containing *dh instead of the j-cell.
| One_dart_per_incident_cell_const_range CombinatorialMap::one_dart_per_incident_cell | ( | Dart_const_handle | dh) | const |
Returns a const range of one dart of each i-cell incident to the j-cell containing *dh.
The first element in the range points onto *dh. Cells are considered in dim dimension. If i==dim+1, consider each connected component instead of each i-cell. If j==dim+1, consider the connected component containing *dh instead of the j-cell.
| boost::function<void(typename Attribute_type< i >::type&, typename Attribute_type< i >::type&)>& CombinatorialMap::onmerge_function | ( | ) |
Return the current dynamic onmerge function associated with i-attributes.
This is a boost:function returning void and having two references to Attribute_type<i>::type as parameters. The onmerge function is returned by reference so that we can modify it.
| boost::function<void(typename Attribute_type< i >::type&, typename Attribute_type< i >::type&)>& CombinatorialMap::onmerge_function | ( | ) |
Return the current dynamic onmerge function associated with i-attributes.
This is a boost:function returning void and having two references to Attribute_type<i>::type as parameters. The onmerge function is returned by reference so that we can modify it.
| const boost::function<void(typename Attribute_type< i >::type&, typename Attribute_type< i >::type&)>& CombinatorialMap::onmerge_function | ( | ) | const |
Return the current dynamic onmerge function associated with i-attributes, when *this is const.
This is a boost:function returning void and having two references to Attribute_type<i>::type as parameters.
| const boost::function<void(typename Attribute_type< i >::type&, typename Attribute_type< i >::type&)>& CombinatorialMap::onmerge_function | ( | ) | const |
Return the current dynamic onmerge function associated with i-attributes, when *this is const.
This is a boost:function returning void and having two references to Attribute_type<i>::type as parameters.
| boost::function<void(typename Attribute_type< i >::type&, typename Attribute_type< i >::type&)>& CombinatorialMap::onsplit_function | ( | ) |
Return the current dynamic onsplit function associated with i-attributes.
This is a boost:function returning void and having two references to Attribute_type<i>::type as parameters. The onsplit function is returned by reference so that we can modify it.
| boost::function<void(typename Attribute_type< i >::type&, typename Attribute_type< i >::type&)>& CombinatorialMap::onsplit_function | ( | ) |
Return the current dynamic onsplit function associated with i-attributes.
This is a boost:function returning void and having two references to Attribute_type<i>::type as parameters. The onsplit function is returned by reference so that we can modify it.
| const boost::function<void(typename Attribute_type< i >::type&, typename Attribute_type< i >::type&)>& CombinatorialMap::onsplit_function | ( | ) | const |
Return the current dynamic onsplit function associated with i-attributes, when *this is const.
This is a boost:function returning void and having two references to Attribute_type<i>::type as parameters.
| const boost::function<void(typename Attribute_type< i >::type&, typename Attribute_type< i >::type&)>& CombinatorialMap::onsplit_function | ( | ) | const |
Return the current dynamic onsplit function associated with i-attributes, when *this is const.
This is a boost:function returning void and having two references to Attribute_type<i>::type as parameters.
| CombinatorialMap& CombinatorialMap::operator= | ( | const CombinatorialMap & | cmap) |
Assignment operator.
All darts and attributes are duplicated, and the former combinatorial map is deleted.
| CombinatorialMap& CombinatorialMap::operator= | ( | const CombinatorialMap & | cmap) |
Assignment operator.
All darts and attributes are duplicated, and the former combinatorial map is deleted.
| Dart_handle CombinatorialMap::opposite | ( | Dart_handle | dh) |
Returns a handle to a dart belonging to the same edge than dart *dh, and not to the same vertex.
NULL if such a dart does not exist.
| Dart_handle CombinatorialMap::opposite | ( | Dart_handle | dh) |
Returns a handle to a dart belonging to the same edge than dart *dh, and not to the same vertex.
NULL if such a dart does not exist.
| Dart_const_handle CombinatorialMap::opposite | ( | Dart_const_handle | dh) | const |
Returns a const handle to a dart belonging to the same edge than dart *dh, and not to the same vertex, when the dart is const.
NULL if such a dart does not exist.
| Dart_const_handle CombinatorialMap::opposite | ( | Dart_const_handle | dh) | const |
Returns a const handle to a dart belonging to the same edge than dart *dh, and not to the same vertex, when the dart is const.
NULL if such a dart does not exist.
| Dart_handle CombinatorialMap::other_extremity | ( | Dart_handle | dh) |
Returns a handle to a dart belonging to the other vertex of the edge containing dart *dh (but contrary to opposite() not necessarily to the same edge).
NULL if such a dart does not exist.
| Dart_handle CombinatorialMap::other_extremity | ( | Dart_handle | dh) |
Returns a handle to a dart belonging to the other vertex of the edge containing dart *dh (but contrary to opposite() not necessarily to the same edge).
NULL if such a dart does not exist.
| Dart_const_handle CombinatorialMap::other_extremity | ( | Dart_const_handle | dh) | const |
Returns a const handle to a dart belonging to the other vertex of the edge containing dart *dh, when the dart is const (but contrary to opposite() not necessarily to the same edge).
NULL if such a dart does not exist.
| Dart_const_handle CombinatorialMap::other_extremity | ( | Dart_const_handle | dh) | const |
Returns a const handle to a dart belonging to the other vertex of the edge containing dart *dh, when the dart is const (but contrary to opposite() not necessarily to the same edge).
NULL if such a dart does not exist.
| size_type CombinatorialMap::remove_cell | ( | Dart_handle | dh) |
Removes the i-cell containing dh.
Returns the number of darts removed from the combinatorial map.
is_removable<i>(dh).See examples in Figure 27.11, Figure 27.13 and Figure 27.14.
If are_attributes_automatically_managed()==true, if i \( <\)dimension, and i+1-attributes are non void, and if there are two distinct (i+1)-cells around dart dh, Attribute_type<i+1>::type::On_merge(a1,a2) is called, with a1 the (i+1)-attribute associated to dh, and a2 the (i+1)-attribute associated to \( \beta_{i+1}\)(dh). If set, the dynamic onmerge function of i+1-attributes is also called on a1 and a2.
If are_attributes_automatically_managed()==true, if a j-cell is disconnected in two j-cells during the operation, and if j-attributes are non void, Attribute_type<j>::type::On_split(a,a') is called with a the original j-attribute and a' the new j-attribute created due to the disconnection. If set, the dynamic onsplit function of j-attributes is also called on a and a'.
If are_attributes_automatically_managed()==false, non void attributes are not updated; thus the combinatorial map can be no more valid after this operation.
| size_type CombinatorialMap::remove_cell | ( | Dart_handle | dh) |
Removes the i-cell containing dh.
Returns the number of darts removed from the combinatorial map.
is_removable<i>(dh).See examples in Figure 27.11, Figure 27.13 and Figure 27.14.
If are_attributes_automatically_managed()==true, if i \( <\)dimension, and i+1-attributes are non void, and if there are two distinct (i+1)-cells around dart dh, Attribute_type<i+1>::type::On_merge(a1,a2) is called, with a1 the (i+1)-attribute associated to dh, and a2 the (i+1)-attribute associated to \( \beta_{i+1}\)(dh). If set, the dynamic onmerge function of i+1-attributes is also called on a1 and a2.
If are_attributes_automatically_managed()==true, if a j-cell is disconnected in two j-cells during the operation, and if j-attributes are non void, Attribute_type<j>::type::On_split(a,a') is called with a the original j-attribute and a' the new j-attribute created due to the disconnection. If set, the dynamic onsplit function of j-attributes is also called on a and a'.
If are_attributes_automatically_managed()==false, non void attributes are not updated; thus the combinatorial map can be no more valid after this operation.
| void CombinatorialMap::set_attribute | ( | Dart_handle | dh, |
| Attribute_handle< i >::type | ah | ||
| ) |
Associates the i-attribute of all the darts of the i-cell containing *dh to *ah.
*dh \( \in\)darts(), 0 \( \leq\)i \( \leq\)dimension, i-attributes are non void, and *ah \( \in\)attributes<i>(). | void CombinatorialMap::set_attribute | ( | Dart_handle | dh, |
| Attribute_handle< i >::type | ah | ||
| ) |
Associates the i-attribute of all the darts of the i-cell containing *dh to *ah.
*dh \( \in\)darts(), 0 \( \leq\)i \( \leq\)dimension, i-attributes are non void, and *ah \( \in\)attributes<i>(). | void CombinatorialMap::set_automatic_attributes_management | ( | bool | update_attributes) |
Set the status of the managment of the attributes of the combinatorial map.
After calling set_automatic_attributes_management(false), all high level operations will not update non void attributes, until the call of set_automatic_attributes_management(true). The call of set_automatic_attributes_management(true) call the correct_invalid_attributes() function.
| void CombinatorialMap::set_automatic_attributes_management | ( | bool | update_attributes) |
Set the status of the managment of the attributes of the combinatorial map.
After calling set_automatic_attributes_management(false), all high level operations will not update non void attributes, until the call of set_automatic_attributes_management(true). The call of set_automatic_attributes_management(true) call the correct_invalid_attributes() function.
| void CombinatorialMap::sew | ( | Dart_handle | dh1, |
| Dart_handle | dh2 | ||
| ) |
i-sew darts *dh1 and *dh2, by keeping the combinatorial map valid.
Links by \( \beta_i\) two by two all the darts of the orbit D1= \( \langle{}\) \( \beta_1\), \( \ldots\), \( \beta_{i-2}\), \( \beta_{i+2}\), \( \ldots\), \( \beta_d\) \( \rangle{}\)(*dh1) and D2= \( \langle{}\) \( \beta_0\), \( \beta_2\), \( \ldots\), \( \beta_{i-2}\), \( \beta_{i+2}\), \( \ldots\), \( \beta_d\) \( \rangle{}\)(*dh2) such that d2=f(d1).
f is the bijection between D1 and D2 satisfying: f(*dh1)=*dh2, and for all e \( \in\)D1, for all j \( \in\){1, \( \ldots\),i-2,i+2, \( \ldots\),d}, f( \( \beta_j\)(e))= \( \beta_j^{-1}\)(f(e)).
If are_attributes_automatically_managed()==true, when necessary, non void attributes are updated to ensure the validity of the combinatorial map: for each j-cells c1 and c2 which are merged into one j-cell during the sew, the two associated attributes attr1 and attr2 are considered. If one attribute is NULL and the other not, the non NULL attribute is associated to all the darts of the resulting cell. When the two attributes are non NULL, functor Attribute_type<i>::type::On_merge is called on the two attributes attr1 and attr2. If set, the dynamic onmerge function of i-attributes is also called on attr1 and attr2. Then, the attribute attr1 is associated to all darts of the resulting j-cell. Finally, attribute attr2 is removed from the combinatorial map.
If are_attributes_automatically_managed()==false, non void attributes are not updated; thus the combinatorial map can be no more valid after this operation.
| void CombinatorialMap::sew | ( | Dart_handle | dh1, |
| Dart_handle | dh2 | ||
| ) |
i-sew darts *dh1 and *dh2, by keeping the combinatorial map valid.
Links by \( \beta_i\) two by two all the darts of the orbit D1= \( \langle{}\) \( \beta_1\), \( \ldots\), \( \beta_{i-2}\), \( \beta_{i+2}\), \( \ldots\), \( \beta_d\) \( \rangle{}\)(*dh1) and D2= \( \langle{}\) \( \beta_0\), \( \beta_2\), \( \ldots\), \( \beta_{i-2}\), \( \beta_{i+2}\), \( \ldots\), \( \beta_d\) \( \rangle{}\)(*dh2) such that d2=f(d1).
f is the bijection between D1 and D2 satisfying: f(*dh1)=*dh2, and for all e \( \in\)D1, for all j \( \in\){1, \( \ldots\),i-2,i+2, \( \ldots\),d}, f( \( \beta_j\)(e))= \( \beta_j^{-1}\)(f(e)).
If are_attributes_automatically_managed()==true, when necessary, non void attributes are updated to ensure the validity of the combinatorial map: for each j-cells c1 and c2 which are merged into one j-cell during the sew, the two associated attributes attr1 and attr2 are considered. If one attribute is NULL and the other not, the non NULL attribute is associated to all the darts of the resulting cell. When the two attributes are non NULL, functor Attribute_type<i>::type::On_merge is called on the two attributes attr1 and attr2. If set, the dynamic onmerge function of i-attributes is also called on attr1 and attr2. Then, the attribute attr1 is associated to all darts of the resulting j-cell. Finally, attribute attr2 is removed from the combinatorial map.
If are_attributes_automatically_managed()==false, non void attributes are not updated; thus the combinatorial map can be no more valid after this operation.
| void CombinatorialMap::swap | ( | CombinatorialMap & | cmap) |
Swap the current combinatorial map with cmap.
There is no copy of darts and attributes thus this method runs in constant time.
| void CombinatorialMap::swap | ( | CombinatorialMap & | cmap) |
Swap the current combinatorial map with cmap.
There is no copy of darts and attributes thus this method runs in constant time.
| void CombinatorialMap::unlink_beta | ( | Dart_handle | dh) |
| void CombinatorialMap::unlink_beta | ( | Dart_handle | dh) |
| void CombinatorialMap::unmark | ( | Dart_const_handle | dh, |
| size_type | m | ||
| ) | const |
Unmarks *dh for the mark m.
*dh \( \in\)darts(). | void CombinatorialMap::unmark | ( | Dart_const_handle | dh, |
| size_type | m | ||
| ) | const |
Unmarks *dh for the mark m.
*dh \( \in\)darts(). | void CombinatorialMap::unmark_all | ( | size_type | m) | const |
Unmarks all the darts of the combinatorial map for m.
| void CombinatorialMap::unmark_all | ( | size_type | m) | const |
Unmarks all the darts of the combinatorial map for m.
| void CombinatorialMap::unsew | ( | Dart_handle | dh) |
i-unsew darts *dh and \( \beta_i\)(*dh), by keeping the combinatorial map valid.
Unlinks by \( \beta_i\) all the darts in the orbit \( \langle{}\) \( \beta_1\), \( \ldots\), \( \beta_{i-2}\), \( \beta_{i+2}\), \( \ldots\), \( \beta_d\) \( \rangle{}\)(*dh). If are_attributes_automatically_managed()==true, when necessary, non void attributes are updated to ensure the validity of the combinatorial map: for each j-cell c split in two j-cells c1 and c2 by the operation, if c is associated to a j-attribute attr1, then this attribute is duplicated into attr2, and all the darts belonging to c2 are associated with this new attribute. Finally, the functor Attribute_type<i>::type::On_split is called on the two attributes attr1 and attr2. If set, the dynamic onsplit function of i-attributes is also called on attr1 and attr2.
If are_attributes_automatically_managed()==false, non void attributes are not updated thus the combinatorial map can be no more valid after this operation.
| void CombinatorialMap::unsew | ( | Dart_handle | dh) |
i-unsew darts *dh and \( \beta_i\)(*dh), by keeping the combinatorial map valid.
Unlinks by \( \beta_i\) all the darts in the orbit \( \langle{}\) \( \beta_1\), \( \ldots\), \( \beta_{i-2}\), \( \beta_{i+2}\), \( \ldots\), \( \beta_d\) \( \rangle{}\)(*dh). If are_attributes_automatically_managed()==true, when necessary, non void attributes are updated to ensure the validity of the combinatorial map: for each j-cell c split in two j-cells c1 and c2 by the operation, if c is associated to a j-attribute attr1, then this attribute is duplicated into attr2, and all the darts belonging to c2 are associated with this new attribute. Finally, the functor Attribute_type<i>::type::On_split is called on the two attributes attr1 and attr2. If set, the dynamic onsplit function of i-attributes is also called on attr1 and attr2.
If are_attributes_automatically_managed()==false, non void attributes are not updated thus the combinatorial map can be no more valid after this operation.
| Dart_handle CombinatorialMap::null_dart_handle |
The null dart handle constant.
A dart d is i-free if beta(d, i)==null_dart_handle. Note that *null_dart_handle \( \notin\)darts().
1.8.4