aboutsummaryrefslogtreecommitdiff
path: root/src/nvim/spellfile.c
diff options
context:
space:
mode:
authordundargoc <33953936+dundargoc@users.noreply.github.com>2022-05-25 20:31:14 +0200
committerGitHub <noreply@github.com>2022-05-25 12:31:14 -0600
commit9fec6dc9a25b5cf9c9a444ac2bd0728e8af3229e (patch)
tree83e044109d61242150b8c98897e179416025f576 /src/nvim/spellfile.c
parent8c4e62351f67dd6a44f67f3a2b6f3a3551acf475 (diff)
downloadrneovim-9fec6dc9a25b5cf9c9a444ac2bd0728e8af3229e.tar.gz
rneovim-9fec6dc9a25b5cf9c9a444ac2bd0728e8af3229e.tar.bz2
rneovim-9fec6dc9a25b5cf9c9a444ac2bd0728e8af3229e.zip
refactor(uncrustify): set maximum number of consecutive newlines to 2 (#18695)
Diffstat (limited to 'src/nvim/spellfile.c')
-rw-r--r--src/nvim/spellfile.c8
1 files changed, 0 insertions, 8 deletions
diff --git a/src/nvim/spellfile.c b/src/nvim/spellfile.c
index f8c01bc27f..2b6bb098d1 100644
--- a/src/nvim/spellfile.c
+++ b/src/nvim/spellfile.c
@@ -638,7 +638,6 @@ slang_T *spell_load_file(char_u *fname, char_u *lang, slang_T *old_lp, bool sile
goto endFAIL;
}
-
// <SECTIONS>: <section> ... <sectionend>
// <section>: <sectionID> <sectionflags> <sectionlen> (section contents)
for (;;) {
@@ -992,7 +991,6 @@ nextone:
}
}
-
// Read a length field from "fd" in "cnt_bytes" bytes.
// Allocate memory, read the string into it and add a NUL at the end.
// Returns NULL when the count is zero.
@@ -3886,7 +3884,6 @@ static char_u *getroom_save(spellinfo_T *spin, char_u *s)
return memcpy(getroom(spin, s_size, false), s, s_size);
}
-
// Free the list of allocated sblock_T.
static void free_blocks(sblock_T *bl)
{
@@ -4338,7 +4335,6 @@ static bool node_equal(wordnode_T *n1, wordnode_T *n2)
return p1 == NULL && p2 == NULL;
}
-
// Function given to qsort() to sort the REP items on "from" string.
static int rep_compare(const void *s1, const void *s2)
{
@@ -4685,7 +4681,6 @@ static int write_vim_spell(spellinfo_T *spin, char_u *fname)
// end of <SECTIONS>
putc(SN_END, fd); // <sectionend>
-
// <LWORDTREE> <KWORDTREE> <PREFIXTREE>
spin->si_memtot = 0;
for (unsigned int round = 1; round <= 3; ++round) {
@@ -4753,7 +4748,6 @@ static void clear_node(wordnode_T *node)
}
}
-
/// Dump a word tree at node "node".
///
/// This first writes the list of possible bytes (siblings). Then for each
@@ -4872,7 +4866,6 @@ static int put_node(FILE *fd, wordnode_T *node, int idx, int regionmask, bool pr
return newindex;
}
-
// ":mkspell [-ascii] outfile infile ..."
// ":mkspell [-ascii] addfile"
void ex_mkspell(exarg_T *eap)
@@ -5260,7 +5253,6 @@ theend:
fclose(fd);
}
-
/// Create a Vim spell file from one or more word lists.
/// "fnames[0]" is the output file name.
/// "fnames[fcount - 1]" is the last input file name.