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
|
local fs = require 'bee.filesystem'
local table_sort = table.sort
local string_rep = string.rep
local type = type
local pairs = pairs
local ipairs = ipairs
local math_type = math.type
local next = next
local rawset = rawset
local move = table.move
local setmetatable = setmetatable
local TAB = setmetatable({}, { __index = function (self, n)
self[n] = string_rep('\t', n)
return self[n]
end})
local KEY = {}
function table.dump(tbl)
if type(tbl) ~= 'table' then
error('Must be a table')
end
local table_mark = {}
local lines = {}
lines[#lines+1] = '{'
local function unpack(tbl, tab)
if table_mark[tbl] then
error('Cyclic references are not allowed.')
end
table_mark[tbl] = true
local keys = {}
for key in pairs(tbl) do
if type(key) == 'string' then
if key:find('[^%w_]') then
KEY[key] = ('[%q]'):format(key)
else
KEY[key] = key
end
elseif math_type(key) == 'integer' then
KEY[key] = ('[%d]'):format(key)
else
error('Key must be `string` or `integer`')
end
keys[#keys+1] = key
end
table_sort(keys, function (a, b)
return KEY[a] < KEY[b]
end)
for _, key in ipairs(keys) do
local value = tbl[key]
local tp = type(value)
if tp == 'table' then
lines[#lines+1] = ('%s%s = {'):format(TAB[tab+1], KEY[key])
unpack(value, tab+1)
lines[#lines+1] = ('%s},'):format(TAB[tab+1])
elseif tp == 'string' or tp == 'number' or tp == 'boolean' then
lines[#lines+1] = ('%s%s = %q,'):format(TAB[tab+1], KEY[key], value)
else
error(('Unsupport value type: [%s]'):format(tp))
end
end
end
unpack(tbl, 0)
lines[#lines+1] = '}'
return table.concat(lines, '\n')
end
local function sort_table(tbl)
if not tbl then
tbl = {}
end
local mt = {}
local keys = {}
local mark = {}
local n = 0
for key in next, tbl do
n=n+1;keys[n] = key
mark[key] = true
end
table_sort(keys)
function mt:__newindex(key, value)
rawset(self, key, value)
n=n+1;keys[n] = key
mark[key] = true
if type(value) == 'table' then
sort_table(value)
end
end
function mt:__pairs()
local list = {}
local m = 0
for key in next, self do
if not mark[key] then
m=m+1;list[m] = key
end
end
if m > 0 then
move(keys, 1, n, m+1)
table_sort(list)
for i = 1, m do
local key = list[i]
keys[i] = key
mark[key] = true
end
n = n + m
end
local i = 0
return function ()
i = i + 1
local key = keys[i]
return key, self[key]
end
end
return setmetatable(tbl, mt)
end
function table.container(tbl)
return sort_table(tbl)
end
function io.load(file_path)
local f, e = io.open(file_path:string(), 'rb')
if not f then
return nil, e
end
local buf = f:read 'a'
f:close()
return buf
end
function io.save(file_path, content)
local f, e = io.open(file_path:string(), "wb")
if f then
f:write(content)
f:close()
return true
else
return false, e
end
end
function io.scan(path)
local result = {path}
local i = 0
return function ()
i = i + 1
local current = result[i]
if not current then
return nil
end
if fs.is_directory(current) then
for path in current:list_directory() do
result[#result+1] = path
end
end
return current
end
end
|
