diff options
author | Campbell Barton <ideasman42@gmail.com> | 2020-11-20 03:39:03 +0300 |
---|---|---|
committer | Campbell Barton <ideasman42@gmail.com> | 2020-11-20 03:39:22 +0300 |
commit | 25266caa454324b3394c09920913fb419b5abf2b (patch) | |
tree | d3280dfb512accb74a7e06fc9841d1228e96dd59 /intern/cycles | |
parent | 5f1bb8da96c47e3feea9853eb479fb565aeaa2fa (diff) |
Cleanup: spelling
Diffstat (limited to 'intern/cycles')
-rw-r--r-- | intern/cycles/kernel/kernel_light.h | 2 | ||||
-rw-r--r-- | intern/cycles/kernel/kernel_light_background.h | 4 | ||||
-rw-r--r-- | intern/cycles/render/object.cpp | 2 |
3 files changed, 4 insertions, 4 deletions
diff --git a/intern/cycles/kernel/kernel_light.h b/intern/cycles/kernel/kernel_light.h index 138b90373a6..9650b85a5c2 100644 --- a/intern/cycles/kernel/kernel_light.h +++ b/intern/cycles/kernel/kernel_light.h @@ -582,7 +582,7 @@ ccl_device_forceinline void triangle_light_sample(KernelGlobals *kg, ccl_device int light_distribution_sample(KernelGlobals *kg, float *randu) { - /* This is basically std::upper_bound as used by pbrt, to find a point light or + /* This is basically std::upper_bound as used by PBRT, to find a point light or * triangle to emit from, proportional to area. a good improvement would be to * also sample proportional to power, though it's not so well defined with * arbitrary shaders. */ diff --git a/intern/cycles/kernel/kernel_light_background.h b/intern/cycles/kernel/kernel_light_background.h index 5fa25069fcd..2a685c0adfa 100644 --- a/intern/cycles/kernel/kernel_light_background.h +++ b/intern/cycles/kernel/kernel_light_background.h @@ -31,7 +31,7 @@ ccl_device float3 background_map_sample(KernelGlobals *kg, float randu, float ra int res_y = kernel_data.background.map_res_y; int cdf_width = res_x + 1; - /* this is basically std::lower_bound as used by pbrt */ + /* This is basically std::lower_bound as used by PBRT. */ int first = 0; int count = res_y; @@ -58,7 +58,7 @@ ccl_device float3 background_map_sample(KernelGlobals *kg, float randu, float ra float dv = inverse_lerp(cdf_v.y, cdf_next_v.y, randv); float v = (index_v + dv) / res_y; - /* this is basically std::lower_bound as used by pbrt */ + /* This is basically std::lower_bound as used by PBRT. */ first = 0; count = res_x; while (count > 0) { diff --git a/intern/cycles/render/object.cpp b/intern/cycles/render/object.cpp index 70ce60252f0..a1a08f26229 100644 --- a/intern/cycles/render/object.cpp +++ b/intern/cycles/render/object.cpp @@ -171,7 +171,7 @@ void Object::compute_bounds(bool motion_blur) bounds = BoundBox::empty; - /* todo: this is really terrible. according to pbrt there is a better + /* TODO: this is really terrible. according to PBRT there is a better * way to find this iteratively, but did not find implementation yet * or try to implement myself */ for (float t = 0.0f; t < 1.0f; t += (1.0f / 128.0f)) { |