diff options
author | Campbell Barton <ideasman42@gmail.com> | 2019-01-15 15:15:58 +0300 |
---|---|---|
committer | Campbell Barton <ideasman42@gmail.com> | 2019-01-15 15:30:31 +0300 |
commit | 4226ee0b71fec6f08897dacf3d6632526618acca (patch) | |
tree | 560c333c5a9458f3dbbb606befd52d558b35503f /source/blender/blenlib/BLI_kdopbvh.h | |
parent | 30c3852ffd140b003410aae25b222dea8b76412f (diff) |
Cleanup: comment line length (blenlib)
Prevents clang-format wrapping text before comments.
Diffstat (limited to 'source/blender/blenlib/BLI_kdopbvh.h')
-rw-r--r-- | source/blender/blenlib/BLI_kdopbvh.h | 6 |
1 files changed, 4 insertions, 2 deletions
diff --git a/source/blender/blenlib/BLI_kdopbvh.h b/source/blender/blenlib/BLI_kdopbvh.h index d83de68169e..c43b76c3c58 100644 --- a/source/blender/blenlib/BLI_kdopbvh.h +++ b/source/blender/blenlib/BLI_kdopbvh.h @@ -151,7 +151,8 @@ void BLI_bvhtree_update_tree(BVHTree *tree); int BLI_bvhtree_overlap_thread_num(const BVHTree *tree); -/* collision/overlap: check two trees if they overlap, alloc's *overlap with length of the int return value */ +/* collision/overlap: check two trees if they overlap, + * alloc's *overlap with length of the int return value */ BVHTreeOverlap *BLI_bvhtree_overlap( const BVHTree *tree1, const BVHTree *tree2, unsigned int *r_overlap_tot, BVHTree_OverlapCallback callback, void *userdata); @@ -161,7 +162,8 @@ int BLI_bvhtree_get_tree_type(const BVHTree *tree); float BLI_bvhtree_get_epsilon(const BVHTree *tree); /* find nearest node to the given coordinates - * (if nearest is given it will only search nodes where square distance is smaller than nearest->dist) */ + * (if nearest is given it will only search nodes where + * square distance is smaller than nearest->dist) */ int BLI_bvhtree_find_nearest_ex( BVHTree *tree, const float co[3], BVHTreeNearest *nearest, BVHTree_NearestPointCallback callback, void *userdata, |