aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authordundargoc <33953936+dundargoc@users.noreply.github.com>2022-11-26 00:52:30 +0100
committerGitHub <noreply@github.com>2022-11-26 07:52:30 +0800
commit9dfbbde240fc095b856d8e0e1c670b1912ec6640 (patch)
treec1322178caf5ad0395aaa2d8034349e305ede953
parentd38da27f1e1e4d8f2ff0af94b32aa531a9183255 (diff)
downloadrneovim-9dfbbde240fc095b856d8e0e1c670b1912ec6640.tar.gz
rneovim-9dfbbde240fc095b856d8e0e1c670b1912ec6640.tar.bz2
rneovim-9dfbbde240fc095b856d8e0e1c670b1912ec6640.zip
docs: fix typos (#21168)
-rw-r--r--runtime/doc/lua.txt2
-rw-r--r--runtime/lua/vim/fs.lua2
-rw-r--r--src/nvim/arglist.c2
-rw-r--r--src/nvim/linematch.c8
-rw-r--r--src/nvim/memory.c2
-rw-r--r--src/nvim/testdir/test_fold.vim2
-rw-r--r--test/functional/ui/spell_spec.lua2
7 files changed, 10 insertions, 10 deletions
diff --git a/runtime/doc/lua.txt b/runtime/doc/lua.txt
index 4055d93f6a..b506226697 100644
--- a/runtime/doc/lua.txt
+++ b/runtime/doc/lua.txt
@@ -2280,7 +2280,7 @@ find({names}, {opts}) *vim.fs.find()*
searches are recursive and may search through many directories! If {stop}
is non-nil, then the search stops when the directory given in {stop} is
reached. The search terminates when {limit} (default 1) matches are found.
- The search can be narrowed to find only files or or only directories by
+ The search can be narrowed to find only files or only directories by
specifying {type} to be "file" or "directory", respectively.
Parameters: ~
diff --git a/runtime/lua/vim/fs.lua b/runtime/lua/vim/fs.lua
index c7c053852d..d128c15233 100644
--- a/runtime/lua/vim/fs.lua
+++ b/runtime/lua/vim/fs.lua
@@ -73,7 +73,7 @@ end
--- searches are recursive and may search through many directories! If {stop}
--- is non-nil, then the search stops when the directory given in {stop} is
--- reached. The search terminates when {limit} (default 1) matches are found.
---- The search can be narrowed to find only files or or only directories by
+--- The search can be narrowed to find only files or only directories by
--- specifying {type} to be "file" or "directory", respectively.
---
---@param names (string|table|fun(name: string): boolean) Names of the files
diff --git a/src/nvim/arglist.c b/src/nvim/arglist.c
index 73c86addac..8621e48754 100644
--- a/src/nvim/arglist.c
+++ b/src/nvim/arglist.c
@@ -1092,7 +1092,7 @@ static void do_arg_all(int count, int forceit, int keep_tabs)
last_curtab = curtab;
win_enter(lastwin, false);
- // Open upto "count" windows.
+ // Open up to "count" windows.
arg_all_open_windows(&aall, count);
// Remove the "lock" on the argument list.
diff --git a/src/nvim/linematch.c b/src/nvim/linematch.c
index f8b286fcd8..2b53fe6bd6 100644
--- a/src/nvim/linematch.c
+++ b/src/nvim/linematch.c
@@ -290,18 +290,18 @@ static void populate_tensor(int *df_iters, const size_t ch_dim, diffcmppath_T *d
/// algorithm to find an optimal alignment of lines of a diff block with 2 or
/// more files. The algorithm is generalized to work for any number of files
-/// which corresponds to another dimmension added to the tensor used in the
+/// which corresponds to another dimension added to the tensor used in the
/// algorithm
///
/// for questions and information about the linematch algorithm please contact
/// Jonathon White (jonathonwhite@protonmail.com)
///
-/// for explanation, a summary of the algorithm in 3 dimmensions (3 files
+/// for explanation, a summary of the algorithm in 3 dimensions (3 files
/// compared) follows
///
/// The 3d case (for 3 buffers) of the algorithm implemented when diffopt
/// 'linematch' is enabled. The algorithm constructs a 3d tensor to
-/// compare a diff between 3 buffers. The dimmensions of the tensor are
+/// compare a diff between 3 buffers. The dimensions of the tensor are
/// the length of the diff in each buffer plus 1 A path is constructed by
/// moving from one edge of the cube/3d tensor to the opposite edge.
/// Motions from one cell of the cube to the next represent decisions. In
@@ -324,7 +324,7 @@ static void populate_tensor(int *df_iters, const size_t ch_dim, diffcmppath_T *d
/// the one which results in the local highest score. The total highest
/// scored path is, then in the end represented by the cell in the
/// opposite corner from the start location. The entire algorithm
-/// consits of populating the 3d cube with the optimal paths from which
+/// consists of populating the 3d cube with the optimal paths from which
/// it may have came.
///
/// Optimizations:
diff --git a/src/nvim/memory.c b/src/nvim/memory.c
index 60c29492bb..8bc871344c 100644
--- a/src/nvim/memory.c
+++ b/src/nvim/memory.c
@@ -553,7 +553,7 @@ static void arena_free_reuse_blks(void)
}
}
-/// Finnish the allocations in an arena.
+/// Finish the allocations in an arena.
///
/// This does not immediately free the memory, but leaves existing allocated
/// objects valid, and returns an opaque ArenaMem handle, which can be used to
diff --git a/src/nvim/testdir/test_fold.vim b/src/nvim/testdir/test_fold.vim
index 23ed3817dd..2215166cd6 100644
--- a/src/nvim/testdir/test_fold.vim
+++ b/src/nvim/testdir/test_fold.vim
@@ -1192,7 +1192,7 @@ endfunc
" Test for merging two recursive folds when an intermediate line with no fold
" is removed
-func Test_fold_merge_recrusive()
+func Test_fold_merge_recursive()
new
call setline(1, [' one', ' two', 'xxxx', ' three',
\ ' four', "\tfive"])
diff --git a/test/functional/ui/spell_spec.lua b/test/functional/ui/spell_spec.lua
index 425790dbf9..5b43edbad4 100644
--- a/test/functional/ui/spell_spec.lua
+++ b/test/functional/ui/spell_spec.lua
@@ -70,7 +70,7 @@ describe("'spell'", function()
"with missing caps here.", |
^ |
|
- ]])
+ ]])
end)
it('"noplainbuffer" and syntax #20385', function()