]> https://gitweb.dealii.org/ - dealii.git/commitdiff
Update pre-commit. 18176/head
authorMarc Fehling <mafehling.git@gmail.com>
Fri, 28 Feb 2025 13:53:11 +0000 (14:53 +0100)
committerMarc Fehling <mafehling.git@gmail.com>
Sat, 1 Mar 2025 19:05:43 +0000 (20:05 +0100)
.pre-commit-config.yaml
doc/news/3.1.0-vs-3.2.0.h
include/deal.II/base/tensor_function.h
include/deal.II/matrix_free/tensor_product_kernels.h
source/grid/grid_out.cc
tests/base/polynomial_lagrange_order.cc
tests/grid/grid_out_gnuplot_01.cc

index 0b0ab6d02461b1bfb7a9de00e40f71446e44f851..f516c4ae903b5b2c97278f7d1f403e416bd9d384 100755 (executable)
@@ -28,7 +28,7 @@ repos:
         )
     exclude: ^bundled/
 - repo: https://github.com/gitleaks/gitleaks
-  rev: v8.23.1
+  rev: v8.24.0
   hooks:
   - id: gitleaks
 - repo: https://github.com/pre-commit/mirrors-clang-format
@@ -42,7 +42,7 @@ repos:
             \.h
         )$
 - repo: https://github.com/crate-ci/typos
-  rev: v1.29.4
+  rev: v1.29.10
   hooks:
   - id: typos
     files: (?x) ^(doc|examples|include|source|tests)/
index 9b230ef92d5b55f6be860e6a37724c42bf264dce..2a0489df6deac8042ee64f3ecb61b375d672e5eb 100644 (file)
@@ -307,7 +307,7 @@ All entries are signed with the names of the author.
        New: The new <code>Polynomial</code> class can
        be used as base class for all 1d polynomials. It stores the
        coefficients of the polynomial and uses the Horner scheme to
-       evaluate values and all derivates.
+       evaluate values and all derivatives.
        <br>
        (RH 2001/03/14)
        </p>
index 39ef90d8fcb4c15c1a49bf3d430c67a64d178413..5ecc957299d2af22b40f4d51679b22734eef8a84 100644 (file)
@@ -121,7 +121,7 @@ public:
 
 /**
  * Provide a tensor valued function which always returns a constant tensor
- * value. Obviously, all derivates of this function are zero.
+ * value. Obviously, all derivatives of this function are zero.
  *
  * @ingroup functions
  */
@@ -173,7 +173,7 @@ private:
 
 /**
  * Provide a tensor valued function which always returns zero. Obviously, all
- * derivates of this function are zero.
+ * derivatives of this function are zero.
  *
  * @ingroup functions
  */
index 684c3ea3228d0114abda7212c907d8dda0a0dcd9..37c7754eb97a97c116466ad78c3d996752ede7aa 100644 (file)
@@ -2334,7 +2334,7 @@ namespace internal
    *             the computed values overwrite the content in the output.
    * @tparam max_derivative Sets the number of derivatives that should be
    *             computed. 0 means only values, 1 means values and first
-   *             derivatives, 2 up to second derivates. Note that all the
+   *             derivatives, 2 up to second derivatives. Note that all the
    *             derivatives access the data in @p shape_values passed to
    *             the constructor of the class.
    *
index 95ec435824944f8215bec7497621b22ac6def7b7..efaa654001f2267accdb5ccebadf8f9613862eaa 100644 (file)
@@ -4164,7 +4164,7 @@ namespace internal
      */
     template <int spacedim>
     void
-    remove_colinear_points(std::vector<Point<spacedim>> &points)
+    remove_collinear_points(std::vector<Point<spacedim>> &points)
     {
       while (points.size() > 2)
         {
@@ -4172,7 +4172,7 @@ namespace internal
           first_difference /= first_difference.norm();
           Tensor<1, spacedim> second_difference = points[2] - points[1];
           second_difference /= second_difference.norm();
-          // If the three points are colinear then remove the middle one.
+          // If the three points are collinear then remove the middle one.
           if ((first_difference - second_difference).norm() < 1e-10)
             points.erase(points.begin() + 1);
           else
@@ -4288,7 +4288,7 @@ namespace internal
                       gnuplot_flags.curved_inner_cells)
                     {
                       // Save the points on each face to a vector and then try
-                      // to remove colinear points that won't show up in the
+                      // to remove collinear points that won't show up in the
                       // generated plot.
                       std::vector<Point<spacedim>> line_points;
                       // compute offset of quadrature points within set of
@@ -4303,7 +4303,7 @@ namespace internal
                         line_points.push_back(
                           mapping->transform_unit_to_real_cell(
                             cell, q_projector.point(offset + i)));
-                      internal::remove_colinear_points(line_points);
+                      internal::remove_collinear_points(line_points);
 
                       for (const Point<spacedim> &point : line_points)
                         out << point << ' ' << cell->level() << ' '
@@ -4562,7 +4562,7 @@ namespace internal
                               gnuplot_flags.curved_inner_cells)
                             {
                               // Save the points on each face to a vector and
-                              // then try to remove colinear points that won't
+                              // then try to remove collinear points that won't
                               // show up in the generated plot.
                               std::vector<Point<spacedim>> line_points;
                               // transform_real_to_unit_cell could be replaced
@@ -4579,7 +4579,7 @@ namespace internal
                                     cell,
                                     (1 - boundary_points[i][0]) * u0 +
                                       boundary_points[i][0] * u1));
-                              internal::remove_colinear_points(line_points);
+                              internal::remove_collinear_points(line_points);
                               for (const Point<spacedim> &point : line_points)
                                 out << point << ' ' << cell->level() << ' '
                                     << static_cast<unsigned int>(
index 664cae799d2d55eb76d032ea966001307d9cb9f7..4585e3f5ae463c894a50838a7f20b5c6564647de 100644 (file)
@@ -13,7 +13,7 @@
 // ------------------------------------------------------------------------
 
 
-// Similar to polyomial_lagrange, but test Lagrange interpolation for high
+// Similar to polynomial_lagrange, but test Lagrange interpolation for high
 // order with tighter tolerances, in particular the effect of stability of the
 // polynomial evaluation at random points
 
index 983b30c1ab616f8c62214198b22d527d0a67ce58..2f09557b514f42de685b4b13fc2a98f07860e948 100644 (file)
@@ -15,7 +15,7 @@
 
 
 // Plot some GNUPLOT output to make sure that all of the flags work as
-// intended. This verifies that the new colinear point removal algorithm works
+// intended. This verifies that the new collinear point removal algorithm works
 // and also that we can do output in dim = 2, spacedim = 3.
 
 

In the beginning the Universe was created. This has made a lot of people very angry and has been widely regarded as a bad move.

Douglas Adams


Typeset in Trocchi and Trocchi Bold Sans Serif.