aboutsummaryrefslogtreecommitdiff
path: root/src/nvim/spell.c
diff options
context:
space:
mode:
authorbfredl <bjorn.linse@gmail.com>2022-04-29 19:33:05 +0200
committerGitHub <noreply@github.com>2022-04-29 19:33:05 +0200
commit6d4180a0d20d0b730b6e64acdac39261f52a9277 (patch)
tree2143d3d8f2cc10caee8b94d79d356eee2e762ebd /src/nvim/spell.c
parentd5dc3dad80ab1aef1d5e2afcc4d44a779605da8b (diff)
parenteef8de4df0247157e57f306062b1b86e01a41454 (diff)
downloadrneovim-6d4180a0d20d0b730b6e64acdac39261f52a9277.tar.gz
rneovim-6d4180a0d20d0b730b6e64acdac39261f52a9277.tar.bz2
rneovim-6d4180a0d20d0b730b6e64acdac39261f52a9277.zip
Merge pull request #18162 from dundargoc/refactor/unctustify
refactor/uncrustify
Diffstat (limited to 'src/nvim/spell.c')
-rw-r--r--src/nvim/spell.c11
1 files changed, 4 insertions, 7 deletions
diff --git a/src/nvim/spell.c b/src/nvim/spell.c
index 20e1fefbb4..754d9dcb48 100644
--- a/src/nvim/spell.c
+++ b/src/nvim/spell.c
@@ -1647,7 +1647,7 @@ void spell_cat_line(char_u *buf, char_u *line, int maxlen)
n = (int)(p - line) + 1;
if (n < maxlen - 1) {
memset(buf, ' ', n);
- STRLCPY(buf + n, p, maxlen - n);
+ STRLCPY(buf + n, p, maxlen - n);
}
}
}
@@ -3420,8 +3420,7 @@ static void spell_suggest_file(suginfo_T *su, char_u *fname)
*p++ = NUL;
if (STRICMP(su->su_badword, line) == 0) {
// Match! Isolate the good word, until CR or NL.
- for (len = 0; p[len] >= ' '; ++len) {
- }
+ for (len = 0; p[len] >= ' '; len++) {}
p[len] = NUL;
// If the suggestion doesn't have specific case duplicate the case
@@ -3816,8 +3815,7 @@ static void suggest_trie_walk(suginfo_T *su, langp_T *lp, char_u *fword, bool so
if (sp->ts_prefixdepth == PFD_PREFIXTREE) {
// Skip over the NUL bytes, we use them later.
- for (n = 0; n < len && byts[arridx + n] == 0; ++n) {
- }
+ for (n = 0; n < len && byts[arridx + n] == 0; n++) {}
sp->ts_curi += n;
// Always past NUL bytes now.
@@ -3890,8 +3888,7 @@ static void suggest_trie_walk(suginfo_T *su, langp_T *lp, char_u *fword, bool so
// none this must be the first try without a prefix.
n = stack[sp->ts_prefixdepth].ts_arridx;
len = pbyts[n++];
- for (c = 0; c < len && pbyts[n + c] == 0; ++c) {
- }
+ for (c = 0; c < len && pbyts[n + c] == 0; c++) {}
if (c > 0) {
c = valid_word_prefix(c, n, flags,
tword + sp->ts_splitoff, slang, false);