diff options
| author | Campbell Barton <ideasman42@gmail.com> | 2021-11-01 06:00:58 +0300 |
|---|---|---|
| committer | Campbell Barton <ideasman42@gmail.com> | 2021-11-01 06:00:58 +0300 |
| commit | 1e749d0602700f175d70eac75f510512fc3b8b42 (patch) | |
| tree | e11c06d6fcdb9e6cf0c36f2201c27cb409c089fb /source/blender | |
| parent | b99d6e1bed5f238151abfc613448bbbfe67f78d0 (diff) | |
Cleanup: spelling, use C comments
Diffstat (limited to 'source/blender')
| -rw-r--r-- | source/blender/blenkernel/intern/spline_base.cc | 2 | ||||
| -rw-r--r-- | source/blender/draw/engines/overlay/overlay_engine.c | 2 | ||||
| -rw-r--r-- | source/blender/nodes/NOD_node_tree_ref.hh | 2 |
3 files changed, 3 insertions, 3 deletions
diff --git a/source/blender/blenkernel/intern/spline_base.cc b/source/blender/blenkernel/intern/spline_base.cc index bbe4e0aab7b..c2c9d178171 100644 --- a/source/blender/blenkernel/intern/spline_base.cc +++ b/source/blender/blenkernel/intern/spline_base.cc @@ -486,7 +486,7 @@ Array<float> Spline::sample_uniform_index_factors(const int samples_size) const prev_length = length; } - /* Zero lengths or float innacuracies can cause invalid values, or simply + /* Zero lengths or float inaccuracies can cause invalid values, or simply * skip some, so set the values that weren't completed in the main loop. */ for (const int i : IndexRange(i_sample, samples_size - i_sample)) { samples[i] = float(samples_size); diff --git a/source/blender/draw/engines/overlay/overlay_engine.c b/source/blender/draw/engines/overlay/overlay_engine.c index 7f9e37f58d5..d63a50bcc03 100644 --- a/source/blender/draw/engines/overlay/overlay_engine.c +++ b/source/blender/draw/engines/overlay/overlay_engine.c @@ -465,7 +465,7 @@ static void OVERLAY_cache_populate(void *vedata, Object *ob) break; case OB_LATTICE: { /* Unlike the other types above, lattices actually have a bounding box defined, so hide the - * lattice wires if only the boundingbox is requested. */ + * lattice wires if only the bounding-box is requested. */ if (ob->dt > OB_BOUNDBOX) { OVERLAY_lattice_cache_populate(vedata, ob); } diff --git a/source/blender/nodes/NOD_node_tree_ref.hh b/source/blender/nodes/NOD_node_tree_ref.hh index e04dd7f41bd..26a5dc9d60f 100644 --- a/source/blender/nodes/NOD_node_tree_ref.hh +++ b/source/blender/nodes/NOD_node_tree_ref.hh @@ -290,7 +290,7 @@ class NodeTreeRef : NonCopyable, NonMovable { struct ToposortResult { Vector<const NodeRef *> sorted_nodes; /** - * There can't be a correct topologycal sort of the nodes when there is a cycle. The nodes will + * There can't be a correct topological sort of the nodes when there is a cycle. The nodes will * still be sorted to some degree. The caller has to decide whether it can handle non-perfect * sorts or not. */ |