Change MuJoCo engine source code function-spacing convention from 3 blank lines to 2

PiperOrigin-RevId: 813754244
Change-Id: I6836e41c3b021cb727e922c25c60f629b9814c93

src/engine/engine_island.c

@@ -53,7 +53,6 @@ static void clearIsland(mjData* d, size_t parena) {
 }
 
 
-
 // allocate island arrays on arena, return 1 on success, 0 on failure
 static int arenaAllocIsland(const mjModel* m, mjData* d) {
 #undef MJ_M
@@ -83,7 +82,6 @@ static int arenaAllocIsland(const mjModel* m, mjData* d) {
 }
 
 
-
 //-------------------------- flood-fill and graph construction  ------------------------------------
 
 // find disjoint subgraphs ("islands") given sparse symmetric adjacency matrix
@@ -139,7 +137,6 @@ int mj_floodFill(int* island, int nr, const int* rownnz, const int* rowadr, cons
 }
 
 
-
 // return id of next tree in Jacobian row i that is different from tree, -1 if not found
 //   start search from *index
 //   write the index of the found tree to *index
@@ -188,7 +185,6 @@ static int treeNext(const mjModel* m, const mjData* d, int tree, int i, int *ind
 }
 
 
-
 // find first and possibly second nonegative tree ids in Jacobian row i
 //   if row i is special-cased (no more trees), return -1
 //   otherwise call treeNext, starting scan at index 0, return index
@@ -284,7 +280,6 @@ static int treeFirst(const mjModel* m, const mjData* d, int tree[2], int i) {
 }
 
 
-
 // add 0 edges, 1 self-edge or 2 flipped edges to array, increment treenedge
 //   return current number of edges
 static int addEdge(int* treenedge, int* edge, int nedge, int tree1, int tree2, int nedge_max) {
@@ -343,7 +338,6 @@ static int addEdge(int* treenedge, int* edge, int nedge, int tree1, int tree2, i
 }
 
 
-
 // find tree-tree edges, increment treenedge counters, return total number of edges
 static int findEdges(const mjModel* m, const mjData* d, int* treenedge, int* edge, int nedge_max) {
   int nefc = d->nefc;
@@ -401,7 +395,6 @@ static int findEdges(const mjModel* m, const mjData* d, int* treenedge, int* edg
 }
 
 
-
 //-------------------------- main entry-point  -----------------------------------------------------
 
 // discover islands: