bartvdbraak/blender
1
0
Fork 4
Code Issues 4 Pull Requests 1 Actions 1 Packages Projects Releases Wiki Activity

Cleanup: warnings & spelling

Browse Source
This commit is contained in:
Campbell Barton 2015-12-02 13:15:52 +11:00
parent 5cbf58ce8b
commit fc9505c9c5
6 changed files with 8 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
extern/libmv/libmv/simple_pipeline/camera_intrinsics.h vendored
View File

@ -197,7 +197,7 @@ class CameraIntrinsics {
double *normalized_x,
double *normalized_y) const = 0;
// Distort an image using the current camera instrinsics
// Distort an image using the current camera intrinsics
//
// The distorted image is computed in output_buffer using samples from
// input_buffer. Both buffers should be width x height x channels sized.
@ -226,7 +226,7 @@ class CameraIntrinsics {
int channels,
PixelType *output_buffer);
// Undistort an image using the current camera instrinsics
// Undistort an image using the current camera intrinsics
//
// The undistorted image is computed in output_buffer using samples from
// input_buffer. Both buffers should be width x height x channels sized.

2
intern/cycles/kernel/geom/geom_qbvh.h
View File

@ -19,7 +19,7 @@ struct QBVHStackItem {
float dist;
};
/* TOOD(sergey): Investigate if using instrinsics helps for both
/* TOOD(sergey): Investigate if using intrinsics helps for both
* stack item swap and float comparison.
*/
ccl_device_inline void qbvh_item_swap(QBVHStackItem *__restrict a,

2
intern/cycles/render/graph.cpp
View File

@ -631,7 +631,7 @@ void ShaderGraph::break_cycles(ShaderNode *node, vector<bool>& visited, vector<b
void ShaderGraph::clean(Scene *scene)
{
/* Graph simplification:
* 1: Remove unnecesarry nodes
* 1: Remove unnecessary nodes
* 2: Constant folding
* 3: Simplification
* 4: De-duplication

2
intern/cycles/util/util_math_fast.h
View File

@ -247,7 +247,7 @@ ccl_device float fast_sinpif(float x)
* The basic idea of this approximation starts with the coarse approximation:
* sin(pi*x) ~= f(x) = 4 * (x - x * abs(x))
*
* This approximation always _over_ estimates the target. On the otherhand,
* This approximation always _over_ estimates the target. On the other hand,
* the curve:
* sin(pi*x) ~= f(x) * abs(f(x)) / 4
*

4
source/blender/bmesh/tools/bmesh_path.c
View File

@ -316,10 +316,10 @@ static float facetag_cut_cost(BMFace *f_a, BMFace *f_b, BMEdge *e)
float ix_e[3], ix_f[3], f;
isect_line_line_v3(e->v1->co, e->v2->co, f_a_cent, f_b_cent, ix_e, ix_f);
f = line_point_factor_v3(ix_e, e->v1->co, e->v2->co);
if (f < 0.0) {
if (f < 0.0f) {
copy_v3_v3(e_cent, e->v1->co);
}
else if (f > 1.0) {
else if (f > 1.0f) {
copy_v3_v3(e_cent, e->v2->co);
}
else {

2
source/blender/modifiers/intern/MOD_weightvgproximity.c
View File

@ -136,7 +136,7 @@ static void get_vert2geom_distance(int numVerts, float (*v_cos)[3],
DerivedMesh *target, const SpaceTransform *loc2trgt)
{
Vert2GeomData data = {0};
Vert2GeomDataChunk data_chunk = {0};
Vert2GeomDataChunk data_chunk = {{{0}}};
BVHTreeFromMesh treeData_v = {NULL};
BVHTreeFromMesh treeData_e = {NULL};