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. -->
39 lines
713 B
Lua
39 lines
713 B
Lua
--- Efficient queue implementation.
|
|
--- Prevents need to shift elements when popping.
|
|
---@class snacks.picker.queue
|
|
---@field queue any[]
|
|
---@field first number
|
|
---@field last number
|
|
local M = {}
|
|
M.__index = M
|
|
|
|
function M.new()
|
|
local self = setmetatable({}, M)
|
|
self.first, self.last, self.queue = 0, -1, {}
|
|
return self
|
|
end
|
|
|
|
function M:push(value)
|
|
self.last = self.last + 1
|
|
self.queue[self.last] = value
|
|
end
|
|
|
|
function M:size()
|
|
return self.last - self.first + 1
|
|
end
|
|
|
|
function M:empty()
|
|
return self:size() == 0
|
|
end
|
|
|
|
function M:pop()
|
|
if self:empty() then
|
|
return
|
|
end
|
|
local value = self.queue[self.first]
|
|
self.queue[self.first] = nil
|
|
self.first = self.first + 1
|
|
return value
|
|
end
|
|
|
|
return M
|