mirror of
https://github.com/folke/snacks.nvim
synced 2025-07-07 21:25:11 +00:00

## Description More info coming tomorrow. In short: - very fast. pretty much realtime filtering/sorting in huge repos (like 1.7 million files) - extensible - easy to customize the layout (and lots of presets) with `snacks.layout` - simple to create custom pickers - `vim.ui.select` - lots of builtin pickers - uses treesitter highlighting wherever it makes sense - fast lua fuzzy matcher which supports the [fzf syntax](https://junegunn.github.io/fzf/search-syntax/) and additionally supports field filters, like `file:lua$ 'function` There's no snacks picker command, just use lua. ```lua -- all pickers Snacks.picker() -- run files picker Snacks.picker.files(opts) Snacks.picker.pick("files", opts) Snacks.picker.pick({source = "files", ...}) ``` <!-- Describe the big picture of your changes to communicate to the maintainers why we should accept this pull request. --> ## Todo - [x] issue with preview loc not always correct when scrolling fast in list (probably due to `snacks.scroll`) - [x] `grep` (`live_grep`) is sometimes too fast in large repos and can impact ui rendering. Not very noticeable, but something I want to look at. - [x] docs - [x] treesitter highlights are broken. Messed something up somewhere ## Related Issue(s) <!-- If this PR fixes any issues, please link to the issue here. - Fixes #<issue_number> --> ## Screenshots <!-- Add screenshots of the changes if applicable. -->
31 lines
717 B
Lua
31 lines
717 B
Lua
---@module 'luassert'
|
|
|
|
local MinHeap = require("snacks.picker.util.minheap")
|
|
|
|
describe("MinHeap", function()
|
|
local values = {} ---@type number[]
|
|
for i = 1, 2000 do
|
|
values[i] = i
|
|
end
|
|
---@param tbl number[]
|
|
local function shuffle(tbl)
|
|
for i = #tbl, 2, -1 do
|
|
local j = math.random(i)
|
|
tbl[i], tbl[j] = tbl[j], tbl[i]
|
|
end
|
|
return tbl
|
|
end
|
|
|
|
for _ = 1, 100 do
|
|
it("should push and pop values correctly", function()
|
|
local topk = MinHeap.new({ capacity = 10 })
|
|
for _, v in ipairs(shuffle(values)) do
|
|
topk:add(v)
|
|
end
|
|
|
|
table.sort(values, topk.cmp)
|
|
local topn = vim.list_slice(values, 1, 10)
|
|
assert.same(topn, topk:get())
|
|
end)
|
|
end
|
|
end)
|