Cleanup: spelling

15 files changed, 21 insertions, 21 deletions

diff --git a/source/blender/blenkernel/intern/lib_id.c b/source/blender/blenkernel/intern/lib_id.c
index 3ad429c5f5a..ca23ec90c97 100644
--- a/source/blender/blenkernel/intern/lib_id.c
+++ b/source/blender/blenkernel/intern/lib_id.c
@@ -1694,7 +1694,7 @@ static void library_make_local_copying_check(ID *id,
       continue;
     }
 
-    /* Shapekeys are considered 'private' to their owner ID here, and never tagged
+    /* Shape-keys are considered 'private' to their owner ID here, and never tagged
      * (since they cannot be linked), so we have to switch effective parent to their owner.
      */
     if (GS(par_id->name) == ID_KE) {
diff --git a/source/blender/blenlib/BLI_array.hh b/source/blender/blenlib/BLI_array.hh
index b929d1220da..07155439170 100644
--- a/source/blender/blenlib/BLI_array.hh
+++ b/source/blender/blenlib/BLI_array.hh
@@ -55,7 +55,7 @@ template<
      * The number of values that can be stored in the array, without doing a heap allocation.
      *
      * When T is large, the small buffer optimization is disabled by default to avoid large
-     * unexpected allocations on the stack. It can still be enabled explicitely though.
+     * unexpected allocations on the stack. It can still be enabled explicitly though.
      */
     uint InlineBufferCapacity = (sizeof(T) < 100) ? 4 : 0,
     /**
diff --git a/source/blender/blenlib/BLI_hash.hh b/source/blender/blenlib/BLI_hash.hh
index de81abd5d7a..5490c953756 100644
--- a/source/blender/blenlib/BLI_hash.hh
+++ b/source/blender/blenlib/BLI_hash.hh
@@ -65,7 +65,7 @@
  *
  * - When you want to provide a different hash function for a type that already has a default hash
  *   function: Implement a struct like the one below and pass it as template parameter to the hash
- *   table explicitely.
+ *   table explicitly.
  *
  *     struct MyCustomHash {
  *       uint32_t operator()(const TheType &value) const {
diff --git a/source/blender/blenlib/BLI_map.hh b/source/blender/blenlib/BLI_map.hh
index 48c58341525..a4c3ee76ca1 100644
--- a/source/blender/blenlib/BLI_map.hh
+++ b/source/blender/blenlib/BLI_map.hh
@@ -94,7 +94,7 @@ template<
      * that (unlike vector) initializing a map has a O(n) cost in the number of slots.
      *
      * When Key or Value are large, the small buffer optimization is disabled by default to avoid
-     * large unexpected allocations on the stack. It can still be enabled explicitely though.
+     * large unexpected allocations on the stack. It can still be enabled explicitly though.
      */
     uint32_t InlineBufferCapacity = (sizeof(Key) + sizeof(Value) < 100) ? 4 : 0,
     /**
diff --git a/source/blender/blenlib/BLI_map_slots.hh b/source/blender/blenlib/BLI_map_slots.hh
index 97d3baf0c83..f12eefcaf0b 100644
--- a/source/blender/blenlib/BLI_map_slots.hh
+++ b/source/blender/blenlib/BLI_map_slots.hh
@@ -90,7 +90,7 @@ template<typename Key, typename Value> class SimpleMapSlot {
   }
 
   /**
-   * The move construtor has to copy the state. If the other slot was occupied, the key and value
+   * The move constructor has to copy the state. If the other slot was occupied, the key and value
    * from the other have to moved as well. The other slot stays in the state it was in before. Its
    * optionally stored key and value remain in a moved-from state.
    */
diff --git a/source/blender/blenlib/BLI_memory_utils.hh b/source/blender/blenlib/BLI_memory_utils.hh
index 55dca98fb07..81792e2101c 100644
--- a/source/blender/blenlib/BLI_memory_utils.hh
+++ b/source/blender/blenlib/BLI_memory_utils.hh
@@ -40,7 +40,7 @@ namespace blender {
 template<typename T> void default_construct_n(T *ptr, uint n)
 {
   /* This is not strictly necessary, because the loop below will be optimized away anyway. It is
-   * nice to make behavior this explicitely, though. */
+   * nice to make behavior this explicitly, though. */
   if (std::is_trivially_constructible<T>::value) {
     return;
   }
@@ -62,7 +62,7 @@ template<typename T> void default_construct_n(T *ptr, uint n)
 template<typename T> void destruct_n(T *ptr, uint n)
 {
   /* This is not strictly necessary, because the loop below will be optimized away anyway. It is
-   * nice to make behavior this explicitely, though. */
+   * nice to make behavior this explicitly, though. */
   if (std::is_trivially_destructible<T>::value) {
     return;
   }
@@ -163,7 +163,7 @@ template<typename T> void initialized_relocate_n(T *src, uint n, T *dst)
  *
  * Before:
  *  src: initialized
- *  dst: uinitialized
+ *  dst: uninitialized
  * After:
  *  src: uninitialized
  *  dst: initialized
diff --git a/source/blender/blenlib/BLI_set.hh b/source/blender/blenlib/BLI_set.hh
index ada193eb7fe..d23aa96e434 100644
--- a/source/blender/blenlib/BLI_set.hh
+++ b/source/blender/blenlib/BLI_set.hh
@@ -91,7 +91,7 @@ template<
      * that (unlike vector) initializing a set has a O(n) cost in the number of slots.
      *
      * When Key is large, the small buffer optimization is disabled by default to avoid large
-     * unexpected allocations on the stack. It can still be enabled explicitely though.
+     * unexpected allocations on the stack. It can still be enabled explicitly though.
      */
     uint32_t InlineBufferCapacity = (sizeof(Key) < 100) ? 4 : 0,
     /**
diff --git a/source/blender/blenlib/BLI_stack.hh b/source/blender/blenlib/BLI_stack.hh
index 030d9c84c8e..2170b8b23bc 100644
--- a/source/blender/blenlib/BLI_stack.hh
+++ b/source/blender/blenlib/BLI_stack.hh
@@ -75,7 +75,7 @@ template<
      * not initialized when it is not needed.
      *
      * When T is large, the small buffer optimization is disabled by default to avoid large
-     * unexpected allocations on the stack. It can still be enabled explicitely though.
+     * unexpected allocations on the stack. It can still be enabled explicitly though.
      */
     uint InlineBufferCapacity = (sizeof(T) < 100) ? 4 : 0,
     /**
diff --git a/source/blender/blenlib/BLI_string_ref.hh b/source/blender/blenlib/BLI_string_ref.hh
index 073137fe175..bb8479efe95 100644
--- a/source/blender/blenlib/BLI_string_ref.hh
+++ b/source/blender/blenlib/BLI_string_ref.hh
@@ -292,8 +292,8 @@ inline std::ostream &operator<<(std::ostream &stream, StringRefNull ref)
 }
 
 /**
- * Adding two StringRefs will allocate an std::string. This is not efficient, but convenient in
- * most cases.
+ * Adding two #StringRefs will allocate an std::string.
+ * This is not efficient, but convenient in most cases.
  */
 inline std::string operator+(StringRef a, StringRef b)
 {
@@ -347,7 +347,7 @@ inline bool StringRefBase::endswith(StringRef suffix) const
 }
 
 /**
- * Return a new StringRef containing only a substring of the original string.
+ * Return a new #StringRef containing only a sub-string of the original string.
  */
 inline StringRef StringRefBase::substr(uint start, uint size) const
 {
diff --git a/source/blender/blenlib/BLI_vector.hh b/source/blender/blenlib/BLI_vector.hh
index b2b2da0a4b0..f61a3d4282b 100644
--- a/source/blender/blenlib/BLI_vector.hh
+++ b/source/blender/blenlib/BLI_vector.hh
@@ -68,7 +68,7 @@ template<
      * not initialized when it is not needed.
      *
      * When T is large, the small buffer optimization is disabled by default to avoid large
-     * unexpected allocations on the stack. It can still be enabled explicitely though.
+     * unexpected allocations on the stack. It can still be enabled explicitly though.
      */
     uint InlineBufferCapacity = (sizeof(T) < 100) ? 4 : 0,
     /**
@@ -79,7 +79,7 @@ template<
 class Vector {
  private:
   /**
-   * Use pointers instead of storing the size explicitely. This reduces the number of instructions
+   * Use pointers instead of storing the size explicitly. This reduces the number of instructions
    * in `append`.
    *
    * The pointers might point to the memory in the inline buffer.
@@ -95,7 +95,7 @@ class Vector {
   AlignedBuffer<(uint)sizeof(T) * InlineBufferCapacity, (uint)alignof(T)> m_inline_buffer;
 
   /**
-   * Store the size of the vector explicitely in debug builds. Otherwise you'd always have to call
+   * Store the size of the vector explicitly in debug builds. Otherwise you'd always have to call
    * the `size` function or do the math to compute it from the pointers manually. This is rather
    * annoying. Knowing the size of a vector is often quite essential when debugging some code.
    */
diff --git a/source/blender/blenlib/BLI_vector_set.hh b/source/blender/blenlib/BLI_vector_set.hh
index dcd4927aed2..03f25a68cd8 100644
--- a/source/blender/blenlib/BLI_vector_set.hh
+++ b/source/blender/blenlib/BLI_vector_set.hh
@@ -27,7 +27,7 @@
  *
  * All core operations (add, remove and contains) can be done in O(1) amortized expected time.
  *
- * Using a VectorSet instead of a normal Set can be benefitial in any of the following
+ * Using a VectorSet instead of a normal Set can be beneficial in any of the following
  * circumstances:
  * - The insertion order is important.
  * - Iteration over all keys has to be fast.
diff --git a/source/blender/editors/space_graph/graph_utils.c b/source/blender/editors/space_graph/graph_utils.c
index 03ed8870d67..6d08fd00cab 100644
--- a/source/blender/editors/space_graph/graph_utils.c
+++ b/source/blender/editors/space_graph/graph_utils.c
@@ -52,7 +52,7 @@
 /* Set Up Drivers Editor */
 
 /* Set up UI configuration for Drivers Editor */
-/* NOTE: Currently called from windowmanager
+/* NOTE: Currently called from window-manager
  * (new drivers editor window) and RNA (mode switching) */
 void ED_drivers_editor_init(bContext *C, ScrArea *area)
 {
diff --git a/source/blender/editors/transform/transform_convert_particle.c b/source/blender/editors/transform/transform_convert_particle.c
index 5feaa70ba19..3fa722d14cf 100644
--- a/source/blender/editors/transform/transform_convert_particle.c
+++ b/source/blender/editors/transform/transform_convert_particle.c
@@ -250,7 +250,7 @@ static void flushTransParticles(TransInfo *t)
 /** \} */
 
 /* -------------------------------------------------------------------- */
-/** \name Recalc Trasform Particles Data
+/** \name Recalc Transform Particles Data
  *
  * \{ */
 
diff --git a/source/blender/functions/FN_cpp_type.hh b/source/blender/functions/FN_cpp_type.hh
index 236baf303e0..1dc72e16e77 100644
--- a/source/blender/functions/FN_cpp_type.hh
+++ b/source/blender/functions/FN_cpp_type.hh
@@ -212,7 +212,7 @@ class CPPType {
   }
 
   /**
-   * Returns true, when the given pointer fullfills the alignment requirement of this type.
+   * Returns true, when the given pointer fulfills the alignment requirement of this type.
    */
   bool pointer_has_valid_alignment(const void *ptr) const
   {
diff --git a/source/blender/makesdna/DNA_windowmanager_types.h b/source/blender/makesdna/DNA_windowmanager_types.h
index e1e8d808c60..a07b8f81d96 100644
--- a/source/blender/makesdna/DNA_windowmanager_types.h
+++ b/source/blender/makesdna/DNA_windowmanager_types.h
@@ -265,7 +265,7 @@ typedef struct wmWindow {
   short modalcursor;
   /** Cursor grab mode. */
   short grabcursor;
-  /** Internal: tag this for extra mousemove event,
+  /** Internal: tag this for extra mouse-move event,
    * makes cursors/buttons active on UI switching. */
   char addmousemove;
   char tag_cursor_refresh;