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
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
|
--!A cross-platform build utility based on Lua
--
-- Licensed to the Apache Software Foundation (ASF) under one
-- or more contributor license agreements. See the NOTICE file
-- distributed with this work for additional information
-- regarding copyright ownership. The ASF licenses this file
-- to you under the Apache License, Version 2.0 (the
-- "License"); you may not use this file except in compliance
-- with the License. You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
--
-- Copyright (C) 2015 - 2018, TBOOX Open Source Group.
--
-- @author ruki
-- @file table.lua
--
-- define module: table
local table = table or {}
-- clear the table
function table.clear(self)
for k in next, self do
rawset(self, k, nil)
end
end
-- join all objects and tables
function table.join(...)
local result = {}
for _, t in ipairs({...}) do
if type(t) == "table" then
for k, v in pairs(t) do
if type(k) == "number" then table.insert(result, v)
else result[k] = v end
end
else
table.insert(result, t)
end
end
return result
end
-- join all objects and tables to self
function table.join2(self, ...)
for _, t in ipairs({...}) do
if type(t) == "table" then
for k, v in pairs(t) do
if type(k) == "number" then table.insert(self, v)
else self[k] = v end
end
else
table.insert(self, t)
end
end
return self
end
-- append all objects to array
function table.append(array, ...)
for _, value in ipairs({...}) do
table.insert(array, value)
end
return array
end
-- copy the table to self
function table.copy(copied)
-- init it
copied = copied or {}
-- copy it
local result = {}
for k, v in pairs(table.wrap(copied)) do
result[k] = v
end
-- ok
return result
end
-- copy the table to self
function table.copy2(self, copied)
-- check
assert(self)
-- init it
copied = copied or {}
-- clear self first
table.clear(self)
-- copy it
for k, v in pairs(table.wrap(copied)) do
self[k] = v
end
end
-- inherit interfaces and create a new instance
function table.inherit(...)
-- init instance
local classes = {...}
local instance = {}
for _, clasz in ipairs(classes) do
for k, v in pairs(clasz) do
if type(v) == "function" then
instance[k] = v
end
end
end
-- ok?
return instance
end
-- inherit interfaces from the given class
function table.inherit2(self, ...)
-- check
assert(self)
-- init instance
local classes = {...}
for _, clasz in ipairs(classes) do
for k, v in pairs(clasz) do
if type(v) == "function" and self[k] == nil then
self[k] = v
end
end
end
-- ok?
return self
end
-- slice table array
function table.slice(self, first, last, step)
-- slice it
local sliced = {}
for i = first or 1, last or #self, step or 1 do
sliced[#sliced + 1] = self[i]
end
return sliced
end
-- is array?
function table.is_array(array)
return type(array) == "table" and array[1] ~= nil
end
-- is dictionary?
function table.is_dictionary(dict)
return type(dict) == "table" and dict[1] == nil
end
-- dump it with the level
function table._dump(self, exclude, level)
-- dump basic type
if type(self) == "string" or type(self) == "boolean" or type(self) == "number" then
io.write(tostring(self))
-- dump table
elseif type(self) == "table" then
-- dump head
io.write("\n")
for l = 1, level do
io.write(" ")
end
io.write("{\n")
-- dump body
local i = 0
for k, v in pairs(self) do
-- exclude some keys
if not exclude or type(k) ~= "string" or not k:find(exclude) then
-- dump spaces and separator
for l = 1, level do
io.write(" ")
end
if i == 0 then
io.write(" ")
else
io.write(", ")
end
-- dump key
if type(k) == "string" then
io.write(k, " = ")
end
-- dump value
table._dump(v, exclude, level + 1)
-- dump newline
io.write("\n")
i = i + 1
end
end
-- dump tail
for l = 1, level do
io.write(" ")
end
io.write("}\n")
elseif self ~= nil then
io.write("<" .. tostring(self) .. ">")
else
io.write("nil")
end
end
-- dump it
function table.dump(self, exclude, prefix)
-- dump prefix
if prefix then
io.write(prefix)
end
-- dump it
table._dump(self, exclude, 0)
-- end
print("")
-- return it
return self
end
-- unwrap object if be only one
function table.unwrap(object)
-- check
assert(object)
-- unwrap it
if type(object) == "table" and table.getn(object) == 1 then
for _, v in pairs(object) do
return v
end
end
-- ok
return object
end
-- wrap object to table
function table.wrap(object)
-- no object?
if nil == object then
return {}
end
-- wrap it if not table
if type(object) ~= "table" then
return {object}
end
-- ok
return object
end
-- remove repeat from the given array
function table.unique(array, barrier)
-- remove repeat
if type(array) == "table" then
-- not only one?
if table.getn(array) ~= 1 then
-- done
local exists = {}
local unique = {}
for _, v in ipairs(array) do
-- exists barrier? clear the current existed items
if barrier and barrier(v) then
exists = {}
end
-- add unique item
if type(v) == "string" then
if not exists[v] then
exists[v] = true
table.insert(unique, v)
end
else
local key = "\"" .. tostring(v) .. "\""
if not exists[key] then
exists[key] = true
table.insert(unique, v)
end
end
end
-- update it
array = unique
end
end
-- ok
return array
end
-- return module: table
return table
|