Cleanup: pass const variables

2 files changed, 4 insertions, 4 deletions

diff --git a/source/blender/blenlib/intern/delaunay_2d.c b/source/blender/blenlib/intern/delaunay_2d.c
index 7287bec0849..8fa429fc0c3 100644
--- a/source/blender/blenlib/intern/delaunay_2d.c
+++ b/source/blender/blenlib/intern/delaunay_2d.c
@@ -1375,7 +1375,7 @@ static void add_edge_constraint(
         isect = isect_seg_seg_v2_lambda_mu_db(va->co, vb->co, curco, v2->co, &lambda, NULL);
         if (isect == ISECT_LINE_LINE_NONE || isect == ISECT_LINE_LINE_EXACT) {
           /* The orient tests say that there is an intersection between
-           * va and vb, but the inexect isect routine has either put the
+           * va and vb, but the inexact intersection routine has either put the
            * intersection exactly on one of the endpoints or just outside
            * one of them.
            * Or this is an exact intersection at one of the curco / v2 ends.
@@ -2443,7 +2443,7 @@ static CDT_result *cdt_get_output(CDT_state *cdt,
  * The current initial Deluanay triangulation algorithm is the Guibas-Stolfi Divide and Conquer
  * algorithm (see "Primitives for the Manipulation of General Subdivisions and the Computation of
  * Voronoi Diagrams"). and uses Shewchuk's exact predicates to issues where numeric errors cause
- * inconsistent geometric judgements. This is followed by inserting edge constraints (including the
+ * inconsistent geometric judgments. This is followed by inserting edge constraints (including the
  * edges implied by faces) using the algorithms discussed in "Fully Dynamic Constrained Delaunay
  * Triangulations" by Kallmann, Bieri, and Thalmann.
  *
@@ -3085,7 +3085,7 @@ static void write_cdt_input_to_file(const CDT_input *inp)
 #  ifndef NDEBUG /* Only used in assert. */
 /*
  * Is a visible from b: i.e., ab crosses no edge of cdt?
- * If constrained is true, consider only constrained edges as possible crossers.
+ * If constrained is true, consider only constrained edges as possible crosser's.
  * In any case, don't count an edge ab itself.
  * Note: this is an expensive test if there are a lot of edges.
  */
diff --git a/source/blender/blenlib/intern/math_base_inline.c b/source/blender/blenlib/intern/math_base_inline.c
index 0a496d2bd68..c0ee658d434 100644
--- a/source/blender/blenlib/intern/math_base_inline.c
+++ b/source/blender/blenlib/intern/math_base_inline.c
@@ -598,7 +598,7 @@ MINLINE int integer_digits_i(const int i)
 
 /* Calculate initial guess for arg^exp based on float representation
  * This method gives a constant bias, which can be easily compensated by
- * multiplicating with bias_coeff.
+ * multiplying with bias_coeff.
  * Gives better results for exponents near 1 (e. g. 4/5).
  * exp = exponent, encoded as uint32_t
  * e2coeff = 2^(127/exponent - 127) * bias_coeff^(1/exponent), encoded as