291 lines
7.0 KiB
Lua
291 lines
7.0 KiB
Lua
local log = require('telescope.log')
|
|
local util = require('telescope.utils')
|
|
|
|
local sorters = {}
|
|
|
|
|
|
local Sorter = {}
|
|
Sorter.__index = Sorter
|
|
|
|
---@class Sorter
|
|
--- Sorter sorts a list of results by return a single integer for a line,
|
|
--- given a prompt
|
|
---
|
|
--- Lower number is better (because it's like a closer match)
|
|
--- But, any number below 0 means you want that line filtered out.
|
|
--- @field scoring_function function Function that has the interface:
|
|
-- (sorter, prompt, line): number
|
|
function Sorter:new(opts)
|
|
opts = opts or {}
|
|
|
|
return setmetatable({
|
|
state = {},
|
|
scoring_function = opts.scoring_function,
|
|
}, Sorter)
|
|
end
|
|
|
|
function Sorter:score(prompt, entry)
|
|
-- TODO: Decide if we actually want to check the type every time.
|
|
return self:scoring_function(prompt, type(entry) == "string" and entry or entry.ordinal)
|
|
end
|
|
|
|
function sorters.new(...)
|
|
return Sorter:new(...)
|
|
end
|
|
|
|
sorters.Sorter = Sorter
|
|
|
|
sorters.get_ngram_sorter = function()
|
|
return Sorter:new {
|
|
scoring_function = function(_, prompt, line)
|
|
if prompt == "" or prompt == nil then
|
|
return 1
|
|
end
|
|
|
|
local ok, result = pcall(function()
|
|
local ngram = util.new_ngram { N = 4 }
|
|
ngram:add(line)
|
|
|
|
local score = ngram:score(prompt)
|
|
if score == 0 then
|
|
return -1
|
|
end
|
|
|
|
-- return math.pow(math.max(score, 0.0001), -1)
|
|
return score
|
|
end)
|
|
|
|
print(prompt, line, result)
|
|
return ok and result or 1
|
|
end
|
|
}
|
|
end
|
|
|
|
sorters.get_levenshtein_sorter = function()
|
|
return Sorter:new {
|
|
scoring_function = function(_, prompt, line)
|
|
local result = require('telescope.algos.string_distance')(prompt, line)
|
|
log.info("Sorting result for", prompt, line, " = ", result)
|
|
return result
|
|
end
|
|
}
|
|
end
|
|
|
|
-- TODO: Match on upper case words
|
|
-- TODO: Match on last match
|
|
sorters.get_fuzzy_file = function(opts)
|
|
opts = opts or {}
|
|
|
|
local ngram_len = opts.ngram_len or 2
|
|
local os_sep = '/'
|
|
|
|
local cached_tails = setmetatable({}, {
|
|
__index = function(t, k)
|
|
local tail_split = vim.split(k, os_sep)
|
|
local tail = tail_split[#tail_split]
|
|
|
|
rawset(t, k, tail)
|
|
return tail
|
|
end,
|
|
})
|
|
|
|
local cached_uppers = setmetatable({}, {
|
|
__index = function(t, k)
|
|
local obj = {}
|
|
for i = 1, #k do
|
|
local s = k:sub(i, i)
|
|
local s_byte = s:byte()
|
|
if s_byte <= 90 and s_byte >= 65 then
|
|
obj[s] = true
|
|
end
|
|
end
|
|
|
|
rawset(t, k, obj)
|
|
return obj
|
|
end
|
|
})
|
|
|
|
local cached_ngrams = {}
|
|
|
|
local function overlapping_ngrams(s, n)
|
|
if cached_ngrams[s] and cached_ngrams[s][n] then
|
|
return cached_ngrams[s][n]
|
|
end
|
|
|
|
local R = {}
|
|
for i = 1, s:len() - n + 1 do
|
|
R[#R+1] = s:sub(i, i+n-1)
|
|
end
|
|
|
|
if not cached_ngrams[s] then
|
|
cached_ngrams[s] = {}
|
|
end
|
|
|
|
cached_ngrams[s][n] = R
|
|
|
|
return R
|
|
end
|
|
|
|
return Sorter:new {
|
|
scoring_function = function(_, prompt, line)
|
|
local N = #prompt
|
|
|
|
if prompt == 0 or N < ngram_len then
|
|
-- TODO: If the character is in the line,
|
|
-- then it should get a point or somethin.
|
|
return 0
|
|
end
|
|
|
|
local prompt_lower = prompt:lower()
|
|
local line_lower = line:lower()
|
|
|
|
local prompt_lower_ngrams = overlapping_ngrams(prompt_lower, ngram_len)
|
|
|
|
-- Contains the original string
|
|
local contains_string = line_lower:find(prompt_lower, 1, true)
|
|
|
|
local prompt_uppers = cached_uppers[prompt]
|
|
local line_uppers = cached_uppers[line]
|
|
|
|
local uppers_matching = 0
|
|
for k, _ in pairs(prompt_uppers) do
|
|
if line_uppers[k] then
|
|
uppers_matching = uppers_matching + 1
|
|
end
|
|
end
|
|
|
|
-- TODO: Consider case senstivity
|
|
local tail = cached_tails[line_lower]
|
|
local contains_tail = tail:find(prompt, 1, true)
|
|
|
|
local consecutive_matches = 0
|
|
local previous_match_index = 0
|
|
local match_count = 0
|
|
|
|
for i = 1, #prompt_lower_ngrams do
|
|
local match_start = line_lower:find(prompt_lower_ngrams[i], 1, true)
|
|
if match_start then
|
|
match_count = match_count + 1
|
|
if match_start > previous_match_index then
|
|
consecutive_matches = consecutive_matches + 1
|
|
end
|
|
|
|
previous_match_index = match_start
|
|
end
|
|
end
|
|
|
|
local tail_modifier = 1
|
|
if contains_tail then
|
|
tail_modifier = 2
|
|
end
|
|
|
|
local denominator = (
|
|
(10 * match_count / #prompt_lower_ngrams)
|
|
-- biases for shorter strings
|
|
+ 3 * match_count * ngram_len / #line
|
|
+ consecutive_matches
|
|
+ N / (contains_string or (2 * #line))
|
|
|
|
-- + 30/(c1 or 2*N)
|
|
|
|
-- TODO: It might be possible that this too strongly correlates,
|
|
-- but it's unlikely for people to type capital letters without actually
|
|
-- wanting to do something with a capital letter in it.
|
|
+ uppers_matching
|
|
) * tail_modifier
|
|
|
|
if denominator == 0 or denominator ~= denominator then
|
|
return -1
|
|
end
|
|
|
|
if #prompt > 2 and denominator < 0.5 then
|
|
return -1
|
|
end
|
|
|
|
return 1 / denominator
|
|
end
|
|
}
|
|
end
|
|
|
|
sorters.get_norcalli_sorter = function()
|
|
local ngramlen = 2
|
|
|
|
local cached_ngrams = {}
|
|
|
|
local function overlapping_ngrams(s, n)
|
|
if cached_ngrams[s] and cached_ngrams[s][n] then
|
|
return cached_ngrams[s][n]
|
|
end
|
|
|
|
local R = {}
|
|
for i = 1, s:len() - n + 1 do
|
|
R[#R+1] = s:sub(i, i+n-1)
|
|
end
|
|
|
|
if not cached_ngrams[s] then
|
|
cached_ngrams[s] = {}
|
|
end
|
|
|
|
cached_ngrams[s][n] = R
|
|
|
|
return R
|
|
end
|
|
|
|
return Sorter:new {
|
|
scoring_function = function(_, prompt, line)
|
|
if prompt == 0 or #prompt < ngramlen then
|
|
return 0
|
|
end
|
|
|
|
local prompt_lower = prompt:lower()
|
|
local line_lower = line:lower()
|
|
|
|
local prompt_ngrams = overlapping_ngrams(prompt_lower, ngramlen)
|
|
|
|
local N = #prompt
|
|
|
|
local contains_string = line_lower:find(prompt_lower, 1, true)
|
|
|
|
local consecutive_matches = 0
|
|
local previous_match_index = 0
|
|
local match_count = 0
|
|
|
|
for i = 1, #prompt_ngrams do
|
|
local match_start = line_lower:find(prompt_ngrams[i], 1, true)
|
|
if match_start then
|
|
match_count = match_count + 1
|
|
if match_start > previous_match_index then
|
|
consecutive_matches = consecutive_matches + 1
|
|
end
|
|
|
|
previous_match_index = match_start
|
|
end
|
|
end
|
|
|
|
-- TODO: Copied from ashkan.
|
|
local denominator = (
|
|
(10 * match_count / #prompt_ngrams)
|
|
-- biases for shorter strings
|
|
-- TODO(ashkan): this can bias towards repeated finds of the same
|
|
-- subpattern with overlapping_ngrams
|
|
+ 3 * match_count * ngramlen / #line
|
|
+ consecutive_matches
|
|
+ N / (contains_string or (2 * #line))
|
|
-- + 30/(c1 or 2*N)
|
|
)
|
|
|
|
if denominator == 0 or denominator ~= denominator then
|
|
return -1
|
|
end
|
|
|
|
if #prompt > 2 and denominator < 0.5 then
|
|
return -1
|
|
end
|
|
|
|
return 1 / denominator
|
|
end
|
|
}
|
|
end
|
|
|
|
return sorters
|