diff options
| author | Campbell Barton <ideasman42@gmail.com> | 2012-03-09 04:41:09 +0400 |
|---|---|---|
| committer | Campbell Barton <ideasman42@gmail.com> | 2012-03-09 04:41:09 +0400 |
| commit | 4f7bdc59d31e94bc97955c1efeef2a8fce0c8ecd (patch) | |
| tree | 7e0a36829cf52ff260821ce02716727052b95d32 /source/blender/blenlib/intern/BLI_kdopbvh.c | |
| parent | 27d43f3fd3a6fbda95cdb87e4672fe34f19c2205 (diff) | |
style cleanup: spelling.
also remove large, duplicate comments from sunsky.h
Diffstat (limited to 'source/blender/blenlib/intern/BLI_kdopbvh.c')
| -rw-r--r-- | source/blender/blenlib/intern/BLI_kdopbvh.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/source/blender/blenlib/intern/BLI_kdopbvh.c b/source/blender/blenlib/intern/BLI_kdopbvh.c index 561c7ffb57e..b992d518b49 100644 --- a/source/blender/blenlib/intern/BLI_kdopbvh.c +++ b/source/blender/blenlib/intern/BLI_kdopbvh.c @@ -718,7 +718,7 @@ static void split_leafs(BVHNode **leafs_array, int *nth, int partitions, int spl * * This function creates an implicit tree on branches_array, the leafs are given on the leafs_array. * - * The tree is built per depth levels. First branchs at depth 1.. then branches at depth 2.. etc.. + * The tree is built per depth levels. First branches at depth 1.. then branches at depth 2.. etc.. * The reason is that we can build level N+1 from level N without any data dependencies.. thus it allows * to use multithread building. * |