diff options
author | Campbell Barton <ideasman42@gmail.com> | 2021-10-25 14:25:50 +0300 |
---|---|---|
committer | Campbell Barton <ideasman42@gmail.com> | 2021-10-25 14:28:06 +0300 |
commit | 8cecf88dcaa82560d6849e2532a3e84b459ef19f (patch) | |
tree | a807dad21cd3925b0a57a46918a5e242ccc4ed6e /intern/cycles | |
parent | 61bb70e0c7a2099639ebe3b87d770cc4d4023001 (diff) |
Cleanup: clang-tidy, spelling
Diffstat (limited to 'intern/cycles')
-rw-r--r-- | intern/cycles/blender/blender_display_driver.cpp | 2 | ||||
-rw-r--r-- | intern/cycles/render/scene.cpp | 2 |
2 files changed, 2 insertions, 2 deletions
diff --git a/intern/cycles/blender/blender_display_driver.cpp b/intern/cycles/blender/blender_display_driver.cpp index 3870f4956f2..cdf175f91d0 100644 --- a/intern/cycles/blender/blender_display_driver.cpp +++ b/intern/cycles/blender/blender_display_driver.cpp @@ -728,7 +728,7 @@ void BlenderDisplayDriver::vertex_buffer_update(const Params & /*params*/) * * Such approach can cause some extra "jelly" effect during panning, but it is not more jelly * than overlay of selected objects. Also, it's possible to redraw texture at an intersection of - * the texture draw parameters and the latest updated draw paaremters (altohoyugh, complexity of + * the texture draw parameters and the latest updated draw parameters (although, complexity of * doing it might not worth it. */ const int x = texture_.params.full_offset.x; const int y = texture_.params.full_offset.y; diff --git a/intern/cycles/render/scene.cpp b/intern/cycles/render/scene.cpp index fd19ab2efda..7c5e1a86f5e 100644 --- a/intern/cycles/render/scene.cpp +++ b/intern/cycles/render/scene.cpp @@ -667,7 +667,7 @@ int Scene::get_volume_stack_size() const if (object->intersects_volume) { /* Object intersects another volume, assume it's possible to go deeper in the stack. */ /* TODO(sergey): This might count nesting twice (A intersects B and B intersects A), but - * can't think of a computantially cheap algorithm. Dividing my 2 doesn't work because of + * can't think of a computationally cheap algorithm. Dividing my 2 doesn't work because of * Venn diagram example with 3 circles. */ ++volume_stack_size; } |