diff options
| author | Campbell Barton <ideasman42@gmail.com> | 2012-02-27 14:35:39 +0400 |
|---|---|---|
| committer | Campbell Barton <ideasman42@gmail.com> | 2012-02-27 14:35:39 +0400 |
| commit | 47c373c7a970fa4bd26453a6e35a4b066f2b77e4 (patch) | |
| tree | 43d916fb86bcf797afa834649706669694225fe8 /source/blender/blenlib/intern/BLI_kdtree.c | |
| parent | 120297734b4a01d93e5223e02f255b5aef01e281 (diff) | |
style cleanup (mostly whitespace)
Diffstat (limited to 'source/blender/blenlib/intern/BLI_kdtree.c')
| -rw-r--r-- | source/blender/blenlib/intern/BLI_kdtree.c | 26 |
1 files changed, 13 insertions, 13 deletions
diff --git a/source/blender/blenlib/intern/BLI_kdtree.c b/source/blender/blenlib/intern/BLI_kdtree.c index d5f66c0e75f..47c44629d65 100644 --- a/source/blender/blenlib/intern/BLI_kdtree.c +++ b/source/blender/blenlib/intern/BLI_kdtree.c @@ -179,17 +179,17 @@ int BLI_kdtree_find_nearest(KDTree *tree, float *co, float *nor, KDTreeNearest * stack[cur++]=root->right; } - while(cur--){ + while(cur--) { node=stack[cur]; cur_dist = node->co[node->d] - co[node->d]; - if(cur_dist<0.0f){ + if(cur_dist<0.0f) { cur_dist= -cur_dist*cur_dist; - if(-cur_dist<min_dist){ + if(-cur_dist<min_dist) { cur_dist=squared_distance(node->co,co,node->nor,nor); - if(cur_dist<min_dist){ + if(cur_dist<min_dist) { min_dist=cur_dist; min_node=node; } @@ -202,9 +202,9 @@ int BLI_kdtree_find_nearest(KDTree *tree, float *co, float *nor, KDTreeNearest * else{ cur_dist= cur_dist*cur_dist; - if(cur_dist<min_dist){ + if(cur_dist<min_dist) { cur_dist=squared_distance(node->co,co,node->nor,nor); - if(cur_dist<min_dist){ + if(cur_dist<min_dist) { min_dist=cur_dist; min_node=node; } @@ -214,7 +214,7 @@ int BLI_kdtree_find_nearest(KDTree *tree, float *co, float *nor, KDTreeNearest * if(node->left) stack[cur++]=node->left; } - if(cur+3 > totstack){ + if(cur+3 > totstack) { KDTreeNode **temp=MEM_callocN((totstack+100)*sizeof(KDTreeNode*), "psys_treestack"); memcpy(temp,stack,totstack*sizeof(KDTreeNode*)); if(stack != defaultstack) @@ -286,15 +286,15 @@ int BLI_kdtree_find_n_nearest(KDTree *tree, int n, float *co, float *nor, KDTree stack[cur++]=root->right; } - while(cur--){ + while(cur--) { node=stack[cur]; cur_dist = node->co[node->d] - co[node->d]; - if(cur_dist<0.0f){ + if(cur_dist<0.0f) { cur_dist= -cur_dist*cur_dist; - if(found<n || -cur_dist<nearest[found-1].dist){ + if(found<n || -cur_dist<nearest[found-1].dist) { cur_dist=squared_distance(node->co,co,node->nor,nor); if(found<n || cur_dist<nearest[found-1].dist) @@ -309,7 +309,7 @@ int BLI_kdtree_find_n_nearest(KDTree *tree, int n, float *co, float *nor, KDTree else{ cur_dist= cur_dist*cur_dist; - if(found<n || cur_dist<nearest[found-1].dist){ + if(found<n || cur_dist<nearest[found-1].dist) { cur_dist=squared_distance(node->co,co,node->nor,nor); if(found<n || cur_dist<nearest[found-1].dist) add_nearest(nearest,&found,n,node->index,cur_dist,node->co); @@ -320,7 +320,7 @@ int BLI_kdtree_find_n_nearest(KDTree *tree, int n, float *co, float *nor, KDTree if(node->left) stack[cur++]=node->left; } - if(cur+3 > totstack){ + if(cur+3 > totstack) { KDTreeNode **temp=MEM_callocN((totstack+100)*sizeof(KDTreeNode*), "psys_treestack"); memcpy(temp,stack,totstack*sizeof(KDTreeNode*)); if(stack != defaultstack) @@ -427,7 +427,7 @@ int BLI_kdtree_range_search(KDTree *tree, float range, float *co, float *nor, KD stack[cur++]=node->right; } - if(cur+3 > totstack){ + if(cur+3 > totstack) { KDTreeNode **temp=MEM_callocN((totstack+100)*sizeof(KDTreeNode*), "psys_treestack"); memcpy(temp,stack,totstack*sizeof(KDTreeNode*)); if(stack != defaultstack) |