diff options
Diffstat (limited to 'src/Coxeter_triangulation/include/gudhi')
4 files changed, 12 insertions, 10 deletions
diff --git a/src/Coxeter_triangulation/include/gudhi/Coxeter_triangulation/Cell_complex/Hasse_diagram_cell.h b/src/Coxeter_triangulation/include/gudhi/Coxeter_triangulation/Cell_complex/Hasse_diagram_cell.h index 59e9a350..9b57da3c 100644 --- a/src/Coxeter_triangulation/include/gudhi/Coxeter_triangulation/Cell_complex/Hasse_diagram_cell.h +++ b/src/Coxeter_triangulation/include/gudhi/Coxeter_triangulation/Cell_complex/Hasse_diagram_cell.h @@ -95,7 +95,7 @@ class Hasse_diagram_cell { deleted_(false) {} /** - * Construcor of a cell of dimension dim having given additional information. + * Constructor of a cell of dimension dim having given additional information. **/ Hasse_diagram_cell(Additional_information ai, int dim) : dimension(dim), additional_info(ai), position(0), deleted_(false) {} @@ -125,7 +125,7 @@ class Hasse_diagram_cell { inline Additional_information& get_additional_information() { return this->additional_info; } /** - * Procedure to retrive position of the cell in the structure. It is used in + * Procedure to retrieve the position of the cell in the structure. It is used in * the implementation of Hasse diagram and set by it. Note that removal of * cell and subsequent call of clean_up_the_structure will change those * positions. @@ -186,7 +186,7 @@ class Hasse_diagram_cell { friend std::ostream& operator<<( std::ostream& out, const Hasse_diagram_cell<Incidence_type, Filtration_type, Additional_information>& c) { // cout << "position : " << c.position << ", dimension : " << c.dimension << ", filtration: " << c.filtration << ", - // size of boudary : " << c.boundary.size() << "\n"; + // size of boundary : " << c.boundary.size() << "\n"; out << c.position << " " << c.dimension << " " << c.filtration << std::endl; for (std::size_t bd = 0; bd != c.boundary.size(); ++bd) { // do not write out the cells that has been deleted diff --git a/src/Coxeter_triangulation/include/gudhi/Functions/Function_affine_plane_in_Rd.h b/src/Coxeter_triangulation/include/gudhi/Functions/Function_affine_plane_in_Rd.h index b29f0906..dc6f5f90 100644 --- a/src/Coxeter_triangulation/include/gudhi/Functions/Function_affine_plane_in_Rd.h +++ b/src/Coxeter_triangulation/include/gudhi/Functions/Function_affine_plane_in_Rd.h @@ -51,7 +51,7 @@ struct Function_affine_plane_in_Rd { * plane in the d-dimensional Euclidean space. * * @param[in] normal_matrix A normal matrix of the affine plane. The number of rows should - * correspond to the ambient dimension, the number of columns should corespond to + * correspond to the ambient dimension, the number of columns should correspond to * the size of the normal basis (codimension). * @param[in] offset The offset vector of the affine plane. * The dimension of the vector should be the ambient dimension of the manifold. @@ -66,7 +66,7 @@ struct Function_affine_plane_in_Rd { * plane in the d-dimensional Euclidean space that passes through origin. * * @param[in] normal_matrix A normal matrix of the affine plane. The number of rows should - * correspond to the ambient dimension, the number of columns should corespond to + * correspond to the ambient dimension, the number of columns should correspond to * the size of the normal basis (codimension). */ Function_affine_plane_in_Rd(const Eigen::MatrixXd& normal_matrix) diff --git a/src/Coxeter_triangulation/include/gudhi/Permutahedral_representation/Permutahedral_representation_iterators.h b/src/Coxeter_triangulation/include/gudhi/Permutahedral_representation/Permutahedral_representation_iterators.h index db145741..1a63d2f7 100644 --- a/src/Coxeter_triangulation/include/gudhi/Permutahedral_representation/Permutahedral_representation_iterators.h +++ b/src/Coxeter_triangulation/include/gudhi/Permutahedral_representation/Permutahedral_representation_iterators.h @@ -26,12 +26,12 @@ namespace Gudhi { namespace coxeter_triangulation { -/* \addtogroup coxeter_triangulation +/** \addtogroup coxeter_triangulation * Iterator types for Permutahedral_representation * @{ */ -/* \brief Iterator over the vertices of a simplex +/** \brief Iterator over the vertices of a simplex * represented by its permutahedral representation. * * Forward iterator, 'value_type' is Permutahedral_representation::Vertex.*/ @@ -83,7 +83,7 @@ class Vertex_iterator }; // Vertex_iterator /*---------------------------------------------------------------------------*/ -/* \brief Iterator over the k-faces of a simplex +/** \brief Iterator over the k-faces of a simplex * given by its permutahedral representation. * * Forward iterator, value_type is Permutahedral_representation. */ @@ -141,7 +141,7 @@ class Face_iterator : public boost::iterator_facade<Face_iterator<Permutahedral_ }; // Face_iterator /*---------------------------------------------------------------------------*/ -/* \brief Iterator over the k-cofaces of a simplex +/** \brief Iterator over the k-cofaces of a simplex * given by its permutahedral representation. * * Forward iterator, value_type is Permutahedral_representation. */ @@ -247,6 +247,8 @@ class Coface_iterator }; // Coface_iterator +/** @} */ + } // namespace coxeter_triangulation } // namespace Gudhi diff --git a/src/Coxeter_triangulation/include/gudhi/Permutahedral_representation/Size_range.h b/src/Coxeter_triangulation/include/gudhi/Permutahedral_representation/Size_range.h index c43effc8..6b137744 100644 --- a/src/Coxeter_triangulation/include/gudhi/Permutahedral_representation/Size_range.h +++ b/src/Coxeter_triangulation/include/gudhi/Permutahedral_representation/Size_range.h @@ -19,7 +19,7 @@ namespace Gudhi { namespace coxeter_triangulation { -/** \brief Auxillary iterator class for sizes of parts in an ordered set partition. +/** \brief Auxiliary iterator class for sizes of parts in an ordered set partition. */ template <class T_it> class Size_iterator |