Spelling: Then Versus Than

Corrects incorrect usages of the words 'then' and 'than'.

Differential Revision: https://developer.blender.org/D9246

Reviewed by Campbell Barton

6 files changed, 8 insertions, 8 deletions

diff --git a/source/blender/blenlib/BLI_scanfill.h b/source/blender/blenlib/BLI_scanfill.h
index cf74bc14cac..fa57f0486e5 100644
--- a/source/blender/blenlib/BLI_scanfill.h
+++ b/source/blender/blenlib/BLI_scanfill.h
@@ -106,7 +106,7 @@ enum {
   BLI_SCANFILL_CALC_POLYS = (1 << 2),
 
   /* note: This flag removes checks for overlapping polygons.
-   * when this flag is set, we'll never get back more faces then (totvert - 2) */
+   * when this flag is set, we'll never get back more faces than (totvert - 2) */
   BLI_SCANFILL_CALC_HOLES = (1 << 3),
 
   /* checks valid edge users - can skip for simple loops */
diff --git a/source/blender/blenlib/intern/array_store.c b/source/blender/blenlib/intern/array_store.c
index 387f9837159..a6a0c21b104 100644
--- a/source/blender/blenlib/intern/array_store.c
+++ b/source/blender/blenlib/intern/array_store.c
@@ -189,7 +189,7 @@
  */
 #  define BCHUNK_SIZE_MIN_DIV 8
 
-/* Disallow chunks bigger then the regular chunk size scaled by this value
+/* Disallow chunks bigger than the regular chunk size scaled by this value
  * note: must be at least 2!
  * however, this code runs wont run in tests unless its ~1.1 ugh.
  * so lower only to check splitting works.
@@ -523,7 +523,7 @@ static void bchunk_list_calc_trim_len(const BArrayInfo *info,
 
 #ifdef USE_MERGE_CHUNKS
   /* avoid creating too-small chunks
-   * more efficient then merging after */
+   * more efficient than merging after */
   if (data_len > info->chunk_byte_size) {
     data_last_chunk_len = (data_trim_len % info->chunk_byte_size);
     data_trim_len = data_trim_len - data_last_chunk_len;
diff --git a/source/blender/blenlib/intern/polyfill_2d.c b/source/blender/blenlib/intern/polyfill_2d.c
index eb7e5ca6658..fe9fa514e08 100644
--- a/source/blender/blenlib/intern/polyfill_2d.c
+++ b/source/blender/blenlib/intern/polyfill_2d.c
@@ -85,7 +85,7 @@ typedef signed char eSign;
  * This is a single purpose KDTree based on BLI_kdtree with some modifications
  * to better suit polyfill2d.
  * - #KDTreeNode2D is kept small (only 16 bytes),
- *   by not storing coords in the nodes and using index values rather then pointers
+ *   by not storing coords in the nodes and using index values rather than pointers
  *   to reference neg/pos values.
  *
  * - #kdtree2d_isect_tri is the only function currently used.
@@ -719,7 +719,7 @@ static bool pf_ear_tip_check(PolyFill *pf, PolyIndex *pi_ear_tip)
        * the area sign will be positive if the point is strictly inside.
        * It will be 0 on the edge, which we want to include as well. */
 
-      /* note: check (v3, v1) first since it fails _far_ more often then the other 2 checks
+      /* note: check (v3, v1) first since it fails _far_ more often than the other 2 checks
        * (those fail equally).
        * It's logical - the chance is low that points exist on the
        * same side as the ear we're clipping off. */
diff --git a/source/blender/blenlib/intern/smallhash.c b/source/blender/blenlib/intern/smallhash.c
index 4a2915ef24e..a091b41af23 100644
--- a/source/blender/blenlib/intern/smallhash.c
+++ b/source/blender/blenlib/intern/smallhash.c
@@ -24,7 +24,7 @@
  * fixed size hash tables but falls back to heap memory once the stack limits reached
  * (#SMSTACKSIZE).
  *
- * based on a doubling hashing approach (non-chaining) which uses more buckets then entries
+ * based on a doubling hashing approach (non-chaining) which uses more buckets than entries
  * stepping over buckets when two keys share the same hash so any key can find a free bucket.
  *
  * See: https://en.wikipedia.org/wiki/Double_hashing
diff --git a/source/blender/blenlib/intern/storage.c b/source/blender/blenlib/intern/storage.c
index 628bdc1a31f..d1e133318ba 100644
--- a/source/blender/blenlib/intern/storage.c
+++ b/source/blender/blenlib/intern/storage.c
@@ -636,7 +636,7 @@ void BLI_file_free_lines(LinkNode *lines)
   BLI_linklist_freeN(lines);
 }
 
-/** is file1 older then file2 */
+/** is file1 older than file2 */
 bool BLI_file_older(const char *file1, const char *file2)
 {
 #ifdef WIN32
diff --git a/source/blender/blenlib/intern/winstuff_dir.c b/source/blender/blenlib/intern/winstuff_dir.c
index 4db385bd8aa..2dc41bfc54c 100644
--- a/source/blender/blenlib/intern/winstuff_dir.c
+++ b/source/blender/blenlib/intern/winstuff_dir.c
@@ -24,7 +24,7 @@
 
 #ifdef WIN32
 
-/* standalone for inclusion in binaries other then blender */
+/* standalone for inclusion in binaries other than blender */
 #  ifdef USE_STANDALONE
 #    define MEM_mallocN(size, str) ((void)str, malloc(size))
 #    define MEM_callocN(size, str) ((void)str, calloc(size, 1))