This commit is contained in:
newbie 2024-02-01 14:22:05 +08:00
parent 08184ce63d
commit bb38aab048
4 changed files with 18 additions and 18 deletions

View File

@ -26,6 +26,7 @@ G.opt.rtp:prepend(lazypath)
require("keymap") require("keymap")
if G.g.vscode then if G.g.vscode then
require('vscode') require('vscode')
else else

View File

@ -56,7 +56,7 @@ G.au({ "InsertEnter" }, {
end, end,
}) })
G.au({ "VimEnter" }, { G.au({ "VimEnter", "BufEnter" }, {
pattern = { "*.code-snippets" }, pattern = { "*.code-snippets" },
callback = function() callback = function()
G.cmd("setfiletype json") G.cmd("setfiletype json")

View File

@ -15,7 +15,6 @@ return {
require 'lspconfig'.yamlls.setup(require('lsp.yaml')) require 'lspconfig'.yamlls.setup(require('lsp.yaml'))
require 'lspconfig'.gopls.setup(require('lsp.go')) require 'lspconfig'.gopls.setup(require('lsp.go'))
require 'lspconfig'.jsonls.setup(require('lsp.json')) require 'lspconfig'.jsonls.setup(require('lsp.json'))
require 'lspconfig'.javals.setup()
G.map({ G.map({

View File

@ -41,8 +41,8 @@
"#define head g.head", "#define head g.head",
"#define maps g.maps", "#define maps g.maps",
"#define add g.add", "#define add g.add",
"", ""
], ]
}, },
"Class_Graph_Dijkstra": { "Class_Graph_Dijkstra": {
"prefix": "Class_Graph_Dijkstra", "prefix": "Class_Graph_Dijkstra",
@ -74,8 +74,8 @@
" else", " else",
" return -1;", " return -1;",
"}", "}",
"", ""
], ]
}, },
"Class_Graph_SPFA": { "Class_Graph_SPFA": {
"prefix": "Class_Graph_SPFA", "prefix": "Class_Graph_SPFA",
@ -103,8 +103,8 @@
" if(dis[en] == inf) return -1;", " if(dis[en] == inf) return -1;",
" return dis[en];", " return dis[en];",
"}", "}",
"", ""
], ]
}, },
"Class_Graph_Kurskal": { "Class_Graph_Kurskal": {
"prefix": "Class_Graph_Kurskal", "prefix": "Class_Graph_Kurskal",
@ -121,8 +121,8 @@
" }", " }",
" return res;", " return res;",
"}", "}",
"", ""
], ]
}, },
"Class_Graph_Prim": { "Class_Graph_Prim": {
"prefix": "Class_Graph_Prim", "prefix": "Class_Graph_Prim",
@ -166,7 +166,7 @@
" ans = max(ans, max(up[i], dis1[i]));", " ans = max(ans, max(up[i], dis1[i]));",
" }", " }",
" return ans;", " return ans;",
"}", "}"
] ]
}, },
"Class_Graph_SCC": { "Class_Graph_SCC": {
@ -218,8 +218,8 @@
" return;", " return;",
" }", " }",
"};", "};",
"", ""
], ]
}, },
"Class_Graph_Euler": { "Class_Graph_Euler": {
"prefix": "Class_Graph_Euler", "prefix": "Class_Graph_Euler",
@ -270,7 +270,7 @@
"", "",
"};", "};",
"#define path eu.path", "#define path eu.path",
"", ""
] ]
}, },
"Class_Graph_LCA": { "Class_Graph_LCA": {
@ -318,8 +318,8 @@
" return fa[0][a];", " return fa[0][a];",
" }", " }",
"};", "};",
"", ""
], ]
}, },
"Class_Graph_erfen": { "Class_Graph_erfen": {
"prefix": "Class_Graph_erfen", "prefix": "Class_Graph_erfen",
@ -353,7 +353,7 @@
" return false;", " return false;",
" }", " }",
"};", "};",
"", ""
] ]
} }
} }