DKL9 GitList
Repositories
DKL9 home
memoire
Code
Commits
Branches
Tags
Search
Tree:
b39812d
Branches
Tags
master
memoire
src
leeches.lua
Reformulate data structures
John Smith
commited
b39812d
at 2023-177 12:35:37
leeches.lua
Blame
History
Raw
--[[ return number indicating how much of a leech the prompt is ]] local function badness(pr) return math.log(pr.fail) / pr.succ * (pr.fail + pr.succ) / math.log(pr.delay) end local function fn(config, deck) local leechqueue = {} for i, cg in ipairs(deck) do for j, pr in ipairs(cg.pr) do if badness(pr) > 0.3 and pr.delay >= 0 then table.insert(leechqueue, { i, j }) end end end table.sort(leechqueue, function(a, b) return badness(deck[a[1]].pr[a[2]]) > badness(deck[b[1]].pr[b[2]]) end) io.write(string.format("Detected %d leeches:\n", #leechqueue)) for _, ij in ipairs(leechqueue) do io.write(string.format("%d:%d %s\n", ij[1], ij[2], deck[ij[1]].pr[ij[2]])) end end return { desc = "(l)eech search", nd = true, fn = fn }