Cleanup: blank lines over doxy headers

3 files changed, 0 insertions, 15 deletions

diff --git a/source/blender/blenlib/BLI_array.h b/source/blender/blenlib/BLI_array.h
index 8e94b8197ef..ed629a1c57c 100644
--- a/source/blender/blenlib/BLI_array.h
+++ b/source/blender/blenlib/BLI_array.h
@@ -69,7 +69,6 @@ void _bli_array_grow_func(
 
 
 /* -------------------------------------------------------------------- */
-
 /** \name Public defines
  * \{ */
 
@@ -170,7 +169,6 @@ void _bli_array_grow_func(
 
 
 /* -------------------------------------------------------------------- */
-
 /** \name Generic Array Utils
  * other useful defines
  * (unrelated to the main array macros)
diff --git a/source/blender/blenlib/intern/BLI_kdopbvh.c b/source/blender/blenlib/intern/BLI_kdopbvh.c
index 2819c1c5943..621fb05b0f2 100644
--- a/source/blender/blenlib/intern/BLI_kdopbvh.c
+++ b/source/blender/blenlib/intern/BLI_kdopbvh.c
@@ -83,7 +83,6 @@
 
 
 /* -------------------------------------------------------------------- */
-
 /** \name Struct Definitions
  * \{ */
 
@@ -199,7 +198,6 @@ const float bvhtree_kdop_axes[13][3] = {
 
 
 /* -------------------------------------------------------------------- */
-
 /** \name Utility Functions
  * \{ */
 
@@ -238,7 +236,6 @@ static void node_minmax_init(const BVHTree *tree, BVHNode *node)
 
 
 /* -------------------------------------------------------------------- */
-
 /** \name Balance Utility Functions
  * \{ */
 
@@ -826,7 +823,6 @@ static void non_recursive_bvh_div_nodes(
 
 
 /* -------------------------------------------------------------------- */
-
 /** \name BLI_bvhtree API
  * \{ */
 
@@ -1042,7 +1038,6 @@ float BLI_bvhtree_get_epsilon(const BVHTree *tree)
 
 
 /* -------------------------------------------------------------------- */
-
 /** \name BLI_bvhtree_overlap
  * \{ */
 
@@ -1260,7 +1255,6 @@ BVHTreeOverlap *BLI_bvhtree_overlap(
 
 
 /* -------------------------------------------------------------------- */
-
 /** \name BLI_bvhtree_find_nearest
  * \{ */
 
@@ -1429,7 +1423,6 @@ int BLI_bvhtree_find_nearest(
 
 
 /* -------------------------------------------------------------------- */
-
 /** \name BLI_bvhtree_ray_cast
  *
  * raycast is done by performing a DFS on the BVHTree and saving the closest hit.
@@ -1725,7 +1718,6 @@ void BLI_bvhtree_ray_cast_all(
 /** \} */
 
 /* -------------------------------------------------------------------- */
-
 /** \name BLI_bvhtree_range_query
  *
  * Allocs and fills an array with the indexs of node that are on the given spherical range (center, radius).
@@ -1811,7 +1803,6 @@ int BLI_bvhtree_range_query(
 
 
 /* -------------------------------------------------------------------- */
-
 /** \name BLI_bvhtree_nearest_projected
 * \{ */
 
@@ -2003,7 +1994,6 @@ int BLI_bvhtree_find_nearest_projected(
 
 
 /* -------------------------------------------------------------------- */
-
 /** \name BLI_bvhtree_walk_dfs
  * \{ */
 
diff --git a/source/blender/blenlib/intern/BLI_memiter.c b/source/blender/blenlib/intern/BLI_memiter.c
index 9c5f026f836..b514ae58654 100644
--- a/source/blender/blenlib/intern/BLI_memiter.c
+++ b/source/blender/blenlib/intern/BLI_memiter.c
@@ -121,7 +121,6 @@ static void memiter_init(BLI_memiter *mi)
 }
 
 /* -------------------------------------------------------------------- */
-
 /** \name Public API's
  * \{ */
 
@@ -252,7 +251,6 @@ uint BLI_memiter_count(const BLI_memiter *mi)
 
 
 /* -------------------------------------------------------------------- */
-
 /** \name Helper API's
  * \{ */
 
@@ -286,7 +284,6 @@ void *BLI_memiter_elem_first_size(BLI_memiter *mi, uint *r_size)
 
 
 /* -------------------------------------------------------------------- */
-
 /** \name Iterator API's
  *
  * \note We could loop over elements until a NULL chunk is found,