refactor(uncrustify): set maximum number of consecutive newlines to 2 (#18695)

src/nvim/regexp_nfa.c

@@ -2747,7 +2747,6 @@ static int nfa_regpiece(void)
 
     break;
 
-
   default:
     break;
   }     // end switch
@@ -3485,7 +3484,6 @@ static nfa_state_T *alloc_state(int c, nfa_state_T *out, nfa_state_T *out1)
  * next state for this fragment.
  */
 
-
 /*
  * Initialize a Frag_T struct and return it.
  */
@@ -3523,7 +3521,6 @@ static void patch(Ptrlist *l, nfa_state_T *s)
   }
 }
 
-
 /*
  * Join the two lists l1 and l2, returning the combination.
  */
@@ -4403,7 +4400,6 @@ static void nfa_postprocess(nfa_regprog_T *prog)
 #define NFA_PIM_MATCH    2      // pim executed, matches
 #define NFA_PIM_NOMATCH  3      // pim executed, no match
 
-
 #ifdef REGEXP_DEBUG
 static void log_subsexpr(regsubs_T *subs)
 {
@@ -4790,7 +4786,6 @@ static bool match_follows(const nfa_state_T *startstate, int depth)
   return false;
 }
 
-
 /// @param l      runtime state list
 /// @param state  state to update
 /// @param subs   pointers to subexpressions
@@ -5460,7 +5455,6 @@ retempty:
   return false;
 }
 
-
 /// Check for a match with \z subexpression "subidx".
 ///
 /// @param bytelen  out: length of match in bytes
@@ -5530,7 +5524,6 @@ static bool nfa_re_num_cmp(uintmax_t val, int op, uintmax_t pos)
   return val == pos;
 }
 
-
 /*
  * Recursively call nfa_regmatch()
  * "pim" is NULL or contains info about a Postponed Invisible Match (start
@@ -5684,7 +5677,6 @@ static int recursive_regmatch(nfa_state_T *state, nfa_pim_T *pim, nfa_regprog_T
   return result;
 }
 
-
 /*
  * Estimate the chance of a match with "state" failing.
  * empty match: 0