Merge master

2 files changed, 2 insertions, 2 deletions

diff --git a/src/Bitmap_cubical_complex/include/gudhi/Bitmap_cubical_complex.h b/src/Bitmap_cubical_complex/include/gudhi/Bitmap_cubical_complex.h
index aa255ec2..4a6af3a4 100644
--- a/src/Bitmap_cubical_complex/include/gudhi/Bitmap_cubical_complex.h
+++ b/src/Bitmap_cubical_complex/include/gudhi/Bitmap_cubical_complex.h
@@ -237,7 +237,7 @@ class Bitmap_cubical_complex : public T {
    * Filtration_simplex_iterator class provides an iterator though the whole structure in the order of filtration.
    * Secondary criteria for filtration are:
    * (1) Dimension of a cube (lower dimensional comes first).
-   * (2) Position in the data structure (the ones that are earlies in the data structure comes first).
+   * (2) Position in the data structure (the ones that are earliest in the data structure come first).
    **/
   class Filtration_simplex_range;
 
diff --git a/src/Bitmap_cubical_complex/include/gudhi/Bitmap_cubical_complex_base.h b/src/Bitmap_cubical_complex/include/gudhi/Bitmap_cubical_complex_base.h
index f8f80ded..bafe7981 100644
--- a/src/Bitmap_cubical_complex/include/gudhi/Bitmap_cubical_complex_base.h
+++ b/src/Bitmap_cubical_complex/include/gudhi/Bitmap_cubical_complex_base.h
@@ -43,7 +43,7 @@ namespace cubical_complex {
  * Each cell is represented by a single
  * bit (in case of black and white bitmaps, or by a single element of a type T
  * (here T is a filtration type of a bitmap, typically a double).
- * All the informations needed for homology and
+ * All the information needed for homology and
  * persistent homology computations (like dimension of a cell, boundary and
  * coboundary elements of a cell, are then obtained from the
  * position of the element in C.