mirror of
https://github.com/folke/snacks.nvim
synced 2025-12-23 08:47:57 +00:00
d0a5310417
## Description Before this fix, identical items are added to history repeatedly. This PR fixes this by only adding an item to history if it's different from the last recorded value. This doesn't completely remove duplicate entries in the history, it only prevents consecutive identical entries.
77 lines
1.8 KiB
Lua
77 lines
1.8 KiB
Lua
---@class snacks.picker.History
|
|
---@field path string
|
|
---@field kv snacks.picker.KeyValue
|
|
---@field idx number
|
|
---@field cursor number
|
|
local M = {}
|
|
M.__index = M
|
|
|
|
---@type table<string, snacks.picker.KeyValue>
|
|
M.stores = {}
|
|
|
|
-- Save the history on exit
|
|
vim.api.nvim_create_autocmd("ExitPre", {
|
|
group = vim.api.nvim_create_augroup("snacks_history", { clear = true }),
|
|
callback = function()
|
|
for n, kv in pairs(M.stores) do
|
|
kv:close()
|
|
M.stores[n] = nil
|
|
end
|
|
end,
|
|
})
|
|
|
|
---@param name string
|
|
---@param opts? {filter?: fun(value: string): boolean}
|
|
function M.new(name, opts)
|
|
opts = opts or {}
|
|
local self = setmetatable({}, M)
|
|
self.path = vim.fn.stdpath("data") .. "/snacks/" .. name .. ".history"
|
|
if not M.stores[name] then
|
|
M.stores[name] = require("snacks.picker.util.kv").new(self.path, {
|
|
max_size = 1000,
|
|
---@param a snacks.picker.KeyValue.entry
|
|
---@param b snacks.picker.KeyValue.entry
|
|
cmp = function(a, b)
|
|
return a.key > b.key
|
|
end,
|
|
})
|
|
end
|
|
self.kv = M.stores[name]
|
|
-- re-index the data
|
|
self.kv.data = vim.tbl_values(self.kv.data)
|
|
if opts.filter then
|
|
self.kv.data = vim.tbl_filter(opts.filter, self.kv.data)
|
|
end
|
|
self.idx = #self.kv.data + 1
|
|
self.cursor = self.idx
|
|
|
|
return self
|
|
end
|
|
|
|
function M:is_current()
|
|
return self.cursor == self.idx
|
|
end
|
|
|
|
function M:record(value)
|
|
-- don't record value if it's identical to the last recorded value
|
|
if vim.deep_equal(self.kv:get(math.max(self.idx - 1, 1)), value) then
|
|
return
|
|
end
|
|
self.kv:set(self.idx, value)
|
|
end
|
|
|
|
function M:next()
|
|
self.cursor = math.min(self.cursor + 1, self.idx)
|
|
return self:get()
|
|
end
|
|
|
|
function M:prev()
|
|
self.cursor = math.max(self.cursor - 1, 1)
|
|
return self:get()
|
|
end
|
|
|
|
function M:get()
|
|
return self.kv:get(self.cursor)
|
|
end
|
|
|
|
return M
|