-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathpool.lua
More file actions
196 lines (170 loc) · 3.79 KB
/
pool.lua
File metadata and controls
196 lines (170 loc) · 3.79 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
---@class Pool
---@field private pool table<any, integer>
---@overload fun(): self
local M = Class 'Pool'
function M:__init()
---@private
self.pool = {}
---@private
self.order = {}
return self
end
function M:__encode()
local data = {}
for obj, w in self:pairs() do
data[#data+1] = obj
data[#data+1] = w
end
return data
end
function M:__decode(data)
local pool = New 'Pool' ()
for i = 1, #data, 2 do
pool:add(data[i], data[i+1])
end
return pool
end
-- 添加对象
---@param obj any
---@param w? integer
function M:add(obj, w)
if self.pool[obj] then
self.pool[obj] = self.pool[obj] + (w or 1)
else
self.pool[obj] = w or 1
self.order[#self.order+1] = obj
end
end
-- 移除对象,请勿在遍历的过程中移除对象
---@param obj any
function M:del(obj)
self.pool[obj] = nil
for i, v in ipairs(self.order) do
if v == obj then
self.order[i] = self.order[#self.order]
self.order[#self.order] = nil
break
end
end
end
-- 是否包含对象
---@param obj any
---@return boolean
function M:has(obj)
return self.pool[obj] ~= nil
end
---@param other Pool
function M:merge(other)
for obj, w in other:pairs() do
self:add(obj, w)
end
end
-- 获取对象的权重
---@param obj any
---@return integer
function M:get_weight(obj)
return self.pool[obj] or 0
end
-- 修改对象的权重
---@param obj any
---@param w integer
function M:set_weight(obj, w)
assert(self.pool[obj])
self.pool[obj] = w
end
-- 增加对象的权重
---@param obj any
---@param w integer
function M:add_weight(obj, w)
assert(self.pool[obj])
self.pool[obj] = self.pool[obj] + w
end
-- 清空池
function M:clear()
self.pool = {}
self.order = {}
end
-- 随机抽取一个对象
---@param filter? fun(obj: any): boolean
---@return any
function M:random(filter)
local valid = {}
local total = 0
for _, obj in ipairs(self.order) do
if not filter or filter(obj) == true then
valid[#valid+1] = obj
total = total + self.pool[obj]
end
end
if total == 0 then
return nil
end
local r = math.random(total)
local sum = 0
for i = 1, #valid do
local obj = valid[i]
sum = sum + self.pool[obj]
if sum >= r then
return obj
end
end
error('unreachable')
end
-- 抽取多个随机对象,不重复
---@param num integer
---@param filter? fun(obj: any): boolean
---@return any[]
function M:random_n(num, filter)
local total = {}
for _, obj in ipairs(self.order) do
if not filter or filter(obj) == true then
total[#total+1] = obj
end
end
local len = #total
if len <= num then
return total
end
local key_map = {}
for i = 1, len do
local o = total[i]
local w = self.pool[o]
local u = math.random()
local key = u ^ (1.0 / w) -- 我不道啊,DeepSeek教我的
key_map[o] = key
end
table.sort(total, function (a, b)
return key_map[a] > key_map[b]
end)
local results = {}
for i = 1, num do
results[i] = total[i]
end
return results
end
-- 显示池的内容,仅用于调试
---@return string
function M:dump()
local buf = {}
for i, obj in ipairs(self.order) do
buf[i] = ('%s: %d'):format(tostring(obj), self.pool[obj])
end
return table.concat(buf, '\n')
end
-- 遍历池的对象
---@return fun(): any, integer
function M:pairs()
local i = 0
return function ()
i = i + 1
local obj = self.order[i]
return obj, self.pool[obj]
end
end
---@class Pool.API
local API = {}
---@return Pool
function API.create()
return New 'Pool' ()
end
return API