diff options
| author | Campbell Barton <ideasman42@gmail.com> | 2012-04-12 04:15:02 +0400 |
|---|---|---|
| committer | Campbell Barton <ideasman42@gmail.com> | 2012-04-12 04:15:02 +0400 |
| commit | 5aaf3ede76c91a062d09360301083b6f75a6a89f (patch) | |
| tree | 4283c97a354f10b7ad24db9df97de023fb4e30a7 /source/blender/blenlib/intern/BLI_kdopbvh.c | |
| parent | c8b19b7b7fee817e4c7934973c99040747be53c3 (diff) | |
code cleanup: remove unused var for windows and style edit (remove spaces between 'var[num]')
Diffstat (limited to 'source/blender/blenlib/intern/BLI_kdopbvh.c')
| -rw-r--r-- | source/blender/blenlib/intern/BLI_kdopbvh.c | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/source/blender/blenlib/intern/BLI_kdopbvh.c b/source/blender/blenlib/intern/BLI_kdopbvh.c index cc05a8a2628..d43f8ae735b 100644 --- a/source/blender/blenlib/intern/BLI_kdopbvh.c +++ b/source/blender/blenlib/intern/BLI_kdopbvh.c @@ -599,13 +599,13 @@ static void verify_tree(BVHTree *tree) //This code can be easily reduced (basicly this is only method to calculate pow(k, n) in O(1).. and stuff like that) typedef struct BVHBuildHelper { - int tree_type; // - int totleafs; // + int tree_type; /* */ + int totleafs; /* */ - int leafs_per_child [32]; //Min number of leafs that are archievable from a node at depth N - int branches_on_level[32]; //Number of nodes at depth N (tree_type^N) + int leafs_per_child[32]; /* Min number of leafs that are archievable from a node at depth N */ + int branches_on_level[32]; /* Number of nodes at depth N (tree_type^N) */ - int remain_leafs; //Number of leafs that are placed on the level that is not 100% filled + int remain_leafs; /* Number of leafs that are placed on the level that is not 100% filled */ } BVHBuildHelper; |