forked from miketang84/lglib
-
Notifications
You must be signed in to change notification settings - Fork 0
/
table.lua
282 lines (244 loc) · 5.74 KB
/
table.lua
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
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
local table, pairs, next, type, require, ipairs = table, pairs, next, type, require, ipairs
local tostring, debug, assert, error, setmetatable = tostring, debug, assert, error, setmetatable
local string = string
local math = math
------------------------------------------------------------------------
-- List or Array Specific
------------------------------------------------------------------------
function append(self, val)
table.insert(self, val)
return self
end
function prepend(self, val)
table.insert(self, 1, val)
return self
end
function ins(self, i, val)
table.insert(self, i, val)
return self
end
-- 支持start, stop为空,为负值
function slice(self, start, stop, is_rev)
local nt = {}
local start = start or 1
local stop = stop or #self
if (stop > 0 and start > 0) or (stop < 0 and start < 0) then assert( stop >= start) end
if start > #self then return {} end
-- 处理索引为负数的情况
-- 最后一个元素为-1,倒数第二个为-2
if start == 0 then
start = 1
elseif start < 0 then
if math.abs(start) >= #self then
start = 1
else
start = #self + start + 1
end
end
if stop == 0 then
stop = 1
elseif stop < 0 then
stop = #self + stop + 1
if stop < 1 then return {} end
end
if not is_rev then
for i = start, (#self > stop and stop or #self) do
table.insert(nt, self[i])
end
else
for i = (#self > stop and stop or #self), start, -1 do
table.insert(nt, self[i])
end
end
return nt
end
function takeApart(self)
local list_len = #self
local list_part, dict_part = {}, {}
for i=1, list_len do
table.insert(list_part, self[i])
end
for k, v in pairs(self) do
if type(k) ~= 'number' or (type(k) == 'number' and k > list_len) then
dict_part[k] = v
end
end
return list_part, dict_part
end
------------------------------------------------------------------------
-- Dict or Hash Table Specific
------------------------------------------------------------------------
function keys(self)
local res = {}
for key, _ in pairs(self) do
table.insert(res, key)
end
return res
end
function size(self)
local count = 0
for _ in pairs(self) do
count = count + 1
end
return count
end
function hasKey(self, key)
for k, _ in pairs(self) do
if k == key then
return true
end
end
return false
end
function isEmpty(self)
return nil == next(self)
end
function isIn(self, val)
for k, v in pairs(self) do
if val == v then
return true
end
end
return false
end
function ifind(self, val)
for k, v in ipairs(self) do
if val == v then
return k
end
end
end
function find(self, val)
for k, v in pairs(self) do
if val == v then
return k
end
end
return nil
end
function imap(self, func)
local res = {}
for _, val in ipairs(self) do
local newVal
if "string" == type(func) then
newVal = val[func](val)
else
newVal = func(val)
end
if newVal then
table.insert(res, func(val))
end
end
return res
end
function map(self, func)
local res = {}
for key, val in pairs(self) do
if "string" == type(func) then
res[key] = val[func](val)
else
res[key] = func(val)
end
end
return res
end
function iremVal(self, val)
local key = table.ifind(self, val)
if key then
return table.remove(self, key)
end
end
function remVal(self, val)
local key = table.find(self, val)
if key then
return table.remove(self, key)
end
end
function copy(self)
local res = {}
for k, v in pairs(self) do
res[k] = v
end
return res
end
function deepcopy(self, seen)
local res = {}
seen = seen or {}
seen[self] = res
for k, v in pairs(self) do
if "table" == type(v) then
if seen[v] then
res[k] = seen[v]
else
res[k] = table.deepCopy(v, seen)
end
else
res[k] = v
end
end
seen[self] = nil
return res
end
function ijoin(self, sep)
local res
sep = sep or ""
for _, v in ipairs(self) do
res = ('%s%s'):format((res and ('%s%s'):format(res, sep) or ""), tostring(v))
end
return res or ""
end
function join(self, sep)
local res
sep = sep or ""
for _, v in pairs(self) do
res = ('%s%s'):format((res and ('%s%s'):format(res, sep) or ""), tostring(v))
end
return res or ""
end
function pt(tt, indent, done)
local done = done or {}
local indent = indent or 0
local space = (" "):rep(indent)
if type(tt) == "table" then
local sb = {}
table.insert(sb, '{ ')
for key, value in pairs(tt) do
table.insert(sb, space) -- indent it
if type (value) == "table" and not done [value] then
done[value] = true
table.insert(sb, ('%s='):format(key));
table.insert(sb, pt(value, indent, done))
table.insert(sb, space) -- indent it
elseif "number" == type(key) then
table.insert(sb, ("%s, "):format(tostring(value)))
elseif "number" == type(value) then
table.insert(sb, ("['%s']=%s, "):format(tostring(key), tostring(value)))
else
table.insert(sb, ("['%s']='%s', "):format(tostring(key), tostring(value)))
end
end
table.insert(sb, '}, ')
return table.concat(sb)
else
return ("%s"):format(tt)
end
end
------------------------------------------------------------------------
-- 将source表中的keys值更新到self中去
-- @param self 被处理字符串
-- @param source 源表
-- @param keys 要更新哪些键值
-- @return self 自身
------------------------------------------------------------------------
function update(self, source, keys)
if keys then
for _, key in ipairs(keys) do
self[key] = source[key]
end
else
for k,v in pairs(source) do
self[k] = v
end
end
return self
end